arXiv:2611.04105
Anti-distinguishability of quantum channels
Ardra Ajitha Vijayan, Nidhin Sudarsanan Ragini
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.
AI Summary
The paper studies when a finite ensemble of quantum channels permits perfect exclusion with one query, allowing arbitrary probes and auxiliary systems. Weak perfect anti-distinguishability requires every observed outcome to exclude a candidate with certainty; strong exclusion additionally requires an exclusion outcome for every candidate that occurs with nonzero probability for some ensemble member. Using Choi operators and process POVMs, it derives support-based obstructions. Weak exclusion requires at least two rank-deficient Choi operators, while strong exclusion requires each candidate’s support to be strictly smaller than the joint Choi support. The common Choi support must lie in the kernel of the tester normalisation. Any positive admixture of the same channel into every candidate prevents even weak exclusion. For two candidates, both exclusion notions coincide with perfect discrimination; larger ensembles exhibit strict separations. Exact criteria follow for several families. For commuting Choi operators and a commuting tester normalisation, the common-support condition is also sufficient, proved by distributing spectral weights among exclusion outcomes. For Pauli channels, every Pauli label must have zero probability in at least one candidate. The full permutation-channel ensemble of an unlabeled POVM admits strong exclusion exactly when some effect is rank-deficient. For commuting qubit phase gates, weak and strong exclusion correspond respectively to the origin lying in the convex hull and relative interior of the relative-phase points; unassisted probes suffice. The scope is finite-dimensional, single-query, zero-error exclusion. Minimum-error performance, multiple queries, memory channels, adaptivity and unambiguous exclusion are left for future study.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
- Comments
- 26 pages, 1 figure. Comments are welcome!