548 research outputs found
Supercatalysis
We show that entanglement-assisted transformations of bipartite entangled
states can be more efficient than catalysis [D. Jonathan and M. B. Plenio,
Phys. Rev. Lett. 83, 3566 (1999)}, i.e., given two incomparable bipartite
states not only can the transformation be enabled by performing collective
operations with an auxiliary entangled state, but the entanglement of the
auxiliary state itself can be enhanced. We refer to this phenomenon as
supercatalysis. We provide results on the properties of supercatalysis and its
relationship with catalysis. In particular, we obtain a useful necessary and
sufficient condition for catalysis, provide several sufficient conditions for
supercatalysis and study the extent to which entanglement of the auxiliary
state can be enhanced via supercatalysis.Comment: Latex, 5 page
Quantum Network Coding
Since quantum information is continuous, its handling is sometimes
surprisingly harder than the classical counterpart. A typical example is
cloning; making a copy of digital information is straightforward but it is not
possible exactly for quantum information. The question in this paper is whether
or not quantum network coding is possible. Its classical counterpart is another
good example to show that digital information flow can be done much more
efficiently than conventional (say, liquid) flow.
Our answer to the question is similar to the case of cloning, namely, it is
shown that quantum network coding is possible if approximation is allowed, by
using a simple network model called Butterfly. In this network, there are two
flow paths, s_1 to t_1 and s_2 to t_2, which shares a single bottleneck channel
of capacity one. In the classical case, we can send two bits simultaneously,
one for each path, in spite of the bottleneck. Our results for quantum network
coding include: (i) We can send any quantum state |psi_1> from s_1 to t_1 and
|psi_2> from s_2 to t_2 simultaneously with a fidelity strictly greater than
1/2. (ii) If one of |psi_1> and |psi_2> is classical, then the fidelity can be
improved to 2/3. (iii) Similar improvement is also possible if |psi_1> and
|psi_2> are restricted to only a finite number of (previously known) states.
(iv) Several impossibility results including the general upper bound of the
fidelity are also given.Comment: 27pages, 11figures. The 12page version will appear in 24th
International Symposium on Theoretical Aspects of Computer Science (STACS
2007
Conditional beam splitting attack on quantum key distribution
We present a novel attack on quantum key distribution based on the idea of
adaptive absorption [calsam01]. The conditional beam splitting attack is shown
to be much more efficient than the conventional beam spitting attack, achieving
a performance similar to the, powerful but currently unfeasible, photon number
splitting attack. The implementation of the conditional beam splitting attack,
based solely on linear optical elements, is well within reach of current
technology.Comment: Submitted to Phys. Rev.
Ordering states with entanglement measures
We demonstrate that all good asymptotic entanglement measures are either
identical or place a different ordering on the set of all quantum states.Comment: 6 pages, minor changes, references updated, all conclusions
unchanged, now accepted for publicatio
Recent advances in the detection of repeat expansions with short-read next-generation sequencing
Short tandem repeats (STRs), also known as microsatellites, are commonly defined as consisting of tandemly repeated nucleotide motifs of 2-6 base pairs in length. STRs appear throughout the human genome, and about 239,000 are documented in the Simple Repeats Track available from the UCSC (University of California, Santa Cruz) genome browser. STRs vary in size, producing highly polymorphic markers commonly used as genetic markers. A small fraction of STRs (about 30 loci) have been associated with human disease whereby one or both alleles exceed an STR-specific threshold in size, leading to disease. Detection of repeat expansions is currently performed with polymerase chain reaction-based assays or with Southern blots for large expansions. The tests are expensive and time-consuming and are not always conclusive, leading to lengthy diagnostic journeys for patients, potentially including missed diagnoses. The advent of whole exome and whole genome sequencing has identified the genetic cause of many genetic disorders; however, analysis pipelines are focused primarily on the detection of short nucleotide variations and short insertions and deletions (indels). Until recently, repeat expansions, with the exception of the smallest expansion (SCA6), were not detectable in next-generation short-read sequencing datasets and would have been ignored in most analyses. In the last two years, four analysis methods with accompanying software (ExpansionHunter, exSTRa, STRetch, and TREDPARSE) have been released. Although a comprehensive comparative analysis of the performance of these methods across all known repeat expansions is still lacking, it is clear that these methods are a valuable addition to any existing analysis pipeline. Here, we detail how to assess short-read data for evidence of expansions, reviewing all four methods and outlining their strengths and weaknesses. Implementation of these methods should lead to increased diagnostic yield of repeat expansion disorders for known STR loci and has the potential to detect novel repeat expansions
Exponential Decay of Correlations Implies Area Law
We prove that a finite correlation length, i.e. exponential decay of
correlations, implies an area law for the entanglement entropy of quantum
states defined on a line. The entropy bound is exponential in the correlation
length of the state, thus reproducing as a particular case Hastings proof of an
area law for groundstates of 1D gapped Hamiltonians.
As a consequence, we show that 1D quantum states with exponential decay of
correlations have an efficient classical approximate description as a matrix
product state of polynomial bond dimension, thus giving an equivalence between
injective matrix product states and states with a finite correlation length.
The result can be seen as a rigorous justification, in one dimension, of the
intuition that states with exponential decay of correlations, usually
associated with non-critical phases of matter, are simple to describe. It also
has implications for quantum computing: It shows that unless a pure state
quantum computation involves states with long-range correlations, decaying at
most algebraically with the distance, it can be efficiently simulated
classically.
The proof relies on several previous tools from quantum information theory -
including entanglement distillation protocols achieving the hashing bound,
properties of single-shot smooth entropies, and the quantum substate theorem -
and also on some newly developed ones. In particular we derive a new bound on
correlations established by local random measurements, and we give a
generalization to the max-entropy of a result of Hastings concerning the
saturation of mutual information in multiparticle systems. The proof can also
be interpreted as providing a limitation on the phenomenon of data hiding in
quantum states.Comment: 35 pages, 6 figures; v2 minor corrections; v3 published versio
Optimal quantum teleportation with an arbitrary pure state
We derive the maximum fidelity attainable for teleportation using a shared
pair of d-level systems in an arbitrary pure state. This derivation provides a
complete set of necessary and sufficient conditions for optimal teleportation
protocols. We also discuss the information on the teleported particle which is
revealed in course of the protocol using a non-maximally entangled state.Comment: 10 pages, REVTe
Noise-assisted preparation of entangled atoms
We discuss the generation of entangled states of two two-level atoms inside
an optical cavity. The cavity mode is supposed to be coupled to a white noise
with adjustable intensity. We describe how the entanglement between the atoms
inside the cavity arise in such a situation. The entanglement is maximized for
intermediate values of the noise intensity, while it is a monotonic function of
the spontaneous rate. This resembles the phenomenon of stochastic resonance and
sheds more light on the idea to exploit white noise in quantum information
processing.Comment: 4 pages, 4 figure
Optical Bell measurement by Fock filtering
We describe a nonlinear interferometric setup to perform a complete optical Bell measurement, i.e. to unambigously discriminate the four polarization entangled EPR-Bell photon pairs. The scheme is robust against detector inefficiency
- …