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:quant-ph/0601071 · Communications in Mathematical Physics

A Relation Between Completely Bounded Norms and Conjugate Channels

Anna Jenčová

Published May 8, 2006• 14 citations
arXivHTMLPDF
DOI
10.1007/s00220-006-0035-z

Related papers

Channel capacities via p-summing norms

Marius Junge, Carlos Palazuelos

arXiv:1305.1020•Advances in Mathematics•Dec 31, 2014•10 citations

Completely Bounded Qusi-Norms, Their Mutiplicativity, and New Additivity Results of Quantum Channels

Ke Li, Quanhua Xu

We obtain two new additivity results of quantum channels. The first one is the additivity of the channel Rényi information associated with the sandwiched Rényi divergence of order $α\in[\frac{1}{2},1)$. To prove this, we introduce the completely bounded $1\toα$ quasi-norms for completely positive maps, with $α\in[\frac{1}{2},1)$, and show that it is multiplicative. The additivity/multiplicativity derived here extends and complements the results of Devetak {\it et al} (Commun Math Phys 266:37-63, 2006) and Gupta and Wilde (Commun Math Phys 334:867-887, 2015), which deal with the case $α>1$. The second one is the additivity of the channel dispersion, which is a quantity related to the second-order behavior of quantum information tasks.

quant-pharXiv:2603.16722•Mar 18, 2026•1 citation

Two-Indexed Schatten Quasi-Norms with Applications to Quantum Information Theory

Jan Kochanowski, Omar Fawzi, Cambyse Rouzé

We define 2-indexed $(q,p)$-Schatten quasi-norms for any $q,p > 0$ on operators on a tensor product of Hilbert spaces, naturally extending the norms defined by Pisier's theory of operator-valued Schatten spaces. We establish several desirable properties of these quasi-norms, such as relational consistency and the behavior on block diagonal operators, assuming that $|\frac{1}{q} - \frac{1}{p}| \leq 1$. In fact, we show that this condition is essentially necessary for natural properties to hold. Furthermore, for linear maps between spaces of such quasi-norms, we introduce completely bounded quasi-norms and co-quasi-norms. We prove that the $q \to p$ completely bounded co-quasi-norm is super-multiplicative for tensor products of quantum channels for $q \geq p>0$, extending an influential result of [Devetak, Junge, King, Ruskai, 2006]. Our proofs rely on elementary matrix analysis and operator convexity tools and do not require operator space theory. On the applications side, we demonstrate that these quasi-norms can be used to express relevant quantum information measures such as Rényi conditional entropies for $α\geq \frac{1}{2}$ or the Sandwiched Rényi Umlaut information for $α< 1$. Our multiplicativity results imply a tensorizing notion of reverse hypercontractivity, additivity of the completely bounded minimum output Rényi-$α$-entropy for $α\geq\frac{1}{2}$ extending another important result of [Devetak, Junge, King, Ruskai, 2006], and additivity of the maximum output Rényi-$α$ entropy for $α\geq \frac{1}{2}$.

quant-pharXiv:2604.14055•Apr 16, 2026•0 citations

SUFFICIENCY OF CHANNELS OVER VON NEUMANN ALGEBRAS

Dėnes Petz

The Quarterly Journal of Mathematics•Jan 1, 1988•251 citations

Characterization of linear maps on Mn whose multiplicity maps have maximal norm, with an application in quantum information

Daniel Puzzuoli

Given a linear map Φ:Mn→Mm , its multiplicity maps are defined as the family of linear maps Φ⊗idk:Mn⊗Mk→Mm⊗Mk , where idk denotes the identity on Mk . Let ‖⋅‖1 denote the trace-norm on matrices, as well as the induced trace-norm on linear maps of matrices, i.e. ‖Φ‖1=max{‖Φ(X)‖1:X∈Mn,‖X‖1=1} . A fact of fundamental importance in both operator algebras and quantum information is that ‖Φ⊗idk‖1 can grow with k . In general, the rate of growth is bounded by ‖Φ⊗idk‖1≤k‖Φ‖1 , and matrix transposition is the canonical example of a map achieving this bound. We prove that, up to an equivalence, the transpose is the unique map achieving this bound. The equivalence is given in terms of complete trace-norm isometries, and the proof relies on a particular characterization of complete trace-norm isometries regarding preservation of certain multiplication relations.We use this result to characterize the set of single-shot quantum channel discrimination games satisfying a norm relation that, operationally, implies that the game can be won with certainty using entanglement, but is hard to win without entanglement. Specifically, we show that the well-known example of such a game, involving the Werner-Holevo channels, is essentially the unique game satisfying this norm relation. This constitutes a step towards a characterization of single-shot quantum channel discrimination games with maximal gap between optimal performance of entangled and unentangled strategies.

