Learning Low-Degree Quantum Objects

Authors Srinivasan Arunachalam , Arkopal Dutt , Francisco Escudero Gutiérrez , Carlos Palazuelos



PDF
Thumbnail PDF

File

LIPIcs.ICALP.2024.13.pdf
  • Filesize: 0.84 MB
  • 19 pages

Document Identifiers

Author Details

Srinivasan Arunachalam
  • IBM Quantum, Thomas J Watson Research Center, Yorktown Heights, NY, USA
Arkopal Dutt
  • IBM Quantum, IBM Research Cambridge, MA, USA
Francisco Escudero Gutiérrez
  • CWI & QuSoft, Amsterdam, The Netherlands
Carlos Palazuelos
  • Dpto. Análisis Matemático y Matemática Aplicada, Fac. Ciencias Matemáticas, Universidad Complutense de Madrid, Spain
  • Instituto de Ciencias Matemáticas, Madrid, Spain

Acknowledgements

We thank the referees of ICALP`24 and TQC`24 for useful comments. We thank Jop Briët and Antonio Pérez Hernández for useful discussions. We thank Alexandros Eskenazis, Paata Ivanisvili, Alexander Volberg and Haonan Zhang for useful comments. A.D. and S.A. thank the Institute for Pure and Applied Mathematics (IPAM) for its hospitality throughout the long program "Mathematical and Computational Challenges in Quantum Computing" in Fall 2023 during which part of this work was initiated.

Cite AsGet BibTex

