含噪平面架构的无条件量子优势
Unconditional quantum advantage with noisy planar architectures
- Technical University of Munich(慕尼黑工业大学)
- Munich Center for Quantum Science and Technology (MCQST)(慕尼黑量子科学与工程中心)
机构由 AI 辅助整理,请以论文原文为准。
AI总结:
本研究证明,在二维局域操作和常数阈值以下局域随机噪声条件下,量子电路在计算能力上无条件超越AC0经典电路,并首次给出适用于平面量子设备、含噪声鲁棒性的复杂性分离结果。
AI中文摘要:
我们考虑在二维空间中受限于局域操作并受到低于常数阈值的局域随机噪声影响的量子设备。我们证明,此类电路在计算能力上严格强于AC0电路,即无噪声、几何上不受约束的常数深度经典电路,其门包括无扇入限制的AND、OR和NOT门。为此,我们展示了一个具有以下性质的计算问题:(i)该问题的任何实例都能被某个几何上二维局域的量子电路以高概率正确求解,即使该电路实现不完美;(ii)但任何多项式规模的AC0电路在求解该问题的某些实例时,会以常数概率失败。据我们所知,这是首个适用于平面量子设备、包含噪声鲁棒性且无条件的复杂性理论分离结果,即不依赖于复杂性理论假设。这使无条件量子优势的实验演示更接近实验现实。
英文摘要:
We consider quantum devices restricted to local operations in 2D and subject to local stochastic noise below a constant threshold. We show that such circuits are computationally more powerful than AC0-circuits, i.e., noise-free, geometrically-unconstrained constant-depth classical circuits with unbounded fan-in AND, OR and NOT gates. To this end, we exhibit a computational problem with the following properties: (i) Any instance of the problem is correctly solved with high probability by a certain geometrically 2D-local quantum circuit even if the latter is imperfectly implemented, but (ii) any polynomial-size AC0-circuit fails to solve certain instances of the problem with constant probability. To our knowledge, this isthe first complexity-theoretic separation which applies to planar quantum devices, incorporates noise-resilience and is unconditional, i.e., does not rely on complexity-theoretic assumptions. This brings the experimental demonstration of an unconditional quantum advantage closer to experimental realities.