Phase transition in Random Circuit Sampling

Abstract

Undesired coupling to the surrounding environment destroys long-range correlations on quantum processors and hinders the coherent evolution in the nominally available computational space. This incoherent noise is an outstanding challenge to fully leverage the computation power of near-term quantum processors. It has been shown that benchmarking Random Circuit Sampling (RCS) with Cross-Entropy Benchmarking (XEB) can provide a reliable estimate of the effective size of the Hilbert space coherently available. The extent to which the presence of noise can trivialize the outputs of a given quantum algorithm, i.e. making it spoofable by a classical computation, is an unanswered question. Here, by implementing an RCS algorithm we demonstrate experimentally that there are two phase transitions observable with XEB, which we explain theoretically with a statistical model. The first is a dynamical transition as a function of the number of cycles and is the continuation of the anti-concentration point in the noiseless case. The second is a quantum phase transition controlled by the error per cycle; to identify it analytically and experimentally, we create a weak link model which allows varying the strength of noise versus coherent evolution. Furthermore, by presenting an RCS experiment with 67 qubits at 32 cycles, we demonstrate that the computational cost of our experiment is beyond the capabilities of existing classical supercomputers, even when accounting for the inevitable presence of noise. Our experimental and theoretical work establishes the existence of transitions to a stable computationally complex phase that is reachable with current quantum processors.

References in corpus (28)

• Quantum Computing in the NISQ era and beyond
• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• Efficient classical simulation of slightly entangled quantum computations
• Quantum computational advantage using photons
• Characterizing Quantum Supremacy in Near-Term Devices
• Strong quantum computational advantage using a superconducting quantum processor
• Logical quantum processor based on reconfigurable atom arrays
• Simulating quantum computation by contracting tensor networks
• A blueprint for demonstrating quantum supremacy with superconducting qubits
• Phase-Programmable Gaussian Boson Sampling Using Stimulated Squeezed Light
• Information Scrambling in Computationally Complex Quantum Circuits
• Quantum Supremacy and the Complexity of Random Circuit Sampling
• Hyper-optimized tensor network contraction
• A flexible high-performance simulator for verifying and benchmarking quantum circuits implemented on real hardware
• Solving the sampling problem of the Sycamore quantum circuits
• Operator Entanglement in Local Quantum Circuits I: Chaotic Dual-Unitary Circuits
• Classical Simulation of Quantum Supremacy Circuits
• A polynomial-time classical algorithm for noisy random circuit sampling
• A density-matrix renormalization group algorithm for simulating quantum circuits with a finite fidelity
• Benchmarking highly entangled states on a 60-atom analog quantum simulator
• Boundaries of quantum supremacy via random circuit sampling
• Effective quantum volume, fidelity and computational cost of noisy quantum processing experiments
• Limitations of Linear Cross-Entropy as a Measure for Quantum Advantage
• Benchmarking Quantum Simulators using Ergodic Quantum Dynamics
• Quantum Computational Advantage via 60-Qubit 24-Cycle Random Circuit Sampling
• Validating quantum-supremacy experiments with exact and fast tensor network contraction
• A sharp phase transition in linear cross-entropy benchmarking
• Efficient approximation of experimental Gaussian boson sampling

Cited by in corpus (50)

• Beyond-classical computation in quantum simulation
• Beyond NISQ: The Megaquop Machine
• Certified randomness using a trapped-ion quantum processor
• Realizing the Nishimori transition across the error threshold for constant-depth quantum circuits
• Visualizing Dynamics of Charges and Strings in (2+1)D Lattice Gauge Theories
• Benchmarking Quantum Computer Simulation Software Packages: State Vector Simulators
• Tensor networks for quantum computing
• The Quantum House Of Cards
• Efficient Quantum Circuit Compilation for Near-Term Quantum Advantage
• Symmetric Clifford twirling for cost-optimal quantum error mitigation in early FTQC regime
• Quantum computer error structure probed by quantum error correction syndrome measurements
• Verifiable measurement-based quantum random sampling with trapped ions
• Demonstration of Algorithmic Quantum Speedup for an Abelian Hidden Subgroup Problem
• Dynamics of disordered quantum systems with two- and three-dimensional tensor networks
• Fault-tolerant compiling of classically hard IQP circuits on hypercubes
• Time-optimal transfer of the quantum state in long qubit arrays
• An engineering guide to superconducting quantum circuit shielding
• Realizing a Continuous Set of Two-Qubit Gates Parameterized by an Idle Time
• Population Dynamics of Schrödinger Cats
• Generating Hard Ising Instances With Planted Solutions Using Post-Quantum Cryptographic Protocols
• Solving lattice gauge theories using the quantum Krylov algorithm and qubitization
• In situ Qubit Frequency Tuning Circuit for Scalable Superconducting Quantum Computing: Scheme and Experiment
• Calibrating quantum gates up to 52 qubits in a superconducting processor
• Non-Haar random circuits form unitary designs as fast as Haar random circuits
• Applications of Certified Randomness
• Achieving the volume-law entropy regime with random-sign Dicke states
• Dynamic quantum circuit compilation
• Scalable projected entangled-pair state representation of random quantum circuit states
• Secret extraction attacks against obfuscated IQP circuits
• Robust preparation of ground state phases under noisy imaginary time evolution
• Counterdiabatic ADAPT-VQE for molecular simulation
• Attention to Quantum Complexity
• Error Crafting in Mixed Quantum Gate Synthesis
• Analysis of heralded higher-fidelity two-qubit entangling gates with self-correction
• Classical simulation of circuits with realistic odd-dimensional Gottesman-Kitaev-Preskill states
• Anticoncentration in Clifford Circuits and Beyond: From Random Tensor Networks to Pseudo-Magic States
• A Heuristic for Matrix Product State Simulation of Out-of-Equilibrium Dynamics of Two-Dimensional Quantum Spin Systems
• Noisy Monitored Quantum Circuits
• Who can compete with quantum computers? Lecture notes on quantum inspired tensor networks computational techniques
• Geometrically Taming Dynamical Entanglement Growth in Purified Quantum States
• Toward quantum scaling advantage in approximate optimization
• On the Fundamental Resource for Exponential Advantage in Quantum Channel Learning
• Reduced Sampling Overhead for Probabilistic Error Cancellation by Pauli Error Propagation
• More global randomness from less-random local gates
• Classical algorithms for measurement-adaptive Gaussian circuits
• Recent quantum runtime (dis)advantages
• Symmetry-Accelerated Classical Simulation of Clifford-Dominated Circuits
• Quantum coherence and counterdiabatic quantum computing
• Fock space prethermalization and time-crystalline order on a quantum processor
• Approximate Quantum Error Correction with 1D Log-Depth Circuits