论文标题
玻色量量子计算优势的资源
Resources for bosonic quantum computational advantage
论文作者
论文摘要
量子计算机承诺将大大优于其经典同行。但是，实现此类计算优势的非古典资源对于查明要精确而具有挑战性，因为它不是一个资源，而是许多可以负责这些潜在优势的微妙相互作用。在这项工作中，我们表明，每个验证量子计算都可以重铸为一个连续变化的采样计算，其中所有计算资源都包含在输入状态中。使用这种降低，我们得出了一种通用的经典算法，以实现玻感计算的强仿真，其复杂性与输入状态和测量设置的非高斯恒星等级相比。我们进一步研究了基于缺乏被动可分离性的非高斯纠缠的相关连续变量抽样计算的有效经典模拟的条件，并确定了非高斯纠缠的操作概念，从而阐明了诸如挤压，非高斯和纠缠和纠缠之类的玻色量量子计算资源的相互作用。
Quantum computers promise to dramatically outperform their classical counterparts. However, the non-classical resources enabling such computational advantages are challenging to pinpoint, as it is not a single resource but the subtle interplay of many that can be held responsible for these potential advantages. In this work, we show that every bosonic quantum computation can be recast into a continuous-variable sampling computation where all computational resources are contained in the input state. Using this reduction, we derive a general classical algorithm for the strong simulation of bosonic computations, whose complexity scales with the non-Gaussian stellar rank of both the input state and the measurement setup. We further study the conditions for an efficient classical simulation of the associated continuous-variable sampling computations and identify an operational notion of non-Gaussian entanglement based on the lack of passive separability, thus clarifying the interplay of bosonic quantum computational resources such as squeezing, non-Gaussianity and entanglement.
