205 research outputs found
Quantum repeaters with imperfect memories: cost and scalability
Memory dephasing and its impact on the rate of entanglement generation in
quantum repeaters is addressed. For systems that rely on probabilistic schemes
for entanglement distribution and connection, we estimate the maximum
achievable rate per employed memory for our optimized partial nesting protocol.
We show that, for any given distance , the polynomial scaling of rate with
distance can only be achieved if quantum memories with coherence times on the
order of or longer, with being the speed of light in the channel, are
available. The above rate degrades as a power of
with distance when the coherence time .Comment: Extended version with 5 figure
Continuous Variable Quantum Cryptography - beating the 3 dB loss limit
We demonstrate that secure quantum key distribution systems based on
continuous variables implementations can operate beyond the apparent 3 dB loss
limit that is implied by the beam splitting attack . The loss limit was
established for standard minimum uncertainty states such as coherent states. We
show that by an appropriate postselection mechanism we can enter a region where
Eve's knowledge falls behind the information shared between Alice and Bob even
in the presence of substantial losses.Comment: 4 pages, 2 figure
Strong quantitative benchmarking of quantum optical devices
Quantum communication devices, such as quantum repeaters, quantum memories,
or quantum channels, are unavoidably exposed to imperfections. However, the
presence of imperfections can be tolerated, as long as we can verify such
devices retain their quantum advantages. Benchmarks based on witnessing
entanglement have proven useful for verifying the true quantum nature of these
devices. The next challenge is to characterize how strongly a device is within
the quantum domain. We present a method, based on entanglement measures and
rigorous state truncation, which allows us to characterize the degree of
quantumness of optical devices. This method serves as a quantitative extension
to a large class of previously-known quantum benchmarks, requiring no
additional information beyond what is already used for the non-quantitative
benchmarks.Comment: 11 pages, 7 figures. Comments are welcome. ver 2: Improved figures,
no changes to main tex
A Note on Linear Optics Gates by Post-Selection
Recently it was realized that linear optics and photo-detectors with feedback
can be used for theoretically efficient quantum information processing. The
first of three steps toward efficient linear optics quantum computation (eLOQC)
was to design a simple non-deterministic gate, which upon post-selection based
on a measurement result implements a non-linear phase shift on one mode. Here a
computational strategy is given for finding non-deterministic gates for bosonic
qubits with helper photons. A more efficient conditional sign flip gate is
obtained.Comment: 14 pages. Minor changes for clarit
Security of quantum cryptography using balanced homodyne detection
In this paper we investigate the security of a quantum cryptographic scheme
which utilizes balanced homodyne detection and weak coherent pulse (WCP). The
performance of the system is mainly characterized by the intensity of the WCP
and postselected threshold. Two of the simplest intercept/resend eavesdropping
attacks are analyzed. The secure key gain for a given loss is also discussed in
terms of the pulse intensity and threshold.Comment: RevTeX4, 8pages, 7 figure
Estimates for practical quantum cryptography
In this article I present a protocol for quantum cryptography which is secure
against attacks on individual signals. It is based on the Bennett-Brassard
protocol of 1984 (BB84). The security proof is complete as far as the use of
single photons as signal states is concerned. Emphasis is given to the
practicability of the resulting protocol. For each run of the quantum key
distribution the security statement gives the probability of a successful key
generation and the probability for an eavesdropper's knowledge, measured as
change in Shannon entropy, to be below a specified maximal value.Comment: Authentication scheme corrected. Other improvements of presentatio
Passive decoy state quantum key distribution: Closing the gap to perfect sources
We propose a quantum key distribution scheme which closely matches the
performance of a perfect single photon source. It nearly attains the physical
upper bound in terms of key generation rate and maximally achievable distance.
Our scheme relies on a practical setup based on a parametric downconversion
source and present-day, non-ideal photon-number detection. Arbitrary
experimental imperfections which lead to bit errors are included. We select
decoy states by classical post-processing. This allows to improve the effective
signal statistics and achievable distance.Comment: 4 pages, 3 figures. State preparation correcte
- …