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

Choi-Kernel Entanglement Determines When Quantum Channels Become Perfectly Excludable

Zongmin Liu

Published Oct 9, 2025• 0 citations
Publisher

Abstract

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.

DOI
10.5281/zenodo.23129016

Related papers

Exact Reference-Assisted Entropy Contraction from the Choi Matrix

Harjas Sandhu

How much distinguishability can a noisy quantum channel preserve when its input is correlated with an untouched quantum memory? This paper gives an exact finite semidefinite program for that question for every finite-dimensional completely positive, trace-preserving channel. The complete coefficient compares joint states with the same memory marginal. The conditional coefficient instead subtracts the distinguishability already present in the memory. Both coefficients, and conditional mutual-information contraction with a separate conditioning system, equal one minus the reciprocal of an optimization in the channel’s unnormalized Choi matrix. The equivalent inverse formula retains an essential range condition, including for singular channels. The proof solves a centered matrix-Gram problem, shows that its optimization center can be positive, and constructs a signed observable lift through an erasure channel. Two weighted quadratic inequalities give the universal entropy bound. A rare coherent memory sector proves sharpness while preserving both local marginals exactly. A memory of bounded dimension suffices, including with prescribed faithful input marginals. The same program gives exact coefficients for regular modular Petz divergences whose generators have finite endpoint value and recession slope, every fixed Petz Rényi order strictly between zero and one, and quantum Chernoff divergence. Further results include a harmonic dual, an exact tensor-product law, a strict-contraction criterion, a sharp comparison with positive quantum Doeblin minorization, and explicit classical, depolarizing and orthogonal-unitary-noise formulas. Ordinary quantum mutual-information contraction is a different optimization. For qubit depolarization the paper determines its exact value on the full completely positive parameter interval. At shrinkage one half, ordinary relative-entropy, ordinary mutual-information and complete entropy contraction are respectively 1/4, 1/3 and 3/8. In higher dimension, bounds and a strict separation are proved without asserting an exact ordinary-MI formula. A discontinuity between nearly complete amplitude damping and pure reset rules out uniformly bounded-use estimation of the exact coefficient from an unknown channel, even with adaptive experiments and quantum ancillas. Thus evaluation from exact supplied Choi data does not imply stable experimental acquisition. Rare sharpness witnesses can carry vanishing absolute information; the results do not assert a communication rate, physical simulator, general recovery map or polynomial cost in physical qubit count.

•Nov 14, 2026•0 citations

Anti-distinguishability of quantum channels

Ardra Ajitha Vijayan, Nidhin Sudarsanan Ragini

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.

quant-pharXiv:2611.04105•Nov 4, 2026•0 citations

Classical Capacity and Entanglement Cost of the Amplitude Damping Channel

Ziao Tang, Chengkai Zhu, Ge Bai +1 more

Determining a noisy quantum channel's classical capacity and entanglement cost generally requires regularization over many channel uses. We remove both regularizations for every qubit-to-qubit channel admitting a pure output. For each such channel, Holevo information, channel entanglement of formation, and parallel entanglement cost are additive with those of any finite-dimensional partner channel. This class includes all qubit-to-qubit channels of Kraus rank at most two. For the amplitude damping channel with damping probability $p$, the unassisted classical capacity equals the known single-use Holevo information, attained by a binary pure-state ensemble with collective decoding, and the entanglement cost is $h_2((1+\sqrt p)/2)$ ebits per use. The common mechanism is a support criterion for strong superadditivity of entanglement of formation: one marginal has no support on the sector in which both local systems are orthogonal to fixed distinguished vectors. We prove this criterion in arbitrary finite dimensions using a triangular block-matrix entropy inequality and decompositions preserving two expectations. For amplitude damping, we also derive an exact finite-block Holevo deficit, identify the unique optimal average input for $p<1$, and construct a binary Kraus representation attaining the uniform formation bound.

quant-pharXiv:2609.28592•Sep 24, 2026•3 citations

Nonadditivity in fermionic quantum Shannon theory

Farzin Salek, Amir-Reza Negari, Graeme Smith +2 more

