5,054 research outputs found
Using Astrometry to Deblend Microlensing Events
We discuss the prospect of deblending microlensing events by observing
astrometric shifts of the lensed stars. Since microlensing searches are
generally performed in very crowded fields, it is expected that stars will be
confusion limited rather than limited by photon statistics. By performing
simulations of events in crowded fields, we find that if we assume a dark lens
and that the lensed star obeys a power law luminosity function, , over half the simulated events show a measurable astrometric
shift. Our simulations included 20000 stars in a Nyquist
sampled CCD frame. For , we found that 58% of the events were
significantly blended , and of those, 73% had a
large astrometric shift . Likewise, for , we found
that 85% of the events were significantly blended, and that 85% of those had
large shifts. Moreover, the shift is weakly correlated to the degree of
blending, suggesting that it may be possible not only to detect the existence
of a blend, but also to deblend events statistically using shift information.Comment: 24 pages, 7 postscript Figure
Entanglement Swapping Chains for General Pure States
We consider entanglement swapping schemes with general (rather than
maximally) entangled bipartite states of arbitary dimension shared pairwise
between three or more parties in a chain. The intermediate parties perform
generalised Bell measurements with the result that the two end parties end up
sharing a entangled state which can be converted into maximally entangled
states. We obtain an expression for the average amount of maximal entanglement
concentrated in such a scheme and show that in a certain reasonably broad class
of cases this scheme is provably optimal and that, in these cases, the amount
of entanglement concentrated between the two ends is equal to that which could
be concentrated from the weakest link in the chain.Comment: 18 pages, 5 figure
Mixed State Entanglement and Quantum Error Correction
Entanglement purification protocols (EPP) and quantum error-correcting codes
(QECC) provide two ways of protecting quantum states from interaction with the
environment. In an EPP, perfectly entangled pure states are extracted, with
some yield D, from a mixed state M shared by two parties; with a QECC, an arbi-
trary quantum state can be transmitted at some rate Q through a
noisy channel without degradation. We prove that an EPP involving one-
way classical communication and acting on mixed state (obtained
by sharing halves of EPR pairs through a channel ) yields a QECC on
with rate , and vice versa. We compare the amount of entanglement
E(M) required to prepare a mixed state M by local actions with the amounts
and that can be locally distilled from it by EPPs using one-
and two-way classical communication respectively, and give an exact expression
for when is Bell-diagonal. While EPPs require classical communica-
tion, QECCs do not, and we prove Q is not increased by adding one-way classical
communication. However, both D and Q can be increased by adding two-way com-
munication. We show that certain noisy quantum channels, for example a 50%
depolarizing channel, can be used for reliable transmission of quantum states
if two-way communication is available, but cannot be used if only one-way com-
munication is available. We exhibit a family of codes based on universal hash-
ing able toachieve an asymptotic (or ) of 1-S for simple noise models,
where S is the error entropy. We also obtain a specific, simple 5-bit single-
error-correcting quantum block code. We prove that {\em iff} a QECC results in
high fidelity for the case of no error the QECC can be recast into a form where
the encoder is the matrix inverse of the decoder.Comment: Resubmission with various corrections and expansions. See also
http://vesta.physics.ucla.edu/~smolin/ for related papers and information. 82
pages latex including 19 postscript figures included using psfig macro
Optimal Universal and State-Dependent Quantum Cloning
We establish the best possible approximation to a perfect quantum cloning
machine which produces two clones out of a single input. We analyze both
universal and state-dependent cloners. The maximal fidelity of cloning is shown
to be 5/6 for universal cloners. It can be achieved either by a special unitary
evolution or by a novel teleportation scheme. We construct the optimal
state-dependent cloners operating on any prescribed two non-orthogonal states,
discuss their fidelities and the use of auxiliary physical resources in the
process of cloning. The optimal universal cloners permit us to derive a new
upper bound on the quantum capacity of the depolarizing quantum channel.Comment: 30 pages (RevTeX), 2 figures (epsf), further results and further
authors added, to appear in Physical Review
Fault-Tolerant Error Correction with Efficient Quantum Codes
We exhibit a simple, systematic procedure for detecting and correcting errors
using any of the recently reported quantum error-correcting codes. The
procedure is shown explicitly for a code in which one qubit is mapped into
five. The quantum networks obtained are fault tolerant, that is, they can
function successfully even if errors occur during the error correction. Our
construction is derived using a recently introduced group-theoretic framework
for unifying all known quantum codes.Comment: 12 pages REVTeX, 1 ps figure included. Minor additions and revision
Hiding bits in Bell states
We present a scheme for hiding bits in Bell states that is secure even when
the sharers Alice and Bob are allowed to carry out local quantum operations and
classical communication. We prove that the information that Alice and Bob can
gain about a hidden bit is exponentially small in , the number of qubits in
each share, and can be made arbitrarily small for hiding multiple bits. We
indicate an alternative efficient low-entanglement method for preparing the
shared quantum states. We discuss how our scheme can be implemented using
present-day quantum optics.Comment: 4 pages RevTex, 1 figure, various small changes and additional
paragraph on optics implementatio
Schumacher's quantum data compression as a quantum computation
An explicit algorithm for performing Schumacher's noiseless compression of
quantum bits is given. This algorithm is based on a combinatorial expression
for a particular bijection among binary strings. The algorithm, which adheres
to the rules of reversible programming, is expressed in a high-level pseudocode
language. It is implemented using two- and three-bit primitive
reversible operations, where is the length of the qubit strings to be
compressed. Also, the algorithm makes use of auxiliary qubits; however,
space-saving techniques based on those proposed by Bennett are developed which
reduce this workspace to while increasing the running time by
less than a factor of two.Comment: 37 pages, no figure
Experimental Demonstration of Greenberger-Horne-Zeilinger Correlations Using Nuclear Magnetic Resonance
The Greenberger-Horne-Zeilinger (GHZ) effect provides an example of quantum
correlations that cannot be explained by classical local hidden variables. This
paper reports on the experimental realization of GHZ correlations using nuclear
magnetic resonance (NMR). The NMR experiment differs from the originally
proposed GHZ experiment in several ways: it is performed on mixed states rather
than pure states; and instead of being widely separated, the spins on which it
is performed are all located in the same molecule. As a result, the NMR version
of the GHZ experiment cannot entirely rule out classical local hidden
variables. It nonetheless provides an unambiguous demonstration of the
"paradoxical" GHZ correlations, and shows that any classical hidden variables
must communicate by non-standard and previously undetected forces. The NMR
demonstration of GHZ correlations shows the power of NMR quantum information
processing techniques for demonstrating fundamental effects in quantum
mechanics.Comment: Latex2.09, 8 pages, 1 eps figur
Locking classical correlation in quantum states
We show that there exist bipartite quantum states which contain large hidden
classical correlation that can be unlocked by a disproportionately small amount
of classical communication. In particular, there are -qubit states for
which a one bit message doubles the optimal classical mutual information
between measurement results on the subsystems, from bits to bits.
States exhibiting this behavior need not be entangled. We study the range of
states exhibiting this phenomenon and bound its magnitude.Comment: 7 pages, revtex
Quantum Channel Capacity of Very Noisy Channels
We present a family of additive quantum error-correcting codes whose
capacities exceeds that of quantum random coding (hashing) for very noisy
channels. These codes provide non-zero capacity in a depolarizing channel for
fidelity parameters when . Random coding has non-zero capacity
only for ; by analogy to the classical Shannon coding limit, this
value had previously been conjectured to be a lower bound. We use the method
introduced by Shor and Smolin of concatenating a non-random (cat) code within a
random code to obtain good codes. The cat code with block size five is shown to
be optimal for single concatenation. The best known multiple-concatenated code
we found has a block size of 25. We derive a general relation between the
capacity attainable by these concatenation schemes and the coherent information
of the inner code states.Comment: 31 pages including epsf postscript figures. Replaced to correct
important typographical errors in equations 36, 37 and in tex
- âŠ