Scalable Full-Stack Benchmarks for Quantum Computers
arXiv:2312.14107 · doi:10.1109/TQE.2024.3404502
Abstract
Quantum processors are now able to run quantum circuits that are infeasible to simulate classically, creating a need for benchmarks that assess a quantum processor's rate of errors when running these circuits. Here, we introduce a general technique for creating efficient benchmarks from any set of quantum computations, specified by unitary circuits. Our benchmarks assess the integrated performance of a quantum processor's classical compilation algorithms and its low-level quantum operations. Unlike existing "full-stack benchmarks", our benchmarks do not require classical simulations of quantum circuits, and they use only efficient classical computations. We use our method to create randomized circuit benchmarks, including a computationally efficient version of the quantum volume benchmark, and an algorithm-based benchmark that uses Hamiltonian simulation circuits. We perform these benchmarks on IBM Q devices and in simulations, and we compare their results to the results of existing benchmarking methods.
arXiv comment9 pages+appendices, 6+1 figures
References in corpus (28)
- Supplementary information for "Quantum supremacy using a programmable superconducting processor"
- Dynamical Decoupling of Open Quantum Systems
- Characterizing Quantum Supremacy in Near-Term Devices
- Robust randomized benchmarking of quantum processes
- Validating quantum computers using randomized model circuits
- Quantum optimization using variational algorithms on near-term quantum devices
- Noise tailoring for scalable quantum computation via randomized compiling
- Scalable Noise Estimation with Random Unitary Operators
- Direct Fidelity Estimation from Few Pauli Measurements
- Characterizing Quantum Gates via Randomized Benchmarking
- Practical characterization of quantum devices without tomography
- Symmetrised Characterisation of Noisy Quantum Processes
- Measuring the Capabilities of Quantum Computers
- Application-Oriented Performance Benchmarks for Quantum Computing
- A general framework for randomized benchmarking
- Direct randomized benchmarking for multi-qubit devices
- Scalable randomized benchmarking of non-Clifford gates
- A volumetric framework for quantum computer benchmarks
- Scalable randomized benchmarking of quantum computers using mirror circuits
- Re-examining the quantum volume test: Ideal distributions, compiler optimizations, confidence intervals, and scalable resource estimations
- Matchgate benchmarking: Scalable benchmarking of a continuous family of many-qubit gates
- Application-Motivated, Holistic Benchmarking of a Full Quantum Computing Stack
- Character randomized benchmarking for non-multiplicity-free groups with applications to subspace, leakage, and matchgate randomized benchmarking
- Benchmarking near-term quantum computers via random circuit sampling
- Demonstrating scalable randomized benchmarking of universal gate sets
- Defining Standard Strategies for Quantum Benchmarks
- Establishing trust in quantum computations
- An Improved Volumetric Metric for Quantum Computers via more Representative Quantum Circuit Shapes