Unified Framework for Quantum Code Embedding

Abstract

Given a Calderbank-Shor-Steane (CSS) code, it is sometimes necessary to modify the code by adding an arbitrary number of physical qubits and parity checks. Motivations may include concatenating codes, embedding low-density parity check (LDPC) codes into finite-dimensional Euclidean space, or reducing the weights of parity checks. During this embedding, it is essential that the modified code possesses an isomorphic set of logical qubits as the original code. However, despite numerous explicit constructions, the conditions of when such a property holds true is not known in general. Therefore, using the language of homological algebra, we provide a unified framework that guarantees a natural isomorphism between the output and input codes. In particular, we explicitly show how previous works fit into our framework.

Minor tweaks, final version for publication

References in corpus (14)

• Topological quantum memory
• Fault-tolerant quantum computation with high threshold in two dimensions
• Surface code quantum computing by lattice surgery
• Models for gapped boundaries and domain walls
• Quantum LDPC codes with positive rate and minimum distance proportional to n^{1/2}
• A no-go theorem for a two-dimensional self-correcting quantum memory based on stabilizer codes
• Tradeoffs for reliable quantum information storage in 2D systems
• Balanced Product Quantum Codes
• Fault-Tolerance of "Bad" Quantum Low-Density Parity Check Codes
• Commuting Pauli Hamiltonians as maps between free modules
• Majorana Fermion Codes
• Single-shot error correction of three-dimensional homological product codes
• Fault-tolerant logical measurements via homological measurement
• Layer Codes