EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Learning Quantum States and Unitaries of Bounded Gate Complexity

Haimeng Zhao, Laura Lewis, Ishaan Kannan, Yihui Quek, Hsin-Yuan Huang, Matthias C. Caro

PRX Quantum · 16.10.2024 · 5 (4)

DOI: 10.1103/prxquantum.5.040306 ↗

Kurz gefasst

Fachartikel in der Zeitschrift PRX Quantum, online erschienen am 16.10.2024. Verfasst von Haimeng Zhao und 5 weiteren Autor:innen. Die Arbeit wurde bisher 39-mal zitiert (Crossref) und nennt 130 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: U.S. Department of Energy, Caltech Summer Undergraduate Research Fellowship, Mellon Mays Undergraduate Fellowship.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

While quantum state tomography is notoriously hard, most states hold little interest to practically minded tomographers. Given that states and unitaries appearing in nature are of bounded gate complexity, it is natural to ask if efficient learning becomes possible. In this work, we prove that to learn a state generated by a quantum circuit with G two-qubit gates to a small trace distance, a sample complexity scaling linearly in G is necessary and sufficient. We also prove that the optimal query complexity to learn a unitary generated by G gates to a small average-case error scales linearly in G . While sample-efficient learning can be achieved, we show that under reasonable cryptographic conjectures, the computational complexity for learning states and unitaries of gate complexity G must scale exponentially in G . We illustrate how these results establish fundamental limitations on the expressivity of quantum machine-learning models and provide new perspectives on no-free-lunch theorems in unitary learning. Together, our results answer how the complexity of learning quantum states and unitaries relate to the complexity of creating these states and unitaries. Published by the American Physical Society 2024

Förderung

  • U.S. Department of Energy
  • Caltech Summer Undergraduate Research Fellowship
  • Mellon Mays Undergraduate Fellowship
  • MediaTek Research Young Scholarship
  • Google Ph.D. Fellowship
  • Deutscher Akademischer Austauschdienst (DAAD) Postdoctoral Researchers International Mobility Experience (PRIME) fellowship

Zitieren

APA

Zhao, H., Lewis, L., Kannan, I., Quek, Y., Huang, H., & Caro, M. C. (2024). Learning Quantum States and Unitaries of Bounded Gate Complexity. PRX Quantum, 5(4). https://doi.org/10.1103/prxquantum.5.040306

Vancouver

Zhao H, Lewis L, Kannan I, Quek Y, Huang H, Caro MC. Learning Quantum States and Unitaries of Bounded Gate Complexity. PRX Quantum. 2024;5(4). doi:10.1103/prxquantum.5.040306

BibTeX
@article{Zhao2024,
  author = {Zhao, Haimeng and Lewis, Laura and Kannan, Ishaan and Quek, Yihui and Huang, Hsin-Yuan and Caro, Matthias C.},
  title = {Learning Quantum States and Unitaries of Bounded Gate Complexity},
  journal = {PRX Quantum},
  year = {2024},
  volume = {5},
  number = {4},
  doi = {10.1103/prxquantum.5.040306}
}
Kostenlos starten →