Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2611.04105

Anti-distinguishability of quantum channels

Ardra Ajitha Vijayan, Nidhin Sudarsanan Ragini

quant-phSubmitted Nov 3, 2026• Announced Nov 4, 2026• 0 citations
arXivHTMLPDF

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.

Little sign of AI-generated textIncremental

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!

Related papers

Operational interpretation of the Choi rank through exclusion tasks

Benjamin Stratton, Chung-Yun Hsieh, Paul Skrzypczyk

The Choi state is an indispensable tool in the study and analysis of quantum channels. Considering a channel in terms of its associated Choi state can greatly simplify problems. It also offers an alternative approach to the characterization of a channel, with properties of the Choi state providing novel insight into a channel's behavior. The rank of a Choi state, termed the Choi rank, has proven to be an important characterizing property, and here, its significance is further elucidated through an operational interpretation. The Choi rank is shown to provide a universal bound on how successfully two agents, Alice and Bob, can perform an entanglement-assisted exclusion task. The task can be considered an extension of superdense coding, where Bob can only output information about Alice's encoded bit string with certainty. Conclusive state exclusion, in place of state discrimination, is therefore considered at the culmination of the superdense coding protocol. In order to prove this result, a necessary condition for conclusive k -state exclusion of a set of states is presented in order to achieve this result, and the notions of weak and strong exclusion are introduced.

arXiv:2406.08360•Physical Review A•Nov 13, 2024•7 citations

Operational Concealment of Measurement Incompatibility by Quantum Channels: Rank Loss versus Contraction

Mohd Asad Siddiqui, Zizhu Wang

Quantum measurements can remain incompatible yet become impossible to certify when all probe states first pass through a quantum channel. We formulate this loss of certifiability as operational concealment and identify its exact finite-dimensional threshold. Under tomographically complete input access, a channel conceals some incompatible binary POVM pair if and only if its Heisenberg adjoint has nontrivial kernel. Thus, in this channel restricted single-use setting, rank loss rather than contraction is the universal transition for exact concealment: injective dissipative dynamics may render the effective measurements compatible while leaving exact concealment impossible. We quantify this distinction through a minimum-gain lower bound and show that regular time-local dynamics cannot produce exact concealment at finite time. We then classify all qubit channels whose adjoint fibres admit a positive unital retraction, reducing concealment to ordinary joint measurability of canonical representatives. For orthogonal projected qubit measurements we obtain an exact robustness formula and a strict separation from ordinary incompatibility robustness. Finally, quotient-space duality expresses this robustness as an experimentally accessible additive advantage in positive-payoff channel-output games. We also prove invariance under adjoining a passive finite-dimensional reference system for lifted target measurements, even when arbitrary joint compatible simulators are allowed on the enlarged output space. These results establish rank-sensitive criteria for certifying measurement incompatibility under restricted channel access.

quant-pharXiv:2607.11762•Jul 14, 2026•0 citations

Choi-Kernel Entanglement Determines When Quantum Channels Become Perfectly Excludable

Zongmin Liu

Perfect exclusion of quantum states can emerge under collective measurements even when it is impossible on a single copy. We establish the corresponding finite-copy activation law for quantum channels using the Doeblin coefficient of \(n\) channel uses. For every qubit channel, the coefficient vanishes after exactly \(\lceil \ln 2/\ln(1+r^\star)\rceil\) uses, where \(r^\star\) is the largest ratio of Schmidt coefficients among vectors in the kernel of the channel's Choi operator; it remains nonzero for all \(n\) when that kernel contains no entangled vector. The two directions admit closed-form certificates: above the threshold, a loop intervention consisting of one diagonal phase gate and local unitaries; below it, a diagonal dual witness. Classical--quantum channels recover the Pusey--Barrett--Rudolph threshold, while amplitude damping recovers the exact value of the corresponding exclusion game. In arbitrary dimension, a kernel vector with Schmidt coefficients \(c\) reduces the problem to a universal correlation-matrix optimization whose threshold is \(\lceil \ln 2/\ln(1+c_{\min}/c_{\max})\rceil\). Hence every channel whose Choi kernel contains a full-Schmidt-rank vector becomes perfectly excludable after finitely many uses, with an exact formula when the kernel is one-dimensional. For qubit channels, finite-copy perfect exclusion is equivalent to divergence of the regularized Doeblin information and therefore to an infinite asymptotic retrocausal capacity, attained with zero error after finitely many uses.

•Oct 9, 2025•0 citations

Frame phase retrievability and state distinguishability of quantum channels

Deguang Han, Kai Liu

