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

Noise-tolerant learnability of shallow quantum circuits from statistics and the cost of quantum pseudorandomness (2405.12085v2)

Published 20 May 2024 in quant-ph, cs.CC, cs.CR, and cs.LG

Abstract: This work studies the learnability of quantum circuits in the near term. We show the natural robustness of quantum statistical queries for learning quantum processes and provide an efficient way to benchmark global depolarizing noise from statistics, which gives us a powerful framework for developing noise-tolerant algorithms. We adapt a learning algorithm for constant-depth quantum circuits to the quantum statistical query setting with a small overhead in the query complexity. We prove average-case lower bounds for learning random quantum circuits of logarithmic and higher depths within diamond distance with statistical queries. Finally, we prove that pseudorandom unitaries (PRUs) cannot be constructed using circuits of constant depth by constructing an efficient distinguisher and proving a new variation of the quantum no-free lunch theorem.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (45)
  1. Optimal quantum tomography. IEEE Journal of Selected Topics in Quantum Electronics, 15(6):1646–1660, 2009.
  2. Query-optimal estimation of unitary channels in diamond distance. In 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS), pages 363–390. IEEE, 2023.
  3. Learning quantum circuits of some t gates. IEEE Transactions on Information Theory, 68(6):3951–3964, 2022.
  4. Learning quantum states and unitaries of bounded gate complexity. arXiv preprint arXiv:2310.19882, 2023.
  5. Learning shallow quantum circuits. arXiv preprint arXiv:2401.10095, 2024.
  6. Learning to predict arbitrary quantum processes. PRX Quantum, 4(4):040337, 2023.
  7. Quantum advantage with shallow circuits. Science, 362(6412):308–311, 2018.
  8. Quantum advantage with noisy shallow circuits. Nature Physics, 16(10):1040–1045, 2020.
  9. Quantum certification and benchmarking. Nature Reviews Physics, 2(7):382–390, 2020.
  10. Efficient learning of quantum noise. Nature Physics, 16(12):1184–1188, 2020.
  11. Quantum error mitigation. Reviews of Modern Physics, 95(4):045005, 2023.
  12. Michael Kearns. Efficient noise-tolerant learning from statistical queries. Journal of the ACM (JACM), 45(6):983–1006, 1998.
  13. Quantum hardness of learning shallow classical circuits. SIAM Journal on Computing, 50(3):972–1013, 2021.
  14. On the role of entanglement and statistics in learning. Advances in Neural Information Processing Systems, 36, 2024.
  15. On the average-case complexity of learning output distributions of quantum circuits. arXiv preprint arXiv:2305.05765, 2023.
  16. Alexander Nietner. Unifying (quantum) statistical and parametrized (quantum) algorithms. arXiv preprint arXiv:2310.17716, 2023.
  17. Armando Angrisani. Learning unitaries with quantum statistical queries. arXiv preprint arXiv:2310.02254, 2023.
  18. Learning quantum processes with quantum statistical queries. arXiv preprint arXiv:2310.02075, 2023.
  19. Krzysztof Pietrzak. Cryptography from learning parity with noise. In International Conference on Current Trends in Theory and Practice of Computer Science, pages 99–114. Springer, 2012.
  20. Mohammed M Alani. Applications of machine learning in cryptography: a survey. In Proceedings of the 3rd International Conference on cryptography, security and privacy, pages 23–27, 2019.
  21. Shadows of quantum machine learning. arXiv preprint arXiv:2306.00061, 2023.
  22. Pseudorandom quantum states. In Advances in Cryptology–CRYPTO 2018: 38th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 19–23, 2018, Proceedings, Part III 38, pages 126–152. Springer, 2018.
  23. Cryptography from pseudorandom quantum states. In Annual International Cryptology Conference, pages 208–236. Springer, 2022.
  24. William Kretschmer. Quantum pseudorandomness and classical complexity. arXiv preprint arXiv:2103.09320, 2021.
  25. Quantum cryptography in algorithmica. In Proceedings of the 55th Annual ACM Symposium on Theory of Computing, pages 1589–1602, 2023.
  26. Simple constructions of linear-depth t-designs and pseudorandom unitaries. arXiv preprint arXiv:2404.12647, 2024.
  27. Efficient unitary designs and pseudorandom unitaries from permutations. arXiv preprint arXiv:2404.16751, 2024.
  28. Pseudorandom unitaries are neither real nor sparse nor noise-robust. arXiv preprint arXiv:2306.11677, 2023.
  29. Low-stabilizer-complexity quantum states are not pseudorandom. arXiv preprint arXiv:2209.14530, 2022.
  30. On the hardness of pac-learning stabilizer states with noise. Quantum, 6:640, 2022.
  31. Improved quantum data analysis. In Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing, pages 1398–1411, 2021.
  32. No free lunch for quantum machine learning. arXiv preprint arXiv:2003.14103, 2020.
  33. Nicholas Hunter-Jones. Unitary designs from statistical mechanics in random quantum circuits. arXiv preprint arXiv:1905.12053, 2019.
  34. Spoofing linear cross-entropy benchmarking in shallow quantum circuits. arXiv preprint arXiv:2005.02421, 2020.
  35. Exponential quantum advantages in learning quantum observables from classical data. arXiv preprint arXiv:2405.02027, 2024.
  36. Quantum computation and quantum information. Cambridge university press, 2010.
  37. Antonio Anna Mele. Introduction to haar measure tools in quantum information: A beginner’s tutorial. Quantum, 8:1340, 2024.
  38. Characterizing quantum supremacy in near-term devices. Nature Physics, 14(6):595–600, 2018.
  39. Random quantum circuits transform local noise into global white noise. Communications in Mathematical Physics, 405(3):78, 2024.
  40. Classical shadows with noise. Quantum, 6:776, 2022.
  41. Robust shadow estimation. PRX Quantum, 2(3):030348, 2021.
  42. Scott Aaronson. Shadow tomography of quantum states. In Proceedings of the 50th annual ACM SIGACT symposium on theory of computing, pages 325–338, 2018.
  43. Online learning of quantum states. Advances in neural information processing systems, 31, 2018.
  44. Reformulation of the no-free-lunch theorem for entangled datasets. Physical Review Letters, 128(7):070501, 2022.
  45. Quantum physical unclonable functions: Possibilities and impossibilities. Quantum, 5:475, 2021.
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
X Twitter Logo Streamline Icon: https://streamlinehq.com

Tweets