We study collective state preparation and channel encoding in fermionic systems under parity superselection and composition governed by the canonical anticommutation relations. For a two-mode Gaussian state $τ$, we obtain the exact entanglement of formation, $E_{\mathrm F}^{\mathrm{phys}}(τ^{\otimes m})=\lceil m/2\rceil\log2$ for every $m\geq1$. Two copies have the same formation value as one, violating additivity and strong superadditivity, while regularization halves the single-copy value. For an associated Gaussian channel, we determine the minimum output entropy and Holevo information at every blocklength and prove nonadditivity of both. Together, these results give exact answers to the fermionic counterparts of the four additivity questions associated with Shor and Hastings. One physical use carries no classical information, whereas two uses transmit one bit perfectly. The unassisted classical and zero-error classical capacities both equal one half bit per mode. A sharp finite-block bound gives a strong converse: the decoding success probability vanishes at every rate above capacity. These optimizations cover all physical pure-state decompositions and channel inputs, with Gaussian ensembles and classical codes attaining the optima. The formation and minimum output entropy formulas hold for every Rényi order $α\in(0,\infty]$. We also determine the unassisted quantum and zero-error quantum capacities, both equal to one half logical qubit per mode, and prove a strong converse: entanglement fidelity vanishes at every rate above capacity. For a noisy Gaussian family, we determine the one- and two-copy formation values and prove strict nonadditivity at full rank. For $τ$, Bell violation under local parity-preserving measurements first appears at three copies.

quant-pharXiv:2610.06758•Oct 6, 2026•0 citations

Exact Complete Relative-Entropy Contraction of Finite Quantum Channels

Ying Xie

We determine the complete equal-reference Umegaki relative-entropy contraction coefficient of every finite-dimensional quantum channel. For its unnormalized Choi matrix J, let H be the largest output subspace with ℂⁿ ⊗ H ⊆ supp J, and let M(ρ) be the compression to H of Tr_A[(ρᵀ ⊗ I)J⁺]. The coefficient is 1 − min_ρ Tr_H M(ρ)⁻¹, with the minimum set to zero when H = {0}. A Kraus cancellation inequality gives the upper bound, and a weighted trace-zero operator basis gives matching faithful pairs with both marginals equal and reference dimension n². The complementary coefficient has a reciprocal radius formula, a finite semidefinite representation, and an exact product law. Strict contraction is equivalent to a nonzero completely positive replacer minorant. The formula also gives the exact coefficient of depolarizing channels throughout their physical parameter range. The general matching family has vanishing input divergence; its logarithmic rate is pointwise for a fixed faithful input density, with separate finite-accuracy bounds for optimization and conditioning. A different construction retains any prescribed positive limiting divergence when the coefficient is one. This cannot hold universally: a complete nonlinear bound for binary symmetric channels forces every maximizing sequence to lose input divergence, regardless of reference dimension. The positive construction still has vanishing trace distance and exponentially small regularization; no fixed-error or capacity conclusion follows. A visual guide records the mathematical routes, proof dependencies, and provenance of the result.

