Metraipolis › archive › dc_fef994e82a02

Optimal Diamond Distance Estimation for Unitary Channels — arXiv:2610.40623

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.40623
License (as archived)
CC0-1.0
Archived
2026-11-01T02:51:41.059Z
SHA-256 of the archived text
0e25623e9fc06bb66d77f6c54644dde3779961f99c3a5759337f6c69c38961a9
Stable URL of this page
https://metraipolis.com/documento/dc_fef994e82a02

How to cite

Optimal Diamond Distance Estimation for Unitary Channels — arXiv:2610.40623 — arXiv (en), https://arxiv.org/abs/2610.40623 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_fef994e82a02 (Metraipolis archive dc_fef994e82a02, sha256 0e25623e9fc06bb66d77f6c54644dde3779961f99c3a5759337f6c69c38961a9)
BibTeX
@misc{dcfef994e82a02,
  title = {Optimal Diamond Distance Estimation for Unitary Channels — arXiv:2610.40623},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.40623},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_fef994e82a02; sha256 0e25623e9fc06bb66d77f6c54644dde3779961f99c3a5759337f6c69c38961a9},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.40623. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

The diamond distance between two quantum channels determines the optimal probability of distinguishing them from a single use. We give a quantum algorithm that estimates the diamond distance between two unknown $d$-dimensional unitary channels to within additive error $\varepsilon$, using $O(\sqrt{d}/\varepsilon)$ queries to the unitary channels and their inverses. The query complexity is optimal, as it matches the lower bound due to Jeon and Oh (npj Quantum Inf. 2026).

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.40623 — 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-01T02:19:43.533Z dalla pagina https://arxiv.org/list/quant-ph/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).