Phase transition in Random Circuit Sampling
read the original 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.
This paper has not been read by Pith yet.
Forward citations
Cited by 3 Pith papers
-
Sample-efficient benchmarking of shallow all-to-all random quantum circuits
Nonlinear cross-entropy benchmark and heavy-output classifier enable sample-efficient distinction between noisy quantum and classical spoofers for shallow-depth all-to-all random circuits.
-
Gaussian boson sampling: Benchmarking quantum advantage
A new classical algorithm for Gaussian boson sampling produces outputs closer to exact results than quantum experiments up to 1152 modes and scales efficiently, indicating hardware errors enable classical simulation.
-
Robust design under uncertainty in quantum error mitigation
Presents unbiased uncertainty quantification for post-processing error mitigation and applies it to optimize hyperparameters in Zero Noise Extrapolation and Clifford Data Regression under finite-shot noise.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.