Metraipolis › archive › dc_faba099435e4
Multiqubit orthogonal product bases — arXiv:2608.18421
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.18421
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-18T14:12:43.205Z
- SHA-256 of the archived text
236b8eae78133c1acd6e3d46eeb728a03f822482508704ba0575715a26a017ed- Stable URL of this page
https://metraipolis.com/documento/dc_faba099435e4
How to cite
Multiqubit orthogonal product bases — arXiv:2608.18421 — arXiv (en), https://arxiv.org/abs/2608.18421 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_faba099435e4 (Metraipolis archive dc_faba099435e4, sha256 236b8eae78133c1acd6e3d46eeb728a03f822482508704ba0575715a26a017ed)
BibTeX
@misc{dcfaba099435e4,
title = {Multiqubit orthogonal product bases — arXiv:2608.18421},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.18421},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_faba099435e4; sha256 236b8eae78133c1acd6e3d46eeb728a03f822482508704ba0575715a26a017ed},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.18421. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We use edge-colored complete multigraphs to study complete orthogonal product bases (OPBs) in $n$-qubit systems. We prove that two OPBs are equivalent if and only if their associated multigraphs are isomorphic, thereby reducing OPB classification to graph isomorphism. Within this framework, we establish the upper bound $v\le 2^n-1$ on the number of variables of an $n$-qubit OPB. We also derive $\binom{a_{n-1}+1}{2}\le a_n\le B_{2^{n-1}}^n$ for the number $a_n$ of equivalence classes of $n$-qubit OPBs, where $B_m$ denotes the number of partitions of an $m$-element set. These bounds imply the asymptotic behavior $a_n=2^{2^{n+o(n)}}$. For every OPB, the connectivity pattern of its color layers characterizes local irreducibility, which in turn implies indistinguishability by finite-round local operations and classical communication (LOCC); the existence of a complete color-splitting tree characterizes perfect distinguishability by finite-round LOCC. Finally, we give an algorithm for testing OPB equivalence and a recursive graph algorithm that constructs a finite-round LOCC protocol whenever such perfect discrimination is possible.
Tema degli esploratori: fisica e astronomia (retro-catalogo arXiv: annunci del 2026-08-20 in quant-ph).
Categorie arXiv: Quantum Physics (quant-ph).
Pagina del lavoro: https://arxiv.org/abs/2608.18421 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-18T14:10:23.790Z dalla pagina https://arxiv.org/catchup/quant-ph/2026-08-20?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).