Computational Power of Random Quantum Circuits in Arbitrary Geometries

Jun 4, 2024·
Matthew DeCross
,
Reza Haghshenas
,
Minzhao Liu
Enrico Rinaldi
Enrico Rinaldi
,
Johnnie Gray
,
Yuri Alexeev
,
Charles H. Baldwin
,
John P. Bartolotta
,
Matthew Bohn
,
Eli Chertkov
,
Julia Cline
,
Jonhas Colina
,
Davide DelVento
,
Joan M. Dreiling
,
Cameron Foltz
,
John P. Gaebler
,
Thomas M. Gatterman
,
Christopher N. Gilbreth
,
Joshua Giles
,
Dan Gresh
,
Alex Hall
,
Aaron Hankin
,
Azure Hansen
,
Nathan Hewitt
,
Ian Hoffman
,
Craig Holliman
,
Ross B. Hutson
,
Trent Jacobs
,
Jacob Johansen
,
Patricia J. Lee
,
Elliot Lehman
,
Dominic Lucchetti
,
Danylo Lykov
,
Ivaylo S. Madjarov
,
Brian Mathewson
,
Karl Mayer
,
Michael Mills
,
Pradeep Niroula
,
Juan M. Pino
,
Conrad Roman
,
Michael Schecter
,
Peter E. Siegfried
,
Bruce G. Tiemann
,
Curtis Volin
,
James Walker
,
Ruslan Shaydulin
,
Marco Pistoia
,
Steven.A. Moses
,
David Hayes
,
Brian Neyenhuis
,
Russell P. Stutz
,
Michael Foss-Feig
· 0 min read
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 $\sim 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. Utilizing the flexible connectivity of H2, we present data from random circuit sampling in highly connected geometries, doing so at unprecedented fidelities and a scale that appears to be beyond the capabilities of state-of-the-art classical algorithms. The considerable difficulty of classically simulating H2 is likely limited only by qubit number, demonstrating the promise and scalability of the QCCD architecture as continued progress is made towards building larger machines.
Type
Publication
Physical Review X 15
publications
Enrico Rinaldi
Authors
Senior R&D Manager
I am a Senior R&D Manager at Quantinuum in London. I am also a Visiting Scientist at the RIKEN Center for Quantum Computing (Theory Unit) and an Honorary Senior Lecturer in the School of Mathematical Sciences at Queen Mary University of London.