多部不可扩展乘积基的最小基数

中文摘要 AI 辅助

在量子信息理论中，多部量子系统的状态空间由张量积建模。在张量积空间 $\mathbb C^{d_1}\otimes\cdots\otimes\mathbb C^{d_p}$ 中，非零向量若可写成 $\lvert \varphi_1\rangle\otimes\cdots\otimes\lvert \varphi_p\rangle$ 且 $\lvert \varphi_j\rangle\in\mathbb C^{d_j}\setminus\{0\}$，则称为乘积态。不可扩展乘积基（UPB）是两两正交的乘积态的有限族，使得不存在非零乘积态与它们全部正交。UPB在研究量子纠缠和非局域现象中起关键作用。寻找最小的UPB是一个自然的极值问题：它询问需要多少个两两正交的乘积态才能阻止任何进一步的乘积态被添加。自Alon和Lovász的开创性工作以来，UPB的一般最小规模问题已被研究了二十多年。对于局部维度 $d_1,\ldots,d_p\ge2$，令 $f_m(d_1,\ldots,d_p)$ 为UPB的最小基数，并令 $f_{LB}(d_1,\ldots,d_p)=1+\sum_{j=1}^{p}(d_j-1)$ 为自然下界。Alon和Lovász精确确定了何时 $f_m$ 达到下界 $f_{LB}$，但受阻的多部情况在一般情况下仍未解决。我们证明了一个稳定化定理：对于每个具有 $p\ge3$ 的非全量子比特系统，当奇偶性阻止自然下界 $f_{LB}$ 被达到时，真正的最小值恰好是 $f_{LB}+1$。等价地，如果偶数局部维度的数量为正且为偶数，并且至少一个局部维度大于二，则 $f_m(d_1,\ldots,d_p)=f_{LB}(d_1,\ldots,d_p)+1$。该证明建立在统一的图论框架之上。我们的结果与早期工作一起，解决了所有有限量子系统中UPB的最小基数问题。

英文摘要

In quantum information theory, the state space of a multipartite quantum system is modeled by a tensor product. In the tensor-product space $\mathbb C^{d_1}\otimes\cdots\otimes\mathbb C^{d_p}$, a nonzero vector is a \emph{product state} if it can be written as $\lvert φ_1\rangle\otimes\cdots\otimes\lvert φ_p\rangle$ with $\lvert φ_j\rangle\in\mathbb C^{d_j}\setminus\{0\}$. An \emph{unextendible product basis} (UPB) is a finite family of pairwise orthogonal product states such that no nonzero product state is orthogonal to all of them. UPBs play a key role in investigating quantum entanglement and nonlocal phenomena. Finding a smallest UPB is a natural extremal problem: it asks how few pairwise orthogonal product states suffice to prevent any further product state from being added. The general minimum-size problem for UPBs has been studied for over two decades since the seminal work of Alon and Lovász. For local dimensions $d_1,\ldots,d_p\ge2$, let $f_m(d_1,\ldots,d_p)$ be the minimum cardinality of a UPB and let $f_{LB}(d_1,\ldots,d_p)=1+\sum_{j=1}^{p}(d_j-1)$ be the natural lower bound. Alon and Lovász determined exactly when $f_m$ attains the lower bound $f_{LB}$, but the obstructed multipartite cases remained open in general. We prove a stabilization theorem: for every non-all-qubit system with $p\ge3$, whenever parity prevents the natural lower bound $f_{LB}$ from being attained, the true minimum is exactly $f_{LB}+1$. Equivalently, if the number of even local dimensions is positive and even, and at least one local dimension is greater than two, then $f_m(d_1,\ldots,d_p)=f_{LB}(d_1,\ldots,d_p)+1$. The proof is built on a unified graph-theoretic framework. Our result, together with earlier work, settles the minimum-cardinality problem for UPBs in all finite quantum systems.

发表机构

• Beijing Normal University-Zhuhai（北京师范大学-珠海）

机构由 AI 辅助整理，请以论文原文为准。