Phase transitions in random circuit sampling.

Journal

Nature

ISSN: 1476-4687

Titre abrégé: Nature

Pays: England

ID NLM: 0410462

Informations de publication

Date de publication:
Oct 2024

Historique:

received: 09 01 2024

accepted: 28 08 2024

medline: 10 10 2024

pubmed: 10 10 2024

entrez: 9 10 2024

Statut: ppublish

Résumé

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 processors

Identifiants

DOI: 10.1038/s41586-024-07998-6 PMID: 39385051

pubmed: 39385051

doi: 10.1038/s41586-024-07998-6

pii: 10.1038/s41586-024-07998-6

doi:

Types de publication

Journal Article

Langues

eng

Sous-ensembles de citation

Pagination

328-333

Informations de copyright

Références

Preskill, J. Quantum computing in the NISQ era and beyond. Quantum 2, 79 (2018).

doi: 10.22331/q-2018-08-06-79

Boixo, S. et al. Characterizing quantum supremacy in near-term devices. Nat. Phys. 14, 595–600 (2018).

doi: 10.1038/s41567-018-0124-x

Neill, C. et al. A blueprint for demonstrating quantum supremacy with superconducting qubits. Science 360, 195–199 (2018).

doi: 10.1126/science.aao4309 pubmed: 29650670

Arute, F. et al. Quantum supremacy using a programmable superconducting processor. Nature 574, 505–510 (2019).

doi: 10.1038/s41586-019-1666-5 pubmed: 31645734

Wu, Y. et al. Strong quantum computational advantage using a superconducting quantum processor. Phys. Rev. Lett. 127, 180501 (2021).

doi: 10.1103/PhysRevLett.127.180501 pubmed: 34767433

Zhu, Q. et al. Quantum computational advantage via 60-qubit 24-cycle random circuit sampling. Sci. Bull. 67, 240–245 (2022).

doi: 10.1016/j.scib.2021.10.017

Liu, Y. et al. Verifying quantum advantage experiments with multiple amplitude tensor network contraction. Phys. Rev. Lett. 132, 030601 (2024).

Mark, D. K., Choi, J., Shaw, A. L., Endres, M. & Choi, S. Benchmarking quantum simulators using ergodic quantum dynamics. Phys. Rev. Lett. 131, 110601 (2023).

doi: 10.1103/PhysRevLett.131.110601 pubmed: 37774308

Shaw, A. L. et al. Benchmarking highly entangled states on a 60-atom analogue quantum simulator. Nature 628, 71–77 (2024).

Bluvstein, D. et al. Logical quantum processor based on reconfigurable atom arrays. Nature 626, 58–65 (2022).

Markov, I. L. & Shi, Y. Simulating quantum computation by contracting tensor networks. SIAM J. Comput. https://doi.org/10.1137/050644756 (2008).

doi: 10.1137/050644756

Boixo, S., Isakov, S. V., Smelyanskiy, V. N. & Neven, H. Simulation of low-depth quantum circuits as complex undirected graphical models. Preprint at https://arxiv.org/abs/1712.05384 (2017).

Gray, J. & Kourtis, S. Hyper-optimized tensor network contraction. Quantum 5, 410 (2021).

doi: 10.22331/q-2021-03-15-410

Huang, C. et al. Classical simulation of quantum supremacy circuits. Preprint at https://arxiv.org/abs/2005.06787 (2020).

Pan, F., Chen, K. & Zhang, P. Solving the sampling problem of the Sycamore quantum circuits. Phys. Rev. Lett. 129, 090502 (2022).

doi: 10.1103/PhysRevLett.129.090502 pubmed: 36083655

Kalachev, G., Panteleev, P., Zhou, P. & Yung, M.-H. Classical sampling of random quantum circuits with bounded fidelity. Preprint at https://arxiv.org/abs/2112.15083 (2021).

Kechedzhi, K. et al. Effective quantum volume, fidelity and computational cost of noisy quantum processing experiments. Future Gener. Comput. Syst. 153, 431–441 (2024).

doi: 10.1016/j.future.2023.12.002

Markov, I. L., Fatima, A., Isakov, S. V. & Boixo, S. Quantum supremacy is both closer and farther than it appears. Preprint at https://arxiv.org/abs/1807.10749 (2018).

Mi, X. et al. Information scrambling in quantum circuits. Science 374, 1479–1483 (2021).

doi: 10.1126/science.abg5029 pubmed: 34709938

Bertini, B., Kos, P. & Prosen, T. Operator entanglement in local quantum circuits. I. Chaotic dual-unitary circuits. SciPost Phys. 8, 067 (2020).

doi: 10.21468/SciPostPhys.8.4.067

Liu, Y., Otten, M., Bassirianjahromi, R., Jiang, L. & Fefferman, B. Benchmarking near-term quantum computers via random circuit sampling. Preprint at https://arxiv.org/abs/2105.05232 (2021).

