arXiv:2610.16138
Perfect discrimination of an orthogonal $2\otimes2$ basis may require collective separable measurements on two copies
Somshubhro Bandyopadhyay
Abstract
We consider an orthogonal basis of $\mathbb C^2\otimes\mathbb C^2$ with three entangled states and one product state. This basis is not perfectly distinguishable by LOCC or even by separable measurements when a single copy of the unknown state is available. We show that with two copies no adaptive separable protocol, which measures the copies one at a time, distinguishes the basis perfectly. We then show that a collective separable measurement on the two copies does. Whether two copies suffice for LOCC remains open.
AI Summary
The paper asks whether collective processing of two copies can be necessary for perfect separable discrimination of an orthogonal two-qubit basis, and how this relates to the open question of whether two copies always suffice for bipartite LOCC discrimination. It studies the basis $|\psi_k\rangle=(|00\rangle+\omega^k|01\rangle+\omega^{2k}|10\rangle)/\sqrt3$ for $k=0,1,2$, together with $|\psi_3\rangle=|11\rangle$, where $\omega=e^{2\pi i/3}$. The first three states have concurrence $2/3$; single-copy perfect discrimination is impossible even by separable measurements. Two results establish a distinction between adaptive and collective separable measurements. No protocol that measures one copy and then conditionally measures the second can perfectly distinguish the four states. The proof enumerates the product vectors in all two-state spans and constructs a nonzero-trace Hermitian witness showing that no single-copy separable measurement can eliminate at least two candidates at every outcome. Consequently, some branch leaves at least three candidates that the second copy cannot resolve. In contrast, an explicit collective separable POVM on $\mathbb C^4\otimes\mathbb C^4$ perfectly distinguishes the two-copy states. The construction exploits a cyclic local-unitary symmetry, reducing the search to one separable operator satisfying orthogonality and block-completeness constraints. It gives five POVM elements, including one outcome with zero probability on every input state, and a closed-form product-vector decomposition. The construction does not establish LOCC implementability. Two-copy LOCC discrimination of this basis, and the general bipartite two-copy LOCC question, remain open.
A solution was found with the help of Claude (Anthropic) and is given below in closed form.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
- Comments
- 11 pages, 2 tables