Quantum volume

Template:Short description Quantum volume is a metric that measures the capabilities and error rates of a quantum computer. It expresses the maximum size of square quantum circuits that can be implemented successfully by the computer. The form of the circuits is independent from the quantum computer architecture, but compiler can transform and optimize it to take advantage of the computer's features. Thus, quantum volumes for different architectures can be compared.

Introduction

Quantum computers are difficult to compare. Quantum volume is a single number designed to show all around performance. It is a measurement and not a calculation, and takes into account several features of a quantum computer, starting with its number of qubits—other measures used are gate and measurement errors, crosstalk and connectivity.

IBM defined its Quantum Volume metric because a classical computer's transistor count and a quantum computer's quantum bit count aren't the same. Qubits decohere with a resulting loss of performance so a few fault tolerant bits are more valuable as a performance measure than a larger number of noisy, error-prone qubits.

Generally, the larger the quantum volume, the more complex the problems a quantum computer can solve.

Alternative benchmarks, such as Cross-entropy benchmarking, reliable Quantum Operations per Second (rQOPS) proposed by Microsoft, Circuit Layer Operations Per Second (CLOPS) proposed by IBM and IonQ's Algorithmic Qubits, have also been proposed.

Definition

Original definition

The quantum volume of a quantum computer was originally defined in 2018 by Nikolaj Moll et al. However, since around 2021 that definition has been supplanted by IBM's 2019 redefinition. The original definition depends on the number of qubits Template:Mvar as well as the number of steps that can be executed, the circuit depth Template:Mvar

${\tilde{V}}_Q=\min [N,d(N){]}^2.$

The circuit depth depends on the effective error rate Template:Math as

$d\simeq \frac{1}{N{\epsilon }_{\mathrm{e}\mathrm{f}\mathrm{f}}}.$

The effective error rate Template:Math is defined as the average error rate of a two-qubit gate. If the physical two-qubit gates do not have all-to-all connectivity, additional SWAP gates may be needed to implement an arbitrary two-qubit gate and Template:Math, where Template:Mvar is the error rate of the physical two-qubit gates. If more complex hardware gates are available, such as the three-qubit Toffoli gate, it is possible that Template:Math.

The allowable circuit depth decreases when more qubits with the same effective error rate are added. So with these definitions, as soon as Template:Math, the quantum volume goes down if more qubits are added. To run an algorithm that only requires Template:Math qubits on an Template:Mvar-qubit machine, it could be beneficial to select a subset of qubits with good connectivity. For this case, Moll et al. give a refined definition of quantum volume.

$V_Q=\underset{n<N}{\max }\{\min {[n,\frac{1}{n{\epsilon }_{\mathrm{e}\mathrm{f}\mathrm{f}}(n)}]}^2\},$

where the maximum is taken over an arbitrary choice of Template:Mvar qubits.

IBM's redefinition

In 2019, IBM's researchers modified the quantum volume definition to be an exponential of the circuit size, stating that it corresponds to the complexity of simulating the circuit on a classical computer:

${\log }_2{V}_Q=\underset{n\le N}{\mathrm{a}\mathrm{r}\mathrm{g}\mathrm{m}\mathrm{a}\mathrm{x}}\{\min [n,d(n)]\}$

Achievement history

The world record, Template:As of, for the highest quantum volume is 2Template:Sup. Here is an overview of historically achieved quantum volumes:

Date	Quantum volumeTemplate:Efn	Qubit count	Manufacturer	System name and reference
2020, January	2Template:Sup	28	IBM	"Raleigh"
2020, June	2Template:Sup	6	Honeywell
2020, August	2Template:Sup	27	IBM	Falcon r4 "Montreal"
2020, November	2Template:Sup	10	Honeywell	"System Model H1"
2020, December	2Template:Sup	27	IBM	Falcon r4 "Montreal"
2021, March	2Template:Sup	10	Honeywell	"System Model H1"
2021, July	2Template:Sup	10	Honeywell	"Honeywell System H1"
2021, December	2Template:Sup	12	Quantinuum (previously Honeywell)	"Quantinuum System Model H1-2"
2022, April	2Template:Sup	27	IBM	Falcon r10 "Prague"
2022, April	2Template:Sup	12	Quantinuum	"Quantinuum System Model H1-2"
2022, May	2Template:Sup	27	IBM	Falcon r10 "Prague"
2022, September	2Template:Sup	20	Quantinuum	"Quantinuum System Model H1-1"
2023, February	2Template:Sup	24	Alpine Quantum Technologies	"Compact Ion-Trap Quantum Computing Demonstrator"
2023, February	2Template:Sup	20	Quantinuum	"Quantinuum System Model H1-1"
2023, May	2Template:Sup	32	Quantinuum	"Quantinuum System Model H2"
2023, June	2Template:Sup	20	Quantinuum	"Quantinuum System Model H1-1"
2024, February	2Template:Sup	20	IQM	"IQM 20-qubit system"
2024, April	2Template:Sup	20	Quantinuum	"Quantinuum System Model H1-1"
2024, August	2Template:Sup	56	Quantinuum	"Quantinuum System Model H2-1"

Volumetric benchmarks

The quantum volume benchmark defines a family of square circuits, whose number of qubits Template:Mvar and depth Template:Mvar are the same. Therefore, the output of this benchmark is a single number. However, a proposed generalization is the volumetric benchmark framework, which defines a family of rectangular quantum circuits, for which Template:Mvar and Template:Mvar are uncoupled to allow the study of time/space performance trade-offs, thereby sacrificing the simplicity of a single-figure benchmark.

Volumetric benchmarks can be generalized not only to account for uncoupled Template:Mvar and Template:Mvar dimensions, but also to test different types of quantum circuits. While quantum volume benchmarks the quantum computer's ability to implement a specific type of randomized circuits, these can, in principle, be substituted by other families of random circuits, periodic circuits, or algorithm-inspired circuits. Each benchmark must have a success criterion that defines whether a processor has "passed" a given test circuit.

While these data can be analyzed in many ways, a simple method of visualization is illustrating the Pareto front of the Template:Mvar versus Template:Mvar trade-off for the processor being benchmarked. This Pareto front provides information on the largest depth Template:Mvar a patch of a given number of qubits Template:Mvar can withstand, or, alternatively, the biggest patch of Template:Mvar qubits that can withstand executing a circuit of given depth Template:Mvar.

See also

• Noisy intermediate-scale quantum era
• Quantum fidelity