arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2610.20737quant-phphysics.chem-ph
收藏

n-可表示性问题的构造性解

A constructive solution to the $n$-representability problem

Google Quantum AI(谷歌量子人工智能);Florida State University(佛罗里达州立大学)

Nicholas C. Rubin, A. Eugene DePrince

AI总结:

该研究通过构造加权平方和层次的两体见证族,给出费米子量子边缘问题的构造性解,数值验证了其有效性,并建立了验证两粒子约化密度矩阵物理性的统一框架。

摘要:

我们通过在加权平方和(sum-of-squares)层次的每一层构造完整的两体见证(two-body witnesses)族,给出了费米子量子边缘问题的解。我们的构造结合了半正定Gram矩阵与显式线性零空间约束,这些约束可精确抵消所有更高体贡献,将对单个可表示性条件的搜索替换为系统的代数过程。除完备性证明外,我们通过求解相关半定规划(semidefinite program)并恢复三费米子区Richardson哈密顿量的精确基态能量,对该构造进行了数值验证。我们进一步证明,当使用完整的平方和生成代数时,不需要更高阶的粒子数乘子。这些结果为通过完整表征所有两体见证来验证候选两粒子约化密度矩阵的物理性,建立了统一的构造性框架。

英文摘要:

We present an instantiation of the constructive solution to the fermionic quantum marginal problem by building the complete family of two-body witnesses at each level of a weighted sum-of-squares hierarchy. Our construction combines positive-semidefinite Gram matrices with explicit linear nullspace constraints that exactly cancel all higher-body contributions following a similar idea to the existing solution but made explicit in open source software. We demonstrate the weighted sum-of-squares construction numerically by solving the associated semidefinite program and recovering the exact ground-state energy of a Richardson Hamiltonian in the three-fermion sector. We further prove that higher-degree particle-number multipliers are unnecessary when the full sum-of-squares generating algebra is used.

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

↑