Random circuit block-encoded matrix and a proposal of quantum LINPACK benchmark
arXiv:2006.04010 · doi:10.1103/PhysRevA.103.062412
Abstract
The LINPACK benchmark reports the performance of a computer for solving a system of linear equations with dense random matrices. Although this task was not designed with a real application directly in mind, the LINPACK benchmark has been used to define the list of TOP500 supercomputers since the debut of the list in 1993. We propose that a similar benchmark, called the quantum LINPACK benchmark, could be used to measure the whole machine performance of quantum computers. The success of the quantum LINPACK benchmark should be viewed as the minimal requirement for a quantum computer to perform a useful task of solving linear algebra problems, such as linear systems of equations. 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. Besides solving linear systems, the RACBEM model can be used to perform a variety of linear algebra tasks relevant to many physical applications, such as computing spectral measures, time series generated by a Hamiltonian simulation, and thermal averages of the energy. We implement these linear algebra operations on IBM Q quantum devices as well as quantum virtual machines, and demonstrate their performance in solving scientific computing problems.
arXiv comment22 pages, 18 figures
References in corpus (32)
- Supplementary information for "Quantum supremacy using a programmable superconducting processor"
- Elementary gates for quantum computation
- Quantum algorithm for solving linear systems of equations
- Characterizing Quantum Supremacy in Near-Term Devices
- Quantum random access memory
- Robust randomized benchmarking of quantum processes
- Validating quantum computers using randomized model circuits
- Determining eigenstates and thermal states on a quantum computer using quantum imaginary time evolution
- Quantum Entanglement Growth Under Random Unitary Dynamics
- Quantum algorithm for systems of linear equations with exponentially improved dependence on precision
- Efficient Z-Gates for Quantum Computing
- Demonstration of qubit operations below a rigorous fault tolerance threshold with gate set tomography
- Hamiltonian simulation with nearly optimal dependence on all parameters
- Random Quantum Circuits are Approximate 2-designs
- Minimally Entangled Typical Thermal State Algorithms
- Average-case complexity versus approximate simulation of commuting quantum computations
- Quantum Supremacy and the Complexity of Random Circuit Sampling
- Characterizing large-scale quantum computers via cycle benchmarking
- Minimally entangled typical quantum states at finite temperature
- Random Quantum Circuits and Pseudo-Random Operators: Theory and Applications
- A quantum linear system algorithm for dense matrices
- Quantum algorithm and circuit design solving the Poisson equation
- Quantum algorithms for systems of linear equations inspired by adiabatic quantum computing
- Variational algorithms for linear algebra
- Efficient phase-factor evaluation in quantum signal processing
- Optimal polynomial based quantum eigenstate filtering with application to solving quantum linear systems
- Fast inversion, preconditioned quantum linear system solvers, and fast evaluation of matrix functions
- Product Decomposition of Periodic Functions in Quantum Signal Processing
- Linear-Depth Quantum Circuits for n-qubit Toffoli gates with no Ancilla
- Noise Threshold of Quantum Supremacy
- Quantum linear system solver based on time-optimal adiabatic quantum computing and quantum approximate optimization algorithm
- A Quantum Interior-Point Predictor-Corrector Algorithm for Linear Programming
Cited by in corpus (16)
- Ground state preparation and energy estimation on early fault-tolerant quantum computers via quantum eigenvalue transformation of unitary matrices
- Near-Term Quantum Computing Techniques: Variational Quantum Algorithms, Error Mitigation, Circuit Compilation, Benchmarking and Classical Simulation
- Benchmarking quantum computers
- Integrating Quantum Computing Resources into Scientific HPC Ecosystems
- Benchmarking quantum co-processors in an application-centric, hardware-agnostic and scalable way
- QASMBench: A Low-level QASM Benchmark Suite for NISQ Evaluation and Simulation
- Benchmarking near-term quantum computers via random circuit sampling
- A quantum hamiltonian simulation benchmark
- HamLib: A library of Hamiltonians for benchmarking quantum algorithms and hardware
- Infinite quantum signal processing
- Benchmarking Quantum Computers: Towards a Standard Performance Evaluation Approach
- Solving the Hele-Shaw flow using the Harrow-Hassidim-Lloyd algorithm on superconducting devices: A study of efficiency and challenges
- A Comprehensive Cross-Model Framework for Benchmarking the Performance of Quantum Hamiltonian Simulations
- AppQSim: Application-oriented benchmarks for Hamiltonian simulation on a quantum computer
- The Role of Quantum Computing in Advancing Scientific High-Performance Computing: A perspective from the ADAC Institute
- Extending the Q-score to an Application-level Quantum Metric Framework