•Nov 8, 2026•0 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
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.
How much distinguishability can a noisy quantum channel preserve when its input is correlated with an untouched quantum memory? This paper gives an exact finite semidefinite program for that question for every finite-dimensional completely positive, trace-preserving channel. The complete coefficient compares joint states with the same memory marginal. The conditional coefficient instead subtracts the distinguishability already present in the memory. Both coefficients, and conditional mutual-information contraction with a separate conditioning system, equal one minus the reciprocal of an optimization in the channel’s unnormalized Choi matrix. The equivalent inverse formula retains an essential range condition, including for singular channels. The proof solves a centered matrix-Gram problem, shows that its optimization center can be positive, and constructs a signed observable lift through an erasure channel. Two weighted quadratic inequalities give the universal entropy bound. A rare coherent memory sector proves sharpness while preserving both local marginals exactly. A memory of bounded dimension suffices, including with prescribed faithful input marginals. The same program gives exact coefficients for regular modular Petz divergences whose generators have finite endpoint value and recession slope, every fixed Petz Rényi order strictly between zero and one, and quantum Chernoff divergence. Further results include a harmonic dual, an exact tensor-product law, a strict-contraction criterion, a sharp comparison with positive quantum Doeblin minorization, and explicit classical, depolarizing and orthogonal-unitary-noise formulas. Ordinary quantum mutual-information contraction is a different optimization. For qubit depolarization the paper determines its exact value on the full completely positive parameter interval. At shrinkage one half, ordinary relative-entropy, ordinary mutual-information and complete entropy contraction are respectively 1/4, 1/3 and 3/8. In higher dimension, bounds and a strict separation are proved without asserting an exact ordinary-MI formula. A discontinuity between nearly complete amplitude damping and pure reset rules out uniformly bounded-use estimation of the exact coefficient from an unknown channel, even with adaptive experiments and quantum ancillas. Thus evaluation from exact supplied Choi data does not imply stable experimental acquisition. Rare sharpness witnesses can carry vanishing absolute information; the results do not assert a communication rate, physical simulator, general recovery map or polynomial cost in physical qubit count.
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.
Determining a noisy quantum channel's classical capacity and entanglement cost generally requires regularization over many channel uses. We remove both regularizations for every qubit-to-qubit channel admitting a pure output. For each such channel, Holevo information, channel entanglement of formation, and parallel entanglement cost are additive with those of any finite-dimensional partner channel. This class includes all qubit-to-qubit channels of Kraus rank at most two. For the amplitude damping channel with damping probability ppp, the unassisted classical capacity equals the known single-use Holevo information, attained by a binary pure-state ensemble with collective decoding, and the entanglement cost is h2((1+p)/2)h_2((1+\sqrt p)/2)h2​((1+p​)/2) ebits per use. The common mechanism is a support criterion for strong superadditivity of entanglement of formation: one marginal has no support on the sector in which both local systems are orthogonal to fixed distinguished vectors. We prove this criterion in arbitrary finite dimensions using a triangular block-matrix entropy inequality and decompositions preserving two expectations. For amplitude damping, we also derive an exact finite-block Holevo deficit, identify the unique optimal average input for p<1p<1p<1, and construct a binary Kraus representation attaining the uniform formation bound.
We study collective state preparation and channel encoding in fermionic systems under parity superselection and composition governed by the canonical anticommutation relations. For a two-mode Gaussian state τττ, we obtain the exact entanglement of formation, EFphys(τ⊗m)=⌈m/2⌉log⁡2E_{\mathrm F}^{\mathrm{phys}}(τ^{\otimes m})=\lceil m/2\rceil\log2EFphys​(τ⊗m)=⌈m/2⌉log2 for every m≥1m\geq1m≥1. Two copies have the same formation value as one, violating additivity and strong superadditivity, while regularization halves the single-copy value. For an associated Gaussian channel, we determine the minimum output entropy and Holevo information at every blocklength and prove nonadditivity of both. Together, these results give exact answers to the fermionic counterparts of the four additivity questions associated with Shor and Hastings. One physical use carries no classical information, whereas two uses transmit one bit perfectly. The unassisted classical and zero-error classical capacities both equal one half bit per mode. A sharp finite-block bound gives a strong converse: the decoding success probability vanishes at every rate above capacity. These optimizations cover all physical pure-state decompositions and channel inputs, with Gaussian ensembles and classical codes attaining the optima. The formation and minimum output entropy formulas hold for every Rényi order α∈(0,∞]α\in(0,\infty]α∈(0,∞]. We also determine the unassisted quantum and zero-error quantum capacities, both equal to one half logical qubit per mode, and prove a strong converse: entanglement fidelity vanishes at every rate above capacity. For a noisy Gaussian family, we determine the one- and two-copy formation values and prove strict nonadditivity at full rank. For τττ, Bell violation under local parity-preserving measurements first appears at three copies.
We determine the complete equal-reference Umegaki relative-entropy contraction coefficient of every finite-dimensional quantum channel. For its unnormalized Choi matrix J, let H be the largest output subspace with ℂⁿ ⊗ H ⊆ supp J, and let M(ρ) be the compression to H of Tr_A[(ρᵀ ⊗ I)J⁺]. The coefficient is 1 − min_ρ Tr_H M(ρ)⁻¹, with the minimum set to zero when H = {0}. A Kraus cancellation inequality gives the upper bound, and a weighted trace-zero operator basis gives matching faithful pairs with both marginals equal and reference dimension n². The complementary coefficient has a reciprocal radius formula, a finite semidefinite representation, and an exact product law. Strict contraction is equivalent to a nonzero completely positive replacer minorant. The formula also gives the exact coefficient of depolarizing channels throughout their physical parameter range. The general matching family has vanishing input divergence; its logarithmic rate is pointwise for a fixed faithful input density, with separate finite-accuracy bounds for optimization and conditioning. A different construction retains any prescribed positive limiting divergence when the coefficient is one. This cannot hold universally: a complete nonlinear bound for binary symmetric channels forces every maximizing sequence to lose input divergence, regardless of reference dimension. The positive construction still has vanishing trace distance and exponentially small regularization; no fixed-error or capacity conclusion follows. A visual guide records the mathematical routes, proof dependencies, and provenance of the result.
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.