From the Physics to the Computational Complexity of Multiboson Correlation Interference

被引:38
|
作者
Laibacher, Simon [1 ]
Tamma, Vincenzo
机构
[1] Univ Ulm, Inst Quantenphys, D-89069 Ulm, Germany
关键词
QUANTUM; ENTANGLEMENT; EFFICIENT; ALGORITHM; PHOTONS;
D O I
10.1103/PhysRevLett.115.243605
中图分类号
O4 [物理学];
学科分类号
0702 ;
摘要
We demonstrate how the physics of multiboson correlation interference leads to the computational complexity of linear optical interferometers based on correlation measurements in the degrees of freedom of the input bosons. In particular, we address the task of multiboson correlation sampling (MBCS) from the probability distribution associated with polarization- and time-resolved detections at the output of random linear optical networks. We show that the MBCS problem is fundamentally hard to solve classically even for nonidentical input photons, regardless of the color of the photons, making it also very appealing from an experimental point of view. These results fully manifest the quantum computational supremacy inherent to the fundamental nature of quantum interference.
引用
收藏
页数:6
相关论文
共 50 条
  • [21] Mathematical Model of Steganalysis Algorithms Correlation Estimation with Computational Complexity Considering
    Atlasov, I. V.
    Menshikh, V. V.
    Solodukha, R. A.
    [J]. 2017 2ND INTERNATIONAL URAL CONFERENCE ON MEASUREMENTS (URALCON), 2017, : 227 - 232
  • [22] Computational complexity and knowledge complexity
    Goldreich, O
    Ostrovsky, R
    Petrank, E
    [J]. SIAM JOURNAL ON COMPUTING, 1998, 27 (04) : 1116 - 1141
  • [23] On computational complexity of graph inference from counting
    Fazekas, Szilard Zsolt
    Ito, Hiro
    Okuno, Yasushi
    Seki, Shinnosuke
    Taneishi, Kei
    [J]. NATURAL COMPUTING, 2013, 12 (04) : 589 - 603
  • [24] On computational complexity of graph inference from counting
    Szilárd Zsolt Fazekas
    Hiro Ito
    Yasushi Okuno
    Shinnosuke Seki
    Kei Taneishi
    [J]. Natural Computing, 2013, 12 : 589 - 603
  • [25] Use of Deep Learning to Improve the Computational Complexity of Reconstruction Algorithms in High Energy Physics
    Valls Canudas, Nuria
    Calvo Gomez, Miriam
    Golobardes Ribe, Elisabet
    Vilasis-Cardona, Xavier
    [J]. APPLIED SCIENCES-BASEL, 2021, 11 (23):
  • [26] Computational Complexity
    Tenreiro Machado, J. A.
    Lopes, Antonio M.
    [J]. ENTROPY, 2017, 19 (02):
  • [27] COMPUTATIONAL COMPLEXITY
    Trevisan, Luca
    Fortnow, Lance
    [J]. BULLETIN OF THE EUROPEAN ASSOCIATION FOR THEORETICAL COMPUTER SCIENCE, 2022, 2022 (136):
  • [28] Computational complexity reduction of trellis-coded co-channel interference canceller
    Murata, H
    Fujiwara, A
    Yoshida, S
    [J]. IEICE TRANSACTIONS ON COMMUNICATIONS, 1996, E79B (03) : 342 - 352
  • [29] Scattershot multiboson correlation sampling with random photonic inner-mode multiplexing
    Tamma, Vincenzo
    Laibacher, Simon
    [J]. EUROPEAN PHYSICAL JOURNAL PLUS, 2023, 138 (04):
  • [30] Physics, complexity and causality
    Ellis, GFR
    [J]. NATURE, 2005, 435 (7043) : 743 - 743