Online Learning of Pure States is as Hard as Mixed States
Fuente:
arXiv
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866915597955104768 |
|---|---|
| author | Meyer, Maxime Adhikary, Soumik Guo, Naixu Rebentrost, Patrick |
| author_facet | Meyer, Maxime Adhikary, Soumik Guo, Naixu Rebentrost, Patrick |
| contents | Quantum state tomography, the task of learning an unknown quantum state, is a fundamental problem in quantum information. In standard settings, the complexity of this problem depends significantly on the type of quantum state that one is trying to learn, with pure states being substantially easier to learn than general mixed states. A natural question is whether this separation holds for any quantum state learning setting. In this work, we consider the online learning framework and prove the surprising result that learning pure states in this setting is as hard as learning mixed states. More specifically, we show that both classes share almost the same sequential fat-shattering dimension, leading to identical regret scaling. We also generalize previous results on full quantum state tomography in the online setting to (i) the $ε$-realizable setting and (ii) learning the density matrix only partially, using smoothed analysis. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2502_00823 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Online Learning of Pure States is as Hard as Mixed States Meyer, Maxime Adhikary, Soumik Guo, Naixu Rebentrost, Patrick Quantum Physics Machine Learning 81P18 (Primary) 68T05, 62L10 (Secondary) I.2.6 Quantum state tomography, the task of learning an unknown quantum state, is a fundamental problem in quantum information. In standard settings, the complexity of this problem depends significantly on the type of quantum state that one is trying to learn, with pure states being substantially easier to learn than general mixed states. A natural question is whether this separation holds for any quantum state learning setting. In this work, we consider the online learning framework and prove the surprising result that learning pure states in this setting is as hard as learning mixed states. More specifically, we show that both classes share almost the same sequential fat-shattering dimension, leading to identical regret scaling. We also generalize previous results on full quantum state tomography in the online setting to (i) the $ε$-realizable setting and (ii) learning the density matrix only partially, using smoothed analysis. |
| title | Online Learning of Pure States is as Hard as Mixed States |
| topic | Quantum Physics Machine Learning 81P18 (Primary) 68T05, 62L10 (Secondary) I.2.6 |
| url | https://arxiv.org/abs/2502.00823 |