Erlangen 2018 – wissenschaftliches Programm
Bereiche | Tage | Auswahl | Suche | Aktualisierungen | Downloads | Hilfe
Q: Fachverband Quantenoptik und Photonik
Q 6: Quantum Information (Concepts and Methods) I
Q 6.2: Vortrag
Montag, 5. März 2018, 11:00–11:15, K 1.019
The Computational Complexity of Multiboson Correlation Interference — •Simon Laibacher1 and Vincenzo Tamma1,2 — 1Institut für Quantenphysik and Center for Integrated Quantum Science and Technology (IQST), Universität Ulm, D-89069 Ulm — 2Faculty of Science, SEES, University of Portsmouth, Portsmouth PO1 3QL, UK
Multiboson correlation sampling was introduced in [1] as a modification of boson sampling [2] in which the photons are detected in a temporally or spectrally resolved manner. Later, it was demonstrated that this problem remains classically hard when nonidentical photons are used, even if they are fully distinguishable in time or frequency at the input [3].
We show that this robustness of the computational complexity persists even if the distinguishability of the photons at the input is random between consecutive runs of the sampling experiment. This feature can be exploited to improve experimental implementations of sampling problems and to significantly simplify the upscaling of such setups to larger photon numbers.
[1] V. Tamma, S. Laibacher, Phys. Rev. Lett. 114, 243601 (2015).
[2] S. Aaronson, A. Arkhipov, in: Proceedings of the 43rd annual ACM symposium on Theory of computing (ACM, 2011) pp. 333–342.
[3] S. Laibacher, V. Tamma, Phys. Rev. Lett. 115, 243605 (2015).