Efficient Learning of Quantum States Prepared With Few Non-Clifford Gates II: Single-Copy Measurements
Not on the map. Why?
Abstract (arXiv)
Recent work has shown that n-qubit quantum states output by circuits with at most t single-qubit non-Clifford gates can be learned to trace distance ε using mathsfpoly(n,2t,1/ε) time and samples. All prior algorithms achieving this runtime use entangled measurements across two copies of the input state. In this work, we give a similarly efficient algorithm that learns the same class of states using only single-copy measurements.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 9 of its 44 references that are in the map. First posted on arXiv 14 Aug 2023.
Builds on
9 of 44 references.
References · 9
- 2021Quantum advantage in learning from experimentscited by 188
- 2021Information-theoretic bounds on quantum advantage in machine learningcited by 96
- 2016Efficient quantum tomography IIcited by 54
- 2021Exponential separations between learning with and without quantum memorycited by 52
- 2023Improved Stabilizer Estimation via Bell Difference Samplingcited by 11
- 2020Fast and robust quantum state tomography from few basis measurementscited by 10
- 2022Optimal algorithms for learning quantum phase statescited by 10
- 2021Efficient Tomography of Non-Interacting Fermion Statescited by 7
- 2022Low-Stabilizer-Complexity Quantum States Are Not Pseudorandomcited by 6
Built on by
Not cited yet.