DOE PAGES title logo U.S. Department of Energy
Office of Scientific and Technical Information

Title: 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 C ( w , d ) . A test suite is an ensemble of test circuits that share a common structure. The test suite C for a given circuit shape may be a singlemore » circuit C , a specific list of circuits { C 1 C N } that must all be run, or a large set of possible circuits equipped with a distribution P r ( 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.« less

Authors:
 [1]; ORCiD logo [1]
  1. Sandia National Laboratories (SNL), Albuquerque, NM, and Livermore, CA (United States). Quantum Performance Lab.
Publication Date:
Research Org.:
Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Sandia National Lab. (SNL-CA), Livermore, CA (United States)
Sponsoring Org.:
USDOE Office of Science (SC), Advanced Scientific Computing Research (ASCR); USDOE National Nuclear Security Administration (NNSA)
OSTI Identifier:
1725835
Report Number(s):
SAND-2020-12589J
Journal ID: ISSN 2521-327X; 692081
Grant/Contract Number:  
AC04-94AL85000; NA0003525
Resource Type:
Accepted Manuscript
Journal Name:
Quantum
Additional Journal Information:
Journal Volume: 4; Journal ID: ISSN 2521-327X
Publisher:
Quantum Science Open Community
Country of Publication:
United States
Language:
English
Subject:
97 MATHEMATICS AND COMPUTING

Citation Formats

Blume-Kohout, Robin, and Young, Kevin C. A volumetric framework for quantum computer benchmarks. United States: N. p., 2020. Web. doi:10.22331/q-2020-11-15-362.
Blume-Kohout, Robin, & Young, Kevin C. A volumetric framework for quantum computer benchmarks. United States. https://doi.org/10.22331/q-2020-11-15-362
Blume-Kohout, Robin, and Young, Kevin C. Sun . "A volumetric framework for quantum computer benchmarks". United States. https://doi.org/10.22331/q-2020-11-15-362. https://www.osti.gov/servlets/purl/1725835.
@article{osti_1725835,
title = {A volumetric framework for quantum computer benchmarks},
author = {Blume-Kohout, Robin and Young, Kevin C.},
abstractNote = {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 C(w,d). A test suite is an ensemble of test circuits that share a common structure. The test suite C for a given circuit shape may be a single circuit C, a specific list of circuits {C1…CN} 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.},
doi = {10.22331/q-2020-11-15-362},
journal = {Quantum},
number = ,
volume = 4,
place = {United States},
year = {Sun Nov 15 00:00:00 EST 2020},
month = {Sun Nov 15 00:00:00 EST 2020}
}

Works referenced in this record:

Validating quantum computers using randomized model circuits
journal, September 2019


Probing Context-Dependent Errors in Quantum Processors
journal, June 2019


Experimental comparison of two quantum computing architectures
journal, March 2017

  • Linke, Norbert M.; Maslov, Dmitri; Roetteler, Martin
  • Proceedings of the National Academy of Sciences, Vol. 114, Issue 13
  • DOI: 10.1073/pnas.1618020114

On the complexity and verification of quantum random circuit sampling
journal, October 2018


Time-domain characterization and correction of on-chip distortion of control pulses in a quantum processor
journal, February 2020

  • Rol, M. A.; Ciorciaro, L.; Malinowski, F. K.
  • Applied Physics Letters, Vol. 116, Issue 5
  • DOI: 10.1063/1.5133894

Randomized benchmarking under different gate sets
journal, March 2019


Scalable noise estimation with random unitary operators
journal, September 2005

  • Emerson, Joseph; Alicki, Robert; Życzkowski, Karol
  • Journal of Optics B: Quantum and Semiclassical Optics, Vol. 7, Issue 10
  • DOI: 10.1088/1464-4266/7/10/021

Characterizing quantum supremacy in near-term devices
journal, April 2018


Randomized benchmarking of quantum gates
journal, January 2008


Optimization of a solid-state electron spin qubit using gate set tomography
journal, October 2016


Efficient Z gates for quantum computing
journal, August 2017


Fast parallel circuits for the quantum Fourier transform
conference, January 2000

  • Cleve, R.; Watrous, J.
  • Proceedings 41st Annual Symposium on Foundations of Computer Science
  • DOI: 10.1109/SFCS.2000.892140

Robust calibration of a universal single-qubit gate set via robust phase estimation
journal, December 2015


Superconducting quantum circuits at the surface code threshold for fault tolerance
journal, April 2014


A variational eigenvalue solver on a photonic quantum processor
journal, July 2014

  • Peruzzo, Alberto; McClean, Jarrod; Shadbolt, Peter
  • Nature Communications, Vol. 5, Issue 1
  • DOI: 10.1038/ncomms5213

Scalable and Robust Randomized Benchmarking of Quantum Processes
journal, May 2011


The LINPACK Benchmark: past, present and future
journal, January 2003

  • Dongarra, Jack J.; Luszczek, Piotr; Petitet, Antoine
  • Concurrency and Computation: Practice and Experience, Vol. 15, Issue 9
  • DOI: 10.1002/cpe.728

When quantum tomography goes wrong: drift of quantum sources and other errors
journal, February 2013


Quantum supremacy using a programmable superconducting processor
journal, October 2019


Fast scramblers
journal, October 2008


Characterizing large-scale quantum computers via cycle benchmarking
journal, November 2019


Algorithms for quantum computation: discrete logarithms and factoring
conference, January 1994


Local Random Quantum Circuits are Approximate Polynomial-Designs
journal, August 2016

  • Brandão, Fernando G. S. L.; Harrow, Aram W.; Horodecki, Michał
  • Communications in Mathematical Physics, Vol. 346, Issue 2
  • DOI: 10.1007/s00220-016-2706-8

Correction: Publisher Correction: Demonstration of qubit operations below a rigorous fault tolerance threshold with gate set tomography
journal, June 2018

  • Blume-Kohout, Robin; Gamble, John King; Nielsen, Erik
  • Nature Communications, Vol. 9, Issue 1
  • DOI: 10.1038/ncomms16226

Universal Quantum Simulators
journal, August 1996


Performing quantum computing experiments in the cloud
journal, September 2016


Quantum algorithms revisited
journal, January 1998

  • Cleve, R.; Ekert, A.; Macchiavello, C.
  • Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences, Vol. 454, Issue 1969
  • DOI: 10.1098/rspa.1998.0164

Symmetrized Characterization of Noisy Quantum Processes
journal, September 2007


Characterizing quantum gates via randomized benchmarking
journal, April 2012


Direct Randomized Benchmarking for Multiqubit Devices
journal, July 2019


Demonstration of a small programmable quantum computer with atomic qubits
journal, August 2016


Quantum Mechanics Helps in Searching for a Needle in a Haystack
journal, July 1997


Characterization of Addressability by Simultaneous Randomized Benchmarking
journal, December 2012


State preservation by repetitive error detection in a superconducting quantum circuit
journal, March 2015


A blueprint for demonstrating quantum supremacy with superconducting qubits
journal, April 2018


When quantum tomography goes wrong: drift of quantum sources and other errors
text, January 2013


Works referencing / citing this record:

A quantum-classical cloud platform optimized for variational hybrid algorithms
journal, March 2020

  • Karalekas, Peter J.; Tezak, Nikolas A.; Peterson, Eric C.
  • Quantum Science and Technology, Vol. 5, Issue 2
  • DOI: 10.1088/2058-9565/ab7559

Benchmarking Quantum Coprocessors in an Application-Centric, Hardware-Agnostic, and Scalable Way
journal, January 2021

  • Martiel, Simon; Ayral, Thomas; Allouche, Cyril
  • IEEE Transactions on Quantum Engineering, Vol. 2
  • DOI: 10.1109/tqe.2021.3090207

t$|$ket$\rangle$ : A Retargetable Compiler for NISQ Devices
text, January 2020


Quantum Algorithms in Cybernetics
preprint, January 2021