Computational Power of Random Quantum Circuits in Arbitrary Geometries
Matthew DeCross, Reza Haghshenas, Mingzhe Liu, Enrico Rinaldi, John P. Gray, Yuri Alexeev, Charles H. Baldwin, John P. Bartolotta, Matthew J. Bohn, Eli Chertkov, James M. Cline, J. Colina, Davide DelVento, Joan Dreiling, C. B. Foltz, J. P. Gaebler, Thomas Gatterman, C. N. Gilbreth, J. Giles, Dan Gresh, Alex Hall, Aaron Hankin, Ann‐Brit Eg Hansen, Nathan Hewitt, Ian M. Hoffman, C. A. Holliman, Ross B. Hutson, Trent Jacobs, Jacob Johansen, P. J. Lee, Erik Lehman, D. Lucchetti, Danylo Lykov, Ivaylo S. Madjarov, B. Mathewson, Karl Mayer, Michael Mills, Pradeep Niroula, Juan Miguel Rey Pino, Conrad Roman, Michael Schecter, P. E. Siegfried, Bruce G. Tiemann, Curtis Volin, J. Walker, Ruslan Shaydulin, Marco Pistoia, Steven A. Moses, David Hayes, B. Neyenhuis, R. P. Stutz, Michael Foss‐Feig
Abstract
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.