Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash 99 tok/s
Gemini 2.5 Pro 48 tok/s Pro
GPT-5 Medium 36 tok/s
GPT-5 High 40 tok/s Pro
GPT-4o 99 tok/s
GPT OSS 120B 461 tok/s Pro
Kimi K2 191 tok/s Pro
2000 character limit reached

Phase transition in Random Circuit Sampling (2304.11119v2)

Published 21 Apr 2023 in quant-ph

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.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (18)
  1. J. Preskill, Quantum Computing in the NISQ era and beyond, Quantum 2, 79 (2018).
  2. I. L. Markov and Y. Shi, Simulating quantum computation by contracting tensor networks, SIAM Journal on Computing 38, 963 (2008).
  3. J. Gray and S. Kourtis, Hyper-optimized tensor network contraction, Quantum 5, 410 (2021).
  4. F. Pan, K. Chen, and P. Zhang, Solving the sampling problem of the sycamore quantum circuits, Physical Review Letters 129, 090502 (2022).
  5. 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).
  6. R. Movassagh, Quantum supremacy and random circuits, arXiv:1909.06210  (2019).
  7. A. Zlokapa, S. Boixo, and D. Lidar, Boundaries of quantum supremacy via random circuit sampling, arXiv:2005.02464  (2020).
  8. See Ref.[44] for a related numerical study in the case of all-to-all connectivity.
  9. 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.
  10. P. de Gennes and J. Prost, The Physics of Liquid Crystals, International Series of Monographs on Physics (Clarendon Press, 1993).
  11. 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.
  12. 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 %.
  13. S. R. White, Density-matrix algorithms for quantum renormalization groups, Physical Review B 48, 10345 (1993).
  14. G. Vidal, Efficient classical simulation of slightly entangled quantum computations, Physical Review Letters 91, 147902 (2003).
  15. 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.
  16. S. Aaronson, Certified randomness from quantum supremacy, Talk at CRYPTO 2018  (2018).
  17. S. Aaronson and S.-H. Hung, Certified randomness from quantum supremacy, arXiv:2303.01625  (2023).
  18. D. Aharonov, Quantum to classical phase transition in noisy quantum computers, Physical Review A 62, 10.1103/physreva.62.062311 (2000).
Citations (66)
List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Summary

  • The paper demonstrates a dynamical phase transition where increased circuit cycles shift the output from concentrated to anti-concentrated states.
  • The paper identifies a noise-induced phase transition driven by error per cycle that distinguishes between globally entangled quantum states and classically spoofer regimes.
  • The study’s 67-qubit, 32-cycle experiment underscores quantum supremacy and provides benchmarks for enhancing noise mitigation and processor calibration.

Phase Transitions in Random Circuit Sampling

In the pursuit of fully realizing the computational capabilities of near-term quantum processors, the intersection of quantum dynamics and noise forms a critical research frontier. This paper presents a thorough investigation into the phase transitions within Random Circuit Sampling (RCS) as a method to benchmark the coherent computational space available on quantum processors. The discussion emphasizes two key phase transitions observable via Cross-Entropy Benchmarking (XEB): a dynamical transition dependent on circuit cycles and a quantum phase transition influenced by noise or error per cycle.

Summary of Findings

  1. Dynamical Transition: This phase transition emerges as a function of the number of circuit cycles. Initially, as cycles increase, there exists a crossing point where the system transitions from a concentrated output distribution to an anti-concentrated one. This transition is essential for ensuring that the output distribution has adequately delocalized from the computational basis, which is pivotal for XEB to accurately estimate quantum state fidelity. The experimental data support this transition, showing that beyond a certain number of cycles, XEB measurements stabilize, aligning with theoretical fidelity predictions.
  2. Noise-Induced Phase Transition: Noise represents a formidable challenge in exploiting the computational power of quantum devices. The paper identifies a second phase transition driven by noise, specifically by the error rate per cycle. A critical finding is the delineation of two regimes: one in which the system's quantum correlations are globally entangled (and computationally intricate), and another where correlations remain localized (hence might be spoofed by classical algorithms). The threshold of error per cycle marking this transition dictates whether a quantum processor can harness the full expanse of its Hilbert space. Experiments and constructs like the weak-link model elucidate the physics underlying this noise-induced phase transition.

Furthermore, the researchers conducted a 67-qubit RCS experiment at 32 cycles, dramatically surpassing the limits faced by existing classical supercomputing capabilities. This not only strengthens the argument for quantum supremacy but also highlights the computational complexity intrinsic to high-dimensional quantum states.

Implications and Future Directions

The results pave the way for more nuanced understanding and improved calibration of quantum processors. They highlight the delicate balance between circuit depth and noise that must be managed to leverage quantum supremacy effectively. These phase transitions serve as a benchmark for setting experimental protocols ensuring the robustness of quantum computations, even amidst unavoidable noise. In practice, these insights can be crucial for enhancing noise mitigation strategies and refining quantum algorithms.

While Random Circuit Sampling currently serves as a primary exhibiting quantum supremacy, the implications of these findings stretch beyond theoretical benchmarking. They encourage exploration into practical applications such as certified randomness generation and further motivations for investigating quantum error correction mechanisms. Additionally, having established the critical noise levels permissible for leveraging computational quantum phases, the paper posits a hopeful landscape for future developments in quantum computing architectures.

The theoretical and experimental advances detailed in this paper contribute significantly to quantum information science, providing a more structured framework for understanding how quantum coherence and noise dynamically interact in complex quantum systems.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-up Questions

We haven't generated follow-up questions for this paper yet.

Youtube Logo Streamline Icon: https://streamlinehq.com

Don't miss out on important new AI/ML research

See which papers are being discussed right now on X, Reddit, and more:

“Emergent Mind helps me see which AI papers have caught fire online.”

Philip

Philip

Creator, AI Explained on YouTube