An Improved Volumetric Metric for Quantum Computers via more Representative Quantum Circuit Shapes
Keith Miller, Charles Broomfield, Ann Cox, Joe Kinast, Brandon, Rodenburg

TL;DR
This paper introduces a generalized quantum volume metric that accounts for diverse circuit shapes, better reflecting the resource requirements of various quantum algorithms and applications.
Contribution
It proposes Quantum Volumetric Classes, extending the quantum volume metric to include different circuit shapes based on depth and qubit scaling.
Findings
Provides a framework for classifying quantum circuits by shape
Enhances the relevance of hardware metrics for specific applications
Facilitates better hardware benchmarking for diverse quantum algorithms
Abstract
In this work, we propose a generalization of the current most widely used quantum computing hardware metric known as the quantum volume. The quantum volume specifies a family of random test circuits defined such that the logical circuit depth is equal to the total number of qubits used in the computation. However, such square circuit shapes do not directly relate to many specific applications for which one may wish to use a quantum computer. Based on surveying available resource estimates for known quantum algorithms, we generalize the quantum volume to a handful of representative circuit shapes, which we call Quantum Volumetric Classes, based on the scaling behavior of the logical circuit depth (time) with the problem size (qubit number).
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum Information and Cryptography · Quantum-Dot Cellular Automata
