Computational Power of Random Quantum Circuits in Arbitrary Geometries
Physical Review X · 13.05.2025 · 15 (2)
DOI: 10.1103/physrevx.15.021052 ↗Kurz gefasst
Fachartikel in der Zeitschrift Physical Review X, online erschienen am 13.05.2025. Verfasst von M. DeCross und 39 weiteren Autor:innen. Die Arbeit wurde bisher 44-mal zitiert (Crossref) und nennt 59 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: Office of Science, U.S. Department of Energy, Argonne National Laboratory.
Abstract (Originalsprache)
Empirical evidence for a gap between the computational powers of classical and quantum computers has been provided by experiments that sample the output distributions of two-dimensional quantum circuits. Many attempts to close this gap have utilized classical simulations based on tensor network techniques, and their limitations shed light on the improvements to quantum hardware required to frustrate classical simulability. In particular, quantum computers having in excess of approximately 50 qubits are primarily vulnerable to classical simulation due to restrictions on their gate fidelity and their connectivity, the latter determining how many gates are required (and, therefore, how much infidelity is suffered) in generating highly entangled states. Here, we describe recent hardware upgrades to Quantinuum’s H2 quantum computer, enabling it to operate on up to 56 qubits with arbitrary connectivity and 99.843(5)% two-qubit gate fidelity. We define a class of circuits with random geometries that become hard to classically simulate in very low depth and implement them utilizing the flexible connectivity of H2. A careful analysis demonstrating the fast saturation of classical simulation complexity with depth indicates that H2 can yield data well beyond the reach of state-of-the art classical simulation methods at unprecedented fidelities. We find that the considerable difficulty of classically simulating H2 is likely limited only by qubit number, demonstrating the promise and scalability of the quantum charge-coupled device architecture as continued progress is made toward building larger machines.
Förderung
- Office of Science
- U.S. Department of Energy
- Argonne National Laboratory
- National Energy Research Scientific Computing Center
- National Quantum Information Science Research Centers
Zitieren
APA
DeCross, M., Haghshenas, R., Liu, M., Rinaldi, E., Gray, J., Alexeev, Y., Baldwin, C. H., Bartolotta, J. P., Bohn, M., Chertkov, E., Cline, J., Colina, J., DelVento, D., Dreiling, J. M., Foltz, C., Gaebler, J. P., Gatterman, T. M., Gilbreth, C. N., Giles, J., …, & Roman, C. (2025). Computational Power of Random Quantum Circuits in Arbitrary Geometries. Physical Review X, 15(2). https://doi.org/10.1103/physrevx.15.021052
Vancouver
DeCross M, Haghshenas R, Liu M, Rinaldi E, Gray J, Alexeev Y, et al. Computational Power of Random Quantum Circuits in Arbitrary Geometries. Physical Review X. 2025;15(2). doi:10.1103/physrevx.15.021052
BibTeX
@article{DeCross2025,
author = {DeCross, M. and Haghshenas, R. and Liu, M. and Rinaldi, E. and Gray, J. and Alexeev, Y. and Baldwin, C. H. and Bartolotta, J. P. and Bohn, M. and Chertkov, E. and Cline, J. and Colina, J. and DelVento, D. and Dreiling, J. M. and Foltz, C. and Gaebler, J. P. and Gatterman, T. M. and Gilbreth, C. N. and Giles, J. and Gresh, D. and Hall, A. and Hankin, A. and Hansen, A. and Hewitt, N. and Hoffman, I. and Holliman, C. and Hutson, R. B. and Jacobs, T. and Johansen, J. and Lee, P. J. and Lehman, E. and Lucchetti, D. and Lykov, D. and Madjarov, I. S. and Mathewson, B. and Mayer, K. and Mills, M. and Niroula, P. and Pino, J. M. and Roman, C.},
title = {Computational Power of Random Quantum Circuits in Arbitrary Geometries},
journal = {Physical Review X},
year = {2025},
volume = {15},
number = {2},
doi = {10.1103/physrevx.15.021052}
}
EUVIMED