On Random Purifications of Isometries and Channels
quant-ph
Submitted: 2026-11-03
Updated: 2026-11-03
License: http://creativecommons.org/licenses/by/4.0/
The gist: Acorn tricks turn weak quantum resources into stronger "randomized" ones.
Terminology
Abstract
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 ϕV for a random phase ϕ can be transformed into one using the same number of uncontrolled forward queries to V, generalizing the analogous result for unitaries.
Sources
- An exponential query advantage from access to Stinespring dilation unitaries in quantum channel learning
- Optimal tomography of bosonic and fermionic Gaussian states
- Inverse-free quantum state estimation with Heisenberg scaling
- Quantum Algorithm for Reversing Unknown Unitary Evolutions
- A List of Complexity Bounds for Property Testing by Quantum Sample-to-Query Lifting
- Approximation does not help in quantum unitary time-reversal
- Optimal lower bound for quantum channel tomography in away-from-boundary regime
- Quantum Lazy Sampling and Path Recording for Any Group
- Purification enables an unbounded query separation in sequential quantum channel discrimination
- Random purification channel made simple
- Random Stinespring superchannel: converting channel queries into dilation isometry queries
- Quantum Simulation of Random Unitaries from Clebsch-Gordan Transforms
- Advantage of Sample Complexity in Quantum PAC Learning Requires Inverse Access to State-Preparation Unitaries
- Optimal learning of quantum channels in diamond distance
- Random purification channel for passive Gaussian bosons
- Mixed state tomography reduces to pure state tomography
- The Keyl-Werner algorithm is not optimal for spectrum estimation
- Optimal lower bounds for quantum state tomography
- Are controlled unitaries helpful?
Related papers
- Computational regimes in matrix-product-state-based quantum trajectory simulations
- Toward chemically accurate quantum simulations on quantum hardware: A quantum-HPC hybrid approach
- Transversal surface-code game with reconfigurable qubits
- Fulqrum: a generalized framework for quantum subspace diagonalization
- Flux-Activated Resonant Control of a Bosonic Quantum Memory
- Machine learning the effects of many quantum measurements