A volumetric framework for quantum computer benchmarks

Abstract

We propose a very large family of benchmarks for probing the performance of quantum computers. We call them volumetric benchmarks (VBs) because they generalize IBM's benchmark for measuring quantum volume \cite{Cross18}. The quantum volume benchmark defines a family of square circuits whose depth $d$ and width $w$ are the same. A volumetric benchmark defines a family of rectangular quantum circuits, for which $d$ and $w$ are uncoupled to allow the study of time/space performance trade-offs. Each VB defines a mapping from circuit shapes -- $(w,d)$ pairs -- to test suites $\mathcal{C}(w,d)$. A test suite is an ensemble of test circuits that share a common structure. The test suite $\mathcal{C}$ for a given circuit shape may be a single circuit $C$, a specific list of circuits $\{C_1\dots C_N\}$ that must all be run, or a large set of possible circuits equipped with a distribution $Pr(C)$. The circuits in a given VB share a structure, which is limited only by designers' creativity. We list some known benchmarks, and other circuit families, that fit into the VB framework: several families of random circuits, periodic circuits, and algorithm-inspired circuits. The last ingredient defining a benchmark is a success criterion that defines when a processor is judged to have "passed" a given test circuit. We discuss several options. Benchmark data can be analyzed in many ways to extract many properties, but we propose a simple, universal graphical summary of results that illustrates the Pareto frontier of the $d$ vs $w$ trade-off for the processor being benchmarked. [1] A. Cross, et al., Phys. Rev. A, 100, 032328, September 2019.

arXiv commentLatest version published in Quantum. 16 pages, 6 figures

References in corpus (30)

• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• A variational eigenvalue solver on a quantum processor
• Quantum Mechanics helps in searching for a needle in a haystack
• Logic gates at the surface code threshold: Superconducting qubits poised for fault-tolerant quantum computing
• Quantum Algorithms Revisited
• Characterizing Quantum Supremacy in Near-Term Devices
• Fast Scramblers
• Randomized Benchmarking of Quantum Gates
• State preservation by repetitive error detection in a superconducting quantum circuit
• Demonstration of a small programmable quantum computer with atomic qubits
• Robust randomized benchmarking of quantum processes
• Validating quantum computers using randomized model circuits
• Efficient Z-Gates for Quantum Computing
• Experimental Comparison of Two Quantum Computing Architectures
• Scalable Noise Estimation with Random Unitary Operators
• Characterizing Quantum Gates via Randomized Benchmarking
• A blueprint for demonstrating quantum supremacy with superconducting qubits
• Local random quantum circuits are approximate polynomial-designs
• Characterization of addressability by simultaneous randomized benchmarking
• Quantum Supremacy and the Complexity of Random Circuit Sampling
• Symmetrised Characterisation of Noisy Quantum Processes
• Characterizing large-scale quantum computers via cycle benchmarking
• Performing Quantum Computing Experiments in the Cloud
• Robust Calibration of a Universal Single-Qubit Gate-Set via Robust Phase Estimation
• Direct randomized benchmarking for multi-qubit devices
• Time-domain characterization and correction of on-chip distortion of control pulses in a quantum processor
• Optimization of a solid-state electron spin qubit using Gate Set Tomography
• Probing context-dependent errors in quantum processors
• When quantum tomography goes wrong: drift of quantum sources and other errors
• Randomized Benchmarking under Different Gatesets

Cited by in corpus (45)

• Noisy intermediate-scale quantum (NISQ) algorithms
• Quantum simulation and computing with Rydberg-interacting qubits
• Gate Set Tomography
• Challenges and Opportunities of Near-Term Quantum Computing Systems
• Measuring the Capabilities of Quantum Computers
• Application-Oriented Performance Benchmarks for Quantum Computing
• Benchmarking a trapped-ion quantum computer with 30 qubits
• Biology and medicine in the landscape of quantum advantages
• Scalable randomized benchmarking of quantum computers using mirror circuits
• Quantum Volume in Practice: What Users Can Expect from NISQ Devices
• Benchmarking quantum computers
• Suppressing quantum circuit errors due to system variability
• QUARK: A Framework for Quantum Computing Application Benchmarking
• Benchmarking quantum co-processors in an application-centric, hardware-agnostic and scalable way
• Application-Motivated, Holistic Benchmarking of a Full Quantum Computing Stack
• Mapping quantum circuits to modular architectures with QUBO
• Quantum utility -- definition and assessment of a practical quantum advantage
• Interaction graph-based characterization of quantum benchmarks for improving quantum circuit mapping techniques
• Conserved charges in the quantum simulation of integrable spin chains
• A Practical Introduction to Benchmarking and Characterization of Quantum Computers
• Numerical Gate Synthesis for Quantum Heuristics on Bosonic Quantum Processors
• Quantum algorithms for scientific computing
• Volumetric Benchmarking of Error Mitigation with Qermit
• Benchmarking Quantum Generative Learning: A Study on Scalability and Noise Resilience using QUARK
• Efficient classical simulation and benchmarking of quantum processes in the Weyl basis
• Near-Term Spin-Qubit Architecture Design via Multipartite Maximally-Entangled States
• Benchmarking Quantum Computers: Towards a Standard Performance Evaluation Approach
• Noise-Adaptive Quantum Compilation Strategies Evaluated with Application-Motivated Benchmarks
• A Comprehensive Cross-Model Framework for Benchmarking the Performance of Quantum Hamiltonian Simulations
• Quantum Mini-Apps: A Framework for Developing and Benchmarking Quantum-HPC Applications
• A Classically Efficient Quantum Scalable Fermi-Hubbard Benchmark
• The Role of Quantum Computing in Advancing Scientific High-Performance Computing: A perspective from the ADAC Institute
• ArsoNISQ: Analyzing Quantum Algorithms on Near-Term Architectures
• Continuous monitoring for noisy intermediate-scale quantum processors
• An Energy Estimation Benchmark for Quantum Computers
• Accurately Simulating the Time Evolution of an Ising Model with Echo Verified Clifford Data Regression on a Superconducting Quantum Computer
• Benchmarking the performance of a high-Q cavity qudit using random unitaries
• Scalable Full-Stack Benchmarks for Quantum Computers
• Counting collisions in random circuit sampling for benchmarking quantum computers
• Learning a quantum computer's capability
• Multi-GPU Quantum Circuit Simulation and the Impact of Network Performance
• Ion-Trap Chip Architecture Optimized for Implementation of Quantum Error-Correcting Code
• Benchmarking quantum devices beyond classical capabilities
• End-to-End Quantum Algorithms for the Jones Polynomial
• Benchmarking fault-tolerant quantum computing hardware via QLOPS