Metraipolis › archive › dc_7de0f9ee5563
Quantum channel tomography: optimal bounds in the near-boundary regime — arXiv:2611.03639
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2611.03639
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-03T11:39:27.382Z
- SHA-256 of the archived text
1e17574e2b4fe6e94c52ddcc29e28c84431ec3731666a16c425cae243c8dbaa8- Stable URL of this page
https://metraipolis.com/documento/dc_7de0f9ee5563
How to cite
Quantum channel tomography: optimal bounds in the near-boundary regime — arXiv:2611.03639 — arXiv (en), https://arxiv.org/abs/2611.03639 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_7de0f9ee5563 (Metraipolis archive dc_7de0f9ee5563, sha256 1e17574e2b4fe6e94c52ddcc29e28c84431ec3731666a16c425cae243c8dbaa8)
BibTeX
@misc{dc7de0f9ee5563,
title = {Quantum channel tomography: optimal bounds in the near-boundary regime — arXiv:2611.03639},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2611.03639},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_7de0f9ee5563; sha256 1e17574e2b4fe6e94c52ddcc29e28c84431ec3731666a16c425cae243c8dbaa8},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.03639. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Quantum channel tomography (also known as quantum process tomography) is a fundamental task in quantum information and quantum computing, aiming to learn the full description of an unknown quantum channel from black-box queries. For channels with input dimension $d_1$, output dimension $d_2$, and Kraus rank at most $r$, [CGO+26] identifies the dilation rate $\tau=rd_2/d_1\geq 1$ as a key parameter governing a Heisenberg-to-classical transition in query complexity. While the optimal bounds in the boundary regime ($\tau=1$) and the away-from-boundary regime ($\tau\geq 1+\Omega(1)$) are now known, the precise behavior in the near-boundary regime ($1<\tau<1+o(1)$) has remained unresolved. In this paper, we close this gap, thereby fully settling the query complexity of quantum channel tomography. Specifically, we show that the query complexity is - $\Omega(rd_1d_2/\varepsilon^2)$ for diamond norm error $\varepsilon$, matching the upper bound by [MB26, CGO+26], - $\Theta(d_1^2/\varepsilon+\min\{(\tau-1)d_1^2,(\tau-1)^2d_1^2d_2^2\}/\varepsilon^2)$ for Choi trace norm error $\varepsilon$. Our results reveal two qualitatively different forms of the Heisenberg-to-classical transition. For diamond norm tomography, the Heisenberg scaling disappears suddenly as soon as $\tau$ leaves the boundary regime. In contrast, Choi trace norm tomography exhibits a gradual transition from Heisenberg to classical scaling as $\tau$ moves from the boundary regime to the away-from-boundary regime.
Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.IT, nuovi lavori del giorno).
Categorie arXiv: Quantum Physics (quant-ph) ; Information Theory (cs.IT).
Pagina del lavoro: https://arxiv.org/abs/2611.03639 — 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-11-03T11:05:37.223Z dalla pagina https://arxiv.org/list/math.IT/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).