500 research outputs found
"Pretty strong" converse for the private capacity of degraded quantum wiretap channels
In the vein of the recent "pretty strong" converse for the quantum and
private capacity of degradable quantum channels [Morgan/Winter, IEEE Trans.
Inf. Theory 60(1):317-333, 2014], we use the same techniques, in particular the
calculus of min-entropies, to show a pretty strong converse for the private
capacity of degraded classical-quantum-quantum (cqq-)wiretap channels, which
generalize Wyner's model of the degraded classical wiretap channel.
While the result is not completely tight, leaving some gap between the region
of error and privacy parameters for which the converse bound holds, and a
larger no-go region, it represents a further step towards an understanding of
strong converses of wiretap channels [cf. Hayashi/Tyagi/Watanabe,
arXiv:1410.0443 for the classical case].Comment: 5 pages, 1 figure, IEEEtran.cls. V2 final (conference) version,
accepted for ISIT 2016 (Barcelona, 10-15 July 2016
Polar codes for degradable quantum channels
Channel polarization is a phenomenon in which a particular recursive encoding
induces a set of synthesized channels from many instances of a memoryless
channel, such that a fraction of the synthesized channels becomes near perfect
for data transmission and the other fraction becomes near useless for this
task. Mahdavifar and Vardy have recently exploited this phenomenon to construct
codes that achieve the symmetric private capacity for private data transmission
over a degraded wiretap channel. In the current paper, we build on their work
and demonstrate how to construct quantum wiretap polar codes that achieve the
symmetric private capacity of a degraded quantum wiretap channel with a
classical eavesdropper. Due to the Schumacher-Westmoreland correspondence
between quantum privacy and quantum coherence, we can construct quantum polar
codes by operating these quantum wiretap polar codes in superposition, much
like Devetak's technique for demonstrating the achievability of the coherent
information rate for quantum data transmission. Our scheme achieves the
symmetric coherent information rate for quantum channels that are degradable
with a classical environment. This condition on the environment may seem
restrictive, but we show that many quantum channels satisfy this criterion,
including amplitude damping channels, photon-detected jump channels, dephasing
channels, erasure channels, and cloning channels. Our quantum polar coding
scheme has the desirable properties of being channel-adapted and symmetric
capacity-achieving along with having an efficient encoder, but we have not
demonstrated that the decoding is efficient. Also, the scheme may require
entanglement assistance, but we show that the rate of entanglement consumption
vanishes in the limit of large blocklength if the channel is degradable with
classical environment.Comment: 12 pages, 1 figure; v2: IEEE format, minor changes including new
figure; v3: minor changes, accepted for publication in IEEE Transactions on
Information Theor
Entanglement and secret-key-agreement capacities of bipartite quantum interactions and read-only memory devices
A bipartite quantum interaction corresponds to the most general quantum
interaction that can occur between two quantum systems in the presence of a
bath. In this work, we determine bounds on the capacities of bipartite
interactions for entanglement generation and secret key agreement between two
quantum systems. Our upper bound on the entanglement generation capacity of a
bipartite quantum interaction is given by a quantity called the bidirectional
max-Rains information. Our upper bound on the secret-key-agreement capacity of
a bipartite quantum interaction is given by a related quantity called the
bidirectional max-relative entropy of entanglement. We also derive tighter
upper bounds on the capacities of bipartite interactions obeying certain
symmetries. Observing that reading of a memory device is a particular kind of
bipartite quantum interaction, we leverage our bounds from the bidirectional
setting to deliver bounds on the capacity of a task that we introduce, called
private reading of a wiretap memory cell. Given a set of point-to-point quantum
wiretap channels, the goal of private reading is for an encoder to form
codewords from these channels, in order to establish secret key with a party
who controls one input and one output of the channels, while a passive
eavesdropper has access to one output of the channels. We derive both lower and
upper bounds on the private reading capacities of a wiretap memory cell. We
then extend these results to determine achievable rates for the generation of
entanglement between two distant parties who have coherent access to a
controlled point-to-point channel, which is a particular kind of bipartite
interaction.Comment: v3: 34 pages, 3 figures, accepted for publication in Physical Review
Construction of wiretap codes from ordinary channel codes
From an arbitrary given channel code over a discrete or Gaussian memoryless
channel, we construct a wiretap code with the strong security. Our construction
can achieve the wiretap capacity under mild assumptions. The key tool is the
new privacy amplification theorem bounding the eavesdropped information in
terms of the Gallager function.Comment: 5 pages, no figure, IEEEtran.cls. Submitted to 2010 IEEE ISI
Polar codes for private classical communication
We construct a new secret-key assisted polar coding scheme for private
classical communication over a quantum or classical wiretap channel. The
security of our scheme rests on an entropic uncertainty relation, in addition
to the channel polarization effect. Our scheme achieves the symmetric private
information rate by synthesizing "amplitude" and "phase" channels from an
arbitrary quantum wiretap channel. We find that the secret-key consumption rate
of the scheme vanishes for an arbitrary degradable quantum wiretap channel.
Furthermore, we provide an additional sufficient condition for when the secret
key rate vanishes, and we suspect that satisfying this condition implies that
the scheme requires no secret key at all. Thus, this latter condition addresses
an open question from the Mahdavifar-Vardy scheme for polar coding over a
classical wiretap channel.Comment: 11 pages, 2 figures, submission to the 2012 International Symposium
on Information Theory and its Applications (ISITA 2012), Honolulu, Hawaii,
US
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
- …