Jon T. Yard

dblp:25/8860 · DBLP profile ↗
← Back
4ranked-venue papers
4as first author
0since 2021 · last 2011
0000-0003-4648-949XORCID · reported

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 · 1 · 1 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
Information theory · 51% Quantum computing and quantum information · 46% Automata and formal languages · 4%

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

TopicWeightPapersLastEvidence papers
Information theory › channel capacity
capacity region
0.222011
Quantum Broadcast Channels · IEEE Trans. Inf. Theory 2011
Capacity Theorems for Quantum Multiple-Access Channels: Classical-Quantum and Quantum-Quantum Capacity Regions · IEEE Trans. Inf. Theory 2008
Quantum computing and quantum information
quantum channel
0.222011
Quantum Broadcast Channels · IEEE Trans. Inf. Theory 2011
Capacity Theorems for Quantum Multiple-Access Channels: Classical-Quantum and Quantum-Quantum Capacity Regions · IEEE Trans. Inf. Theory 2008
Information theory › network information theory
broadcast channel
0.112011
Quantum Broadcast Channels · IEEE Trans. Inf. Theory 2011
Quantum computing and quantum information › quantum information theory
quantum data compression
0.112009
Optimal quantum source coding with quantum side information at the encoder and decoder · IEEE Trans. Inf. Theory 2009
Quantum computing and quantum information › quantum information theory
quantum side information
0.112009
Optimal quantum source coding with quantum side information at the encoder and decoder · IEEE Trans. Inf. Theory 2009
Information theory › network information theory
rate region
0.112009
Optimal quantum source coding with quantum side information at the encoder and decoder · IEEE Trans. Inf. Theory 2009
Information theory › network information theory
multiple-access channel
0.112008
Capacity Theorems for Quantum Multiple-Access Channels: Classical-Quantum and Quantum-Quantum Capacity Regions · IEEE Trans. Inf. Theory 2008
Quantum computing and quantum information
quantum entanglement
0.012011
Quantum Broadcast Channels · IEEE Trans. Inf. Theory 2011
Automata and formal languages › grammatical inference
state merging
0.012011
Quantum Broadcast Channels · IEEE Trans. Inf. Theory 2011
Information theory › information measures › mutual information
conditional mutual information
0.012009
Optimal quantum source coding with quantum side information at the encoder and decoder · IEEE Trans. Inf. Theory 2009
Quantum computing and quantum information › quantum information theory
coherent information
0.012008
Capacity Theorems for Quantum Multiple-Access Channels: Classical-Quantum and Quantum-Quantum Capacity Regions · IEEE Trans. Inf. Theory 2008
Quantum computing and quantum information › quantum channel
degradable channel
0.012008
Capacity Theorems for Quantum Multiple-Access Channels: Classical-Quantum and Quantum-Quantum Capacity Regions · IEEE Trans. Inf. Theory 2008

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

superposition coding · 0.1
YearPublicationVenuePosition
2011 Quantum Broadcast Channels
abstract
We consider quantum channels with one sender and two receivers, used in several different ways for the simultaneous transmission of independent messages. We begin by extending the technique of superposition coding to quantum channels with a classical input to give a general achievable region. We also give outer bounds to the capacity regions for various special cases from the classical literature and prove that superposition coding is optimal for a class of channels. We then consider extensions of superposition coding for channels with a quantum input, where some of the messages transmitted are quantum instead of classical, in the sense that the parties establish bipartite or tripartite GHZ entanglement. We conclude by using state merging to give achievable rates for establishing bipartite entanglement between different pair of parties with the assistance of free classical communication.
Jon T. Yard, Patrick M. Hayden, Igor Devetak
IEEE Trans. Inf. Theory1
2009 Optimal quantum source coding with quantum side information at the encoder and decoder
abstract
Consider many instances of an arbitrary quadripartite pure state of four quantum systems ABCD. Alice holds the AC part of each state, Bob holds B, while R represents all other parties correlated with ABC . Alice is required to redistribute the C systems to Bob while asymptotically preserving the overall purity. We prove that this is possible using Q qubits of communication and E ebits of shared entanglement between Alice and Bob, provided that Q ges 1/2I(C; D|B) and Q + E ges H(C|B), proving the optimality of the Luo-Devetak outer bound. The optimal qubit rate provides the first known operational interpretation of quantum conditional mutual information. We also show how our protocol leads to a fully operational proof of strong subaddivity and uncover a general organizing principle, in analogy to thermodynamics, that underlies the optimal rates.
Jon T. Yard, Igor Devetak
IEEE Trans. Inf. Theory1
2008 Capacity Theorems for Quantum Multiple-Access Channels: Classical-Quantum and Quantum-Quantum Capacity Regions
abstract
We consider quantum channels with two senders and one receiver. For an arbitrary such channel, we give multiletter characterizations of two different two-dimensional capacity regions. The first region comprises the rates at which it is possible for one sender to send classical information, while the other sends quantum information. The second region consists of the rates at which each sender can send quantum information. For each region, we give an example of a channel for which the corresponding region has a single-letter description. One of our examples relies on a new result proved here, perhaps of independent interest, stating that the coherent information over any degradable channel is concave in the input density operator. We conclude with connections to other work and a discussion on generalizations where each user simultaneously sends classical and quantum information.
Jon T. Yard, Patrick M. Hayden, Igor Devetak
IEEE Trans. Inf. Theory1
2005 Capacity theorems for quantum multiple access channels
abstract
We consider quantum channels with two senders and one receiver. For an arbitrary such channel, we give multi-letter characterizations of two different two-dimensional capacity regions. The first region characterizes the rates at which it is possible for one sender to send classical information while the other sends quantum information. The second region gives the rates at which each sender can send quantum information. We give an example of a channel for which each region has a single-letter description, concluding with a characterization of the rates at which each user can simultaneously send classical and quantum information
Jon T. Yard, Igor Devetak, Patrick M. Hayden
ISIT1