论文标题

在HyperGraph产品代码中划分量子位以实现逻辑门

Partitioning qubits in hypergraph product codes to implement logical gates

论文作者

Quintavalle, Armanda O., Webster, Paul, Vasmer, Michael

论文摘要

高率低密度平价检查(LDPC)代码的承诺大大降低了易于故障的量子计算的开销,这取决于在此类代码上构建对逻辑门的有效,容忍度耐受性的实现。横向门是易于断层门的最简单类型,但是LDPC代码上横向门的潜力已被大大忽略了。我们研究了可以在HyperGraph产品代码(一类LDPC代码)中实现的横向门。通过为HyperGraph产品代码的逻辑运算符构建符合性规范基础,我们的分析得到了帮助,这可能引起了独立的关注。我们表明,在这些代码中,横向门可以在所有逻辑码头上实现Hadamard(达到逻辑交换门)和Control-Z。此外,我们表明,横向操作的序列与误差校正交织在一起,允许在同一代码块中的任意对逻辑Qubits之间实现纠缠门。因此,我们证明横向门可以用作辅助状态注入时在LDPC代码上通用量子计算的基础。

The promise of high-rate low-density parity check (LDPC) codes to substantially reduce the overhead of fault-tolerant quantum computation depends on constructing efficient, fault-tolerant implementations of logical gates on such codes. Transversal gates are the simplest type of fault-tolerant gate, but the potential of transversal gates on LDPC codes has hitherto been largely neglected. We investigate the transversal gates that can be implemented in hypergraph product codes, a class of LDPC codes. Our analysis is aided by the construction of a symplectic canonical basis for the logical operators of hypergraph product codes, a result that may be of independent interest. We show that in these codes transversal gates can implement Hadamard (up to logical SWAP gates) and control-Z on all logical qubits. Moreover, we show that sequences of transversal operations, interleaved with error correction, allow implementation of entangling gates between arbitrary pairs of logical qubits in the same code block. We thereby demonstrate that transversal gates can be used as the basis for universal quantum computing on LDPC codes, when supplemented with state injection.

扫码加入交流群

加入微信交流群

微信交流群二维码

扫码加入学术交流群,获取更多资源