Application Performance Benchmarks for Quantum Computers (2310.13637v2)
Abstract: Current technological advancements of quantum computers highlight the need for application-driven, practical and well-defined methods of benchmarking their performance. As the existing NISQ device's quality of two-qubit gate errors rate is even around one percent and the number of qubits is still limited to a few or several dozen, naturally, we need to propose rather small algorithms instances taken from key promising application areas, such as quantum chemistry, combinatorial optimisation or machine learning. While many techniques for assessing the performance of logical components, such as gate fidelity and qubit coherence exist, it is still challenging to extrapolate those values onto the performance of different quantum algorithms and subroutines. This work aims to introduce a series of initial quantum application benchmarks together with a methodology of execution for measuring the performance and fidelity of the results. The proposed suite refers to several variational algorithms widely used on available NISQ devices but also includes examples of quantum circuits designed for a fault-tolerant quantum computer.
- Application-oriented performance benchmarks for quantum computing, 2023.
- Optimization applications as quantum performance benchmarks, 2023.
- Measuring the capabilities of quantum computers. Nature Physics, 18(1):75–79, dec 2021.
- Defining standard strategies for quantum benchmarks, 2023.
- Validating quantum computers using randomized model circuits. Physical Review A, 100(3), sep 2019.
- Variational quantum algorithms. Nature Reviews Physics, 3(9):625–644, aug 2021.
- Scale, quality, and speed: three key attributes to measure the performance of near-term quantum computers. arXiv preprint arXiv:2110.14108, 2021.
- A race track trapped-ion quantum processor. arXiv preprint arXiv:2305.03828, 2023.
- Generation and verification of 27-qubit greenberger-horne-zeilinger states in a superconducting quantum computer. Journal of Physics Communications, 5(9):095004, 2021.
- 14-qubit entanglement: Creation and coherence. Physical Review Letters, 106(13):130506, 2011.
- Lov K Grover. A fast quantum mechanical algorithm for database search. In Proceedings of the twenty-eighth annual ACM symposium on Theory of computing, pages 212–219, 1996.
- Approximate quantum fourier transform with o (n log (n)) t gates. NPJ Quantum Information, 6(1):26, 2020.
- Fast quantum modular exponentiation. Physical Review A, 71(5):052320, 2005.
- Experimental quantum error correction. Physical Review Letters, 81(10):2152, 1998.
- On the cnot-cost of toffoli gates. arXiv preprint arXiv:0803.2316, 2008.
- Decompositions of n-qubit toffoli gates with linear circuit complexity. International Journal of Theoretical Physics, 56:2350–2361, 2017.
- Realization of scalable cirac-zoller multi-qubit gates. arXiv preprint arXiv:2301.07564, 2023.
- Don Coppersmith. An approximate fourier transform useful in quantum factoring. arXiv preprint quant-ph/0201067, 2002.
- The variational quantum eigensolver: a review of methods and best practices. Physics Reports, 986:1–128, 2022.
- Application of quantum approximate optimization algorithm to job shop scheduling problem. European Journal of Operational Research, 310(2):518–528, 2023.
- Exploring the capabilities of quantum support vector machines for image classification on the mnist benchmark. In International Conference on Computational Science, pages 193–200. Springer, 2023.