Skip to main page content
U.S. flag

An official website of the United States government

Dot gov

The .gov means it’s official.
Federal government websites often end in .gov or .mil. Before sharing sensitive information, make sure you’re on a federal government site.

Https

The site is secure.
The https:// ensures that you are connecting to the official website and that any information you provide is encrypted and transmitted securely.

Access keys NCBI Homepage MyNCBI Homepage Main Content Main Navigation
. 2024 Oct;634(8033):328-333.
doi: 10.1038/s41586-024-07998-6. Epub 2024 Oct 9.

Phase transitions in random circuit sampling

A Morvan #  1 B Villalonga #  1 X Mi #  1 S Mandrà #  1   2   3 A Bengtsson  1 P V Klimov  1 Z Chen  1 S Hong  1 C Erickson  1 I K Drozdov  1   4 J Chau  1 G Laun  1 R Movassagh  1 A Asfaw  1 L T A N Brandão  5 R Peralta  6 D Abanin  1 R Acharya  1 R Allen  1 T I Andersen  1 K Anderson  1 M Ansmann  1 F Arute  1 K Arya  1 J Atalaya  1 J C Bardin  1   7 A Bilmes  1 G Bortoli  1 A Bourassa  1 J Bovaird  1 L Brill  1 M Broughton  1 B B Buckley  1 D A Buell  1 T Burger  1 B Burkett  1 N Bushnell  1 J Campero  1 H-S Chang  1 B Chiaro  1 D Chik  1 C Chou  1 J Cogan  1 R Collins  1 P Conner  1 W Courtney  1 A L Crook  1 B Curtin  1 D M Debroy  1 A Del Toro Barba  1 S Demura  1 A Di Paolo  1 A Dunsworth  1 L Faoro  1 E Farhi  1 R Fatemi  1 V S Ferreira  1 L Flores Burgos  1 E Forati  1 A G Fowler  1 B Foxen  1 G Garcia  1 É Genois  1 W Giang  1 C Gidney  1 D Gilboa  1 M Giustina  1 R Gosula  1 A Grajales Dau  1 J A Gross  1 S Habegger  1 M C Hamilton  1   8 M Hansen  1 M P Harrigan  1 S D Harrington  1 P Heu  1 M R Hoffmann  1 T Huang  1 A Huff  1 W J Huggins  1 L B Ioffe  1 S V Isakov  1 J Iveland  1 E Jeffrey  1 Z Jiang  1 C Jones  1 P Juhas  1 D Kafri  1 T Khattar  1 M Khezri  1 M Kieferová  1   9 S Kim  1 A Kitaev  1 A R Klots  1 A N Korotkov  1   10 F Kostritsa  1 J M Kreikebaum  1 D Landhuis  1 P Laptev  1 K-M Lau  1 L Laws  1 J Lee  1   11 K W Lee  1 Y D Lensky  1 B J Lester  1 A T Lill  1 W Liu  1 W P Livingston  1 A Locharla  1 F D Malone  1 O Martin  1 S Martin  1 J R McClean  1 M McEwen  1 K C Miao  1 A Mieszala  1 S Montazeri  1 W Mruczkiewicz  1 O Naaman  1 M Neeley  1 C Neill  1 A Nersisyan  1 M Newman  1 J H Ng  1 A Nguyen  1 M Nguyen  1 M Yuezhen Niu  1 T E O'Brien  1 S Omonije  1 A Opremcak  1 A Petukhov  1 R Potter  1 L P Pryadko  12 C Quintana  1 D M Rhodes  1 C Rocque  1 E Rosenberg  1 N C Rubin  1 N Saei  1 D Sank  1 K Sankaragomathi  1 K J Satzinger  1 H F Schurkus  1 C Schuster  1 M J Shearn  1 A Shorter  1 N Shutty  1 V Shvarts  1 V Sivak  1 J Skruzny  1 W C Smith  1 R D Somma  1 G Sterling  1 D Strain  1 M Szalay  1 D Thor  1 A Torres  1 G Vidal  1 C Vollgraff Heidweiller  1 T White  1 B W K Woo  1 C Xing  1 Z J Yao  1 P Yeh  1 J Yoo  1 G Young  1 A Zalcman  1 Y Zhang  1 N Zhu  1 N Zobrist  1 E G Rieffel  2 R Biswas  2 R Babbush  1 D Bacon  1 J Hilton  1 E Lucero  1 H Neven  1 A Megrant  1 J Kelly  1 P Roushan  1 I Aleiner  1 V Smelyanskiy  1 K Kechedzhi  13 Y Chen  1 S Boixo  1
Affiliations

Phase transitions in random circuit sampling

A Morvan et al. Nature. 2024 Oct.

Abstract

