Measuring the Capabilities of Quantum Computers

Abstract

A quantum computer has now solved a specialized problem believed to be intractable for supercomputers, suggesting that quantum processors may soon outperform supercomputers on scientifically important problems. But flaws in each quantum processor limit its capability by causing errors in quantum programs, and it is currently difficult to predict what programs a particular processor can successfully run. We introduce techniques that can efficiently test the capabilities of any programmable quantum computer, and we apply them to twelve processors. Our experiments show that current hardware suffers complex errors that cause structured programs to fail up to an order of magnitude earlier - as measured by program size - than disordered ones. As a result, standard error metrics inferred from random disordered program behavior do not accurately predict performance of useful programs. Our methods provide efficient, reliable, and scalable benchmarks that can be targeted to predict quantum computer performance on real-world problems.

arXiv comment4 pages + appendices. Please see the published paper for the final version of this work. The version here does not contain changes implemented in the peer-review process. Data and code for this manuscript can be found at https://zenodo.org/record/5197499

References in corpus (44)

• Quantum Computing in the NISQ era and beyond
• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• Improved Simulation of Stabilizer Circuits
• Quantum Computing with Very Noisy Devices
• Characterizing Quantum Supremacy in Near-Term Devices
• Randomized Benchmarking of Quantum Gates
• Quantum Computational Supremacy
• Robust randomized benchmarking of quantum processes
• A simple formula for the average gate fidelity of a quantum dynamical operation
• Validating quantum computers using randomized model circuits
• Exact and Approximate Unitary 2-Designs: Constructions and Applications
• Efficient Z-Gates for Quantum Computing
• Noise tailoring for scalable quantum computation via randomized compiling
• Experimental Comparison of Two Quantum Computing Architectures
• Benchmarking an 11-qubit quantum computer
• Scalable Noise Estimation with Random Unitary Operators
• Characterizing Quantum Gates via Randomized Benchmarking
• A blueprint for demonstrating quantum supremacy with superconducting qubits
• Demonstration of qubit operations below a rigorous fault tolerance threshold with gate set tomography
• Evenly distributed unitaries: on the structure of unitary designs
• Characterization of addressability by simultaneous randomized benchmarking
• Symmetrised Characterisation of Noisy Quantum Processes
• Characterizing large-scale quantum computers via cycle benchmarking
• Ultrahigh Error Threshold for Surface Codes with Biased Noise
• Efficient learning of quantum noise
• Detecting crosstalk errors in quantum information processors
• Three Qubit Randomized Benchmarking
• Quantum gate teleportation between separated qubits in a trapped-ion processor
• Comparing Experiments to the Fault-Tolerance Threshold
• Quantum Operation Time Reversal
• What randomized benchmarking actually measures
• Fault-tolerant thresholds for the surface code in excess of 5% under biased noise
• Direct randomized benchmarking for multi-qubit devices
• Detecting and tracking drift in quantum information processors
• A volumetric framework for quantum computer benchmarks
• Benchmarking gate-based quantum computers
• Performance of quantum error correction with coherent errors
• Probing quantum processor performance with pyGSTi
• Experimental quantum verification in the presence of temporally correlated noise
• Shorter gate sequences for quantum computing by mixing unitaries
• Bounding the average gate fidelity of composite channels using the unitarity
• Accrediting outputs of noisy intermediate-scale quantum computing devices
• Controlling error orientation to improve quantum algorithm success rates
• Randomized Benchmarking as Convolution: Fourier Analysis of Gate Dependent Errors

Cited by in corpus (73)

