Re-examining the quantum volume test: Ideal distributions, compiler optimizations, confidence intervals, and scalable resource estimations

Abstract

The quantum volume test is a full-system benchmark for quantum computers that is sensitive to qubit number, fidelity, connectivity, and other quantities believed to be important in building useful devices. The test was designed to produce a single-number measure of a quantum computer's general capability, but a complete understanding of its limitations and operational meaning is still missing. We explore the quantum volume test to better understand its design aspects, sensitivity to errors, passing criteria, and what passing implies about a quantum computer. We elucidate some transient behaviors the test exhibits for small qubit number including the ideal measurement output distributions and the efficacy of common compiler optimizations. We then present an efficient algorithm for estimating the expected heavy output probability under different error models and compiler optimization options, which predicts performance goals for future systems. Additionally, we explore the original confidence interval construction and show that it underachieves the desired coverage level for single shot experiments and overachieves for more typical number of shots. We propose a new confidence interval construction that reaches the specified coverage for typical number of shots and is more efficient in the number of circuits needed to pass the test. We demonstrate these savings with a $QV=2^{10}$ experimental dataset collected from Quantinuum System Model H1-1. Finally, we discuss what the quantum volume test implies about a quantum computer's practical or operational abilities especially in terms of quantum error correction.

arXiv comment29 pages, 15 figures

References in corpus (51)

• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• Surface codes: Towards practical large-scale quantum computation
• The theory of variational hybrid quantum-classical algorithms
• A Quantum Approximate Optimization Algorithm
• Average Entropy of a Subsystem
• Characterizing Quantum Supremacy in Near-Term Devices
• Randomized Benchmarking of Quantum Gates
• Prescription for experimental determination of the dynamics of a quantum black box
• Entanglement and quantum computation with ions in thermal motion
• Quantum Error Correction for Beginners
• Time Optimal Control in Spin Systems
• Validating quantum computers using randomized model circuits
• Exact and Approximate Unitary 2-Designs: Constructions and Applications
• Distance measures to compare real and ideal quantum processes
• Quantum optimization using variational algorithms on near-term quantum devices
• Demonstration of the trapped-ion quantum-CCD computer architecture
• Simple Quantum Error Correcting Codes
• Noise tailoring for scalable quantum computation via randomized compiling
• Benchmarking an 11-qubit quantum computer
• Characterizing Quantum Gates via Randomized Benchmarking
• Optimal Quantum Circuits for General Two-Qubit Gates
• A geometric theory of non-local two-qubit operations
• Quantum codes on a lattice with boundary
• An approximate Fourier transform useful in quantum factoring
• Random Quantum Circuits are Approximate 2-designs
• Local random quantum circuits are approximate polynomial-designs
• Characterizing large-scale quantum computers via cycle benchmarking
• Mitigation of readout noise in near-term quantum devices by classical post-processing based on detector tomography
• Ultrahigh Error Threshold for Surface Codes with Biased Noise
• Efficient learning of quantum noise
• Detecting crosstalk errors in quantum information processors
• Measuring the Capabilities of Quantum Computers
• Reducing unitary and spectator errors in cross resonance with optimized rotary echoes
• Efficient Generation of Generic Entanglement
• Direct randomized benchmarking for multi-qubit devices
• Introduction to Quantum Gate Set Tomography
• Quantum coding with low-depth random circuits
• Coherence in logical quantum channels
• Crosstalk Suppression for Fault-tolerant Quantum Error Correction with Trapped Ions
• Bounding the average gate fidelity of composite channels using the unitarity
• Hidden Inverses: Coherent Error Cancellation at the Circuit Level
• Eliminating Leakage Errors in Hyperfine Qubits
• Comparing Zeeman qubits to hyperfine qubits in the context of the surface code: ${}^{174}$Yb${}^{+}$ and ${}^{171}$Yb${}^{+}$
• Subspace benchmarking high-fidelity entangling operations with trapped ions
• Handling Leakage with Subsystem Codes
• Quantum fault tolerance in small experiments
• Stabilizer Slicing: Coherent Error Cancellations in LDPC Codes
• Scalable Benchmarks for Gate-Based Quantum Computers
• Benchmarking near-term quantum computers via random circuit sampling
• Randomized Benchmarking of Clifford Operators
• Sampling random quantum circuits: a pedestrian's guide

Cited by in corpus (27)

• A Race Track Trapped-Ion Quantum Processor
• Benchmarking a trapped-ion quantum computer with 30 qubits
• Quantum Volume in Practice: What Users Can Expect from NISQ Devices
• Protecting Expressive Circuits with a Quantum Error Detection Code
• Strategies for practical advantage of fault-tolerant circuit design in noisy trapped-ion quantum computers
• Optimal synthesis into fixed XX interactions
• Performance of Quantum Approximate Optimization with Quantum Error Detection
• Quantum Volume for Photonic Quantum Processors
• Noise-Aware Quantum Amplitude Estimation
• A Comprehensive Cross-Model Framework for Benchmarking the Performance of Quantum Hamiltonian Simulations
• Increasing the Measured Effective Quantum Volume with Zero Noise Extrapolation
• Simulating Floquet scrambling circuits on trapped-ion quantum computers
• Generating multipartite nonlocality to benchmark quantum computers
• The Role of Quantum Computing in Advancing Scientific High-Performance Computing: A perspective from the ADAC Institute
• Testing quantum computers with the protocol of quantum state matching
• Analysis of a Programmable Quantum Annealer as a Random Number Generator
• Fidelity decay and error accumulation in random quantum circuits
• Quantum Algorithms for Compositional Text Processing
• Scalable Full-Stack Benchmarks for Quantum Computers
• Counting collisions in random circuit sampling for benchmarking quantum computers
• Realization and Calibration of Continuously Parameterized Two-Qubit Gates on a Trapped-Ion Quantum Processor
• Digital Zero-Noise Extrapolation with Quantum Circuit Unoptimization
• Evaluating the Limits of QAOA Parameter Transfer at High-Rounds on Sparse Ising Models With Geometrically Local Cubic Terms
• Quantum data generation in a denoising model with multiscale entanglement renormalization network
• Benchmarking quantum devices beyond classical capabilities
• Multi-GPU Quantum Circuit Simulation and the Impact of Network Performance
• Noise-Aware Circuit Compilations for a Continuously Parameterized Two-Qubit Gateset