On the experimental verification of quantum complexity in linear optics
On the experimental verification of quantum complexity in linear optics
复制标题
DOI：
10.1038/nphoton.2014.152
复制
发表时间：
2014-08-01
期刊：
影响因子：
35
通讯作者：
Laing, Anthony
中科院分区：
文献类型：
--
作者：
Carolan, Jacques;Meinecke, Jasmin D. A.;Laing, Anthony
量子计算机有望解决经典计算机永远难以解决的某些问题。这些设备中的第一个可能会解决适合其自身特定物理能力的定制问题。据推测，对许多量子力学干扰的玻色子的概率分布进行采样对于经典计算机来说是困难的，但可以用线性光学中的光子来解决。然而，此类问题的复杂性意味着其解决方案在数学上无法验证，因此建立成功操作的任务变成了收集足够令人信服的环境或实验证据。在这里，我们开发了可扩展的方法，通过实验为此类计算建立正确的操作，我们在集成光学电路中、在高达 50,000 维的希尔伯特空间上实现了三个、四个和五个光子。我们的广泛方法适用于所有量子计算架构，其中量子算法的形式验证方法要么难以处理，要么未知。
Quantum computers promise to solve certain problems that are forever intractable to classical computers. The first of these devices are likely to tackle bespoke problems suited to their own particular physical capabilities. Sampling the probability distribution from many bosons interfering quantum-mechanically is conjectured to be intractable to a classical computer but solvable with photons in linear optics. However, the complexity of this type of problem means its solution is mathematically unverifiable, so the task of establishing successful operation becomes one of gathering sufficiently convincing circumstantial or experimental evidence. Here, we develop scalable methods to experimentally establish correct operation for this class of computation, which we implement for three, four and five photons in integrated optical circuits, on Hilbert spaces of up to 50,000 dimensions. Our broad approach is practical for all quantum computational architectures where formal verification methods for quantum algorithms are either intractable or unknown.