Anti-distinguishability of quantum channels
quant-ph
Submitted: 2026-11-03
Updated: 2026-11-03
Comments: 26 pages, 1 figure. Comments are welcome!
License: http://creativecommons.org/licenses/by/4.0/
The gist: We study single-query perfect anti-distinguishability/exclusion tasks of finite quantum channel ensembles, primarily using associated Choi operators and process POVMs.
Terminology
Abstract
We study single-query perfect anti-distinguishability/exclusion tasks of finite quantum channel ensembles, primarily using associated Choi operators and process POVMs. Weak perfect anti-distinguishability requires each measurement outcome to exclude an ensemble candidate with certainty, whereas the strong form additionally requires every candidate to have an exclusion outcome occurring with non-zero probability. For pairs of channels, both coincide with perfect distinguishability, whereas larger ensembles exhibit separations. We derive Choi-operator-support-based obstructions: weak exclusion requires at least two rank-deficient Choi operators, while strong exclusion requires the support of every candidate Choi operator to be strictly contained in the joint Choi support. The common Choi support must also lie in the kernel of the PPOVM normalisation. For commuting Choi operators, this condition is sufficient for weak exclusion when the normalisation also commutes with them. Conversely, a nonzero admixture of the same noise channel into every candidate precludes weak exclusion for any probe. We apply these results to measure-and-prepare, state-space contraction, Pauli, and replacer channels. In particular, the full permutation-channel ensemble of an unlabeled POVM is strongly anti-distinguishable exactly when some POVM effect is rank-deficient, while replacer-channel exclusion reduces to state exclusion. A Choi-commuting ensemble exhibits strong exclusion with an unassisted probe although no positive-definite PPOVM normalisation permits even weak exclusion. In contrast, commuting qubit phase gates, whose Choi operators need not commute, admit exact convex-hull criteria for weak and strong exclusion, both attainable without assistance.
Sources
- Hypothesis testing with open quantum systems
- Robust Online Hamiltonian Learning
- Hamiltonian Learning and Certification Using Quantum Resources
- Robust and Efficient Hamiltonian Learning
- Hamiltonian Property Testing
- Quantum Hamiltonian Certification
- Conditions for compatibility of quantum state assignments
- Simple Information Processing Tasks with Unbounded Quantum Advantage
- Failure of epistemic models to explain the antidistinguishability of quantum mixed preparations
- Noncontextuality Inequalities from Antidistinguishability
- How contextuality and antidistinguishability are related
- Conclusive Exclusion of Quantum States
- A note on the inner products of pure states and their antidistinguishability
- Tight bounds for antidistinguishability and circulant sets of pure quantum states
- The pretty bad measurement
- Quantum state exclusion with many copies
- Quantum state exclusion for group-generated ensembles of pure states
- Conclusive exclusion of quantum states with group action
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