Benchmarking quantum devices beyond classical capabilities
arXiv:2502.02575 · doi:10.1103/dsjj-stkn
Abstract
Rapid development of quantum computing technology has led to a wide variety of sophisticated quantum devices. Benchmarking these systems becomes crucial for understanding their capabilities and paving the way for future advancements. The Quantum Volume (QV) test is one of the most widely used benchmarks for evaluating quantum computer performance due to its architecture independence. However, as the number of qubits in a quantum device grows, the test faces a significant limitation. It requires determining the subspace of the most probable outcomes, a task that is typically performed via classical simulation of the quantum circuit and therefore incurs an exponential computational cost. In this work, we propose modifications to the QV test, by adopting a carefully restricted circuit ensemble generated from a gate set that remains universal for quantum computation, that allows for the direct determination of the heavy-output subspace. Crucially, the modified circuits remain capable of general quantum computation. This approach overcomes the scalability barrier of the Quantum Volume test beyond classical computational limits, while still probing the key features of universal quantum computing.
References in corpus (32)
- Supplementary information for "Quantum supremacy using a programmable superconducting processor"
- Quantum algorithm for solving linear systems of equations
- Review article: Linear optical quantum computing
- Improved Simulation of Stabilizer Circuits
- Superconducting Qubits: Current State of Play
- Trapped-Ion Quantum Computing: Progress and Challenges
- NMR Techniques for Quantum Control and Computation
- Characterizing Quantum Supremacy in Near-Term Devices
- Logical quantum processor based on reconfigurable atom arrays
- Validating quantum computers using randomized model circuits
- Quantum error correction below the surface code threshold
- How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits
- Tensor networks for complex quantum systems
- Demonstration of the trapped-ion quantum-CCD computer architecture
- Matchgates and classical simulation of quantum circuits
- Challenges and Opportunities of Near-Term Quantum Computing Systems
- Measuring the Capabilities of Quantum Computers
- IBM Quantum Computers: Evolution, Performance, and Future Directions
- Reducing unitary and spectator errors in cross resonance with optimized rotary echoes
- Spectral form factors and late time quantum chaos
- Benchmarking a trapped-ion quantum computer with 30 qubits
- A volumetric framework for quantum computer benchmarks
- Scalable randomized benchmarking of quantum computers using mirror circuits
- Benchmarking quantum computers
- Unitary quantum gates, perfect entanglers and unistochastic maps
- Re-examining the quantum volume test: Ideal distributions, compiler optimizations, confidence intervals, and scalable resource estimations
- A Refined Laser Method and Faster Matrix Multiplication
- Classically estimating observables of noiseless quantum circuits
- Quantum Convolutional Neural Networks are Effectively Classically Simulable
- Demonstrating scalable randomized benchmarking of universal gate sets
- Improved simulation of quantum circuits dominated by free fermionic operations
- Fidelity decay and error accumulation in random quantum circuits