699 research outputs found
Quantum data hiding in the presence of noise
When classical or quantum information is broadcast to separate receivers,
there exist codes that encrypt the encoded data such that the receivers cannot
recover it when performing local operations and classical communication, but
they can decode reliably if they bring their systems together and perform a
collective measurement. This phenomenon is known as quantum data hiding and
hitherto has been studied under the assumption that noise does not affect the
encoded systems. With the aim of applying the quantum data hiding effect in
practical scenarios, here we define the data-hiding capacity for hiding
classical information using a quantum channel. Using this notion, we establish
a regularized upper bound on the data hiding capacity of any quantum broadcast
channel, and we prove that coherent-state encodings have a strong limitation on
their data hiding rates. We then prove a lower bound on the data hiding
capacity of channels that map the maximally mixed state to the maximally mixed
state (we call these channels "mictodiactic"---they can be seen as a
generalization of unital channels when the input and output spaces are not
necessarily isomorphic) and argue how to extend this bound to generic channels
and to more than two receivers.Comment: 12 pages, accepted for publication in IEEE Transactions on
Information Theor
Second-Order Asymptotics for the Classical Capacity of Image-Additive Quantum Channels
We study non-asymptotic fundamental limits for transmitting classical
information over memoryless quantum channels, i.e. we investigate the amount of
classical information that can be transmitted when a quantum channel is used a
finite number of times and a fixed, non-vanishing average error is permissible.
We consider the classical capacity of quantum channels that are image-additive,
including all classical to quantum channels, as well as the product state
capacity of arbitrary quantum channels. In both cases we show that the
non-asymptotic fundamental limit admits a second-order approximation that
illustrates the speed at which the rate of optimal codes converges to the
Holevo capacity as the blocklength tends to infinity. The behavior is governed
by a new channel parameter, called channel dispersion, for which we provide a
geometrical interpretation.Comment: v2: main results significantly generalized and improved; v3: extended
to image-additive channels, change of title, journal versio
Recoverability in quantum information theory
The fact that the quantum relative entropy is non-increasing with respect to
quantum physical evolutions lies at the core of many optimality theorems in
quantum information theory and has applications in other areas of physics. In
this work, we establish improvements of this entropy inequality in the form of
physically meaningful remainder terms. One of the main results can be
summarized informally as follows: if the decrease in quantum relative entropy
between two quantum states after a quantum physical evolution is relatively
small, then it is possible to perform a recovery operation, such that one can
perfectly recover one state while approximately recovering the other. This can
be interpreted as quantifying how well one can reverse a quantum physical
evolution. Our proof method is elementary, relying on the method of complex
interpolation, basic linear algebra, and the recently introduced Renyi
generalization of a relative entropy difference. The theorem has a number of
applications in quantum information theory, which have to do with providing
physically meaningful improvements to many known entropy inequalities.Comment: v5: 26 pages, generalized lower bounds to apply when supp(rho) is
contained in supp(sigma
Quantum Data Locking for Secure Communication against an Eavesdropper with Time-Limited Storage
Quantum cryptography allows for unconditionally secure communication against an eavesdropper endowed with unlimited computational power and perfect technologies, who is only constrained by the laws of physics. We review recent results showing that, under the assumption that the eavesdropper can store quantum information only for a limited time, it is possible to enhance the performance of quantum key distribution in both a quantitative and qualitative fashion. We consider quantum data locking as a cryptographic primitive and discuss secure communication and key distribution protocols. For the case of a lossy optical channel, this yields the theoretical possibility of generating secret key at a constant rate of 1 bit per mode at arbitrarily long communication distances.United States. Army Research Office (United States. Defense Advanced Research Projects Agency. Quiness Program (W31P4Q-12-1-0019
Probabilistic theories with purification
We investigate general probabilistic theories in which every mixed state has
a purification, unique up to reversible channels on the purifying system. We
show that the purification principle is equivalent to the existence of a
reversible realization of every physical process, namely that every physical
process can be regarded as arising from a reversible interaction of the system
with an environment, which is eventually discarded. From the purification
principle we also construct an isomorphism between transformations and
bipartite states that possesses all structural properties of the
Choi-Jamiolkowski isomorphism in quantum mechanics. Such an isomorphism allows
one to prove most of the basic features of quantum mechanics, like e.g.
existence of pure bipartite states giving perfect correlations in independent
experiments, no information without disturbance, no joint discrimination of all
pure states, no cloning, teleportation, no programming, no bit commitment,
complementarity between correctable channels and deletion channels,
characterization of entanglement-breaking channels as measure-and-prepare
channels, and others, without resorting to the mathematical framework of
Hilbert spaces.Comment: Differing from the journal version, this version includes a table of
contents and makes extensive use of boldface type to highlight the contents
of the main theorems. It includes a self-contained introduction to the
framework of general probabilistic theories and a discussion about the role
of causality and local discriminabilit
Towards a resolution of the spin alignment problem
Consider minimizing the entropy of a mixture of states by choosing each state
subject to constraints. If the spectrum of each state is fixed, we expect that
in order to reduce the entropy of the mixture, we should make the states less
distinguishable in some sense. Here, we study a class of optimization problems
that are inspired by this situation and shed light on the relevant notions of
distinguishability. The motivation for our study is the spin alignment
conjecture introduced recently in Ref.~\cite{Leditzky2022a}. In the original
version of the underlying problem, each state in the mixture is constrained to
be a freely chosen state on a subset of qubits tensored with a fixed
state on each of the qubits in the complement. According to the
conjecture, the entropy of the mixture is minimized by choosing the freely
chosen state in each term to be a tensor product of projectors onto a fixed
maximal eigenvector of , which maximally ``aligns'' the terms in the
mixture. We generalize this problem in several ways. First, instead of
minimizing entropy, we consider maximizing arbitrary unitarily invariant convex
functions such as Fan norms and Schatten norms. To formalize and generalize the
conjectured required alignment, we define \textit{alignment} as a preorder on
tuples of self-adjoint operators that is induced by majorization. We prove the
generalized conjecture for Schatten norms of integer order, for the case where
the freely chosen states are constrained to be classical, and for the case
where only two states contribute to the mixture and is proportional to a
projector. The last case fits into a more general situation where we give
explicit conditions for maximal alignment. The spin alignment problem has a
natural ``dual" formulation, versions of which have further generalizations
that we introduce.Comment: 36 pages. Comments are welcome
- …