























Abstract:Learning quantum states from measurement data is a central problem in quantum information and computational complexity. In this work, we study the problem of learning to generate mixed states on a finite-dimensional lattice. Motivated by recent developments in mixed state phases of matter, we focus on arbitrary states in the trivial phase. A state belongs to the trivial phase if there exists a shallow preparation channel circuit under which local reversibility is preserved throughout the preparation. We prove that any mixed state in this class can be efficiently learned from measurement access alone. Specifically, given copies of an unknown trivial phase mixed state, our algorithm outputs a shallow local channel circuit that approximately generates this state in trace distance. The sample complexity and runtime are polynomial (or quasi-polynomial) in the number of qubits, assuming constant (or polylogarithmic) circuit depth and gate locality. Importantly, the learner is not given the original preparation circuit and relies only on its existence. Our results provide a structural foundation for quantum generative models based on shallow channel circuits. In the classical limit, our framework also inspires an efficient algorithm for classical diffusion models using only a polynomial overhead of training and generation.
| Comments: | 44 pages, 14 figures, 1 table. Updated references to include additional relevant works, applications, and discussions |
| Subjects: | Quantum Physics (quant-ph); Statistical Mechanics (cond-mat.stat-mech); Computational Complexity (cs.CC); Machine Learning (cs.LG) |
| Cite as: | arXiv:2604.01197 [quant-ph] |
| (or arXiv:2604.01197v2 [quant-ph] for this version) | |
| https://doi.org/10.48550/arXiv.2604.01197 arXiv-issued DOI via DataCite |
From: Fangjun Hu [view email]
[v1]
Wed, 1 Apr 2026 17:42:56 UTC (1,240 KB)
[v2]
Thu, 16 Apr 2026 03:59:09 UTC (1,300 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。