Related papers: A new approach to codeword stabilized quantum code…
In this paper, we prove how to extend a subset of quantum stabilizer codes into a qudit hybrid code storing $\log_2 p$ classical bits over a qudit space with dimension $p$, with $p$ prime. Our proof also gives an explicit procedure for…
Implementing robust quantum error correction (QEC) is imperative for harnessing the promise of quantum technologies. We introduce a framework that takes {\it any} classical code and explicitly constructs the corresponding QEC code. Our…
Recently, an information theoretical model for Quantum Secret Sharing (QSS) schemes was introduced. By using this model, we prove that pure state Quantum Threshold Schemes (QTS) can be constructed from quantum MDS codes and vice versa. In…
We apply quantum Construction X on quasi-cyclic codes with large Hermitian hulls over $\mathbb{F}_4$ and $\mathbb{F}_9$ to derive good qubit and qutrit stabilizer codes, respectively. In several occasions we obtain quantum codes with…
A divisible binary classical code is one in which every code word has weight divisible by a fixed integer. If the divisor is $2^\nu$ for a positive integer $\nu$, then one can construct a Calderbank-Shor-Steane (CSS) code, where…
This is a comprehensive review on fault-tolerant topological quantum computation with the surface codes. The basic concepts and useful tools underlying fault-tolerant quantum computation, such as universal quantum computation, stabilizer…
The essential insight of quantum error correction was that quantum information can be protected by suitably encoding this quantum information across multiple independently erred quantum systems. Recently it was realized that, since the most…
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…
By defining projective error models we study the mathematical structure of Clifford codes and stabilizer codes using tools from projective representation theory. Furthermore, we introduce a new class of codes which we have called weak…
We show how, given any set of generators of the stabilizer of a quantum code, an efficient gate array that computes the codewords can be constructed. For an n-qubit code whose stabilizer has d generators, the resulting gate array consists…
Concatenating quantum error correction codes scales error correction capability by driving logical error rates down double-exponentially across levels. However, the noise structure shifts under concatenation, making it hard to choose an…
We consider geometric methods of ``rotating" the toric code in higher dimensions to reduce the qubit count. These geometric methods can be used to prepare higher dimensional toric code states using single shot techniques, and in turn these…
Soon after the dawn of quantum error correction, DiVincenzo and Peres observed that stabilizer codewords could give rise to simple proofs of quantumness via contextuality. This discovery can be recast in the language of nonlocal games:…
Perturbation theories provide valuable insights on quantum many-body systems. Systems of interacting particles, like electrons, are often treated perturbatively around exactly solvable Gaussian points. Systems of interacting qubits have…
Scalable realisation of quantum computing is reliant on the development of fault tolerant devices. Analysis of quantum error correction protocols typically considers incoherent noise models or noise-free syndrome measurements. While this is…
We introduce a framework for entanglement-assisted quantum error correcting codes that unifies the three original frameworks for such codes called EAQEC, EAOQEC, and EACQ under a single umbrella. The unification is arrived at by viewing…
Quantum error-correcting codes can be used to protect qubits involved in quantum computation. This requires that logical operators acting on protected qubits be translated to physical operators (circuits) acting on physical quantum states.…
We develop the theory of entanglement-assisted quantum error correcting (EAQEC) codes, a generalization of the stabilizer formalism to the setting in which the sender and receiver have access to pre-shared entanglement. Conventional…
The article surveys quantum error control, focusing on quantum stabilizer codes, stressing on the how to use classical codes to design good quantum codes. It is to appear as a book chapter in "A Concise Encyclopedia of Coding Theory,"…
Fault-tolerant quantum computation allows quantum computations to be carried out while resisting unwanted noise. Several error-correcting codes have been developed to achieve this task, but none alone are capable of universal quantum…