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 条
  • [1] Computational complexity in physics
    Moore, C
    [J]. COMPLEXITY FROM MICROSCOPIC TO MACROSCOPIC SCALES: COHERENCE AND LARGE DEVIATIONS, 2002, 63 : 131 - 135
  • [2] Parallel computational complexity in statistical physics
    Moriarty, KJ
    Machta, JL
    Greenlaw, R
    [J]. UNIFYING THEMES IN COMPLEX SYSTEMS, 2000, : 365 - 372
  • [3] Physics based computational complexity of nonlinear filters
    Daum, F
    Huang, J
    [J]. SIGNAL AND DATA PROCESSING OF SMALL TARGETS 2004, 2004, 5428 : 145 - 153
  • [4] SPECIAL ISSUE - COMPUTATIONAL PHYSICS - GRAPPLING WITH COMPLEXITY
    ZABUSKY, NJ
    [J]. PHYSICS TODAY, 1987, 40 (10) : 25 - 27
  • [5] Towards applying computational complexity to foundations of physics
    Kreinovich V.
    Finkelstein A.M.
    [J]. Journal of Mathematical Sciences, 2006, 134 (5) : 2358 - 2382
  • [6] Multiboson correlation interferometry with multimode thermal sources
    Tamma, Vincenzo
    Laibacher, Simon
    [J]. PHYSICAL REVIEW A, 2014, 90 (06):
  • [7] A minimum interference routing algorithm with reduced computational complexity
    Figueiredo, Gustavo B.
    da Fonseca, Nelson L. S.
    Monteiro, Jose A. S.
    [J]. COMPUTER NETWORKS, 2006, 50 (11) : 1710 - 1732
  • [8] COMPUTATIONAL-COMPLEXITY OF SOME INTERFERENCE GRAPH CALCULATIONS
    GAMST, A
    RALF, K
    [J]. IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 1990, 39 (02) : 140 - 149
  • [9] Computational Complexity of Interference Alignment for Symmetric MIMO Networks
    Ma, Liangping
    Xu, Tianyi
    Sternberg, Gregory
    [J]. IEEE COMMUNICATIONS LETTERS, 2013, 17 (12) : 2308 - 2311
  • [10] From Query Complexity to Computational Complexity
    Dobzinski, Shahar
    Vondrak, Jan
    [J]. STOC'12: PROCEEDINGS OF THE 2012 ACM SYMPOSIUM ON THEORY OF COMPUTING, 2012, : 1107 - 1116