Garry Bowen

dblp:20/4049 · DBLP profile ↗
← Back
5ranked-venue papers
5as first author
0since 2021 · last 2008
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 3 · 3 first-authorApplied, interdisciplinary, general and emerging computing · 2 · 2 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
3 papers
Quantum computing and quantum information · 87% Information theory · 13%

Topics — the 7 heaviest of 8, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Quantum computing and quantum information
quantum information theory
0.232008
Asymptotic Entanglement Manipulation of Bipartite Pure States · IEEE Trans. Inf. Theory 2008
On feedback and the classical capacity of a noisy quantum channel · IEEE Trans. Inf. Theory 2005
Quantum feedback channels · IEEE Trans. Inf. Theory 2004
Quantum computing and quantum information
quantum channel capacity
0.122005
On feedback and the classical capacity of a noisy quantum channel · IEEE Trans. Inf. Theory 2005
Quantum feedback channels · IEEE Trans. Inf. Theory 2004
Quantum computing and quantum information › quantum information theory
entanglement manipulation
0.112008
Asymptotic Entanglement Manipulation of Bipartite Pure States · IEEE Trans. Inf. Theory 2008
Information theory
channel capacity
0.022005
On feedback and the classical capacity of a noisy quantum channel · IEEE Trans. Inf. Theory 2005
Quantum feedback channels · IEEE Trans. Inf. Theory 2004
Information theory › channel capacity
feedback capacity
0.022005
On feedback and the classical capacity of a noisy quantum channel · IEEE Trans. Inf. Theory 2005
Quantum feedback channels · IEEE Trans. Inf. Theory 2004
Quantum computing and quantum information
entanglement measures
0.012008
Asymptotic Entanglement Manipulation of Bipartite Pure States · IEEE Trans. Inf. Theory 2008
Quantum computing and quantum information › quantum channel capacity
classical capacity
0.012005
On feedback and the classical capacity of a noisy quantum channel · IEEE Trans. Inf. Theory 2005

Methods — techniques the papers use, named apart from their topics

von neumann entropy · 0.1relative entropy of entanglement · 0.1coherent information bounds · 0.1nonentangled input states · 0.1entanglement-breaking channels · 0.1no-cloning theorem · 0.0entanglement-assisted capacity · 0.0
YearPublicationVenuePosition
2008 Asymptotic Entanglement Manipulation of Bipartite Pure States
abstract
Entanglement of pure states of bipartite quantum systems has been shown to have a unique measure in terms of the von Neumann entropy of the reduced states of either of its subsystems. The measure is established under entanglement manipulation of an asymptotically large number of copies of the bipartite pure state. In this paper, two different asymptotic measures of entanglement for arbitrary sequences of bipartite pure states are established. These are shown to coincideonly whenthe sequence isinformation stable, in terms of the quantum spectral information rates of its corresponding sequence of subsystem states. Additional bounds on the optimal rates of entanglement manipulation protocols in quantum information theory are also presented. These include bounds given by generalizations of the coherent information bounds, Rains' bound, and the relative entropy of entanglement.
Garry Bowen, Nilanjana Datta
IEEE Trans. Inf. Theory1
2006 Beyond i.i.d. in Quantum Information Theory
abstract
The information spectrum approach gives general formulae for optimal rates of codes in many areas of information theory. In this paper the quantum spectral divergence rates are defined and properties of the rates are derived. The entropic rates, conditional entropic rates, and spectral mutual information rates are then defined in terms of the spectral divergence rates. Properties including subadditivity, chain rules, Araki-Lieb inequalities, and monotonicity are then explored
Garry Bowen, Nilanjana Datta
ISIT1
2005 On feedback and the classical capacity of a noisy quantum channel
abstract
In Shannon information theory, the capacity of a memoryless communication channel cannot be increased by the use of feedback from receiver to sender. In this correspondence, the use of classical feedback is shown to provide no increase in the unassisted classical capacity of a memoryless quantum channel when feedback is used across nonentangled input states, or when the channel is an entanglement-breaking channel. This gives a generalization of the Shannon theory for certain classes of feedback protocols when transmitting through noisy quantum communication channels.
Garry Bowen, Rajagopal Nagarajan
IEEE Trans. Inf. Theory1
2004 On feedback and the classical capacity of a noisy quantum channel
abstract
In Shannon information theory the capacity of a memoryless communication channel cannot be increased by the use of feedback. The use of classical feedback is shown to provide no increase in the classical capacity of a memoryless quantum channel when feedback is used across nonentangled input states, or when the channel is an entanglement-breaking channel
Garry Bowen, Rajagopal Nagarajan
ISIT1
2004 Quantum feedback channels
abstract
In Shannon information theory, the capacity of a memoryless communication channel cannot be increased by the use of feedback. In quantum information theory, the no-cloning theorem means that noiseless copying and feedback of quantum information cannot be achieved. In this correspondence, quantum feedback is defined as the unlimited use of a noiseless quantum channel from receiver to sender. Given such quantum feedback, it is shown to provide no increase in the entanglement-assisted capacities of a memoryless quantum channel, in direct analogy to the classical case. It is also shown that in various cases of nonassisted capacities, feedback may increase the capacity of memoryless quantum channels.
Garry Bowen
IEEE Trans. Inf. Theory1