arXiv:2610.04288
Polynomial Separation between One-Way and Two-Way LOCC in Discrimination of Maximally Entangled States
Youngrong Lim
Abstract
One-way local operations and classical communication (LOCC) can fail to distinguish four orthogonal maximally entangled states in every local dimension $d\ge4$. We show that every set of $k$ pairwise orthogonal maximally entangled states in $\mathbb C^d\otimes\mathbb C^d$ is perfectly distinguishable by an $A\to B\to A$ protocol whenever $d\ge Ck^4[\log(2k)]^ν$, for universal constants $C,ν>0$. A single feedback message therefore raises the number of candidates that can always be distinguished from a constant to $Ω\!\left(d^{1/4}/(\log d)^{ν/4}\right)$, establishing a polynomial separation between one-way and two-way LOCC. In our protocol, Alice preserves exact orthogonality while reducing overlaps between Bob's conditional subspaces. Bob reduces the candidates to a singleton or an orthogonal pair and refines his outcome so that Alice can complete the discrimination. As a corollary, nine copies suffice for perfect two-way LOCC discrimination of any orthogonal maximally entangled set in all sufficiently large local dimensions.
AI Summary
The paper asks how the worst-case size of a perfectly LOCC-distinguishable set of orthogonal maximally entangled states scales with local dimension when feedback is allowed. One-way LOCC can fail for four states in every $d\ge4$. It proves that every set of $k$ such states in $\mathbb C^d\otimes\mathbb C^d$ is distinguishable using an $A\to B\to A$ protocol whenever $d\ge Ck^4[\log(2k)]^\nu$, for universal constants $C,\nu>0$. Thus feedback raises the universally distinguishable set size from a constant to $\Omega(d^{1/4}/(\log d)^{\nu/4})$. Alice first projects onto sectors that preserve exact pairwise orthogonality while bounding overlaps between Bob’s conditional subspaces by $1/[4(k-1)]$. The construction combines random compression, corrective rotations enforcing zero trace constraints, and recursive refinement; its convergence proof is deferred to supplemental material. Bob decomposes the resulting block Gram matrix into positive singleton and pair terms, implementing a measurement that leaves at most two orthogonal pure candidates. He then incorporates the first step of a two-state discrimination protocol into his feedback message. The dimension bound implies that nine copies suffice in all sufficiently large dimensions, and some universal constant number suffices in every dimension. An extension covers orthogonal pure states with bounded Schmidt-spectrum condition number $\kappa$, at dimension $d\ge C\kappa^2k^4[\log(2\kappa k)]^\nu$. The guarantees concern exact discrimination, not bounded-error separations or experimental robustness. Efficient measurement synthesis is not established, constants are unevaluated, and the optimal dimension scaling, smaller-dimensional triple cases, and minimum universal copy count remain open.
GPT-6 and Fable-5.1 were used under the author’s direction to assist with exploring and refining mathematical arguments, checking calculations, and revising the manuscript.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
- Comments
- 5+12 pages, 1 figure