Barak, B., Chou, C.-N. & Gao, X. Spoofing linear cross-entropy benchmarking in shallow quantum circuits. Preprint at https://arxiv.org/abs/2005.02421 (2020).

Dalzell, A. M., Hunter-Jones, N. & Brandão, F. G. S. L. Random quantum circuits anticoncentrate in log depth. PRX Quantum 3, 010333 (2022).

doi: 10.1103/PRXQuantum.3.010333

Bouland, A., Fefferman, B., Nirkhe, C. & Vazirani, U. On the complexity and verification of quantum random circuit sampling. Nat. Phys. 15, 159 (2019).

doi: 10.1038/s41567-018-0318-2

Movassagh, R. The hardness of random quantum circuits. Nat. Phys. 19, 1719 (2023).

doi: 10.1038/s41567-023-02131-2

Gao, X. et al. Limitations of linear cross-entropy as a measure for quantum advantage. PRX Quantum 5, 010334 (2024).

doi: 10.1103/PRXQuantum.5.010334

Aharonov, D., Gao, X., Landau, Z., Liu, Y. & Vazirani, U. A polynomial-time classical algorithm for noisy random circuit sampling. In Proc. 55th Annual ACM Symposium on Theory of Computing 945–957 (ACM, 2023).

Ware, B. et al. A sharp phase transition in linear cross-entropy benchmarking. Preprint at https://arxiv.org/abs/2305.04954 (2023).

Dalzell, A. M., Hunter-Jones, N. & Brandão, F. G. Random quantum circuits transform local noise into global white noise. Commun. Math. Phys. 405, 78 (2024).

doi: 10.1007/s00220-024-04958-z

de Gennes, P. & Prost, J. The Physics of Liquid Crystals (Clarendon, 1993).

Aharonov, D. Quantum to classical phase transition in noisy quantum computers. Phys. Rev. A 62, 062311 (2000).

Chen, J., Zhang, F., Huang, C., Newman, M. & Shi, Y. Classical simulation of intermediate-size quantum circuits. Preprint at https://arxiv.org/abs/1805.01450 (2018).

Villalonga, B. et al. A flexible high-performance simulator for verifying and benchmarking quantum circuits implemented on real hardware. npj Quantum Inf. 5, 86 (2019).

doi: 10.1038/s41534-019-0196-1

Zlokapa, A., Villalonga, B., Boixo, S. & Lidar, D. A. Boundaries of quantum supremacy via random circuit sampling. npj Quantum Inf. 9, 36 (2023).

doi: 10.1038/s41534-023-00703-x

White, S. R. Density-matrix algorithms for quantum renormalization groups. Phys. Rev. B 48, 10345 (1993).

doi: 10.1103/PhysRevB.48.10345

Vidal, G. Efficient classical simulation of slightly entangled quantum computations. Phys. Rev. Lett. 91, 147902 (2003).

doi: 10.1103/PhysRevLett.91.147902 pubmed: 14611555

Ayral, T. et al. Density-matrix renormalization group algorithm for simulating quantum circuits with a finite fidelity. PRX Quantum 4, 020304 (2023).

doi: 10.1103/PRXQuantum.4.020304

Aaronson, S. & Arkhipov, A. The computational complexity of linear optics. In Proc. Forty-third Annual ACM Symposium on Theory of Computing 333–342 (2011).

Zhong, H.-S. et al. Quantum computational advantage using photons. Science 370, 1460–1463 (2020).

doi: 10.1126/science.abe8770 pubmed: 33273064

Zhong, H.-S. et al. Phase-programmable Gaussian boson sampling using stimulated squeezed light. Phys. Rev. Lett. 127, 180502 (2021).

doi: 10.1103/PhysRevLett.127.180502 pubmed: 34767431

Madsen, L. S. et al. Quantum computational advantage with a programmable photonic processor. Nature 606, 75–81 (2022).

doi: 10.1038/s41586-022-04725-x pubmed: 35650354 pmcid: 9159949

Villalonga, B. et al. Efficient approximation of experimental Gaussian boson sampling. Preprint at https://arxiv.org/abs/2109.11525 (2021).

Bassirian, R., Bouland, A., Fefferman, B., Gunn, S. & Tal, A. On certified randomness from Fourier sampling or random circuit sampling. Preprint at https://arxiv.org/abs/2111.14846 (2021).

Aaronson, S. & Hung, S.-H. Certified randomness from quantum supremacy. In Proc. 55th Annual ACM Symposium on Theory of Computing 933–944 (ACM, 2023).

Morvan, A. et al. Data for ‘Phase transition in random circuit sampling’. Zenodo https://doi.org/10.5281/zenodo.8253792 (2024).