11,773 research outputs found
Algorithmic Superactivation of Asymptotic Quantum Capacity of Zero-Capacity Quantum Channels
The superactivation of zero-capacity quantum channels makes it possible to
use two zero-capacity quantum channels with a positive joint capacity for their
output. Currently, we have no theoretical background to describe all possible
combinations of superactive zero-capacity channels; hence, there may be many
other possible combinations. In practice, to discover such superactive
zero-capacity channel-pairs, we must analyze an extremely large set of possible
quantum states, channel models, and channel probabilities. There is still no
extremely efficient algorithmic tool for this purpose. This paper shows an
efficient algorithmical method of finding such combinations. Our method can be
a very valuable tool for improving the results of fault-tolerant quantum
computation and possible communication techniques over very noisy quantum
channels.Comment: 35 pages, 17 figures, Journal-ref: Information Sciences (Elsevier,
2012), presented in part at Quantum Information Processing 2012 (QIP2012),
v2: minor changes, v3: published version; Information Sciences, Elsevier,
ISSN: 0020-0255; 201
Parts of Quantum States
It is shown that generic N-party pure quantum states (with equidimensional
subsystems) are uniquely determined by their reduced states of just over half
the parties; in other words, all the information in almost all N-party pure
states is in the set of reduced states of just over half the parties. For N
even, the reduced states in fewer than N/2 parties are shown to be an
insufficient description of almost all states (similar results hold when N is
odd). It is noted that Real Algebraic Geometry is a natural framework for any
analysis of parts of quantum states: two simple polynomials, a quadratic and a
cubic, contain all of their structure. Algorithmic techniques are described
which can provide conditions for sets of reduced states to belong to pure or
mixed states.Comment: 10 pages, 1 figur
- …