This survey introduces the role of frame phase retrieval in pure-state identification and information preservation by quantum channels. For unit vectors, the lift $x\mapsto xx^*$ identifies vectors that differ only by a global phase with the same rank-one quantum state, converts frame intensities into linear functionals of the lifted state, and makes the adjoint pullback of output observables an operator-valued measurement on the input system. From this viewpoint, a channel is phase retrievable exactly when it is injective on pure states. We develop this correspondence through Choi-rank-two linear combinations of Kraus operators, higher-rank relative spectra, structural obstructions, and constructions with prescribed Choi rank. We distinguish injective identification from full tomography, perfect one-shot discrimination, zero-error classical communication, and exact quantum correction. Twirling channels then provide a structured setting in which commutants, irreducible dimensions, multiplicities, orbit-frame orthogonality, coding indices, and phase-retrievable subspaces can be read from group representations.

quant-pharXiv:2608.30006•Sep 1, 2026•0 citations

Local state antimarking : Nonlocality without entanglement

Biswadeep Chatterjee, Tathagata Gupta, Pratik Ghosal +1 more

A set of quantum states is said to be antidistinguishable if, upon being given a randomly chosen state from the set, it is possible to exclude with certainty a state that was definitely not prepared. We study quantum nonlocality within the framework of local state exclusion and prove that any set of multipartite pure states containing a state that is orthogonal to all the others is locally antidistinguishable. Next, we introduce the task of $\textit{local state antimarking}$, where, instead of a single state, a non-repetitive sequence of states from a known set of multipartite states is randomly selected and distributed to spatially separated parties, whose objective is to identify, using LOCC, at least one sequence that was not supplied. We present an ensemble of product states that is not globally antidistinguishable; yet, by choosing states from it without replacement, one can construct sequences that can be perfectly excluded globally but, importantly, not locally. This reveals a hitherto unexplored form of `nonlocality without entanglement'. Finally, for a given ensemble, we compare its local antidistinguishability and antimarkability with its conclusive local distinguishability and markability. We demonstrate that no strict hierarchy exists between these paradigms: there exist product-state ensembles that permit one task while strictly forbidding the other, and vice versa.

quant-pharXiv:2605.09710•May 12, 2026•0 citations

Anti-isomorphisms and the naturality of channel--state duality

Marcin Marciniak, Michał Cholewiak

Channel--state duality identifies completely positive maps with bipartite states. Its generalisation to von Neumann algebras is known to produce states not on $\mathcal{M}\bar{\otimes}\mathcal{N}$ but on the tensor product of $\mathcal{M}$ with the \emph{opposite} algebra of $\mathcal{N}$, or equivalently with a commutant; returning to $\mathcal{N}$ itself requires a transposition, and it has been observed that this step typically fails. We determine exactly when it does not fail. Our main result is that a Choi--Jamiołkowski type isomorphism which is natural in the first algebra exists if and only if the second algebra is $*$-anti-isomorphic to itself. Naturality cannot be dropped: whenever $\mathcal{M}$ is anti-isomorphic to itself such an isomorphism exists for trivial reasons, since the order structure of a predual is a Jordan invariant and cannot distinguish an algebra from its opposite. Consequently no such correspondence exists for the type III factors constructed by Connes. We show in addition that the domain admits no description in terms of properties of individual maps: the space of all normal maps with the operator norm is too large, and neither complete boundedness nor complete positivity cuts it down to the right size.

math.OACross-listedarXiv:2608.13750•Entropy•Aug 17, 2026•0 citations
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.
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.
The Choi state is an indispensable tool in the study and analysis of quantum channels. Considering a channel in terms of its associated Choi state can greatly simplify problems. It also offers an alternative approach to the characterization of a channel, with properties of the Choi state providing novel insight into a channel's behavior. The rank of a Choi state, termed the Choi rank, has proven to be an important characterizing property, and here, its significance is further elucidated through an operational interpretation. The Choi rank is shown to provide a universal bound on how successfully two agents, Alice and Bob, can perform an entanglement-assisted exclusion task. The task can be considered an extension of superdense coding, where Bob can only output information about Alice's encoded bit string with certainty. Conclusive state exclusion, in place of state discrimination, is therefore considered at the culmination of the superdense coding protocol. In order to prove this result, a necessary condition for conclusive k -state exclusion of a set of states is presented in order to achieve this result, and the notions of weak and strong exclusion are introduced.
Quantum measurements can remain incompatible yet become impossible to certify when all probe states first pass through a quantum channel. We formulate this loss of certifiability as operational concealment and identify its exact finite-dimensional threshold. Under tomographically complete input access, a channel conceals some incompatible binary POVM pair if and only if its Heisenberg adjoint has nontrivial kernel. Thus, in this channel restricted single-use setting, rank loss rather than contraction is the universal transition for exact concealment: injective dissipative dynamics may render the effective measurements compatible while leaving exact concealment impossible. We quantify this distinction through a minimum-gain lower bound and show that regular time-local dynamics cannot produce exact concealment at finite time. We then classify all qubit channels whose adjoint fibres admit a positive unital retraction, reducing concealment to ordinary joint measurability of canonical representatives. For orthogonal projected qubit measurements we obtain an exact robustness formula and a strict separation from ordinary incompatibility robustness. Finally, quotient-space duality expresses this robustness as an experimentally accessible additive advantage in positive-payoff channel-output games. We also prove invariance under adjoining a passive finite-dimensional reference system for lifted target measurements, even when arbitrary joint compatible simulators are allowed on the enlarged output space. These results establish rank-sensitive criteria for certifying measurement incompatibility under restricted channel access.
Perfect exclusion of quantum states can emerge under collective measurements even when it is impossible on a single copy. We establish the corresponding finite-copy activation law for quantum channels using the Doeblin coefficient of nnn channel uses. For every qubit channel, the coefficient vanishes after exactly ⌈ln⁡2/ln⁡(1+r⋆)⌉\lceil \ln 2/\ln(1+r^\star)\rceil⌈ln2/ln(1+r⋆)⌉ uses, where r⋆r^\starr⋆ is the largest ratio of Schmidt coefficients among vectors in the kernel of the channel's Choi operator; it remains nonzero for all nnn when that kernel contains no entangled vector. The two directions admit closed-form certificates: above the threshold, a loop intervention consisting of one diagonal phase gate and local unitaries; below it, a diagonal dual witness. Classical--quantum channels recover the Pusey--Barrett--Rudolph threshold, while amplitude damping recovers the exact value of the corresponding exclusion game. In arbitrary dimension, a kernel vector with Schmidt coefficients ccc reduces the problem to a universal correlation-matrix optimization whose threshold is ⌈ln⁡2/ln⁡(1+cmin⁡/cmax⁡)⌉\lceil \ln 2/\ln(1+c_{\min}/c_{\max})\rceil⌈ln2/ln(1+cmin​/cmax​)⌉. Hence every channel whose Choi kernel contains a full-Schmidt-rank vector becomes perfectly excludable after finitely many uses, with an exact formula when the kernel is one-dimensional. For qubit channels, finite-copy perfect exclusion is equivalent to divergence of the regularized Doeblin information and therefore to an infinite asymptotic retrocausal capacity, attained with zero error after finitely many uses.
This survey introduces the role of frame phase retrieval in pure-state identification and information preservation by quantum channels. For unit vectors, the lift x↦xx∗x\mapsto xx^*x↦xx∗ identifies vectors that differ only by a global phase with the same rank-one quantum state, converts frame intensities into linear functionals of the lifted state, and makes the adjoint pullback of output observables an operator-valued measurement on the input system. From this viewpoint, a channel is phase retrievable exactly when it is injective on pure states. We develop this correspondence through Choi-rank-two linear combinations of Kraus operators, higher-rank relative spectra, structural obstructions, and constructions with prescribed Choi rank. We distinguish injective identification from full tomography, perfect one-shot discrimination, zero-error classical communication, and exact quantum correction. Twirling channels then provide a structured setting in which commutants, irreducible dimensions, multiplicities, orbit-frame orthogonality, coding indices, and phase-retrievable subspaces can be read from group representations.
A set of quantum states is said to be antidistinguishable if, upon being given a randomly chosen state from the set, it is possible to exclude with certainty a state that was definitely not prepared. We study quantum nonlocality within the framework of local state exclusion and prove that any set of multipartite pure states containing a state that is orthogonal to all the others is locally antidistinguishable. Next, we introduce the task of local state antimarking\textit{local state antimarking}local state antimarking, where, instead of a single state, a non-repetitive sequence of states from a known set of multipartite states is randomly selected and distributed to spatially separated parties, whose objective is to identify, using LOCC, at least one sequence that was not supplied. We present an ensemble of product states that is not globally antidistinguishable; yet, by choosing states from it without replacement, one can construct sequences that can be perfectly excluded globally but, importantly, not locally. This reveals a hitherto unexplored form of `nonlocality without entanglement'. Finally, for a given ensemble, we compare its local antidistinguishability and antimarkability with its conclusive local distinguishability and markability. We demonstrate that no strict hierarchy exists between these paradigms: there exist product-state ensembles that permit one task while strictly forbidding the other, and vice versa.
Channel--state duality identifies completely positive maps with bipartite states. Its generalisation to von Neumann algebras is known to produce states not on M⊗ˉN\mathcal{M}\bar{\otimes}\mathcal{N}M⊗ˉ​N but on the tensor product of M\mathcal{M}M with the \emph{opposite} algebra of N\mathcal{N}N, or equivalently with a commutant; returning to N\mathcal{N}N itself requires a transposition, and it has been observed that this step typically fails. We determine exactly when it does not fail. Our main result is that a Choi--Jamiołkowski type isomorphism which is natural in the first algebra exists if and only if the second algebra is ∗*∗-anti-isomorphic to itself. Naturality cannot be dropped: whenever M\mathcal{M}M is anti-isomorphic to itself such an isomorphism exists for trivial reasons, since the order structure of a predual is a Jordan invariant and cannot distinguish an algebra from its opposite. Consequently no such correspondence exists for the type III factors constructed by Connes. We show in addition that the domain admits no description in terms of properties of individual maps: the space of all normal maps with the operator norm is too large, and neither complete boundedness nor complete positivity cuts it down to the right size.