Metraipolis › archive › dc_bf6917097eb0

On Random Purifications of Isometries and Channels — arXiv:2611.04573

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.04573
License (as archived)
CC0-1.0
Archived
2026-11-04T19:08:50.343Z
SHA-256 of the archived text
6cc55bc8ca6e2268ffb870f6046d4a627094475c7e1816190a7919b0054a051f
Stable URL of this page
https://metraipolis.com/documento/dc_bf6917097eb0

How to cite

On Random Purifications of Isometries and Channels — arXiv:2611.04573 — arXiv (en), https://arxiv.org/abs/2611.04573 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_bf6917097eb0 (Metraipolis archive dc_bf6917097eb0, sha256 6cc55bc8ca6e2268ffb870f6046d4a627094475c7e1816190a7919b0054a051f)
BibTeX
@misc{dcbf6917097eb0,
  title = {On Random Purifications of Isometries and Channels — arXiv:2611.04573},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.04573},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_bf6917097eb0; sha256 6cc55bc8ca6e2268ffb870f6046d4a627094475c7e1816190a7919b0054a051f},
  year = {2026}
}

Archived text

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

Acorn tricks turn weak quantum resources into stronger "randomized" ones. A recent example is the random purification channel, which turns $t$ copies of a mixed state into $t$ copies of a random purification. We ask whether analogous techniques can turn queries to an isometry into queries to a random unitary completion, or queries to a quantum channel into queries to a random isometry dilation. For an isometry from dimension $N$ to dimension $M$, we give an efficient, stateful simulator for $T$ sequential, forward queries to a fixed Haar random unitary completion. It uses at most one forward isometry query per simulated call, with total trace-distance error $O(T\sqrt{N/(M-T)})$. This lifts isometry query lower bounds to arbitrary unitary completions, and copy complexity lower bounds to forward access to state preparation unitaries, with dimension-dependent loss that can be made arbitrarily small for most applications. Conversely, we construct two distributions on quantum channels distinguishable exactly with two queries to an arbitrary dilation, but requiring exponentially many channel queries for nonnegligible advantage. This rules out efficient simulation of random channel dilations. Our technique also shows that approximating the quantum switch to any constant error below $1/2$ requires exponentially many channel queries, even for identical channels, giving an exponential query advantage for indefinite causal order and improving on Bavaresco et al. (2025). Finally, we show how to "decontrol" controlled forward access to an isometry: any algorithm making controlled queries to $\phi V$ for a random phase $\phi$ can be transformed into one using the same number of uncontrolled forward queries to $V$, generalizing the analogous result for unitaries.

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/2611.04573 — 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-04T18:42:37.665Z dalla pagina https://arxiv.org/list/quant-ph/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).