Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
167 tokens/sec
GPT-4o
7 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

A Cryptographic Perspective on the Verifiability of Quantum Advantage (2310.14464v1)

Published 23 Oct 2023 in quant-ph and cs.CR

Abstract: In recent years, achieving verifiable quantum advantage on a NISQ device has emerged as an important open problem in quantum information. The sampling-based quantum advantages are not known to have efficient verification methods. This paper investigates the verification of quantum advantage from a cryptographic perspective. We establish a strong connection between the verifiability of quantum advantage and cryptographic and complexity primitives, including efficiently samplable, statistically far but computationally indistinguishable pairs of (mixed) quantum states ($\mathsf{EFI}$), pseudorandom states ($\mathsf{PRS}$), and variants of minimum circuit size problems ($\mathsf{MCSP}$). Specifically, we prove that a) a sampling-based quantum advantage is either verifiable or can be used to build $\mathsf{EFI}$ and even $\mathsf{PRS}$ and b) polynomial-time algorithms for a variant of $\mathsf{MCSP}$ would imply efficient verification of quantum advantages. Our work shows that the quest for verifiable quantum advantages may lead to applications of quantum cryptography, and the construction of quantum primitives can provide new insights into the verifiability of quantum advantages.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (38)
  1. The computational complexity of linear optics. Theory OF Computing, 9(4):143–252, 2013.
  2. Interactive proofs for quantum computations. In Andrew Chi-Chih Yao, editor, Innovations in Computer Science - ICS 2010, pages 453–469. Tsinghua University Press, 2010.
  3. Complexity-theoretic foundations of quantum supremacy experiments. In Proceedings of the 32nd Computational Complexity Conference, CCC ’17, Dagstuhl, DEU, 2017. Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik.
  4. Non-interactive classical verification of quantum computation. In Theory of Cryptography Conference, pages 153–180. Springer, 2020.
  5. On the classical hardness of spoofing linear cross-entropy benchmarking. Theory OF Computing, 16(11):1–8, 2020.
  6. 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.
  7. IQP sampling and verifiable quantum advantage: Stabilizer scheme and classical security. arXiv preprint arXiv:2308.07152, 2023.
  8. A cryptographic test of quantumness and certifiable randomness from a single quantum device. Journal of the ACM (JACM), 68(5):1–47, 2021.
  9. On the computational hardness needed for quantum cryptography. arXiv preprint arXiv:2209.04101, 2022.
  10. On the Computational Hardness Needed for Quantum Cryptography. In 14th Innovations in Theoretical Computer Science Conference – ITCS 2023, volume 251 of Leibniz International Proceedings in Informatics (LIPIcs), pages 24:1–24:21. Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2023.
  11. Quantum pseudoentanglement. arXiv preprint arXiv:2211.00747, 2022.
  12. Universal blind quantum computation. In 50th annual IEEE symposium on foundations of computer science – FOCS 2009, pages 517–526. IEEE, 2009.
  13. Local random quantum circuits are approximate polynomial-designs. Communications in Mathematical Physics, 346:397–434, 2016.
  14. Characterizing quantum supremacy in near-term devices. Nature Physics, 14(6):595–600, 2018.
  15. Simpler proofs of quantumness. arXiv preprint arXiv:2005.04826, 2020.
  16. (pseudo) random quantum states with binary phase. In Theory of Cryptography Conference, pages 229–250. Springer, 2019.
  17. Scalable pseudorandom quantum states. In Advances in Cryptology – CRYPTO 2020, pages 417–440. Springer, 2020.
  18. On the correlation intractability of obfuscated pseudorandom functions. In Theory of Cryptography: 13th International Conference, TCC 2016-A, Tel Aviv, Israel, January 10-13, 2016, Proceedings, Part I 13, pages 389–415. Springer, 2016.
  19. Quantum meets the minimum circuit size problem. arXiv preprint arXiv:2108.03171, 2021.
  20. A quantum approximate optimization algorithm. arXiv preprint arXiv:1411.4028, 2014.
  21. A game of quantum advantage: linking verification and simulation. Quantum, 6:753, 2022.
  22. Limitations of linear cross-entropy as a measure for quantum advantage. arXiv preprint arXiv:2112.01657, 2021.
  23. Oded Goldreich. A note on computational indistinguishability. Information Processing Letters, 34(6):277–281, 1990.
  24. Computational advantage of quantum random sampling. Reviews of Modern Physics, 95(3):035001, 2023.
  25. Sample complexity of device-independently certified “quantum supremacy”. Physical review letters, 122(21):210502, 2019.
  26. Pseudorandom quantum states. In Advances in Cryptology – CRYPTO 2018, pages 126–152. Springer, 2018.
  27. Circuit minimization problem. In Proceedings of the thirty-second annual ACM symposium on Theory of computing, pages 73–79, 2000.
  28. Classically verifiable quantum advantage from a computational bell test. Nature Physics, 18(8):918–924, 2022.
  29. Quantum cryptography in algorithmica. In Proceedings of the 55th Annual ACM Symposium on Theory of Computing, pages 1589–1602, 2023.
  30. William Kretschmer. Quantum pseudorandomness and classical complexity. arXiv preprint arXiv:2103.09320, 2021.
  31. B. Laurent and P. Massart. Adaptive estimation of a quadratic functional by model selection. The Annals of Statistics, 28(5):1302 – 1338, 2000.
  32. Urmila Mahadev. Classical verification of quantum computations. SIAM J. Comput., 51(4):1172–1229, 2022. Extended abstract appeared in FOCS 2018.
  33. A variational eigenvalue solver on a photonic quantum processor. Nature communications, 5(1):4213, 2014.
  34. Simulation of quantum circuits using the big-batch tensor network method. Physical Review Letters, 128(3):030501, 2022.
  35. Natural proofs. In Proceedings of the twenty-sixth annual ACM symposium on Theory of computing, pages 204–213, 1994.
  36. Instantaneous quantum computation. arXiv preprint arXiv:0809.0847, 2008.
  37. Peter W Shor. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM review, 41(2):303–332, 1999.
  38. Daniel R Simon. On the power of quantum computation. SIAM journal on computing, 26(5):1474–1483, 1997.

Summary

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

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