Phase transition in Random Circuit Sampling (2304.11119v2)
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.
- J. Preskill, Quantum Computing in the NISQ era and beyond, Quantum 2, 79 (2018).
- I. L. Markov and Y. Shi, Simulating quantum computation by contracting tensor networks, SIAM Journal on Computing 38, 963 (2008).
- J. Gray and S. Kourtis, Hyper-optimized tensor network contraction, Quantum 5, 410 (2021).
- F. Pan, K. Chen, and P. Zhang, Solving the sampling problem of the sycamore quantum circuits, Physical Review Letters 129, 090502 (2022).
- A. M. Dalzell, N. Hunter-Jones, and F. G. S. L. Brandão, Random quantum circuits anticoncentrate in log depth, PRX Quantum 3, 010333 (2022).
- R. Movassagh, Quantum supremacy and random circuits, arXiv:1909.06210 (2019).
- A. Zlokapa, S. Boixo, and D. Lidar, Boundaries of quantum supremacy via random circuit sampling, arXiv:2005.02464 (2020).
- See Ref.[44] for a related numerical study in the case of all-to-all connectivity.
- The data shown is mostly for large values of the period since the phase transition point moves to larger noise for small periods. Hence, in order to measure the phase transition experimentally we needed to go to a larger error rate and therefore smaller XEB values. This would require very high precision and hence too many samples.
- P. de Gennes and J. Prost, The Physics of Liquid Crystals, International Series of Monographs on Physics (Clarendon Press, 1993).
- Note that the transition discussed here is qualitatively different from the quantum to classical transition discussed in Ref. [45]. The transition discussed here is a competition between the finite rate of convergence to the overall ergodic state and the fidelity per cycle. The transition in Ref. [45] is a competition between local interactions and the error rate per qubit.
- An intrinsic Pauli error rate of 3.5×10−33.5superscript1033.5\times 10^{-3}3.5 × 10 start_POSTSUPERSCRIPT - 3 end_POSTSUPERSCRIPT corresponds to an average fidelity of 99.72%percent99.7299.72\%99.72 %.
- S. R. White, Density-matrix algorithms for quantum renormalization groups, Physical Review B 48, 10345 (1993).
- G. Vidal, Efficient classical simulation of slightly entangled quantum computations, Physical Review Letters 91, 147902 (2003).
- S. Aaronson and A. Arkhipov, The computational complexity of linear optics, in Proceedings of the forty-third annual ACM symposium on Theory of computing (2011) pp. 333–342.
- S. Aaronson, Certified randomness from quantum supremacy, Talk at CRYPTO 2018 (2018).
- S. Aaronson and S.-H. Hung, Certified randomness from quantum supremacy, arXiv:2303.01625 (2023).
- D. Aharonov, Quantum to classical phase transition in noisy quantum computers, Physical Review A 62, 10.1103/physreva.62.062311 (2000).
Collections
Sign up for free to add this paper to one or more collections.