Abstract: Quantum error correction protocols are an essential element in the design of any circuit-model quantum computer. In this thesis, I introduce the coherent parity check (CPC) framework for quantum error correction. CPC codes have a fundamental structure in which quantum parity check measurements are stored coherently and compared over time. The specific advantage of the CPC code structure is that it provides a way of creating new stabilizer codes from the starting point of any sequence of parity checks. I show that this freedom in the choice of parity checks can be used to derive methods for the construction of distance-three quantum codes based on almost any distance-three classical code. The CPC framework has further applications in machine search routines for code discovery, as well as in the design of bespoke codes tailored for the demands of a given device. Another feature of CPC codes is that they can be represented as factor graphs of the type commonly seen in classical error correction and machine learning. I outline a procedure for this mapping, and demonstrate how a quantum code can be derived by manipulating its factor graph representation. The aim of the factor graph mapping for CPC codes is to make it easier to adapt well-developed techniques from classical information theory for use with quantum codes. This will make the CPC framework a useful tool for the theoretical and practical study of quantum error correction codes as large-scale quantum computers move closer to becoming a reality.
Abstract: Quantum error correction protocols are an essential element in the design of any circuit-model quantum computer. In this thesis, I introduce the coherent parity check (CPC) framework for quantum error correction. CPC codes have a fundamental structure in which quantum parity check measurements are stored coherently and compared over time. The specific advantage of the CPC code structure is that it provides a way of creating new stabilizer codes from the starting point of any sequence of parity checks. I show that this freedom in the choice of parity checks can be used to derive methods for the construction of distance-three quantum codes based on almost any distance-three classical code. The CPC framework has further applications in machine search routines for code discovery, as well as in the design of bespoke codes tailored for the demands of a given device. Another feature of CPC codes is that they can be represented as factor graphs of the type commonly seen in classical error correction and machine learning. I outline a procedure for this mapping, and demonstrate how a quantum code can be derived by manipulating its factor graph representation. The aim of the factor graph mapping for CPC codes is to make it easier to adapt well-developed techniques from classical information theory for use with quantum codes. This will make the CPC framework a useful tool for the theoretical and practical study of quantum error correction codes as large-scale quantum computers move closer to becoming a reality.
Abstract We introduce a high-level graphical framework for designing and analysing quantum error correcting codes, centred on what we term the coherent parity check (CPC). The graphical formulation is based on the diagrammatic tools of the ZX-calculus of quantum observables. The resulting framework leads to a construction for stabilizer codes that allows us to design and verify a broad range of quantum codes based on classical ones, and that gives a means of discovering large classes of codes using both analytical and numerical methods. We focus in particular on the smaller codes that will be the first used by near-term devices. We show how CSS codes form a subset of CPC codes and, more generally, how to compute stabilizers for a CPC code. As an explicit example of this framework, we give a method for turning almost any pair of classical [ n , k , 3 ] codes into a [ [ 2 n − k + 2 , k , 3 ] ] CPC code. Further, we give a simple technique for machine search which yields thousands of potential codes, and demonstrate its operation for distance 3 and 5 codes. Finally, we use the graphical tools to demonstrate how Clifford computation can be performed within CPC codes. As our framework gives a new tool for constructing small- to medium-sized codes with relatively high code rates, it provides a new source for codes that could be suitable for emerging devices, while its ZX-calculus foundations enable natural integration of error correction with graphical compiler toolchains. It also provides a powerful framework for reasoning about all stabilizer quantum error correction codes of any size.
We present a framework for constructing and analysing quantum error correction codes that gives simple and intuitive tools for designing codes based on device specifications. Built from a direct analog of classical parity checking, these coherent parity codes use a simple model for constraints between qubits and decoding of information. With an associated graphical language, this coherent parity check (CPC) construction enables automated search for codes, and we give discovered examples of low-overhead codes for small devices ([[10,3,3]], and [[12,4,3]]) based on realistic error rates taken from current ion trap state-of-the-art . We show that CPC codes form a class of CSS codes. We further show that the graphical language maps to the category-theoretic ZX calculus, which enables the use of the automated reasoning tool Quantomatic to derive properties of the codes. We show how automated reasoning allows us to perform computation between qubits in the same code-block without requiring multiple codeblocks and/or transversal gates. These tools offer a significant aid to put quantum error correction theory into design practice for practical quantum technologies in both the immediate future and looking forwards to large-scale deployable quantum computing. Furthermore, the close theoretical link between the CPC construction and classical error correction codes opens up the possibility of constructing quantum versions of modern high- performance error correction codes (such as LDPC and turbo codes) that approach the Shannon limit.
Coherent parity check (CPC) codes are a new framework for the construction of quantum error correction codes that encode multiple qubits per logical block. CPC codes have a canonical structure involving successive rounds of bit and phase parity checks, supplemented by cross-checks to fix the code distance. In this paper, we provide a detailed introduction to CPC codes using conventional quantum circuit notation. We demonstrate the implementation of a CPC code on real hardware, by designing a [[4, 2, 2]] detection code for the IBM 5Q superconducting qubit device. Whilst the individual gate-error rates on the IBM device are too high to realise a fault tolerant quantum detection code, our results show that the syndrome information from a full encode-decode cycle of the [[4, 2, 2]] CPC code can be used to increase the output state fidelity by post-selection. Following this, we generalise CPC codes to other quantum technologies by showing that their structure allows them to be efficiently compiled using any experimentally realistic native two-qubit gate. We introduce a three-stage CPC design process for the construction of hardware-optimised quantum memories. As a proof-of-concept example, we apply our design process to an idealised linear seven-qubit ion trap. In the first stage of the process, we use exhaustive search methods to find a large set of [[7, 3, 3]] codes that saturate the quantum Hamming bound for seven qubits. We then optimise over the discovered set of codes to meet the hardware and layout demands of the ion trap device. We also discuss how the CPC design process will generalise to larger-scale codes and other qubit technologies.
Coherent parity check (CPC) codes are a new framework for the construction of quantum error correction codes that encode multiple qubits per logical block. CPC codes have a canonical structure involving successive rounds of bit and phase parity checks, supplemented by cross-checks to fix the code distance. In this paper, we provide a detailed introduction to CPC codes using conventional quantum circuit notation. We demonstrate the implementation of a CPC code on real hardware, by designing a [[4, 2, 2]] detection code for the IBM 5Q superconducting qubit device. Whilst the individual gate-error rates on the IBM device are too high to realise a fault tolerant quantum detection code, our results show that the syndrome information from a full encode–decode cycle of the [[4, 2, 2]] CPC code can be used to increase the output state fidelity by post-selection. Following this, we generalise CPC codes to other quantum technologies by showing that their structure allows them to be efficiently compiled using any experimentally realistic native two-qubit gate. We introduce a three-stage CPC design process for the construction of hardware-optimised quantum memories. As a proof-of-concept example, we apply our design process to an idealised linear seven-qubit ion trap. In the first stage of the process, we use exhaustive search methods to find a large set of [[7, 3, 3]] codes that saturate the quantum Hamming bound for seven qubits. We then optimise over the discovered set of codes to meet the hardware and layout demands of the ion trap device. We also discuss how the CPC design process will generalise to larger-scale codes and other qubit technologies.
We introduce a new graphical framework for designing quantum error correction codes based on classical principles. A key feature of this graphical language, over previous approaches, is that it is closely related to that of factor graphs or graphical models in classical information theory and machine learning. It enables us to formulate the description of the recently-introduced ‘coherent parity check’ quantum error correction codes entirely within the language of classical information theory. This makes our construction accessible without requiring background in quantum error correction or even quantum mechanics in general. More importantly, this allows for a collaborative interplay where one can design new quantum error correction codes derived from classical codes.
Noise is one of the central obstacles to building useful quantum computers, and quantum error correction (QEC) provides the framework for protecting quantum information against it. Unlike classical error correction, QEC must preserve fragile quantum states without copying them, measuring them directly, or destroying the information they encode. Driven by rapid progress in both theory and experiment, this challenge has grown into one of the most active areas of quantum information science. This tutorial gives a guided introduction to modern QEC, developing the core concepts of codes, syndromes, stabilizers, decoding, and fault tolerance before connecting them to major code families and current research directions. We cover both established constructions and newer developments, including topological and subsystem codes, bosonic and qudit codes, dynamical codes, and quantum low-density parity-check (qLDPC) codes. The emphasis is on building operational understanding: explaining not only what the main objects are, but how they are used in code design, error diagnosis, decoding, and fault-tolerant computation. The tutorial is intended for newcomers seeking a first path through QEC, as well as researchers looking for a coherent reference for the concepts, code families, and tools that arise in current work.