Heuristic-free verification-inspired quantum benchmarking

Abstract

In this paper, we introduce a new approach to quantum benchmarking inspired by quantum verification, motivating new paradigms in quantum benchmarking. Our proposed benchmark not only serves as a robust indicator of computational capability but also offers scalability, customizability, and universality. By providing formal statements regarding the quality of quantum devices while assuming device consistency, we eliminate the reliance on heuristics. We establish a deep connection between quantum verification and quantum benchmarking. For practical application, we present a concrete benchmarking protocol for bounded-error quantum polynomial time (BQP) computations derived from an efficient quantum verification protocol and prove it to match our redefined standards for quantum benchmarking.