The computational power of random quantum circuits in arbitrary geometries

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.

Includes minor updates to the text and an updated author list to include researchers who made technical contributions in upgrading the machine to 56 qubits but were left off the original version by mistake

References in corpus (33)

• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• Quantum computational advantage using photons
• Error mitigation for short-depth quantum circuits
• Characterizing Quantum Supremacy in Near-Term Devices
• Strong quantum computational advantage using a superconducting quantum processor
• Logical quantum processor based on reconfigurable atom arrays
• A simple formula for the average gate fidelity of a quantum dynamical operation
• Quantum Entanglement Growth Under Random Unitary Dynamics
• Demonstration of the trapped-ion quantum-CCD computer architecture
• Noise tailoring for scalable quantum computation via randomized compiling
• Simulating quantum computation by contracting tensor networks
• Manipulation and Detection of a Trapped Yb+ Ion Hyperfine Qubit
• Characterizing Quantum Gates via Randomized Benchmarking
• A Race Track Trapped-Ion Quantum Processor
• Quantum Low-Density Parity-Check Codes
• Quantum Supremacy and the Complexity of Random Circuit Sampling
• Characterizing large-scale quantum computers via cycle benchmarking
• What limits the simulation of quantum computers?
• Hyper-optimized tensor network contraction
• A flexible high-performance simulator for verifying and benchmarking quantum circuits implemented on real hardware
• Computational advantage of quantum random sampling
• Measuring the Capabilities of Quantum Computers
• Solving the sampling problem of the Sycamore quantum circuits
• A density-matrix renormalization group algorithm for simulating quantum circuits with a finite fidelity
• High fidelity state preparation and measurement of ion hyperfine qubits with I > 1/2
• Jet: Fast quantum circuit simulations with parallel task-based tensor-network contraction
• Statistical analysis of randomized benchmarking
• Limitations of Linear Cross-Entropy as a Measure for Quantum Advantage
• Fast counting with tensor networks
• Density Matrix Renormalization Group with Tensor Processing Units
• Transport of multispecies ion crystals through a junction in an RF Paul trap
• Hyper-optimized approximate contraction of tensor networks with arbitrary geometry
• Validating quantum-supremacy experiments with exact and fast tensor network contraction

Cited by in corpus (16)

• Exactly solvable many-body dynamics from space-time duality
• High-fidelity two-qubit quantum logic gates in a trapped-ion chain using axial motional modes
• Efficient fault-tolerant code switching via one-way transversal CNOT gates
• Quantum error correction for long chains of trapped ions
• Mitigation of birefringence in cavity-based quantum networks using frequency-encoded photons
• AppQSim: Application-oriented benchmarks for Hamiltonian simulation on a quantum computer
• End-to-End Protocol for High-Quality QAOA Parameters with Few Shots
• Scalable projected entangled-pair state representation of random quantum circuit states
• Simulating Quantum Circuits with Tree Tensor Networks using Density-Matrix Renormalization Group Algorithm
• Towards self-correcting quantum codes for neutral atom arrays
• Logarithmic growth of operator entanglement in a clean non-integrable circuit
• End-to-End Quantum Algorithms for the Jones Polynomial
• Preparing the Gutzwiller wave function for attractive SU(3) fermions on a quantum computer
• Resourcefulness of non-classical continuous-variable quantum gates
• Error detection without post-selection in adaptive quantum circuits
• Vertical ion transport in a surface Paul trap: escalator and elevator approaches