Generalized surface codes and packing of logical qubits

Abstract

We consider a notion of relative homology (and cohomology) for surfaces with two types of boundaries. Using this tool, we study a generalization of Kitaev's code based on surfaces with mixed boundaries. This construction includes both Bravyi and Kitaev's and Freedman and Meyer's extension of Kitaev's toric code. We argue that our generalization offers a denser storage of quantum information. In a planar architecture, we obtain a three-fold overhead reduction over the standard architecture consisting of a punctured square lattice.

28 pages

References in corpus (11)

• Fault-tolerant quantum computation by anyons
• Surface codes: Towards practical large-scale quantum computation
• Good Quantum Error-Correcting Codes Exist
• Fault-tolerant quantum computation with high threshold in two dimensions
• Topological fault-tolerance in cluster state quantum computation
• Building logical qubits in a superconducting quantum computing system
• A fault-tolerant one-way quantum computer
• Quantum codes on a lattice with boundary
• Low-distance Surface Codes under Realistic Quantum Noise
• Constructions and Noise Threshold of Hyperbolic Surface Codes
• Topological Quantum Error Correction with Optimal Encoding Rate

Cited by in corpus (6)

• Fusing Binary Interface Defects in Topological Phases: The $\mathrm{Vec}(\mathbb{Z}/p\mathbb{Z})$ case
• A Scalable Decoder Micro-architecture for Fault-Tolerant Quantum Computing
• A linear-time benchmarking tool for generalized surface codes
• Gauging Defects in Quantum Spin Systems
• Planar Floquet Codes
• Homology-changing percolation transitions on finite graphs