A comprehensive survey on quantum computer usage: How many qubits are employed for what purposes?
arXiv:2307.16130 · doi:10.1038/s42254-024-00725-0
Abstract
Quantum computers (QCs), which work based on the law of quantum mechanics, are expected to be faster than classical computers in several computational tasks such as prime factoring and simulation of quantum many-body systems. In the last decade, research and development of QCs have rapidly advanced. Now hundreds of physical qubits are at our disposal, and one can find several remarkable experiments actually outperforming the classical computer in a specific computational task. On the other hand, it is unclear what the typical usages of the QCs are. Here we conduct an extensive survey on the papers that are posted in the quant-ph section in arXiv and claim to have used QCs in their abstracts. To understand the current situation of the research and development of the QCs, we evaluated the descriptive statistics about the papers, including the number of qubits employed, QPU vendors, application domains and so on. Our survey shows that the annual number of publications is increasing, and the typical number of qubits employed is about six to ten, growing along with the increase in the quantum volume (QV). Most of the preprints are devoted to applications such as quantum machine learning, condensed matter physics, and quantum chemistry, while quantum error correction and quantum noise mitigation use more qubits than the other topics. These imply that the increase in QV is fundamentally relevant, and more experiments for quantum error correction, and noise mitigation using shallow circuits with more qubits will take place.
14 pages, 5 figures, figures regenerated
References in corpus (4)
- Supplementary information for "Quantum supremacy using a programmable superconducting processor"
- Noise-resilient Edge Modes on a Chain of Superconducting Qubits
- Simulating large-size quantum spin chains on cloud-based superconducting quantum computers
- A Quantum Approach to the Discretizable Molecular Distance Geometry Problem
Cited by in corpus (6)
- A Critical Analysis of Deployed Use Cases for Quantum Key Distribution and Comparison with Post-Quantum Cryptography
- Scalable circuit depth reduction in feedback-based quantum optimization with a quadratic approximation
- Ab initio extended Hubbard model of short polyenes for efficient quantum computing
- C3-VQA: Cryogenic Counter-based Co-processor for Variational Quantum Algorithms
- Encoded probabilistic imaginary-time evolution on a trapped-ion quantum computer for ground and excited states of spin qubits
- Efficient Qubit Calibration by Binary-Search Hamiltonian Tracking