• A Race Track Trapped-Ion Quantum Processor
• Application-Oriented Performance Benchmarks for Quantum Computing
• Benchmarking a trapped-ion quantum computer with 30 qubits
• Near-Term Quantum Computing Techniques: Variational Quantum Algorithms, Error Mitigation, Circuit Compilation, Benchmarking and Classical Simulation
• Scalable randomized benchmarking of quantum computers using mirror circuits
• A density-matrix renormalization group algorithm for simulating quantum circuits with a finite fidelity
• Benchmarking quantum computers
• Quantum Volume in Practice: What Users Can Expect from NISQ Devices
• Benchmarking highly entangled states on a 60-atom analog quantum simulator
• Suppressing quantum circuit errors due to system variability
• Re-examining the quantum volume test: Ideal distributions, compiler optimizations, confidence intervals, and scalable resource estimations
• Error-robust quantum logic optimization using a cloud quantum computer interface
• Quantum Fourier Transform using Dynamic Circuits
• Verifiable blind quantum computing with trapped ions and single photons
• A taxonomy of small Markovian errors
• Experimental benchmarking of an automated deterministic error suppression workflow for quantum algorithms
• Quantum utility -- definition and assessment of a practical quantum advantage
• The computational power of random quantum circuits in arbitrary geometries
• Protecting Expressive Circuits with a Quantum Error Detection Code
• Learning correlated noise in a 39-qubit quantum processor
• Analyzing the impact of time-correlated noise on zero-noise extrapolation
• Quantum circuit fidelity estimation using machine learning
• A quantum hamiltonian simulation benchmark
• Testing platform-independent quantum error mitigation on noisy quantum computers
• Scaling of energy and power in a large quantum battery-charger model
• A Practical Introduction to Benchmarking and Characterization of Quantum Computers
• Demonstrating scalable randomized benchmarking of universal gate sets
• HamLib: A library of Hamiltonians for benchmarking quantum algorithms and hardware
• Algorithmic QUBO Formulations for k-SAT and Hamiltonian Cycles
• Quantum algorithms for scientific computing
• Learning How to Dynamically Decouple
• Leveraging Randomized Compiling for the QITE Algorithm
• Volumetric Benchmarking of Error Mitigation with Qermit
• Fair Sampling Error Analysis on NISQ Devices
• Benchmarking quantum logic operations relative to thresholds for fault tolerance
• Benchmarking quantum gates and circuits
• Fully scalable randomized benchmarking without motion reversal
• Highly optimized quantum circuits synthesized via data-flow engines
• Quantum error reduction with deep neural network applied at the post-processing stage
• An Accurate and Efficient Analytic Model of Fidelity Under Depolarizing Noise Oriented to Large Scale Quantum System Design
• Benchmarking Quantum Generative Learning: A Study on Scalability and Noise Resilience using QUARK
• Error estimation in current noisy quantum computers
• Benchmarking Quantum Computers: Towards a Standard Performance Evaluation Approach
• Quantum circuit debugging and sensitivity analysis via local inversions
• Efficient characterization of qudit logical gates with gate set tomography using an error-free Virtual-Z-gate model
• A Comprehensive Cross-Model Framework for Benchmarking the Performance of Quantum Hamiltonian Simulations
• Non-Markovian Quantum Gate Set Tomography
• Qubit assignment using time reversal
• Empirical learning of dynamical decoupling on quantum processors
• Learning to rank quantum circuits for hardware-optimized performance enhancement
• Simulating Floquet scrambling circuits on trapped-ion quantum computers
• Cross-Platform Comparison of Arbitrary Quantum Processes
• Perturbative Analysis of Quasi-periodic Patterning of Transmon Quantum Computers: Enhancement of Many-Body Localization
• A protocol to characterize errors in quantum simulation of many-body physics
• AppQSim: Application-oriented benchmarks for Hamiltonian simulation on a quantum computer
• Testing quantum computers with the protocol of quantum state matching
• A Theory of Direct Randomized Benchmarking
• Unifying non-Markovian characterisation with an efficient and self-consistent framework
• Q-fid: Quantum Circuit Fidelity Improvement with LSTM Networks
• Learning a quantum computer's capability
• Scalable Full-Stack Benchmarks for Quantum Computers
• Joint Encryption and Error Correction for Secure Quantum Communication
• Distributing Quantum Computations, Shot-wise
• Reliable confidence regions for quantum tomography using distribution moments
• Simulating sparse SYK model with a randomized algorithm on a trapped-ion quantum computer
• Simplifying errors by symmetry and randomisation
• Benchmarking fault-tolerant quantum computing hardware via QLOPS
• Benchmarking quantum devices beyond classical capabilities
• Multi-GPU Quantum Circuit Simulation and the Impact of Network Performance
• Topology-Aware Block Coordinate Descent for Qubit Frequency Allocation of Superconducting Quantum Processors
• Systematic Characterization of Transmon Qubit Stability with Thermal Cycling
• End-to-End Quantum Algorithms for the Jones Polynomial
• Performance evaluation of variational quantum eigensolver and quantum dynamics algorithms on the advection-diffusion equation