Advantage of Entangled Learning Rules in Quantum Measurement Class Learning
Not on the map. Why?
Abstract (arXiv)
Learning with data in the form of quantum states is of current interest and has led to a variety of problems that boil down to interaction with the available data via quantum measurement and classical post-processing of observed classical outcomes. In quantum measurement PAC learning, one is given a sequence of unknown, prepared quantum states and classical labels, along with a hypothesis class of candidate measurements. The task is to select a measurement from the hypothesis class that minimizes a fixed notion of error in prediction of the classical labels via measurement of a new state by the selected hypothesis. In this work, we consider the advantage of interacting with the given data in the measurement learning framework using learning rules given by measurements that cannot be implemented using local operations and classical communication (LOCC), as opposed to single-copy learning rules. We provide a construction showing that there exist learning scenarios wherein single-copy learning rules are asymptotically suboptimal compared to optimal ones. We then show that learning rules based on entangled measurements enjoy at most a polynomial sample complexity advantage over single-copy learning rules in the PAC learning setting (under a natural joint measurability covering assumption).
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 5 of its 22 references that are in the map. First posted on arXiv 5 Oct 2026.
Builds on
5 of 22 references.
References · 5
- 2016Optimal Quantum Sample Complexity of Learning Algorithmscited by 33
- 2020Quantum statistical query learningcited by 21
- 2017A Survey of Quantum Learning Theorycited by 12
- 2021A Theoretical Framework for Learning from Quantum Datacited by 8
- 2022Lower Bounds for Learning Quantum States with Single-Copy Measurementscited by 8
Built on by
Not cited yet.