Bereiche | Tage | Auswahl | Suche | Aktualisierungen | Downloads | Hilfe

Q: Fachverband Quantenoptik und Photonik

Q 25: Quantum information: Quantum communication II

Q 25.2: Vortrag

Dienstag, 19. März 2013, 11:15–11:30, E 214

Detector efficiency in Communication Complexity and Bell test experiments — •Michael Epping — Institut für Theoretische Physik III, Heinrich-Heine-Universität Düsseldorf, Universitätsstr. 1, 40225 Düsseldorf

Suppose several separated parties need to calculate a function f(x), but each party has only access to one part of the input x. The amount of communication (in bits) necessary for the parties in order to calculate f is the communication complexity of f (see [1] for a survey). Similarly, one can ask for the probability of successful calculation of f if the communication is restricted. The parties can increase this probability if they share a non-local state, while the communication remains classical[2,3]. In this talk a link between the detection efficiency necessary for a quantum advantage in the task described above and the detection loophole of a Bell test experiment is presented. This is, the detection loophole can be closed when the detectors allow for a quantum advantage in the communication complexity task.

[1] H. Buhrman, R. Cleve, S. Massar and R. Wolf, "Non-locality and Communication Complexity", arXiv:0907.3584 (2009)

[2] C. Brukner, M. Zukowski, J. Pan and A. Zeilinger, "Bell's inequalities and quantum communication complexity", Phys. Rev. Lett., 92:127901 (2004)

[3] M. Epping, "Quantenkommunikationskomplexität mit nichtidealen Detektoren", Master's thesis, University of Vienna, Austria (2012)