Discriminating idempotent quantum channels

• URL: http://arxiv.org/abs/2603.28582v1
• Date: Mon, 30 Mar 2026 15:31:40 GMT
• Title: Discriminating idempotent quantum channels
• Abstract summary: We study binary discrimination of idempotent quantum channels.<n>We show that a simple image inclusion condition completely determines the behavior.<n>All error exponents (Stein/Chernoff/strong-converse) are explicitly computable with no adaptive advantage.
• Score: 1.7188280334580195
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We study binary discrimination of idempotent quantum channels. When the two channels share a common full-rank invariant state, we show that a simple image inclusion condition completely determines the asymptotic behavior: when it holds, a broad family of channel divergences collapse to a closed-form, single-letter expression, regularization is unnecessary, and all error exponents (Stein/Chernoff/strong-converse) are explicitly computable with no adaptive advantage. Crucially, this yields the strong converse property for this channel family, which is an important open problem for general channels. When the inclusion fails, asymmetric exponents become infinite, implying perfect asymptotic discrimination. We apply the results to GNS-symmetric channels, showing discrimination rates for large number of self iterations converge exponentially fast to those of the corresponding idempotent peripheral projections. If the two channels do not share a common invariant state, we provide a single-letter converse bound on the regularized sandwiched Rényi cb-divergence, which suffices to establish a strong converse upper bound on the Stein exponents.

Related papers

• Failure of the Asymptotic Equipartition Property for Quantum Channels [2.7074235008521246]
  We show that smoothing over completely positive trace-preserving maps of quantum channels fails in general.<n>Second, the AEP with smoothing over subchannels (completely positive trace-nonincreasing maps) is equivalent to the strong converse for parallel channel Stein's lemma.
  arXiv  Detail & Related papers  (2026-09-14T04:11:20Z)
• Exceptional activated mode theory for generalized real-complex transitions [48.9823527611878]
  Real-to-complex transitions mark the onset of amplification in non-Hermitian systems.<n>We develop a general, non-perturbative activated-mode principle that governs the real-to-complex threshold across broad classes of non-Hermitian systems.
  arXiv  Detail & Related papers  (2026-08-12T18:00:37Z)
• Typical entanglement in anyon chains: Page curves beyond Lie group symmetries [41.99844472131922]
  We study bipartite entanglement statistics in one-dimensional anyon chains constrained by fusion rules of unitary pre-modular categories.<n>Surprisingly, despite the constrained Hilbert space structure, the large $L$ expansion has no universal $O(sqrtL)$ or $O(1)$ symmetry-type corrections.<n> Numerical simulations of the integrable and quantum-chaotic golden chain Hamiltonian show that chaotic mid-spectrum eigenstates match the Haar-random predictions.
  arXiv  Detail & Related papers  (2026-03-26T18:00:03Z)
• Stability and Generalization of Push-Sum Based Decentralized Optimization over Directed Graphs [55.77845440440496]
  Push-based decentralized communication enables optimization over communication networks, where information exchange may be asymmetric.<n>We develop a unified uniform-stability framework for the Gradient Push (SGP) algorithm.<n>A key technical ingredient is an imbalance-aware generalization bound through two quantities.
  arXiv  Detail & Related papers  (2026-02-24T05:32:03Z)
• Random-Matrix-Induced Simplicity Bias in Over-parameterized Variational Quantum Circuits [72.0643009153473]
  We show that expressive variational ansatze enter a Haar-like universality class in which both observable expectation values and parameter gradients concentrate exponentially with system size.<n>As a consequence, the hypothesis class induced by such circuits collapses with high probability to a narrow family of near-constant functions.<n>We further show that this collapse is not unavoidable: tensor-structured VQCs, including tensor-network-based and tensor-hypernetwork parameterizations, lie outside the Haar-like universality class.
  arXiv  Detail & Related papers  (2026-01-05T08:04:33Z)
• Error exponents of quantum state discrimination with composite correlated hypotheses [40.82628972269358]
  We study the error exponents in quantum hypothesis testing between two sets of quantum states.<n>We introduce and compare two natural extensions of the quantum Hoeffding divergence and anti-divergence to sets of quantum states.
  arXiv  Detail & Related papers  (2025-08-18T13:04:06Z)
• Reverse-type Data Processing Inequality [14.394578053743999]
  A quantum data processing inequality asserts that two quantum states become harder to distinguish when a noisy channel is applied.<n>A reverse quantum data processing inequality characterizes whether distinguishability is preserved after the application of a noisy channel.<n>In this work, we explore these concepts through contraction and expansion coefficients of the relative entropy of quantum channels.
  arXiv  Detail & Related papers  (2024-11-29T17:56:36Z)
• Exponents for classical-quantum channel simulation in purified distance [5.598487000369366]
  We determine the exact error and strong converse exponent for entanglement-assisted classical-quantum channel simulation. We critically use various properties of the quantum fidelity, additional auxiliary channel techniques, approximations via Chebyshev inequalities, and entropic continuity bounds.
  arXiv  Detail & Related papers  (2024-10-14T17:45:41Z)
• Exponents for Shared Randomness-Assisted Channel Simulation [10.437113494732605]
  We determine the exact error and strong converse exponents of shared randomness-assisted channel simulation in worst case total-variation distance. Strikingly, and in stark contrast to channel coding, there are no critical rates, allowing a tight characterization for arbitrary rates below and above the simulation capacity.
  arXiv  Detail & Related papers  (2024-10-09T16:45:58Z)
• Error exponent of activated non-signaling assisted classical-quantum channel coding [12.221087476416056]
  We find that the optimal exponent--also called reliability function--is equal to the well-known sphere packing bound. Remarkably, there is no critical rate and our characterization remains tight for arbitrarily low rates below the capacity.
  arXiv  Detail & Related papers  (2024-10-01T21:26:17Z)
• Barycentric bounds on the error exponents of quantum hypothesis exclusion [7.812210699650153]
  We study the optimal error probability of quantum state exclusion from an information-theoretic perspective.<n>We extend our analysis to the more complicated task of quantum channel exclusion.
  arXiv  Detail & Related papers  (2024-07-18T17:27:36Z)
• $\widetilde{O}(N^2)$ Representation of General Continuous Anti-symmetric Function [41.1983944775617]
  In quantum mechanics, the wave function of fermion systems such as many-body electron systems are anti-symmetric and continuous. We prove that our ansatz can represent any AS continuous functions, and can accommodate the determinant-based structure proposed by Hutter.
  arXiv  Detail & Related papers  (2024-02-23T07:59:41Z)
• Usefulness of adaptive strategies in asymptotic quantum channel discrimination [43.7637825272776]
  We investigate the usefulness of adaptive methods in the framework of binary hypothesis testing. There is a fundamental distinction between adaptive and non-adaptive strategies with respect to the channel uses. We show that adaptive strategies with classical feedback do not increase the discrimination power of the channel beyond non-adaptive product input strategies.
  arXiv  Detail & Related papers  (2020-11-12T18:40:47Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.