Proper Agnostic Learning of Matrix Product States and Tree Tensor Networks

arXiv:2609.30148 · quant-ph · Submitted 2026-09-24 · Read on arXiv

quant-ph

Submitted: 2026-09-24

Updated: 2026-09-24

Comments: 15+37 pages

License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/

Terminology

• Agnostic Learning — 36× in this paper · explained in 1 episode
• Accuracy — 14× in this paper · explained in 1 episode
• Trace — 14× in this paper · explained in 2 episodes
• Core — 7× in this paper · explained in 2 episodes
• Hilbert Space — 7× in this paper · explained in 2 episodes
• Algorithmic Primitives — 1× in this paper · explained in 1 episode
• BQP — 1× in this paper · explained in 2 episodes
• Entanglement — 1× in this paper · explained in 3 episodes
• Redundancy — 1× in this paper · explained in 2 episodes
• Trace Distance — 1× in this paper · explained in 3 episodes

Sources

• Learning the closest product state
• Emergent classicality and wavefunction branching in an isolated quantum many-body system

Related papers

• Reconquering Bell sampling on qudits: stabilizer learning and testing, quantum pseudorandomness bounds, and more
• Encrypted clones can leak: Classification of informative subsets in Quantum Encrypted Cloning
• Polynomial-time classical and quantum simulation of quantum impurity models
• A quasiparticle-protected superconducting qubit
• Theory of quantum-enhanced interferometry with general Markovian light sources
• A convergent hierarchy of spectral gap certificates for qubit Hamiltonians