On the Quantum LINPACK Benchmark

ORAL

Abstract

The LINPACK benchmark reports the performance of a computer for solving systems of linear equations with pseudo-dense random matrices, and has been used to define the list of TOP500 supercomputers since the debut of the list in 1993. We propose that a quantum LINPACK benchmark could be used to measure the whole machine performance of quantum computers. We propose an input model called the RAndom Circuit Block-Encoded Matrix (RACBEM), which is a proper generalization of a dense random matrix in the quantum setting. The RACBEM model is efficient to be implemented on a quantum computer, and can be designed to optimally adapt to any given quantum architecture, with relying on a black-box quantum compiler. The result of the quantum LINPACK benchmark demonstrates the performance of a quantum computer in solving scientific computing problems.

*This work was partially supported by a Google Quantum Research Award (Y.D.,L.L.), by the Department of Energy under Grant No. DE-AC02-05CH11231, No. DE-SC0017867, and the Quantum System Accelerator project (L.L.).
This research used resources of the Oak Ridge Leadership Computing Facility, which is a DOE Office of Science User Facility supported under Contract No. DE-AC05-00OR22725.

Presenters

  • Yulong Dong

    • University of California, Berkeley

Authors

  • Yulong Dong

    • University of California, Berkeley
  • Lin Lin

    • University of California, Berkeley
  • Birgitta K Whaley

    • University of California, Berkeley
    • Chemistry, University of California, Berkeley