Scalable Full-Stack Benchmarks for Quantum Computers
Quantum processors are now able to run quantum circuits that are infeasible to simulate classically, creating a need for benchmarks that assess a quantum processor's rate of errors when running these circuits. Here, we introduce a general technique for creating efficient benchmarks from a...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2024-01-01
|
| Series: | IEEE Transactions on Quantum Engineering |
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/10538040/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832583975066927104 |
|---|---|
| author | Jordan Hines Timothy Proctor |
| author_facet | Jordan Hines Timothy Proctor |
| author_sort | Jordan Hines |
| collection | DOAJ |
| description | Quantum processors are now able to run quantum circuits that are infeasible to simulate classically, creating a need for benchmarks that assess a quantum processor's rate of errors when running these circuits. Here, we introduce a general technique for creating efficient benchmarks from any set of quantum computations, specified by unitary circuits. Our benchmarks assess the integrated performance of a quantum processor's classical compilation algorithms and its low-level quantum operations. Unlike existing “full-stack benchmarks,” our benchmarks do not require classical simulations of quantum circuits, and they use only efficient classical computations. We use our method to create random circuit benchmarks, including a computationally efficient version of the quantum volume benchmark, and an algorithm-based benchmark that uses Hamiltonian simulation circuits. We perform these benchmarks on IBM Q devices and in simulations, and we compare their results to the results of the existing benchmarking methods. |
| format | Article |
| id | doaj-art-53186f0b863243e78638ea62932a75a8 |
| institution | Kabale University |
| issn | 2689-1808 |
| language | English |
| publishDate | 2024-01-01 |
| publisher | IEEE |
| record_format | Article |
| series | IEEE Transactions on Quantum Engineering |
| spelling | doaj-art-53186f0b863243e78638ea62932a75a82025-01-28T00:02:33ZengIEEEIEEE Transactions on Quantum Engineering2689-18082024-01-01511210.1109/TQE.2024.340450210538040Scalable Full-Stack Benchmarks for Quantum ComputersJordan Hines0https://orcid.org/0000-0001-5126-7256Timothy Proctor1https://orcid.org/0000-0003-0219-8930Department of Physics, University of California, Berkeley, CA, USAQuantum Performance Laboratory, Sandia National Laboratories, Albuquerque, NM, USAQuantum processors are now able to run quantum circuits that are infeasible to simulate classically, creating a need for benchmarks that assess a quantum processor's rate of errors when running these circuits. Here, we introduce a general technique for creating efficient benchmarks from any set of quantum computations, specified by unitary circuits. Our benchmarks assess the integrated performance of a quantum processor's classical compilation algorithms and its low-level quantum operations. Unlike existing “full-stack benchmarks,” our benchmarks do not require classical simulations of quantum circuits, and they use only efficient classical computations. We use our method to create random circuit benchmarks, including a computationally efficient version of the quantum volume benchmark, and an algorithm-based benchmark that uses Hamiltonian simulation circuits. We perform these benchmarks on IBM Q devices and in simulations, and we compare their results to the results of the existing benchmarking methods.https://ieeexplore.ieee.org/document/10538040/Application benchmarksbenchmarkingquantum algorithmsquantum computing |
| spellingShingle | Jordan Hines Timothy Proctor Scalable Full-Stack Benchmarks for Quantum Computers IEEE Transactions on Quantum Engineering Application benchmarks benchmarking quantum algorithms quantum computing |
| title | Scalable Full-Stack Benchmarks for Quantum Computers |
| title_full | Scalable Full-Stack Benchmarks for Quantum Computers |
| title_fullStr | Scalable Full-Stack Benchmarks for Quantum Computers |
| title_full_unstemmed | Scalable Full-Stack Benchmarks for Quantum Computers |
| title_short | Scalable Full-Stack Benchmarks for Quantum Computers |
| title_sort | scalable full stack benchmarks for quantum computers |
| topic | Application benchmarks benchmarking quantum algorithms quantum computing |
| url | https://ieeexplore.ieee.org/document/10538040/ |
| work_keys_str_mv | AT jordanhines scalablefullstackbenchmarksforquantumcomputers AT timothyproctor scalablefullstackbenchmarksforquantumcomputers |