1,439 research outputs found
Entanglement-assisted communication of classical and quantum information
We consider the problem of transmitting classical and quantum information
reliably over an entanglement-assisted quantum channel. Our main result is a
capacity theorem that gives a three-dimensional achievable rate region. Points
in the region are rate triples, consisting of the classical communication rate,
the quantum communication rate, and the entanglement consumption rate of a
particular coding scheme. The crucial protocol in achieving the boundary points
of the capacity region is a protocol that we name the classically-enhanced
father protocol. The classically-enhanced father protocol is more general than
other protocols in the family tree of quantum Shannon theoretic protocols, in
the sense that several previously known quantum protocols are now child
protocols of it. The classically-enhanced father protocol also shows an
improvement over a time-sharing strategy for the case of a qubit dephasing
channel--this result justifies the need for simultaneous coding of classical
and quantum information over an entanglement-assisted quantum channel. Our
capacity theorem is of a multi-letter nature (requiring a limit over many uses
of the channel), but it reduces to a single-letter characterization for at
least three channels: the completely depolarizing channel, the quantum erasure
channel, and the qubit dephasing channel.Comment: 23 pages, 5 figures, 1 table, simplification of capacity region--it
now has the simple interpretation as the unit resource capacity region
translated along the classically-enhanced father trade-off curv
Converse bounds for private communication over quantum channels
This paper establishes several converse bounds on the private transmission
capabilities of a quantum channel. The main conceptual development builds
firmly on the notion of a private state, which is a powerful, uniquely quantum
method for simplifying the tripartite picture of privacy involving local
operations and public classical communication to a bipartite picture of quantum
privacy involving local operations and classical communication. This approach
has previously led to some of the strongest upper bounds on secret key rates,
including the squashed entanglement and the relative entropy of entanglement.
Here we use this approach along with a "privacy test" to establish a general
meta-converse bound for private communication, which has a number of
applications. The meta-converse allows for proving that any quantum channel's
relative entropy of entanglement is a strong converse rate for private
communication. For covariant channels, the meta-converse also leads to
second-order expansions of relative entropy of entanglement bounds for private
communication rates. For such channels, the bounds also apply to the private
communication setting in which the sender and receiver are assisted by
unlimited public classical communication, and as such, they are relevant for
establishing various converse bounds for quantum key distribution protocols
conducted over these channels. We find precise characterizations for several
channels of interest and apply the methods to establish several converse bounds
on the private transmission capabilities of all phase-insensitive bosonic
channels.Comment: v3: 53 pages, 3 figures, final version accepted for publication in
IEEE Transactions on Information Theor
Quantum trade-off coding for bosonic communication
The trade-off capacity region of a quantum channel characterizes the optimal
net rates at which a sender can communicate classical, quantum, and entangled
bits to a receiver by exploiting many independent uses of the channel, along
with the help of the same resources. Similarly, one can consider a trade-off
capacity region when the noiseless resources are public, private, and secret
key bits. In [Phys. Rev. Lett. 108, 140501 (2012)], we identified these
trade-off rate regions for the pure-loss bosonic channel and proved that they
are optimal provided that a longstanding minimum output entropy conjecture is
true. Additionally, we showed that the performance gains of a trade-off coding
strategy when compared to a time-sharing strategy can be quite significant. In
the present paper, we provide detailed derivations of the results announced
there, and we extend the application of these ideas to thermalizing and
amplifying bosonic channels. We also derive a "rule of thumb" for trade-off
coding, which determines how to allocate photons in a coding strategy if a
large mean photon number is available at the channel input. Our results on the
amplifying bosonic channel also apply to the "Unruh channel" considered in the
context of relativistic quantum information theory.Comment: 20 pages, 7 figures, v2 has a new figure and a proof that the regions
are optimal for the lossy bosonic channel if the entropy photon-number
inequality is true; v3, submission to Physical Review A (see related work at
http://link.aps.org/doi/10.1103/PhysRevLett.108.140501); v4, final version
accepted into Physical Review
Two-way quantum communication channels
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.Comment: 21 pages, 3 figure
Quantum network communication -- the butterfly and beyond
We study the k-pair communication problem for quantum information in networks
of quantum channels. We consider the asymptotic rates of high fidelity quantum
communication between specific sender-receiver pairs. Four scenarios of
classical communication assistance (none, forward, backward, and two-way) are
considered. (i) We obtain outer and inner bounds of the achievable rate regions
in the most general directed networks. (ii) For two particular networks
(including the butterfly network) routing is proved optimal, and the free
assisting classical communication can at best be used to modify the directions
of quantum channels in the network. Consequently, the achievable rate regions
are given by counting edge avoiding paths, and precise achievable rate regions
in all four assisting scenarios can be obtained. (iii) Optimality of routing
can also be proved in classes of networks. The first class consists of directed
unassisted networks in which (1) the receivers are information sinks, (2) the
maximum distance from senders to receivers is small, and (3) a certain type of
4-cycles are absent, but without further constraints (such as on the number of
communicating and intermediate parties). The second class consists of arbitrary
backward-assisted networks with 2 sender-receiver pairs. (iv) Beyond the k-pair
communication problem, observations are made on quantum multicasting and a
static version of network communication related to the entanglement of
assistance.Comment: 15 pages, 17 figures. Final versio
Quantum Channel Capacities Per Unit Cost
Communication over a noisy channel is often conducted in a setting in which
different input symbols to the channel incur a certain cost. For example, for
bosonic quantum channels, the cost associated with an input state is the number
of photons, which is proportional to the energy consumed. In such a setting, it
is often useful to know the maximum amount of information that can be reliably
transmitted per cost incurred. This is known as the capacity per unit cost. In
this paper, we generalize the capacity per unit cost to various communication
tasks involving a quantum channel such as classical communication,
entanglement-assisted classical communication, private communication, and
quantum communication. For each task, we define the corresponding capacity per
unit cost and derive a formula for it analogous to that of the usual capacity.
Furthermore, for the special and natural case in which there is a zero-cost
state, we obtain expressions in terms of an optimized relative entropy
involving the zero-cost state. For each communication task, we construct an
explicit pulse-position-modulation coding scheme that achieves the capacity per
unit cost. Finally, we compute capacities per unit cost for various bosonic
Gaussian channels and introduce the notion of a blocklength constraint as a
proposed solution to the long-standing issue of infinite capacities per unit
cost. This motivates the idea of a blocklength-cost duality, on which we
elaborate in depth.Comment: v3: 18 pages, 2 figure
Unconstrained distillation capacities of a pure-loss bosonic broadcast channel
Bosonic channels are important in practice as they form a simple model for
free-space or fiber-optic communication. Here we consider a single-sender
two-receiver pure-loss bosonic broadcast channel and determine the
unconstrained capacity region for the distillation of bipartite entanglement
and secret key between the sender and each receiver, whenever they are allowed
arbitrary public classical communication. We show how the state merging
protocol leads to achievable rates in this setting, giving an inner bound on
the capacity region. We also evaluate an outer bound on the region by using the
relative entropy of entanglement and a `reduction by teleportation' technique.
The outer bounds match the inner bounds in the infinite-energy limit, thereby
establishing the unconstrained capacity region for such channels. Our result
could provide a useful benchmark for implementing a broadcasting of
entanglement and secret key through such channels. An important open question
relevant to practice is to determine the capacity region in both this setting
and the single-sender single-receiver case when there is an energy constraint
on the transmitter.Comment: v2: 6 pages, 3 figures, introduction revised, appendix added where
the result is extended to the 1-to-m pure-loss bosonic broadcast channel. v3:
minor revision, typo error correcte
- …