Undesired coupling to the surrounding environment destroys long-range correlations in quantum processors and hinders coherent evolution in the nominally available computational space. This noise is an outstanding challenge when leveraging the computation power of near-term quantum processors1. It has been shown that benchmarking random circuit sampling with cross-entropy benchmarking can provide an estimate of the effective size of the Hilbert space coherently available2-8. Nevertheless, quantum algorithms' outputs can be trivialized by noise, making them susceptible to classical computation spoofing. Here, by implementing an algorithm for random circuit sampling, we demonstrate experimentally that two phase transitions are observable with cross-entropy benchmarking, 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 us to vary the strength of the noise versus coherent evolution. Furthermore, by presenting a random circuit sampling experiment in the weak-noise phase with 67 qubits at 32 cycles, we demonstrate that the computational cost of our experiment is beyond the capabilities of existing classical supercomputers. Our experimental and theoretical work establishes the existence of transitions to a stable, computationally complex phase that is reachable with current quantum processors.

PubMed Disclaimer

Conflict of interest statement

The authors declare no competing interests.

Figures

Fig. 1
Fig. 1. Phase transitions in RCS.
One phase transition goes between a concentrated output distribution of bit strings from RCS at a low number of cycles to a broad or anti-concentrated distribution. There is a second phase transition in a noisy system. A strong-enough error per cycle induces a phase transition from a regime where correlations extend to the full system to a regime where the system may be approximately represented by the product of several uncorrelated subsystems.
Fig. 2
Fig. 2. Phase transitions in the linear cross-entropy.
ad, At a low number of cycles, XEB grows with the size of the system. In a noiseless device, XEB will converge to 1 with the number of cycles. In the presence of noise, XEB becomes an estimator of the system fidelity. a,b, We experimentally observed a dynamical phase transition at a fixed number of cycles between these two regimes in one (a) and two dimensions (b). The random circuits have Haar random single-qubit gates and an iSWAP-like gate as an entangler. c,d, We experimentally probed a noise-induced phase transition using a weak-link model (see the main text), where the weak link is applied every 12 cycles (discrete gate set; see main text). c, The two different regimes. In the weak-noise regime, XEB converges to the fidelity, whereas in the strong-noise regime, XEB remains higher than predicted by the digital error model. d, We induced errors to scan the transition from one regime to the other.
Fig. 3
Fig. 3. Noise-induced phase transitions.
ac, Experimental noise-induced phase transitions as a function of the error per cycle for several periods T of the weak-link model (discrete gate set) (T = 8 (a), T = 12 (b) and T = 18 (c)). As T increases, the critical value of noise or error per cycle becomes lower. d, Phase diagram of the transition with analytical, numerical and experimental data. The experimental data were extracted from the crossing of the largest number of cycles scanned. e,f, Experimental transitions in two dimensions with different patterns: staggered ACBD (e) and unstaggered EGFH (f; discrete gate set). g, Numerical phase diagram of the two-dimensional phase transition. We show the critical point for different sizes and patterns. The qubits are arranged as shown in the inset of e. For fixed size, we increased the number of bridges (such as the red coupler in e) until all bridges were applied (four and six for the 4 × 4 and 4 × 6 systems, respectively), denoted as links per four cycles in g. For all the patterns, we delimited a lower bound on the critical error rate of 0.47 errors per cycle to separate the region of strong noise where XEB failed to characterize the underlying fidelity and where global correlations were subdominant. The experimental results shown in Fig. 4 (SYC-67) and in Supplementary Information section C1 (SYC-70) are represented by red stars, which are well within the weak-noise regime.
Fig. 4
Fig. 4. Demonstration of a classically intractable computation.
a, Verification of RCS fidelity with logarithmic XEB. The full device is divided into two (green) or three (blue) patches to estimate the XEB fidelity for a modest computational cost. We used the discrete gate set of single-qubit gates chosen randomly from ZpX1/2Zp with p ∈ {−1, −3/4, −1/2, …, 3/4}. For each number of cycles, 20 circuit instances were sampled with 100,000 shots each. The solid lines indicate the XEB estimated from the digital error model. b, Verification of RCS fidelity with Loschmidt echo. The inversion was done by reversing the circuit and inserting single-qubit gates. In this case, the Loschmidt echo number of cycles doubled. c, Time complexity estimated as a function of the number of qubits and the number of cycles for a set of circuits. As a working definition of time complexity, we used the number of FLOPs needed to compute the probability of a single bit string under no memory constraints. The solid line indicates the depth at which correlations spread to the full device and the FLOPs with depth go from exponential to polynomial. d, Evolution of the time complexity of the RCS experiments. The dashed line represents doubly exponential growth as a guide for the eye.

References

    1. Preskill, J. Quantum computing in the NISQ era and beyond. Quantum2, 79 (2018).
    1. Boixo, S. et al. Characterizing quantum supremacy in near-term devices. Nat. Phys.14, 595–600 (2018).
    1. Neill, C. et al. A blueprint for demonstrating quantum supremacy with superconducting qubits. Science360, 195–199 (2018). - PubMed
    1. Arute, F. et al. Quantum supremacy using a programmable superconducting processor. Nature574, 505–510 (2019). - PubMed
    1. Wu, Y. et al. Strong quantum computational advantage using a superconducting quantum processor. Phys. Rev. Lett.127, 180501 (2021). - PubMed

LinkOut - more resources