Efficient Matrix Product State Learning in Logarithmic Depth
在对数深度下高效学习矩阵积态
Chia-Ying Lin, Nai-Hui Chia, Shih-Han Hung
AI总结 本文研究了在有限样本和电路深度下高效学习矩阵积态(MPS)的问题,提出了一种并行解缠算法,将电路深度降低到O(log n)并减少样本复杂度,同时针对硬件限制进行了扩展和分析。
Comments 40 pages, 4 figures
详情
学习量子态的最接近的矩阵积态(MPS)表示为量子机器学习和复杂量子系统分析提供了有用的工具。在本工作中,我们研究了在以下设定下的MPS学习问题:给定许多输入MPS的副本,任务是恢复该状态的经典描述。目前已知的多项式时间算法,由[LCLP10, CPF+10]提出,需要线性电路深度和~O(n^5)的样本,超过十年未见改进。这些成本既不被认为是最优的,使得现有算法对于资源有限的近期量子设备来说不切实际。我们引入了用于MPS学习的并行解缠算法。对于精确的MPS学习,我们的算法在多项式时间内运行,使用电路深度O(log n)和样本复杂度~O(n^3),在深度和系统大小n的依赖性上都得到了改进。关键思想是利用MPS中中间块的约简状态的有界秩结构,并以树结构组织解缠操作。我们进一步将算法扩展到最接近的MPS学习,将样本复杂度对n的依赖性从n^9改进到n^7,并用Ω(n)的乘积态下界补充算法。我们还研究了受硬件限制的MPS学习,包括受限测量和几何连通性。在学习异或与噪声(LPN)假设下,我们证明了学习MPS(2)家族在非自适应单量子比特测量下的计算难度。最后,我们展示了我们的算法可以在q维超立方体晶格上以深度O(qn^{1/q})实现,从而在深度上实现渐近减少。总的来说,我们的工作为高效MPS学习所需的量子资源提供了完整的表征。
Learning the closest matrix product state (MPS) representation of a quantum state enables useful tools for quantum machine learning and analysis of complex quantum systems. In this work, we study the problem of learning MPS in the following setting: given many copies of an input MPS, the task is to recover a classical description of the state. The best known polynomial-time algorithm, introduced by [LCLP10, CPF+10], requires linear circuit depth and $\widetilde O(n^5)$ samples, and has seen no improvement in over a decade. These costs, neither known to be optimal, renders existing algorithms impractical for near-term quantum devices with limited resources. We introduce parallel disentangling algorithms for MPS learning. For exact MPS learning, our algorithm runs in polynomial time and uses circuit depth $O(\log n)$ and sample complexity $\widetilde O(n^3)$, improving both the depth and the dependence on the system size $n$. The key idea is to exploit the bounded-rank structure of reduced states on middle blocks of an MPS and organize the disentangling operations in a tree structure. We further extend the algorithm to closest MPS learning, improving the sample complexity dependence on $n$ from $n^9$ to $n^7$ and complement the algorithms with an $Ω(n)$ product-state lower bound. We also investigate MPS learning under hardware constraints, including restricted measurements and geometric connectivity. Under the Learning Parity with Noise (LPN) assumption, we show computational hardness for learning an MPS(2) family with non-adaptive single-qubit measurements. Finally, we show that our algorithm can be implemented with depth $O(q n^{1/q})$ on a $q$-dimensional hypercubic lattice, giving an asymptotic reduction in depth. Together, our work provides a complete characterization of the quantum resources needed for efficient MPS learning.