Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
129 tokens/sec
GPT-4o
28 tokens/sec
Gemini 2.5 Pro Pro
42 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Classically Spoofing System Linear Cross Entropy Score Benchmarking (2405.00789v1)

Published 1 May 2024 in quant-ph and cs.CC

Abstract: In recent years, several experimental groups have claimed demonstrations of ``quantum supremacy'' or computational quantum advantage. A notable first claim by Google Quantum AI revolves around a metric called the Linear Cross Entropy Benchmarking (Linear XEB), which has been used in multiple quantum supremacy experiments since. The complexity-theoretic hardness of spoofing Linear XEB has nevertheless been doubtful due to its dependence on the Cross-Entropy Quantum Threshold (XQUATH) conjecture put forth by Aaronson and Gunn, which has been disproven for sublinear depth circuits. In efforts on demonstrating quantum supremacy by quantum Hamiltonian simulation, a similar benchmarking metric called the System Linear Cross Entropy Score (sXES) holds firm in light of the aforementioned negative result due to its fundamental distinction with Linear XEB. Moreover, the hardness of spoofing sXES complexity-theoretically rests on the System Linear Cross-Entropy Quantum Threshold Assumption (sXQUATH), the formal relationship of which to XQUATH is unclear. Despite the promises that sXES offers for future demonstration of quantum supremacy, in this work we show that it is an unsound benchmarking metric. Particularly, we prove that sXQUATH does not hold for sublinear depth circuits and present a classical algorithm that spoofs sXES for experiments corrupted with noise larger than certain threshold.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (38)
  1. John Preskill. Quantum computing and the entanglement frontier. arXiv preprint arXiv:1203.5813, 2012.
  2. Quantum supremacy using a programmable superconducting processor. Nature, 574(7779):505–510, oct 2019.
  3. Computational complexity: a modern approach. Cambridge University Press, 2009.
  4. Complexity-theoretic foundations of quantum supremacy experiments, 2016.
  5. Characterizing quantum supremacy in near-term devices. Nature Physics, 14(6):595–600, apr 2018.
  6. A blueprint for demonstrating quantum supremacy with superconducting qubits. Science, 360(6385):195–199, 2018.
  7. Sample complexity of device-independently certified “quantum supremacy”. Physical review letters, 122(21):210502, 2019.
  8. Quantum certification and benchmarking. Nature Reviews Physics, 2(7):382–390, 2020.
  9. Computational advantage of quantum random sampling. Reviews of Modern Physics, 95(3):035001, 2023.
  10. Strong quantum computational advantage using a superconducting quantum processor. Physical review letters, 127(18):180501, 2021.
  11. Quantum computational advantage via 60-qubit 24-cycle random circuit sampling. Science bulletin, 67(3):240–245, 2022.
  12. Quantum computational advantage with a programmable photonic processor. Nature, 606(7912):75–81, 2022.
  13. Simulation of quantum circuits using the big-batch tensor network method. Physical Review Letters, 128(3):030501, 2022.
  14. Classical simulation of quantum supremacy circuits. arXiv preprint arXiv:2005.06787, 2020.
  15. Closing the" quantum supremacy" gap: achieving real-time simulation of a random quantum circuit using a new sunway supercomputer. In Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis, pages 1–12, 2021.
  16. Solving the sampling problem of the sycamore quantum circuits. Physical Review Letters, 129(9):090502, 2022.
  17. Classical sampling of random quantum circuits with bounded fidelity. arXiv preprint arXiv:2112.15083, 2021.
  18. Phase transition in random circuit sampling. arXiv preprint arXiv:2304.11119, 2023.
  19. Efficient classical simulation of noisy quantum computation. arXiv preprint arXiv:1810.03176, 2018.
  20. Spoofing linear cross-entropy benchmarking in shallow quantum circuits. arXiv preprint arXiv:2005.02421, 2020.
  21. Limitations of linear cross-entropy as a measure for quantum advantage. arXiv preprint arXiv:2112.01657, 2021.
  22. Spoofing cross-entropy measure in boson sampling. Physical Review Letters, 131(1):010401, 2023.
  23. A polynomial-time classical algorithm for noisy random circuit sampling. In Proceedings of the 55th Annual ACM Symposium on Theory of Computing, pages 945–957, 2023.
  24. Polynomial-time classical simulation of noisy iqp circuits with constant depth. arXiv preprint arXiv:2403.14607, 2024.
  25. On the classical hardness of spoofing linear cross-entropy benchmarking, 2020.
  26. A quantum hamiltonian simulation benchmark. npj Quantum Information, 8(1), nov 2022.
  27. Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics. In Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, pages 193–204, 2019.
  28. Mario Szegedy. Quantum speed-up of markov chain based algorithms. In 45th Annual IEEE symposium on foundations of computer science, pages 32–41. IEEE, 2004.
  29. Quantum algorithm for linear systems of equations. Physical Review Letters, 103(15), October 2009.
  30. Richard P Feynman. Simulating physics with computers. In Feynman and computation, pages 133–153. CRC Press, 2018.
  31. Seth Lloyd. Universal quantum simulators. Science, 273(5278):1073–1078, 1996.
  32. Achieving quantum supremacy with sparse and noisy commuting quantum computations. Quantum, 1:8, 2017.
  33. Random quantum circuits are approximate 2-designs. Communications in Mathematical Physics, 291:257–302, 2009.
  34. Yinzheng Gu. Moments of random matrices and weingarten functions. PhD thesis, 2013.
  35. The weingarten calculus. NOTICES OF THE AMERICAN MATHEMATICAL SOCIETY, 69(5), 2022.
  36. Chaos and complexity by design. Journal of High Energy Physics, 2017(4):1–64, 2017.
  37. Yinchen Liu. Moments of random quantum circuits and applications in random circuit sampling. Master’s thesis, University of Waterloo, 2021.
  38. A polynomial-time classical algorithm for noisy random circuit sampling, Nov 2022.
Citations (1)
View on Semantic Scholar

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now