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

Physical Review A

Comment on “Secret-key-assisted private classical communication capacity over quantum channels”

Mark M. Wilde

Published Apr 29, 2011• 7 citations
Publisher

Abstract

The paper of Hsieh, Luo, and Brun (HLB) [Phys. Rev. A 78, 042306 (2008)] contains several issues with the capacity theorem presented there, one of which is the suggestion that a sender and receiver can achieve entanglement-assisted classical capacity without any entanglement at all, and another of which is a violation of the Holevo bound. There is also an issue with the converse proof of the capacity theorem. In this comment, I point out these issues and provide revisions of the capacity theorem and the converse proof.

DOI
10.1103/physreva.83.046303

Related papers

The Private Classical Capacity and Quantum Capacity of a Quantum Channel

Igor Devetak

A formula for the capacity of a quantum channel for transmitting private classical information is derived. This is shown to be equal to the capacity of the channel for generating a secret key, and neither capacity is enhanced by forward public classical communication. Motivated by the work of Schumacher and Westmoreland on quantum privacy and quantum coherence, parallels between private classical information and quantum information are exploited to obtain an expression for the capacity of a quantum channel for generating pure bipartite entanglement. The latter implies a new proof of the quantum channel coding theorem and a simple proof of the converse. The coherent information plays a role in all of the above mentioned capacities

arXiv:quant-ph/0304127•IEEE Transactions on Information Theory•Jan 1, 2005•840 citations

Secret-key-assisted private classical communication capacity over quantum channels

Min-Hsiu Hsieh, Zhicheng Luo, Todd A. Brun

We prove a regularized formula for the secret-key-assisted capacity region of a quantum channel for transmitting private classical information. This result parallels the work of Devetak et al. (e-print arXiv:quant-ph/0512015) on entanglement-assisted quantum communication capacity . This formula provides a family protocol, the private father protocol, under the resource inequality framework that includes private classical communication without secret-key assistance as a child protocol.

arXiv:0806.3525•Physical Review A•Oct 8, 2008•17 citations

Coding Theorems for Hybrid Channels. II

A. A. Kuznetsova, Alexander Semenovich Holevo

The present paper continues investigation of the capacities of measurement (quantum-classical) channels in the most general setting, initiated in [A. A. Kuznetsova and A. S. Holevo, Theory Probab. Appl., 58 (2014), pp. 264--285]. The proof of coding theorems is given for the classical capacity and entanglement-assisted classical capacity of the measurement channel with arbitrary output alphabet, without assuming that the channel is given by a bounded operator-valued density.

arXiv:1408.3255•Theory of Probability and Its Applications•Jan 1, 2015•4 citations

Entanglement-Assisted Communication Surpassing the Ultimate Classical Capacity

Shuhong Hao, Haowei Shi, Wei Li +3 more

We report experimental entanglement-assisted communication above the ultimate classical capacity set by the Holevo-Schumacher-Westmorel bound. A high-efficiency entanglement source and a phase-conjugate quantum receiver reap the benefit of pre-shared entanglement over lossy and noisy channels.

Quantum Information and Measurement (QIM)•Jan 1, 2021•8 citations

Entanglement-Assisted Communication Surpassing the Ultimate Classical Capacity

Shuhong Hao, Haowei Shi, Wei Li +2 more

We report experimental entanglement-assisted communication above the ultimate classical capacity set by the Holevo-Schumacher-Westmorel bound. A high-efficiency entanglement source and a phase-conjugate quantum receiver reap the benefit of pre-shared entanglement over lossy and noisy channels.

Conference on Lasers and Electro-Optics•Jan 1, 2021•1 citation

Remarks on the classical capacity of quantum channel

Alexander Semenovich Holevo

A direct proof of the relation between the one-shot classical capacity and the minimal output entropy for covariant quantum channels is suggested. The structure of covariant channels is described in some detail. A simple proof of a general inequality for entanglement-assisted classical capacity is given.

arXiv:quant-ph/0212025•Dec 4, 2002•95 citations
The paper of Hsieh, Luo, and Brun (HLB) [Phys. Rev. A 78, 042306 (2008)] contains several issues with the capacity theorem presented there, one of which is the suggestion that a sender and receiver can achieve entanglement-assisted classical capacity without any entanglement at all, and another of which is a violation of the Holevo bound. There is also an issue with the converse proof of the capacity theorem. In this comment, I point out these issues and provide revisions of the capacity theorem and the converse proof.
A formula for the capacity of a quantum channel for transmitting private classical information is derived. This is shown to be equal to the capacity of the channel for generating a secret key, and neither capacity is enhanced by forward public classical communication. Motivated by the work of Schumacher and Westmoreland on quantum privacy and quantum coherence, parallels between private classical information and quantum information are exploited to obtain an expression for the capacity of a quantum channel for generating pure bipartite entanglement. The latter implies a new proof of the quantum channel coding theorem and a simple proof of the converse. The coherent information plays a role in all of the above mentioned capacities