用测量数据高效学习并生成量子混合态,无需知道原始电路。
Learning and Generating Mixed States Prepared by Shallow Channel Circuits
- 基于浅层通道电路结构,仅凭测量数据即可学习混合态
- 样本复杂度和运行时间在量子比特数上多项式(或准多项式)增长
- 适用于量子生成模型,也启发了经典扩散模型的高效训练
从测量数据中学习量子态是量子信息与计算复杂性中的核心问题。本文研究有限维晶格上混合态的生成学习问题。受混合态物相研究进展启发,聚焦平凡相中的任意态:若存在一个浅层制备通道电路,使得制备过程中局部可逆性始终被保持,则该态属于平凡相。我们证明,此类混合态可仅通过测量访问高效学习。具体而言,给定未知平凡相混合态的多个副本,算法输出一个浅层局部通道电路,能在迹距离上近似生成该态。样本复杂度与运行时间在量子比特数上为多项式(或准多项式),前提是电路深度恒定(或对数多对数)且门局域性受限。重要的是,学习者不掌握原始制备电路,仅依赖其存在性。结果为基于浅层通道电路的量子生成模型提供了结构性基础。在经典极限下,本框架亦启发了一种仅需多项式训练与生成开销的经典扩散模型高效算法。
原文摘要 · Abstract (English)
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.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。