Scalable Full-Stack Benchmarks for Quantum Computers

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.

9 pages+appendices, 6+1 figures

References in corpus (9)

• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• Robust randomized benchmarking of quantum processes
• Direct Fidelity Estimation from Few Pauli Measurements
• Symmetrised Characterisation of Noisy Quantum Processes
• Character randomized benchmarking for non-multiplicity-free groups with applications to subspace, leakage, and matchgate randomized benchmarking
• 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

Cited by in corpus (2)

• Benchmarking quantum computers
• A Practical Introduction to Benchmarking and Characterization of Quantum Computers