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/0308120 · Quantum Information and Computation

Multiplicativity of accessible fidelity and quantumness for sets of quantum states

K.M.R. Audenaert, Christopher A. Fuchs, Christopher King, Andreas Winter

Published Jan 1, 2004• 12 citations
arXivHTMLPDF

Abstract

Two measures of sensitivity to eavesdropping for alphabets of quantum states were recently introduced by Fuchs and Sasaki in quant-ph/0302092. These are the accessible fidelity and quantumness. In this paper we prove an important property of both measures: They are multiplicative under tensor products. The proof in the case of accessible fidelity shows a connection between the measure and characteristics of entanglement-breaking quantum channels.

DOI
10.26421/qic4.1-1

Related papers

On the quantumness of a Hilbert space

Christopher A. Fuchs

We derive an exact expression for the quantumness of a Hilbert space (defined in C.A. Fuchs and M. Sasaki, Quant. Info. Comp. {\bf 3}, 377 (2003)), and show that in composite Hilbert spaces the signal states must contain at least some entangled states in order to achieve such a sensitivity. Furthermore, we establish that the accessible fidelity for symmetric informationally complete signal ensembles is equal to the quantumness. Though spelling the most trouble for an eavesdropper because of this, it turns out that the accessible fidelity is nevertheless easy for her to achieve in this case: Any measurement consisting of rank-one POVM elements is an optimal measurement, and the simple procedure of reproducing the projector associated with the measurement outcome is an optimal output strategy.

arXiv:quant-ph/0404122•Quantum Information and Computation•Dec 1, 2004•56 citations

The Quantumness of a Set of Quantum States

Christopher A. Fuchs, Masahide Sasaki

This article is an introduction to quant-ph/0302092. We propose to quantify how "quantum" a set of quantum states is. The quantumness of a set is the worst-case difficulty of transmitting the states through a classical communication channel. Potential applications of this measure arise in quantum cryptography, where one might like to use an alphabet of states most sensitive to quantum eavesdropping, and in lab demonstrations of quantum teleportation, where it is necessary to check that entanglement has indeed been used.

arXiv:quant-ph/0302108•Feb 13, 2003•13 citations

Additivity/Multiplicativity Communication Channels

Grigori Gennadievich Amosov, Alexander Semenovich Holevo, Reinhard F. Werner

A class of problems in quantum information theory, having an elementary formulation but still resisting solution, concerns the additivity properties of various quantities characterizing quantum channels, notably the “classical capacity”, and the “maximal output purity”. All known results, including extensive numerical work, are consistent with the conjecture that these quantities are indeed additive (resp. multiplicative) with respect to tensor products of channels. A proof of this conjecture would have important consequences in quantum information theory. In particular, according to this conjecture, the classical capacity or the maximal purity of outputs cannot be increased by using entangled inputs of the channel. In this paper we state the additivity/multiplicativity problems, give some relations between them, and prove some new partial results, which also support the conjecture. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Kluwer Academic Publishers eBooks•Feb 24, 2006•0 citations

On some additivity problems in quantum information theory

Grigori Gennadievich Amosov, Alexander Semenovich Holevo, Reinhard F. Werner

A class of problems in quantum information theory, having an elementary formulation but still resisting solution, concerns the additivity properties of various quantities characterizing quantum channels, notably the "classical capacity", and the "maximal output purity". All known results, including extensive numerical work, are consistent with the conjecture that these quantities are indeed additive (resp. multiplicative) with respect to tensor products of channels. A proof of this conjecture would have important consequences in quantum information theory. In particular, according to this conjecture, the classical capacity or the maximal purity of outputs cannot be increased by using entangled inputs of the channel. In this paper we state the additivity/multiplicativity problems, give some relations between them, and prove some new partial results, which also support the conjecture.

arXiv:math-ph/0003002•Mar 4, 2000•125 citations

Additivity of the Classical Capacity of Entanglement-Breaking Quantum Channels

Peter W. Shor

We show that for the tensor product of an entanglement-breaking quantum channel with an arbitrary quantum channel, both the minimum entropy of an output of the channel and the Holevo-Schumacher-Westmoreland capacity are additive. In addition, for the tensor product of two arbitrary quantum channels, we give a bound involving entanglement of formation for the amount of subadditivity (for minimum entropy output) or superadditivity (for classical capacity) that can occur. One of the more important open questions of quantum information theory is the determination of the capacity of a quantum channel for carrying classical information. This question has been only partially resolved. If entanglement between multiple inputs to the channel is not allowed, a formula for the classical capacity of a quantum channel has indeed been discovered [1, 2]. This capacity formula for a quantum channel Ψ is χ ∗ (Ψ) = max p i,ρ i H Ψ(piρi) − ∑

