mlsanityData to 14 Oct 2026

Learning to erase quantum states: thermodynamic implications of quantum learning theory

arXiv 2504.07341 ↗First posted 9 Apr 2025quant-ph cond-mat.stat-mech cs.CCcited by 0

Not on the map. Why?

Abstract (arXiv)

The energy cost of erasing quantum states depends on our knowledge of the states. We show that learning algorithms can acquire such knowledge to erase many copies of an unknown state at the optimal energy cost. This is proved by showing that learning can be made fully reversible and has no fundamental energy cost itself. With simple counting arguments, we relate the energy cost of erasing quantum states to their complexity, entanglement, and magic. We further show that the constructed erasure protocol is computationally efficient when learning is efficient. Conversely, under standard cryptographic assumptions, we prove that the optimal energy cost cannot be achieved efficiently in general. These results also enable efficient work extraction based on learning. Together, our results establish a concrete connection between quantum learning theory and thermodynamics, highlighting the physical significance of learning processes and enabling provably-efficient learning-based protocols for thermodynamic tasks.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 12 of its 115 references that are in the map. First posted on arXiv 9 Apr 2025.

Builds on

12 of 115 references.

References · 12

  1. 2020Predicting Many Properties of a Quantum System from Very Few Measurementscited by 233
  2. 2015Statistical physics of inference: Thresholds and algorithmscited by 128
  3. 2016Efficient quantum tomography IIcited by 54
  4. 2023A survey on the complexity of learning quantum statescited by 32
  5. 2023Learning quantum Hamiltonians at any temperature in polynomial timecited by 23
  6. 2024Learning shallow quantum circuitscited by 20
  7. 2023Learning quantum states and unitaries of bounded gate complexitycited by 15
  8. 2022Optimal algorithms for learning quantum phase statescited by 10
  9. 2019Quantum hardness of learning shallow classical circuitscited by 7
  10. 2023Efficient Learning of Quantum States Prepared With Few Non-Clifford Gatescited by 7
  11. 2024Learning quantum states prepared by shallow circuits in polynomial timecited by 6
  12. 2024How to Construct Random Unitariescited by 3

Built on by

Not cited yet.