Metraipolis › archive › dc_6ec9ccf8dcba
Intermediate memory costs of quantum channel synthesis with a protected subsystem — arXiv:2610.20536
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.20536
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-15T14:47:32.351Z
- SHA-256 of the archived text
a5a8037fd0411ad5bca02863dcc1e5aeb0b4c8d0de7dc424e7bce33244b9288c- Stable URL of this page
https://metraipolis.com/documento/dc_6ec9ccf8dcba
How to cite
Intermediate memory costs of quantum channel synthesis with a protected subsystem — arXiv:2610.20536 — arXiv (en), https://arxiv.org/abs/2610.20536 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_6ec9ccf8dcba (Metraipolis archive dc_6ec9ccf8dcba, sha256 a5a8037fd0411ad5bca02863dcc1e5aeb0b4c8d0de7dc424e7bce33244b9288c)
BibTeX
@misc{dc6ec9ccf8dcba,
title = {Intermediate memory costs of quantum channel synthesis with a protected subsystem — arXiv:2610.20536},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.20536},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_6ec9ccf8dcba; sha256 a5a8037fd0411ad5bca02863dcc1e5aeb0b4c8d0de7dc424e7bce33244b9288c},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.20536. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
A quantum memory can preserve a subsystem perfectly while discarding information needed by a later operation. We study the total intermediate dimension required for channel synthesis when the first stage protects a $b$-dimensional subsystem and has a prescribed noncommutative graph imposing full confusability on an $a$-dimensional control register. For a finite family of classically controlled branches, exact synthesis is possible if and only if the target graph contains the prescribed graph of the first stage. For every feasible family, we construct a single processor that implements all branches exactly. The processor uses pairwise nonorthogonal pure program states in a register of dimension at most $a$. A target graph may be realizable with a carrier of dimension $b$, while synthesizing a channel with that graph can require dimension $ab$. We also characterize the closure of the attainable channels, distinguishing exact synthesis from arbitrarily accurate approximation. Finally, for a family built from the trine communication task, a four-dimensional carrier permits exact synthesis with quantum programs under output depolarization. At the same total carrier dimension and without free shared randomness, classical programs have optimal normalized diamond error $(1-\eta)/4$, where $0\leq\eta\leq1$ is the depolarization strength. For $\eta<1$, the gap persists under sufficiently small perturbations of the target branches. Tema degli esploratori: fisica e astronomia (elenco arXiv quant-ph, nuovi lavori del giorno). Categorie arXiv: Quantum Physics (quant-ph). Pagina del lavoro: https://arxiv.org/abs/2610.20536 — 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-15T14:01:23.671Z dalla pagina https://arxiv.org/list/quant-ph/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).