Contraction and Expansion Values of Quantum Channels
- URL: http://arxiv.org/abs/2607.04950v1
- Date: Mon, 06 Jul 2026 11:25:19 GMT
- Title: Contraction and Expansion Values of Quantum Channels
- Abstract summary: We introduce the emphcontraction and expansion values, two monotone sequences that refine the contraction and expansion coefficients.<n>We compute or estimate them for single-qubit channels, $d$-dimensional amplitude damping channels, and direct-sum channels.
- Score: 0.21485350418225244
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: The contraction coefficient of the trace distance is a central tool in quantum information, quantifying how strongly a quantum channel degrades the distinguishability of states. However, being an extremal ratio, it captures only the most optimistic behaviour of the channel and is often trivial, even for very noisy channels. Moreover, a single scalar is poorly suited to describe how contraction accumulates under channel composition. In this work we introduce the \emph{contraction and expansion values}, two monotone sequences that refine the contraction and expansion coefficients in the same way singular values refine the operator norm. They arise from a min--max variational principle over subspaces of traceless Hermitian operators, admit an operational interpretation in terms of two state-discrimination games, and are shown to coincide with the Gel'fand or Bernstein numbers of the channel restricted to traceless operators. This identification places the sequences within Pietsch's theory of $s$-numbers and yields, in particular, bounds under channel composition that the contraction coefficient alone cannot provide. We establish their main structural properties and compute or estimate them for single-qubit channels, $d$-dimensional amplitude damping channels, and direct-sum channels.
Related papers
- Asymptotic Limits of Entanglement Distribution [43.748379918040854]
We investigate the limits of entanglement distribution across quantum networks utilizing intermediate stations and local operations.<n>We establish a strict dichotomy: the preservation of entanglement over arbitrarily long distances is possible if the underlying quantum channel admits a correctable subspace.<n>We derive a fundamental lower bound on the physical resource requirements, proving that for channels without a correctable subspace, the number of parallel channels per link must scale at least logarithmically with the number of intermediate stations to sustain a non-zero amount of entanglement.
arXiv Detail & Related papers (2026-05-22T09:56:38Z) - Circulant quantum channels and its applications [7.293435425629241]
This note introduces a family of circulant quantum channels -- a subclass of the mixed-permutation channels.<n>We show that the image of the circulant quantum channel is precisely the set of circulant matrices.<n>We prove that the channel is entanglement-breaking, implying a substantially reduced resource cost for erasing quantum correlations.
arXiv Detail & Related papers (2026-01-23T04:22:15Z) - Flagged Extensions and Numerical Simulations for Quantum Channel Capacity: Bridging Theory and Computation [0.0]
I will investigate the capacities of noisy quantum channels through a combined analytical and numerical approach.<n>I introduce novel flagged extension techniques that embed a channel into a higher-dimensional space.<n>My results refine previous bounds and clarify noise thresholds beyond which quantum transmission vanishes.
arXiv Detail & Related papers (2025-06-03T22:21:08Z) - Statistical Mean Estimation with Coded Relayed Observations [42.545965302772174]
We consider a problem of statistical mean estimation in which the samples are not observed directly, but are instead observed by a relay (teacher'') that transmits information through a memoryless channel to the decoder (student'')<n>We consider the minimax estimation error in the large deviations regime, and establish achievable error exponents that are tight in broad regimes of the estimation accuracy and channel quality.
arXiv Detail & Related papers (2025-05-14T03:07:05Z) - Rate-reliability tradeoff for deterministic identification [49.126395046088014]
We find that for positive exponents linear scaling is restored, now with a rate that is a function of the reliability exponents.<n>We also show that even if only one of the two errors is required to be exponentially small, the linearithmic scaling is lost.
arXiv Detail & Related papers (2025-02-04T15:09:14Z) - 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) - Weyl channels for multipartite systems [42.37986459997699]
Quantum channels describe unitary and non-unitary evolution of quantum systems.
We show that these channels are completely characterized by elements drawn of finite cyclic groups.
arXiv Detail & Related papers (2023-10-17T02:45:47Z) - Reliable Simulation of Quantum Channels: the Error Exponent [5.8303977553652]
We study the error exponent of quantum channel simulation, which characterizes the optimal speed of exponential convergence.<n>We obtain an achievability bound for quantum channel simulation in the finite-blocklength setting.
arXiv Detail & Related papers (2021-12-08T18:55:54Z) - Channel-Wise Early Stopping without a Validation Set via NNK Polytope
Interpolation [36.479195100553085]
Convolutional neural networks (ConvNets) comprise high-dimensional feature spaces formed by the aggregation of multiple channels.
We present channel-wise DeepNNK, a novel generalization estimate based on non-dimensional kernel regression (NNK) graphs.
arXiv Detail & Related papers (2021-07-27T17:33:30Z) - Coherent control and distinguishability of quantum channels via
PBS-diagrams [59.94347858883343]
We introduce a graphical language for coherent control of general quantum channels inspired by practical quantum optical setups involving polarising beam splitters (PBS)
We characterise the observational equivalence of purified channels in various coherent-control contexts, paving the way towards a faithful representation of quantum channels under coherent control.
arXiv Detail & Related papers (2021-03-02T22:56:25Z) - Coherence dynamics induced by attenuation and amplification Gaussian
channels [0.0]
We study the coherence dynamics introduced by these channels on input states.
We write a simple expression for computing the entropy production due to the coherence for both channels.
This can be useful to simulate many processes in quantum thermodynamics, as finite-time driving on bosonic modes.
arXiv Detail & Related papers (2020-10-29T01:21:03Z)
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.