Srinivasan Arunachalam, Arkopal Dutt, Francisco Escudero Gutiérrez, and Carlos Palazuelos. Learning Low-Degree Quantum Objects. In 51st International Colloquium on Automata, Languages, and Programming (ICALP 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 297, pp. 13:1-13:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
https://doi.org/10.4230/LIPIcs.ICALP.2024.13

Abstract

We consider the problem of learning low-degree quantum objects up to ε-error in 𝓁₂-distance. We show the following results: (i) unknown n-qubit degree-d (in the Pauli basis) quantum channels and unitaries can be learned using O(1/ε^d) queries (which is independent of n), (ii) polynomials p:{-1,1}ⁿ → [-1,1] arising from d-query quantum algorithms can be learned from O((1/ε)^d ⋅ log n) many random examples (x,p(x)) (which implies learnability even for d = O(log n)), and (iii) degree-d polynomials p:{-1,1}ⁿ → [-1,1] can be learned through O(1/ε^d) queries to a quantum unitary U_p that block-encodes p. Our main technical contributions are new Bohnenblust-Hille inequalities for quantum channels and completely bounded polynomials.

Subject Classification

ACM Subject Classification
  • Theory of computation → Quantum complexity theory
Keywords
  • Tomography

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads

References

  1. Scott Aaronson and Andris Ambainis. Forrelation: A problem that optimally separates quantum from classical computing. In Proceedings of the Forty-Seventh Annual ACM Symposium on Theory of Computing, STOC '15, pages 307-316, New York, NY, USA, 2015. Association for Computing Machinery. URL: https://doi.org/10.1145/2746539.2746547.
  2. Srinivasan Arunachalam, Sergey Bravyi, Arkopal Dutt, and Theodore J. Yoder. Optimal Algorithms for Learning Quantum Phase States. In 18th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2023), volume 266 of Leibniz International Proceedings in Informatics (LIPIcs), pages 3:1-3:24, 2023. Google Scholar
  3. Srinivasan Arunachalam, Jop Briët, and Carlos Palazuelos. Quantum query algorithms are completely bounded forms. SIAM J. Comput, 48(3):903-925, 2019. Preliminary version in ITCS'18. Google Scholar
  4. Srinivasan Arunachalam, Sourav Chakraborty, Michal Kouckỳ, Nitin Saurabh, and Ronald De Wolf. Improved bounds on Fourier entropy and min-entropy. ACM Transactions on Computation Theory (TOCT), 13(4):1-40, 2021. Google Scholar
  5. Srinivasan Arunachalam, Sourav Chakraborty, Troy Lee, Manaswi Paraashar, and Ronald De Wolf. Two new results about quantum exact learning. Quantum, 5:587, 2021. Google Scholar
  6. Srinivasan Arunachalam, Arkopal Dutt, Francisco Escudero Gutierrez, and Carlos Palazuelos. Learling low-degree quantum objects. arXiv preprint, 2024. Google Scholar
  7. Alp Atıcı and Rocco A Servedio. Quantum algorithms for learning and testing juntas. Quantum Information Processing, 6(5):323-348, 2007. Google Scholar
  8. Nikhil Bansal and Makrand Sinha. k-forrelation optimally separates quantum and classical query complexity. In Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing, STOC 2021, pages 1303-1316, New York, NY, USA, 2021. Association for Computing Machinery. URL: https://doi.org/10.1145/3406325.3451040.
  9. Nikhil Bansal, Makrand Sinha, and Ronald de Wolf. Influence in Completely Bounded Block-Multilinear Forms and Classical Simulation of Quantum Algorithms. In 37th Computational Complexity Conference (CCC 2022), volume 234, pages 28:1-28:21, 2022. URL: https://doi.org/10.4230/LIPIcs.CCC.2022.28.
  10. Zongbo Bao and Penghui Yao. On Testing and Learning Quantum Junta Channels. In Gergely Neu and Lorenzo Rosasco, editors, Proceedings of Thirty Sixth Conference on Learning Theory, volume 195 of Proceedings of Machine Learning Research, pages 1064-1094. PMLR, 12-15 July 2023. URL: https://proceedings.mlr.press/v195/bao23b.html.
  11. Frédéric Bayart, Daniel Pellegrino, and Juan B Seoane-Sepúlveda. The Bohr radius of the n-dimensional polydisk is equivalent to (log n)/n. Advances in Mathematics, 264:726-746, 2014. Google Scholar
  12. Robert Beals, Harry Buhrman, Richard Cleve, Michele Mosca, and Ronald de Wolf. Quantum lower bounds by polynomials. J. ACM, 48(4):778-797, 2001. Google Scholar
  13. Henri Frédéric Bohnenblust and Einar Hille. On the absolute convergence of Dirichlet series. Annals of Mathematics, pages 600-622, 1931. Google Scholar
  14. Harald Bohr. Ueber die Bedeutung der Potenzreihen unendlich vieler Variablen in der Theorie der Dirichletschen Reihen. Nachrichten von der Gesellschaft der Wissenschaften zu Göttingen, Mathematisch-Physikalische Klasse, 1913:441-488, 1913. Google Scholar
  15. Nader H. Bshouty and Jeffrey C. Jackson. Learning DNF over the uniform distribution using a quantum example oracle. In Proceedings of the Eighth Annual Conference on Computational Learning Theory, COLT '95, pages 118-127, New York, NY, USA, 1995. Association for Computing Machinery. URL: https://doi.org/10.1145/225298.225312.
  16. Mark Bun and Justin Thaler. Guest column: Approximate degree in classical and quantum computing. ACM SIGACT News, 51(4):48-72, 2021. Google Scholar
  17. Clément L Canonne. A short note on learning discrete distributions. arXiv preprint, 2020. URL: https://arxiv.org/abs/2002.11457.
  18. Shantanav Chakraborty, András Gilyén, and Stacey Jeffery. The Power of Block-Encoded Matrix Powers: Improved Regression Techniques via Faster Hamiltonian Simulation. In Christel Baier, Ioannis Chatzigiannakis, Paola Flocchini, and Stefano Leonardi, editors, 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019), volume 132 of Leibniz International Proceedings in Informatics (LIPIcs), pages 33:1-33:14, Dagstuhl, Germany, 2019. Schloss Dagstuhl - Leibniz-Zentrum für Informatik. URL: https://doi.org/10.4230/LIPIcs.ICALP.2019.33.
  19. Chi-Fang Chen, Andrew Lucas, and Chao Yin. Speed limits and locality in many-body quantum dynamics. Reports on Progress in Physics, 2023. Google Scholar
  20. Thomas Chen, Shivam Nadimpalli, and Henry Yuen. Testing and Learning Quantum Juntas Nearly Optimally. In Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 1163-1185. SIAM, 2023. Google Scholar
  21. Kai-Min Chung and Han-Hsuan Lin. Sample efficient algorithms for learning quantum channels in pac model and the approximate state discrimination problem. arXiv preprint, 2018. URL: https://arxiv.org/abs/1810.10938.
  22. Andreas Defant, Leonhard Frerick, Joaquim Ortega-Cerdà, Myriam Ounaïes, and Kristian Seip. The Bohnenblust-Hille inequality for homogeneous polynomials is hypercontractive. Annals of mathematics, pages 485-497, 2011. Google Scholar
  23. Andreas Defant, Mieczysław Mastyło, and Antonio Pérez. On the Fourier spectrum of functions on boolean cubes. Mathematische Annalen, 374:653-680, 2019. Google Scholar
  24. Diogo Diniz, Gustavo Muñoz-Fernández, Daniel Pellegrino, and J Seoane-Sepúlveda. Lower bounds for the constants in the Bohnenblust-Hille inequality: The case of real scalars. Proceedings of the American Mathematical Society, 142(2):575-580, 2014. Google Scholar
  25. Francisco Escudero Gutiérrez. Influences of Fourier completely bounded polynomials and classical simulation of quantum algorithms. arXiv:2304.06713, 2023. Google Scholar
  26. Alexandros Eskenazis and Paata Ivanisvili. Learning low-degree functions from a logarithmic number of random queries. In Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2022, pages 203-207, New York, NY, USA, 2022. Association for Computing Machinery. URL: https://doi.org/10.1145/3519935.3519981.
  27. Alexandros Eskenazis, Paata Ivanisvili, and Lauritz Streck. Low-degree learning and the metric entropy of polynomials. arXiv preprint, 2022. URL: https://arxiv.org/abs/2203.09659.
  28. Omar Fawzi, Aadil Oufkir, and Daniel Stilck França. Lower bounds on learning Pauli channels. arXiv preprint, 2023. URL: https://arxiv.org/abs/2301.09192.
  29. Steven T Flammia and Ryan O'Donnell. Pauli error estimation via population recovery. Quantum, 5:549, 2021. Google Scholar
  30. Alexandre Grothendieck. Résumé de la théorie métrique des produits tensoriels topologiques. Soc. de Matemática de São Paulo, 1953. Google Scholar
  31. Gus Gutoski and Nathaniel Johnston. Process tomography for unitary quantum channels. Journal of Mathematical Physics, 55(3), 2014. Google Scholar
  32. Jeongwan Haah, Aram W Harrow, Zhengfeng Ji, Xiaodi Wu, and Nengkun Yu. Sample-optimal tomography of quantum states. IEEE Transactions on Information Theory, 63(9):5628-5641, 2017. Google Scholar
  33. Hsin-Yuan Huang, Sitan Chen, and John Preskill. Learning to predict arbitrary quantum processes. PRX Quantum, 4:040337, December 2023. URL: https://doi.org/10.1103/PRXQuantum.4.040337.
  34. Hsin-Yuan Huang, Richard Kueng, and John Preskill. Predicting many properties of a quantum system from very few measurements. Nature Physics, 16(10):1050-1057, 2020. Google Scholar
  35. Siddharth Iyer, Anup Rao, Victor Reis, Thomas Rothvoss, and Amir Yehudayoff. Tight bounds on the Fourier growth of bounded functions on the hypercube. arXiv preprint, 2021. URL: https://arxiv.org/abs/2107.06309.
  36. Ohad Klein, Joseph Slote, Alexander Volberg, and Haonan Zhang. Quantum and Classical Low-Degree Learning via a Dimension-Free Remez Inequality. In 15th Innovations in Theoretical Computer Science Conference (ITCS 2024), volume 287 of Leibniz International Proceedings in Informatics (LIPIcs), pages 69:1-69:22, 2024. Google Scholar
  37. Hirotada Kobayashi, Keiji Matsumoto, and Tomoyuki Yamakami. Quantum merlin-arthur proof systems: Are multiple merlins more helpful to arthur? In Algorithms and Computation: 14th International Symposium, ISAAC 2003, pages 189-198. Springer, 2003. Google Scholar
  38. Ching-Yi Lai and Hao-Chung Cheng. Learning quantum circuits of T-depth one. In 2022 IEEE International Symposium on Information Theory (ISIT), pages 2213-2218, 2022. URL: https://doi.org/10.1109/ISIT50566.2022.9834452.
  39. Nathan Linial, Yishay Mansour, and Noam Nisan. Constant depth circuits, Fourier transform, and learnability. Journal of the ACM (JACM), 40(3):607-620, 1993. Google Scholar
  40. John E Littlewood. On bounded bilinear forms in an infinite number of variables. The Quarterly Journal of Mathematics, pages 164-174, 1930. Google Scholar
  41. Richard A. Low. Learning and testing algorithms for the clifford group. Phys. Rev. A, 80:052314, November 2009. Google Scholar
  42. Ashley Montanaro. Some applications of hypercontractive inequalities in quantum information theory. Journal of Mathematical Physics, 53(12), 2012. Google Scholar
  43. Ashley Montanaro and Tobias J Osborne. Quantum Boolean functions. arXiv preprint, 2008. URL: https://arxiv.org/abs/0810.2435.
  44. Shivam Nadimpalli, Natalie Parham, Francisca Vasconcelos, and Henry Yuen. On the Pauli spectrum of QAC0. arXiv preprint, 2023. URL: https://arxiv.org/abs/2311.09631.
  45. Michael A. Nielsen and Isaac L. Chuang. Quantum Computation and Quantum Information: 10th Anniversary Edition. Cambridge University Press, Cambridge, UK, 2010. URL: https://doi.org/10.1017/CBO9780511976667.
  46. Ryan O'Donnell. Analysis of Boolean Functions. Cambridge University Press, 2014. Google Scholar
  47. Ryan O'Donnell and John Wright. Efficient quantum tomography. In Proceedings of the Forty-Eighth Annual ACM Symposium on Theory of Computing, STOC '16, pages 899-912, New York, NY, USA, 2016. Association for Computing Machinery. URL: https://doi.org/10.1145/2897518.2897544.
  48. Daniel Pellegrino and Eduardo V Teixeira. Towards sharp Bohnenblust-Hille constants. Communications in Contemporary Mathematics, 20(03):1750029, 2018. Google Scholar
  49. David Pérez-García, Michael M Wolf, Carlos Palazuelos, Ignacio Villanueva, and Marius Junge. Unbounded violation of tripartite Bell inequalities. Communications in Mathematical Physics, 279:455-486, 2008. Google Scholar
  50. Joseph Slote, Alexander Volberg, and Haonan Zhang. Bohnenblust-Hille inequality for cyclic groups. arXiv preprint, 2023. URL: https://arxiv.org/abs/2305.10560.
  51. Joseph Slote, Alexander Volberg, and Haonan Zhang. Noncommutative bohnenblust-hille inequality in the heisenberg-weyl and gell-mann bases with applications to fast learning. arXiv preprint, 2023. URL: https://arxiv.org/abs/2301.01438.
  52. Barbara M. Terhal. Quantum error correction for quantum memories. Rev. Mod. Phys., 87:307-346, April 2015. Google Scholar
  53. Minh C Tran, Kunal Sharma, and Kristan Temme. Locality and error mitigation of quantum circuits. arXiv preprint, 2023. URL: https://arxiv.org/abs/2303.06496.
  54. Leslie G. Valiant. A Theory of the Learnable. Communications of the ACM, 27(11):1134-1142, 1984. Google Scholar
  55. Ewout Van Den Berg, Zlatko K Minev, Abhinav Kandala, and Kristan Temme. Probabilistic error cancellation with sparse Pauli-Lindblad models on noisy quantum processors. Nature Physics, pages 1-6, 2023. Google Scholar
  56. N. Th. Varopoulos. On an inequality of von Neumann and an application of the metric theory of tensor products to operators theory. J. Functional Analysis, 16:83-100, 1974. URL: https://doi.org/10.1016/0022-1236(74)90071-8.
  57. Alexander Volberg and Haonan Zhang. Noncommutative Bohnenblust-Hille inequalities. Mathematische Annalen, pages 1-20, 2023. Google Scholar