arXiv:1710.03281•Quantum•Feb 5, 2018•1 citation

Imperfect measurements and conjugate observables

Adarsh S, P. N. Bala Subramanian, T. P. Sreeraj

arXiv:2401.05013•Pramana•Apr 16, 2026•0 citations
We obtain two new additivity results of quantum channels. The first one is the additivity of the channel Rényi information associated with the sandwiched Rényi divergence of order α∈[12,1)α\in[\frac{1}{2},1)α∈[21​,1). To prove this, we introduce the completely bounded 1→α1\toα1→α quasi-norms for completely positive maps, with α∈[12,1)α\in[\frac{1}{2},1)α∈[21​,1), and show that it is multiplicative. The additivity/multiplicativity derived here extends and complements the results of Devetak {\it et al} (Commun Math Phys 266:37-63, 2006) and Gupta and Wilde (Commun Math Phys 334:867-887, 2015), which deal with the case α>1α>1α>1. The second one is the additivity of the channel dispersion, which is a quantity related to the second-order behavior of quantum information tasks.
We define 2-indexed (q,p)(q,p)(q,p)-Schatten quasi-norms for any q,p>0q,p > 0q,p>0 on operators on a tensor product of Hilbert spaces, naturally extending the norms defined by Pisier's theory of operator-valued Schatten spaces. We establish several desirable properties of these quasi-norms, such as relational consistency and the behavior on block diagonal operators, assuming that ∣1q−1p∣≤1|\frac{1}{q} - \frac{1}{p}| \leq 1∣q1​−p1​∣≤1. In fact, we show that this condition is essentially necessary for natural properties to hold. Furthermore, for linear maps between spaces of such quasi-norms, we introduce completely bounded quasi-norms and co-quasi-norms. We prove that the q→pq \to pq→p completely bounded co-quasi-norm is super-multiplicative for tensor products of quantum channels for q≥p>0q \geq p>0q≥p>0, extending an influential result of [Devetak, Junge, King, Ruskai, 2006]. Our proofs rely on elementary matrix analysis and operator convexity tools and do not require operator space theory. On the applications side, we demonstrate that these quasi-norms can be used to express relevant quantum information measures such as Rényi conditional entropies for α≥12α\geq \frac{1}{2}α≥21​ or the Sandwiched Rényi Umlaut information for α<1α< 1α<1. Our multiplicativity results imply a tensorizing notion of reverse hypercontractivity, additivity of the completely bounded minimum output Rényi-ααα-entropy for α≥12α\geq\frac{1}{2}α≥21​ extending another important result of [Devetak, Junge, King, Ruskai, 2006], and additivity of the maximum output Rényi-ααα entropy for α≥12α\geq \frac{1}{2}α≥21​.
Given a linear map Φ:Mn→Mm , its multiplicity maps are defined as the family of linear maps Φ⊗idk:Mn⊗Mk→Mm⊗Mk , where idk denotes the identity on Mk . Let ‖⋅‖1 denote the trace-norm on matrices, as well as the induced trace-norm on linear maps of matrices, i.e. ‖Φ‖1=max{‖Φ(X)‖1:X∈Mn,‖X‖1=1} . A fact of fundamental importance in both operator algebras and quantum information is that ‖Φ⊗idk‖1 can grow with k . In general, the rate of growth is bounded by ‖Φ⊗idk‖1≤k‖Φ‖1 , and matrix transposition is the canonical example of a map achieving this bound. We prove that, up to an equivalence, the transpose is the unique map achieving this bound. The equivalence is given in terms of complete trace-norm isometries, and the proof relies on a particular characterization of complete trace-norm isometries regarding preservation of certain multiplication relations.We use this result to characterize the set of single-shot quantum channel discrimination games satisfying a norm relation that, operationally, implies that the game can be won with certainty using entanglement, but is hard to win without entanglement. Specifically, we show that the well-known example of such a game, involving the Werner-Holevo channels, is essentially the unique game satisfying this norm relation. This constitutes a step towards a characterization of single-shot quantum channel discrimination games with maximal gap between optimal performance of entangled and unentangled strategies.