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/0205057 · IEEE Transactions on Information Theory

On the capacities of bipartite hamiltonians and unitary gates

C.H. Bennett, Aram W. Harrow, Debbie Leung, J.A. Smolin

Published Jul 23, 2003• 135 citations
arXivHTMLPDF

Abstract

We consider interactions as bidirectional channels. We investigate the capacities for interaction Hamiltonians and nonlocal unitary gates to generate entanglement and transmit classical information. We give analytic expressions for the entanglement generating capacity and entanglement-assisted one-way classical communication capacity of interactions, and show that these quantities are additive, so that the asymptotic capacities equal the corresponding 1-shot capacities. We give general bounds on other capacities, discuss some examples, and conclude with some open questions.

DOI
10.1109/tit.2003.814935

Related papers

On the capacities of bipartite Hamiltonians and unitary gates

C. H. Bennett, Aram W. Harrow, Debbie Leung +1 more

We consider interactions as bidirectional channels, and investigate the capacities for interaction Hamiltonians and nonlocal unitary gates to generate entanglement and transmit classical information. We give analytic expressions for the entanglement generating capacity and entanglement-assisted 1-way classical communication capacity of interactions, and show that these quantities are additive, so that the asymptotic capacities equal the corresponding 1-shot capacities. We give bounds on other capacities and discuss their additivity, along with other open questions.

•Jan 1, 2002•95 citations

On the Capacities of Bipartite Hamiltonians and

Charles H. Bennett, Aram W. Harrow, Debbie Leung +1 more

We consider interactions as bidirectional channels. We investigate the capacities for interaction Hamiltonians and non- local unitary gates to generate entanglement and transmit clas- sical information. We give analytic expressions for the entangle- ment generating capacity and entanglement-assisted one-way clas- sical communication capacity of interactions, and show that these quantities are additive, so that the asymptotic capacities equal the corresponding -shot capacities. We give general bounds on other capacities, discuss some examples, and conclude with some open questions.

•Jan 1, 2003•0 citations

TWO-WAY QUANTUM COMMUNICATION CHANNELS

Andrew M. Childs, Debbie Leung, HOI-KWONG LO

We consider communication between two parties using a bipartite quantum operation, which constitutes the most general quantum mechanical model of two-party communication. We primarily focus on the simultaneous forward and backward communication of classical messages. For the case in which the two parties share unlimited prior entanglement, we give inner and outer bounds on the achievable rate region that generalize classical results due to Shannon. In particular, using a protocol of Bennett, Harrow, Leung, and Smolin, we give a one-shot expression in terms of the Holevo information for the entanglement-assisted one-way capacity of a two-way quantum channel. As applications, we rederive two known additivity results for one-way channel capacities: the entanglement-assisted capacity of a general one-way channel, and the unassisted capacity of an entanglement-breaking one-way channel.

arXiv:quant-ph/0506039•International Journal of Quantum Information•Feb 1, 2006•19 citations

Two-way quantum communication channels

Andrew M. Childs, Debbie Leung, Hoi‐Kwong Lo

We consider communication between two parties using a bipartite quantum operation, which constitutes the most general quantum mechanical model of two-party communication. We primarily focus on the simultaneous forward and backward communication of classical messages. For the case in which the two parties share unlimited prior entanglement, we give inner and outer bounds on the achievable rate region that generalize classical results due to Shannon. In particular, using a protocol of Bennett, Harrow, Leung, and Smolin, we give a one-shot expression in terms of the Holevo information for the entanglement-assisted one-way capacity of a two-way quantum channel. As applications, we rederive two known additivity results for one-way channel capacities: the entanglement-assisted capacity of a general one-way channel, and the unassisted capacity of an entanglement-breaking one-way channel. 1.

•Jan 1, 2005•16 citations

One-Shot Entanglement-Assisted Quantum and Classical Communication

Nilanjana Datta, Min-Hsiu Hsieh

We study entanglement-assisted quantum and classical communication over a single use of a quantum channel, which itself can correspond to a finite number of uses of a channel with arbitrarily correlated noise. We obtain characterizations of the corresponding one-shot capacities by establishing upper and lower bounds on them in terms of the difference of two smoothed entropic quantities. In the case of a memoryless channel, the upper and lower bounds converge to the known single-letter formulas for the corresponding capacities, in the limit of asymptotically many uses of it. Our results imply that the difference of two smoothed entropic quantities characterizing the one-shot entanglement-assisted capacities serves as a one-shot analog of the mutual information, since it reduces to the mutual information, between the output of the channel and a system purifying its input, in the asymptotic, memoryless scenario.

arXiv:1105.3321•IEEE Transactions on Information Theory•Nov 21, 2012•52 citations

Lower bounds for communication capacities of two-qudit unitary operations

