arXiv (All)
open access
Polynomial Separation between One-Way and Two-Way LOCC in Discrimination of Maximally Entangled States
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 distinguishabl
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Characterizing local unitary equivalence of multipartite states by local unitary Bargmann invariants#1037585
- Universal quantum coding#1142338
- Separability criteria and lower bounds of entanglement via realignment#1326914
- Certification of high-dimensional entanglement in continuous-variable systems#1187791
- Bounds on Entanglement Dynamics from Krylov-Space Spreading#662414
Record · ID 1199562
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive