arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2607.01608quant-phmath.OC
收藏

量子态层析的结构化分解方法

Structured Factorization Approaches for Quantum State Tomography

University of Michigan(密歇根大学);Purdue University(普渡大学);Oak Ridge National Laboratory(橡树岭国家实验室);DEVCOM Army Research Laboratory(德福科姆陆军研究实验室);Tulane University(杜兰大学);The Ohio State University(俄亥俄州立大学)

Zhen Qin, Joseph M. Lukens, Brian T. Kirby, Zhihui Zhu

AI总结:

提出结构化分解统一框架,通过参数化密度矩阵为FF†并约束因子F的结构先验,实现可扩展的量子态层析,并开发投影梯度下降和幂法优化算法。

摘要:

由于量子态层析(QST)的复杂度随系统规模指数增长,利用低秩性、张量网络结构和神经网络表示等先验对于在样本复杂度和参数复杂度方面实现可扩展的QST至关重要。本文引入一个统一框架,称为结构化分解,它基于Burer-Monteiro型分解,将密度矩阵参数化为$FF^\dagger$,其中因子$F$被约束为属于一个结构化模型类。这种分解通过构造保证了物理有效性,同时允许通过选择因子空间直接融入广泛的结构先验,范围从通用Cholesky分解到低秩矩阵、矩阵乘积算子以及基于多层感知机和Transformer架构的神经密度算子。基于此结构化分解框架,我们将QST表述为从测量数据在因子空间上的优化问题。我们首先对一类广泛的结构化量子态的最小二乘估计的样本复杂度进行了统一的统计分析。然后,我们提出了一种投影梯度下降方法,该方法直接在因子空间上操作,并适应广泛的结构参数化和重建目标。为了进一步利用最大似然估计公式的几何结构和因子上的约束,我们推导出一种幂法,得到一种无步长且快速收敛的算法,当因子无约束时,它恢复Covers方法作为特例。

英文摘要:

Since the complexity of quantum state tomography (QST) scales exponentially with system size, exploiting priors such as low-rankness, tensor-network structures, and neural-network representations is essential for scalable QST in terms of sample complexity and parameter complexity. In this paper, we introduce a unified framework, termed structured factorization, that builds on BurerMonteiro-type factorization by parametrizing the density matrix as $FF^\dagger$, where the factor $F$ is constrained to belong to a structured model class. This factorization guarantees physical validity by construction while allowing a broad range of structural priors to be incorporated directly through the choice of the factor space, ranging from the generic Cholesky decomposition to low-rank matrices, matrix product operators, and neural density operators based on multilayer perceptron and transformer architectures. Building on this structured factorization framework, we formulate QST as an optimization problem over the factor space from measurement data. We first develop a unified statistical analysis of the sample complexity of least-squares estimation for a broad class of structured quantum states. We then propose a projected gradient descent method that operates directly on the factor space and accommodates a wide range of structural parametrizations and reconstruction objectives. To further exploit the geometry of the maximum-likelihood estimation formulation and the constraints on the factors, we derive a power method that yields a step-size-free algorithm with fast convergence, recovering Covers method as a special case when the factor is unconstrained.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