From simulatability to universality of continuous-variable quantum computers

Cameron Calcluth · 2025 · arXiv 预印本（Chalmers University of Technology 博士学位论文）

| 编号 QCV038 | 主题 连续变量与玻色子算术 | 链接 arXiv:2505.21618 |

摘要

摘要保留原文（英文）

摘要取自 arXiv / 出版方元数据，未作翻译，以保证与原文一致（作者自标注为 Abridged 版）。

(Abridged.) Quantum computers promise to solve some problems exponentially faster than traditional computers, but we still do not fully understand why this is the case. While the most studied model of quantum computation uses qubits, which are the quantum equivalent of a classical bit, an alternative method for building quantum computers is gaining traction. Continuous-variable devices, with their infinite range of measurement outcomes, use systems such as electromagnetic fields. Given this infinite-dimensional structure, combined with the complexities of quantum physics, we are left with a natural question: when are continuous-variable quantum computers more powerful than classical devices? This thesis investigates this question by exploring the boundary of which circuits are classically simulatable and which unlock a quantum advantage over classical computers. A series of proofs are presented demonstrating the efficient simulatability of progressively more complex circuits, even those with high amounts of Wigner negativity. Specifically, circuits initiated with highly Wigner-negative Gottesman-Kitaev-Preskill states, which form a grid-like structure in phase space, can be simulated in polynomial time.

本站词条在引用该文献时，会以 wikilink（sources/QCV038）链接到本页；右侧「反向链接」面板自动列出所有引用它的词条。