期刊
PHYSICAL REVIEW A
卷 89, 期 2, 页码 -出版社
AMER PHYSICAL SOC
DOI: 10.1103/PhysRevA.89.022328
关键词
-
资金
- NPSC/NIST fellowship program
- NSF
- Intelligence Advanced Research Projects Activity (IARPA) via Department of Interior National Business Center [D12PC00527]
Aaronson and Arkhipov recently used computational complexity theory to argue that classical computers very likely cannot efficiently simulate linear, multimode, quantum-optical interferometers with arbitrary Fock-state inputs [Aaronson and Arkhipov, Theory Comput. 9, 143 (2013)]. Here we present an elementary argument that utilizes only techniques from quantum optics. We explicitly construct the Hilbert space for such an interferometer and showthat its dimension scales exponentiallywith all the physical resources. We also showin a simple example just how the Schrodinger and Heisenberg pictures of quantum theory, while mathematically equivalent, are not in general computationally equivalent. Finally, we conclude our argument by comparing the symmetry requirements of multiparticle bosonic to fermionic interferometers and, using simple physical reasoning, connect the nonsimulatability of the bosonic device to the complexity of computing the permanent of a large matrix.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据