.png){kind=icon}
.png){kind=icon}
Return
Heuristic-free verification-inspired quantum benchmarking
.png){kind=icon}
OA
AI
DOI：10.1088/2058-9565/adc298.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
quantum benchmarking
quantum verification
formal device characterization
Journal
IF:
5
Papers:
1.4K
Citations:
5.1K
Organization
View more organizations