Title: Computational Power of Random Quantum Circuits in Arbitrary Geometries

Journal Article · · Physical Review. X

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. Published by the American Physical Society 2025

Sponsoring Organization:
USDOE
Grant/Contract Number:
AC02-05CH11231; AC02-06CH11357
OSTI ID:
2565986
Journal Information:
Physical Review. X, Journal Name: Physical Review. X Journal Issue: 2 Vol. 15; ISSN PRXHAE; ISSN 2160-3308
Publisher:
American Physical SocietyCopyright Statement
Country of Publication:
United States
Language:
English

References (43)

An Introduction to the Bootstrap book January 1993
Positive-instance driven dynamic programming for treewidth journal October 2018
The Isoperimetric Number of Random Regular Graphs journal May 1988
A simple formula for the average gate fidelity of a quantum dynamical operation journal October 2002
Quantum computational advantage via 60-qubit 24-cycle random circuit sampling journal February 2022
Random Regular Graphs: Asymptotic Distributions and Contiguity journal December 1995
Characterizing large-scale quantum computers via cycle benchmarking journal November 2019
A flexible high-performance simulator for verifying and benchmarking quantum circuits implemented on real hardware journal October 2019
Characterizing quantum supremacy in near-term devices journal April 2018
On the complexity and verification of quantum random circuit sampling journal October 2018
Measuring the capabilities of quantum computers journal December 2021
The hardness of random quantum circuits journal July 2023
Quantum supremacy using a programmable superconducting processor journal October 2019
Demonstration of the trapped-ion quantum CCD computer architecture journal April 2021
Evidence for the utility of quantum computing before fault tolerance journal June 2023
Logical quantum processor based on reconfigurable atom arrays journal December 2023
Quantum Low-Density Parity-Check Codes journal October 2021
Density Matrix Renormalization Group with Tensor Processing Units journal February 2023
Density-Matrix Renormalization Group Algorithm for Simulating Quantum Circuits with a Finite Fidelity journal April 2023
Limitations of Linear Cross-Entropy as a Measure for Quantum Advantage journal February 2024
Manipulation and detection of a trapped Yb + hyperfine qubit journal November 2007
Characterizing quantum gates via randomized benchmarking journal April 2012
Noise tailoring for scalable quantum computation via randomized compiling journal November 2016
Statistical analysis of randomized benchmarking journal May 2019
Error Mitigation for Short-Depth Quantum Circuits journal November 2017
Strong Quantum Computational Advantage Using a Superconducting Quantum Processor journal October 2021
Solving the Sampling Problem of the Sycamore Quantum Circuits journal August 2022
High Fidelity State Preparation and Measurement of Ion Hyperfine Qubits with I>12 journal September 2022
Transport of Multispecies Ion Crystals through a Junction in a Radio-Frequency Paul Trap journal April 2023
Verifying Quantum Advantage Experiments with Multiple Amplitude Tensor Network Contraction journal January 2024
Average entropy of a subsystem journal August 1993
What Limits the Simulation of Quantum Computers? journal November 2020
A Race-Track Trapped-Ion Quantum Processor journal December 2023
Qubit-Reuse Compilation with Mid-Circuit Measurement and Reset journal December 2023
Hyperoptimized Approximate Contraction of Tensor Networks with Arbitrary Geometry journal January 2024
Quantum Entanglement Growth under Random Unitary Dynamics journal July 2017
Computational advantage of quantum random sampling journal July 2023
Quantum computational advantage using photons journal December 2020
Simulating Quantum Computation by Contracting Tensor Networks journal January 2008
Engineering a direct k-way Hypergraph Partitioning Algorithm conference January 2017
Fast counting with tensor networks journal November 2019
Hyper-optimized tensor network contraction journal March 2021
Jet: Fast quantum circuit simulations with parallel task-based tensor-network contraction journal May 2022