Dominic William Berry

It is known that entangling capacities of bipartite unitary operations may be used to place upper bounds on communication capacities. Here we present alternative definitions of entangling capacities for unitary operations and use them to place lower bounds on the communication capacities of arbitrary bipartite unitaries. Thus entangling capacities may be used to place both upper and lower bounds on the communication capacities for arbitrary bipartite unitaries, allowing them to be more easily estimated. We elucidate the connection between these results and the standard formula for the entanglement assisted capacity of channels. In addition, we present more general methods for producing ensembles for communication from initial states for entanglement creation, and thereby derive sufficient conditions such that the usual forms of entangling capacity provide lower bounds on communication capacities.

arXiv:0704.2066•Physical Review A•Dec 6, 2007•4 citations
We consider interactions as bidirectional channels. We investigate the capacities for interaction Hamiltonians and nonlocal unitary gates to generate entanglement and transmit classical information. We give analytic expressions for the entanglement generating capacity and entanglement-assisted one-way classical communication capacity of interactions, and show that these quantities are additive, so that the asymptotic capacities equal the corresponding 1-shot capacities. We give general bounds on other capacities, discuss some examples, and conclude with some open questions.
We consider interactions as bidirectional channels, and investigate the capacities for interaction Hamiltonians and nonlocal unitary gates to generate entanglement and transmit classical information. We give analytic expressions for the entanglement generating capacity and entanglement-assisted 1-way classical communication capacity of interactions, and show that these quantities are additive, so that the asymptotic capacities equal the corresponding 1-shot capacities. We give bounds on other capacities and discuss their additivity, along with other open questions.
We consider interactions as bidirectional channels. We investigate the capacities for interaction Hamiltonians and non- local unitary gates to generate entanglement and transmit clas- sical information. We give analytic expressions for the entangle- ment generating capacity and entanglement-assisted one-way clas- sical communication capacity of interactions, and show that these quantities are additive, so that the asymptotic capacities equal the corresponding -shot capacities. We give general bounds on other capacities, discuss some examples, and conclude with some open questions.
We consider communication between two parties using a bipartite quantum operation, which constitutes the most general quantum mechanical model of two-party communication. We primarily focus on the simultaneous forward and backward communication of classical messages. For the case in which the two parties share unlimited prior entanglement, we give inner and outer bounds on the achievable rate region that generalize classical results due to Shannon. In particular, using a protocol of Bennett, Harrow, Leung, and Smolin, we give a one-shot expression in terms of the Holevo information for the entanglement-assisted one-way capacity of a two-way quantum channel. As applications, we rederive two known additivity results for one-way channel capacities: the entanglement-assisted capacity of a general one-way channel, and the unassisted capacity of an entanglement-breaking one-way channel.
We consider communication between two parties using a bipartite quantum operation, which constitutes the most general quantum mechanical model of two-party communication. We primarily focus on the simultaneous forward and backward communication of classical messages. For the case in which the two parties share unlimited prior entanglement, we give inner and outer bounds on the achievable rate region that generalize classical results due to Shannon. In particular, using a protocol of Bennett, Harrow, Leung, and Smolin, we give a one-shot expression in terms of the Holevo information for the entanglement-assisted one-way capacity of a two-way quantum channel. As applications, we rederive two known additivity results for one-way channel capacities: the entanglement-assisted capacity of a general one-way channel, and the unassisted capacity of an entanglement-breaking one-way channel. 1.
We study entanglement-assisted quantum and classical communication over a single use of a quantum channel, which itself can correspond to a finite number of uses of a channel with arbitrarily correlated noise. We obtain characterizations of the corresponding one-shot capacities by establishing upper and lower bounds on them in terms of the difference of two smoothed entropic quantities. In the case of a memoryless channel, the upper and lower bounds converge to the known single-letter formulas for the corresponding capacities, in the limit of asymptotically many uses of it. Our results imply that the difference of two smoothed entropic quantities characterizing the one-shot entanglement-assisted capacities serves as a one-shot analog of the mutual information, since it reduces to the mutual information, between the output of the channel and a system purifying its input, in the asymptotic, memoryless scenario.
It is known that entangling capacities of bipartite unitary operations may be used to place upper bounds on communication capacities. Here we present alternative definitions of entangling capacities for unitary operations and use them to place lower bounds on the communication capacities of arbitrary bipartite unitaries. Thus entangling capacities may be used to place both upper and lower bounds on the communication capacities for arbitrary bipartite unitaries, allowing them to be more easily estimated. We elucidate the connection between these results and the standard formula for the entanglement assisted capacity of channels. In addition, we present more general methods for producing ensembles for communication from initial states for entanglement creation, and thereby derive sufficient conditions such that the usual forms of entangling capacity provide lower bounds on communication capacities.