Related papers: A no-go theorem for a two-dimensional self-correct…
Collective coherent (CC) errors are inevitable, as every physical qubit undergoes free evolution under its kinetic Hamiltonian. These errors can be more damaging than stochastic Pauli errors because they affect all qubits coherently,…
Local decoders provide a promising approach to real-time quantum error-correction by replacing centralized classical decoding, with significant hardware constraints, by a fully distributed architecture based on a simple, local update rule.…
We prove several theorems characterizing the existence of homological error correction codes both classically and quantumly. Not every classical code is homological, but we find a family of classical homological codes saturating the Hamming…
Quantum codes with low-weight stabilizers known as LDPC codes have been actively studied recently due to their simple syndrome readout circuits and potential applications in fault-tolerant quantum computing. However, all families of quantum…
We construct a Pauli stabilizer model for every two-dimensional Abelian topological order that admits a gapped boundary. Our primary example is a Pauli stabilizer model on four-dimensional qudits that belongs to the double semion (DS) phase…
Due to their fast decoding algorithms, quantum generalizations of low-density parity check, or LDPC, codes have been investigated as a solution to the problem of decoherence in fragile quantum states. However, the additional twisted inner…
We construct explicitly two infinite families of genuine nonadditive 1-error correcting quantum codes and prove that their coding subspaces are 50% larger than those of the optimal stabilizer codes of the same parameters via the linear…
We study restrictions on locality-preserving unitary logical gates for topological quantum codes in two spatial dimensions. A locality-preserving operation is one which maps local operators to local operators --- for example, a…
We explore the design of quantum error-correcting codes for cases where the decoherence events of qubits are correlated. In particular, we consider the case where only spatially contiguous qubits decohere, which is analogous to the case of…
An orthogonal set of states in multipartite systems is called to be strong quantum nonlocality if it is locally irreducible under every bipartition of the subsystems…
Designs for quantum error correction depend strongly on the connectivity of the qubits. For solid state qubits, the most straightforward approach is to have connectivity constrained to a planar graph. Practical considerations may also…
In quantum error-correcting code (QECC), many quantum operations and measurements are necessary to correct errors in logical qubits. In the stabilizer formalism, which is widely used in QECC, generators $G_i (i=1,2,..)$ consist of multiples…
The importance of quantum error correction in paving the way to build a practical quantum computer is no longer in doubt. This dissertation makes a threefold contribution to the mathematical theory of quantum error-correcting codes.…
We develop the procedures of gauging and ungauging, reveal their operational meaning and propose their generalization in a systematic manner within the framework of quantum error-correcting codes. We demonstrate with an example of the…
In this paper, we introduce a construction of quantum convolutional codes (QCCs) based on difference triangle sets (DTSs). To construct QCCs, one must determine polynomial stabilizers $X(D)$ and $Z(D)$ that commute (symplectic…
The surface code is a promising platform for a quantum memory, but its threshold under coherent errors remains incompletely understood. We study maximum-likelihood decoding of the square-lattice surface code in the presence of single-qubit…
In fault-tolerant quantum computation, the preparation of logical states is a ubiquitous subroutine, yet significant challenges persist even for the simplest states required. In the present work, we present a unitary, scalable,…
A powerful method for analyzing quantum error-correcting codes is to map them onto classical statistical mechanics models. Such mappings have thus far mostly focused on static codes, possibly subject to repeated syndrome measurements.…
We show that within any quantum stabilizer code there lurks a classical binary linear code with similar error-correcting capabilities, thereby demonstrating new connections between quantum codes and classical codes. Using this result --…
A new type of local-check additive quantum code is presented. Qubits are associated with edges of a 2-dimensional lattice whereas the stabilizer operators correspond to the faces and the vertices. The boundary of the lattice consists of…