aktualisiertes pdf - DPG-Tagungen
aktualisiertes pdf - DPG-Tagungen
aktualisiertes pdf - DPG-Tagungen
Sie wollen auch ein ePaper? Erhöhen Sie die Reichweite Ihrer Titel.
YUMPU macht aus Druck-PDFs automatisch weboptimierte ePaper, die Google liebt.
ods are limited due to the loss in the quantum channel (e.g. loss in the<br />
optical fiber) and in the single-photon counters of the receivers. One can<br />
argue that the loss in the detectors cannot be changed by an eavesdropper<br />
in order to increase the covered distance. Here we show that the<br />
security analysis of this scenario is not as easy as is commonly assumed,<br />
since already two-photon processes allow eavesdropping strategies that<br />
outperform the known photon-number splitting attack. For this reason<br />
there is, so far, no satisfactory security analysis available in the framework<br />
of individual attacks.<br />
[1] B. Huttner, N. Imoto, N. Gisin and T. Mor, Phys. Rev. A 51, 1863<br />
(1995); H. Inamori, N. Lütkenhaus and D. Mayers, quant-ph/0107017.<br />
[2] M. Curty and N. Lütkenhaus, quant-ph/0311066.<br />
Q 7.3 Mo 17:00 HS 101<br />
Robustness of the BB84 Quantum Key Distribution Against<br />
Collective Attacks — •Georgios Nikolopoulos and Gernot Alber<br />
— Institut für Angewandte Physik, Technische Universität Darmstadt,<br />
D-64289 Darmstadt<br />
Quantum key distribution protocols exploit quantum correlations in<br />
order to establish a secure key between two legitimate users. Recent work<br />
on quantum cryptography [1-3] has revealed a remarkable link between<br />
quantum and secret correlations. So far, it is not known, however, what is<br />
the maximum disturbance (upper robustness bound) up to which Alice<br />
and Bob can share non-classical correlations and what an eavesdropper<br />
can achieve by employing an appropriately optimized strategy. We<br />
present recent results concerning these upper robustness bounds for the<br />
BB84 protocol under the assumption of general coherent eavesdropping<br />
strategies.<br />
/1/ M. Curty, M. Lewenstein, and N. Lütkenhaus, quant-ph/0307151<br />
(2003).<br />
/2/ A. Acin and N. Gisin, quant-ph/0310054 (2003).<br />
/3/ A. Acin, L. Masanes, and N. Gisin, Phys. Rev. Let. 91, 167901 (2003).<br />
Q 7.4 Mo 17:15 HS 101<br />
Multiplexed quantum cryptography with cascaded photons<br />
from a single quantum dot — •Thomas Aichele 1 , Valéry<br />
Zwiller 2 , Gaël Reinaudi 1 , and Oliver Benson 1 — 1 Humboldt-<br />
Universität zu Berlin, Nano-Optik — 2 Ecole Polytechnique Fédérale de<br />
Lausanne, Switzerland<br />
Efficient generation of single photons is an important task for modern<br />
quantum technology such as quantum computation and quantum<br />
cryptography. In quantum cryptography with single photon sources the<br />
transition lifetime limits the maximum achievable transmission rate of<br />
quantum bits.<br />
Here we present and demonstrate a method to further enhance the<br />
effective transmission rate by using multiplexing similar as in classical<br />
communication channels. This method relies on cascaded multi-photon<br />
emission that is observed in single InP quantum dots (QDs). Cross correlations<br />
between different photoluminescence spectral lines prove the excistence<br />
of this cascade and also reveal their dynamics. Auto-correlation<br />
measurements on both the individual spectral lines as on the multiplexed<br />
signal show single photon statistics. As a proof of principle we implemented<br />
a BB84 quantum cryptography setup using this multiplexing<br />
technique.<br />
Q 7.5 Mo 17:30 HS 101<br />
A Compact Source for Polarization Entangled Photon Pairs<br />
— •Hannes Böhm 1 , Andreas Poppe 1 , Markus Aspelmeyer 1 ,<br />
Thomas Jennewein 1 , and Anton Zeilinger 1,2 — 1 Institut fuer Experimentalphysik,<br />
University of Vienna, Austria — 2 Institute for Quantum<br />
Optics and Quantum Information, Austrian Academy of Sciences<br />
We present a compact source for polarization-entangled photon pairs<br />
based on spontaneous parametric down-conversion (SPDC). Its small<br />
size, low power consumption and high efficiency make it a versatile tool<br />
for quantum communication experiments. In a recent outdoor experiment<br />
it was used to demonstrate the distribution of entanglement between two<br />
independent observers separated by 600m using optical free space links.<br />
Q 7.6 Mo 17:45 HS 101<br />
Measurements for quantum communication using linear<br />
optics — •Philippe Raynal, Peter van Loock, and Norbert<br />
Lütkenhaus — Institut für Theoretische Physik I, Universität<br />
Erlangen-Nürnberg, Staudtstrasse, 7/B1 91058 Erlangen, Deutschland<br />
82<br />
There is a set of simple criteria to decide whether a given projection<br />
measurement can be, in principle, exactly implemented solely by means<br />
of linear optics utilizing photon counting or homodyne detections [1].<br />
The linear-optics toolbox includes auxiliary photons and conditional dynamics,<br />
i.e., the adjustment of subsequent linear-optics transformations<br />
of the conditional states after measuring a first mode. Here we add more<br />
tools such as phase-space displacements and squeezing and incorporate<br />
them into the criteria. This enables one to treat important measurements<br />
for quantum communication in the continuous-variable regime where the<br />
signal states have an unfixed and unbounded photon number. We further<br />
discuss the extension of our approach to generalized measurements<br />
(POVM’s).<br />
[1] P. van Loock, N. Lütkenhaus, PRA (in press), quant-ph/0304057.<br />
Q 7.7 Mo 18:00 HS 101<br />
Experimental quantum communication complexity —<br />
•Pavel Trojek 1,2 , Christian Schmid 1,2 , Mohamed Bourennane<br />
1,2 , Marek ˇ Zukowski 3 , and Harald Weinfurter 1,2 —<br />
1 Ludwig-Maximilians-Universität, D-80797 München, Germany —<br />
2 Max-Planck-Institut für Quantenoptik, D-85748 Garching, — 3 Instytut<br />
Fizyki Teoretycznej i Astrofizyki Uniwersytet Gdański, PL-80-952<br />
Gdańsk, Poland<br />
Quantum communication complexity is one of the promising applications<br />
in quantum information processing. It tackles the problem of<br />
communication reduction during distributed computation tasks by the<br />
utilization of quantum effects.<br />
We report on the experimental realization of one-qubit communication<br />
complexity protocol, in which five parties must determine in common<br />
the correct value of a specific Boolean function with the highest possible<br />
probability of success. This function depends on personal random data<br />
distributed initially to each party. To accomplish the task the parties can<br />
communicate sequentially only one qubit.<br />
The protocol is implemented using single photon passing through all<br />
parties and the last one performs an analysis of a photon polarization<br />
state. The personal information of each party is encoded via a phase<br />
transformation to the photon state. For a fair comparison with classical<br />
one-bit protocol, no experimental runs are discarded, even if the detection<br />
of photon fails. The obtained results enabled us to demonstrate for<br />
the first time the superiority of quantum communication over its classical<br />
counterpart for a broad class of distributed computation tasks.<br />
Q 7.8 Mo 18:15 HS 101<br />
Breaking entanglement in noisy channels — •Thomas Konrad 1 ,<br />
Jürgen Audretsch 1 , and Lajos Diosi 2 — 1 Fachbereich Physik<br />
Universität Konstanz — 2 Research Institute for Particle and Nuclear<br />
Physics, Budapest<br />
How noisy is a quantum communication channel allowed to be before<br />
it completely destroys the entanglement between two quantum systems,<br />
one of which traverses the channel? We address this question by relating<br />
a rather abstract criterion [1] for entanglement breaking maps to a quantity<br />
which characterizes the channel noise . On the way some properties<br />
of entanglement breaking maps are reviewed.<br />
[1] M. Horodecki, P.W. Shor and M.B.Ruskai, ”Entanglement Breaking<br />
Channels” quant-ph/0302031<br />
Q 7.9 Mo 18:30 HS 101<br />
Quantum Cellular Automata and the Capacity of Quantum<br />
Channels with Memory — •Dennis Kretschmann, Dirk<br />
Schlingemann, and Reinhard F. Werner — Institut für Mathematische<br />
Physik, Technische Universität Braunschweig, Mendelssohnstr.<br />
3, 38106 Braunschweig, Germany<br />
Any processing of quantum information, be it storage or transfer, can<br />
be represented by a quantum channel. Quantum channel capacity expresses<br />
quantitatively how much quantum information can be stored in<br />
a physical device, or sent down a transmission line: it is the maximal<br />
number of qubit transmissions per use of the channel, taken in the limit<br />
of long messages.<br />
Up to now most of the work on quantum channels has focused on<br />
memoryless channels, which are characterized by the requirement that<br />
successive channel inputs are acted on independently. In many real-world<br />
settings this assumption cannot be justified. In this talk we show how to<br />
describe and characterize quantum channels with memory, emphasizing<br />
and exploiting connections with the theory of quantum cellular automata<br />
and the physics of spin chains.