•Jan 31, 2002•171 citations

Squeezing quantum information through a classical channel: measuring the “quantumness” of a set of quantum states

Christopher A. Fuchs, Masahide Sasaki

In this paper we propose a general method to quantify how ``quantum'' a set of quantum states is. The idea is to gauge the quantumness of the set by the worst-case difficulty of transmitting the states through a purely classical communication channel. Potential applications of this notion arise in quantum cryptography, where one might like to use an alphabet of states that promises to be the most sensitive to quantum eavesdropping, and in laboratory demonstrations of quantum teleportation, where it is necessary to check that quantum entanglement has actually been used in the protocol.

arXiv:quant-ph/0302092•Quantum Information and Computation•Jan 1, 2003•88 citations
Two measures of sensitivity to eavesdropping for alphabets of quantum states were recently introduced by Fuchs and Sasaki in quant-ph/0302092. These are the accessible fidelity and quantumness. In this paper we prove an important property of both measures: They are multiplicative under tensor products. The proof in the case of accessible fidelity shows a connection between the measure and characteristics of entanglement-breaking quantum channels.
We derive an exact expression for the quantumness of a Hilbert space (defined in C.A. Fuchs and M. Sasaki, Quant. Info. Comp. {\bf 3}, 377 (2003)), and show that in composite Hilbert spaces the signal states must contain at least some entangled states in order to achieve such a sensitivity. Furthermore, we establish that the accessible fidelity for symmetric informationally complete signal ensembles is equal to the quantumness. Though spelling the most trouble for an eavesdropper because of this, it turns out that the accessible fidelity is nevertheless easy for her to achieve in this case: Any measurement consisting of rank-one POVM elements is an optimal measurement, and the simple procedure of reproducing the projector associated with the measurement outcome is an optimal output strategy.
This article is an introduction to quant-ph/0302092. We propose to quantify how "quantum" a set of quantum states is. The quantumness of a set is the worst-case difficulty of transmitting the states through a classical communication channel. Potential applications of this measure arise in quantum cryptography, where one might like to use an alphabet of states most sensitive to quantum eavesdropping, and in lab demonstrations of quantum teleportation, where it is necessary to check that entanglement has indeed been used.
A class of problems in quantum information theory, having an elementary formulation but still resisting solution, concerns the additivity properties of various quantities characterizing quantum channels, notably the “classical capacity”, and the “maximal output purity”. All known results, including extensive numerical work, are consistent with the conjecture that these quantities are indeed additive (resp. multiplicative) with respect to tensor products of channels. A proof of this conjecture would have important consequences in quantum information theory. In particular, according to this conjecture, the classical capacity or the maximal purity of outputs cannot be increased by using entangled inputs of the channel. In this paper we state the additivity/multiplicativity problems, give some relations between them, and prove some new partial results, which also support the conjecture. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
A class of problems in quantum information theory, having an elementary formulation but still resisting solution, concerns the additivity properties of various quantities characterizing quantum channels, notably the "classical capacity", and the "maximal output purity". All known results, including extensive numerical work, are consistent with the conjecture that these quantities are indeed additive (resp. multiplicative) with respect to tensor products of channels. A proof of this conjecture would have important consequences in quantum information theory. In particular, according to this conjecture, the classical capacity or the maximal purity of outputs cannot be increased by using entangled inputs of the channel. In this paper we state the additivity/multiplicativity problems, give some relations between them, and prove some new partial results, which also support the conjecture.
We show that for the tensor product of an entanglement-breaking quantum channel with an arbitrary quantum channel, both the minimum entropy of an output of the channel and the Holevo-Schumacher-Westmoreland capacity are additive. In addition, for the tensor product of two arbitrary quantum channels, we give a bound involving entanglement of formation for the amount of subadditivity (for minimum entropy output) or superadditivity (for classical capacity) that can occur. One of the more important open questions of quantum information theory is the determination of the capacity of a quantum channel for carrying classical information. This question has been only partially resolved. If entanglement between multiple inputs to the channel is not allowed, a formula for the classical capacity of a quantum channel has indeed been discovered [1, 2]. This capacity formula for a quantum channel Ψ is χ ∗ (Ψ) = max p i,ρ i H Ψ(piρi) − ∑
In this paper we propose a general method to quantify how ``quantum'' a set of quantum states is. The idea is to gauge the quantumness of the set by the worst-case difficulty of transmitting the states through a purely classical communication channel. Potential applications of this notion arise in quantum cryptography, where one might like to use an alphabet of states that promises to be the most sensitive to quantum eavesdropping, and in laboratory demonstrations of quantum teleportation, where it is necessary to check that quantum entanglement has actually been used in the protocol.