Bereiche | Tage | Auswahl | Suche | Aktualisierungen | Downloads | Hilfe
Q: Fachverband Quantenoptik und Photonik
Q 23: Quantum Information: Concepts and Methods IV
Q 23.1: Vortrag
Dienstag, 1. März 2016, 14:30–14:45, e214
The Computational Complexity of Multiboson Correlation Interference — •Simon Laibacher and Vincenzo Tamma — Institut für Quantenphysik and Center for Integrated Quantum Science and Technology (IQST), Universität Ulm, D-89069 Ulm, Germany
In our talk, we demonstrate that a computational power beyond any classical capabilities can be achieved in bosonic linear interferometers even with nonidentical photons [1]. This approach overcomes the challenge of generating identical bosons, which so far have been essential in quantum information processing, including the well-known problem of boson sampling [2].
In contrast to the original formulation of boson sampling, we investigate MultiBoson Correlation Sampling, where time-resolved sampling measurements at the interferometer output are performed [3,4]. Interestingly, even with photons of completely different colors this problem is at least as computationally hard as the original boson sampling problem with identical photons[1].
These results demonstrate the quantum computational supremacy inherent in the fundamental nature of quantum interference [3].
[1] Laibacher and Tamma, in press in Phys. Rev. Lett. (2015)
[2] Aaronson and Arkhipov, in Proceedings of the 43rd annual ACM
symposium on Theory of computing (ACM, 2011) pp. 333–342
[3] Tamma and Laibacher, Phys. Rev. Lett. 114, 243601 (2015)
[4] Tamma and Laibacher, Quantum Inf. Proc. (2015).
DOI:10.1007/s11128-015-1177-8