This thesis will explore quantum error correction from several different perspectives. We will examine both the tasks of how to implement quantum error correcting codes in hardware and how to develop error correcting codes with good properties. Firstly we will examine a specific, hardware-motivated computational scheme in which a class of bosonic code called rotation symmetric bosonic codes is concatenated with a well-known topological error correcting code, the surface code. We study this scheme subject to realistic noisy measurement and noise due to photon loss. We envision realising this scheme with superconducting qubit technology. The overhead in terms of number of qubits and time required for this scheme is significant however, motivating an alternative approach of investigating better error correcting codes. With this is mind, we then examine error correction approach that features condensed matter models at its core with the aim of finding more resource-efficient codes. We begin by studying a method of code construction called fractalization, which we apply to the Raussendorf model. Our novel contribution is to fractalize the code in both space and time and demonstrate the existence, for specific values of the generating parameters, of fracton excitations that are immobile in both space and time. Finally, we further pursue new code constructions by exploring the self-correction properties of classical hyperbolic codes. We study a family of classical hyperbolic codes for which we find numerical evidence consistent with a polynomial energy barrier. This would indicate that they are likely to display self-correcting behaviour. By studying such a simple classical model we not only gain intuition about hyperbolic codes in general, but also suggest that classical hyperbolic codes are likely to be good candidates for the construction of quantum codes via a product construction.
This thesis will explore quantum error correction from several different perspectives. We will examine both the tasks of how to implement quantum error correcting codes in hardware and how to develop error correcting codes with good properties. Firstly we will examine a specific, hardware-motivated computational scheme in which a class of bosonic code called rotation symmetric bosonic codes is concatenated with a well-known topological error correcting code, the surface code. We study this scheme subject to realistic noisy measurement and noise due to photon loss. We envision realising this scheme with superconducting qubit technology. The overhead in terms of number of qubits and time required for this scheme is significant however, motivating an alternative approach of investigating better error correcting codes. With this is mind, we then examine error correction approach that features condensed matter models at its core with the aim of finding more resource-efficient codes. We begin by studying a method of code construction called fractalization, which we apply to the Raussendorf model. Our novel contribution is to fractalize the code in both space and time and demonstrate the existence, for specific values of the generating parameters, of fracton excitations that are immobile in both space and time. Finally, we further pursue new code constructions by exploring the self-correction properties of classical hyperbolic codes. We study a family of classical hyperbolic codes for which we find numerical evidence consistent with a polynomial energy barrier. This would indicate that they are likely to display self-correcting behaviour. By studying such a simple classical model we not only gain intuition about hyperbolic codes in general, but also suggest that classical hyperbolic codes are likely to be good candidates for the construction of quantum codes via a product construction.
A central goal in quantum error correction is to reduce the overhead of fault-tolerant quantum computing by increasing noise thresholds and reducing the number of physical qubits required to sustain a logical qubit. We introduce a potential path towards this goal based on a family of dynamically generated quantum error correcting codes that we call "hyperbolic Floquet codes.'' These codes are defined by a specific sequence of non-commuting two-body measurements arranged periodically in time that stabilize a topological code on a hyperbolic manifold with negative curvature. We focus on a family of lattices for n qubits that, according to our prescription that defines the code, provably achieve a finite encoding rate ( 1 / 8 + 2 / n ) while still requiring only two-body measurements. Similar to hyperbolic surface codes, the distance of the code at each time-step scales at most logarithmically in n . The family of lattices we choose indicates that this scaling is achievable in practice. We develop and benchmark an efficient matching-based decoder that provides evidence of a threshold near 0.1% in a phenomenological noise model and 0.25% in an entangling measurements noise model. Utilizing weight-two check operators and a qubit connectivity of 3, one of our hyperbolic Floquet codes uses 400 physical qubits to encode 52 logical qubits with a code distance of 8, i.e., it is a [ [ 400 , 52 , 8 ] ] code. At small error rates, comparable logical error suppression to this code requires 5x as many physical qubits (1924) when using the honeycomb Floquet code with the same noise model and decoder.
(Abridged.) This thesis investigates scalable fault-tolerant quantum computation through the development of bosonic quantum codes, quantum LDPC codes, and decoding protocols that connect continuous-variable and discrete-variable error correction. We investigate superconducting microwave implementations of continuous-variable quantum computing, including the deterministic generation of cubic phase states, and introduce the dissipatively stabilized squeezed cat qubit, a noise-biased bosonic encoding with enhanced error suppression and faster gates. The performance of rotation-symmetric and GKP codes is analyzed under realistic noise and measurement models, revealing key trade-offs in measurement-based schemes. To integrate bosonic codes into larger architectures, we develop decoding methods that exploit analog syndrome information, enabling quasi-single-shot decoding in concatenated systems. On the discrete-variable side, we introduce localized statistics decoding, a highly parallelizable decoder for quantum LDPC codes, and propose quantum radial codes, a new family of single-shot LDPC codes with low overhead and strong circuit-level performance. Finally, we present fault complexes, a homological framework for analyzing faults in dynamic quantum error correction protocols. Extending the role of homology in static CSS codes, fault complexes provide a general language for the design and analysis of fault-tolerant schemes.
Quantum computing has the potential to transform information technology by offering algorithms for certain tasks, such as quantum simulation, that are vastly more efficient than what is possible with any classical device. But experimentally implementing practical quantum information processing is a very difficult task. Here we study two important, and closely related, aspects of this challenge: architectures for quantum computing, and quantum error correction Exquisite quantum control has now been achieved in small ion traps, in nitrogen-vacancy centres and in superconducting qubit clusters, but the challenge remains of how to scale these systems to build practical quantum devices. In Part I of this thesis we analyse one approach to building a scalable quantum computer by networking together many simple processor cells, thus avoiding the need to create a single complex structure. The difficulty is that realistic quantum links are very error prone. Here we describe a method by which even these error-prone cells can perform quantum error correction. Groups of cells generate and purify shared resource states, which then enable stabilization of topologically encoded data. Given a realistically noisy network (10% error rate) we find that our protocol can succeed provided that all intra-cell error rates are below 0.8%. Furthermore, we show that with some adjustments, the protocols we employ can be made robust also against high levels of loss in the network interconnects. We go on to analyse the potential running speed of such a device. Using levels of fidelity that are either already achievable in experimental systems, or will be in the near-future, we find that employing a surface code approach in a highly noisy and lossy network architecture can result in kilohertz computer clock speeds. In Part II we consider the question of quantum error correction beyond the surface code. We consider several families of topological codes, and determine the minimum requirements to demonstrate proof-of-principle error suppression in each type of code. A particularly promising code is the gauge color code, which admits a universal transversal gate set. Furthermore, a recent result of Bombin shows the gauge color code supports an error-correction protocol that achieves tolerance to noisy measurements without the need for repeated measurements, so called single-shot error correction. Here, we demonstrate the promise of single-shot error correction by designing a decoder and investigating its performance. We simulate fault-tolerant error correction with the gauge color code, and estimate a sustainable error rate, i.e. the threshold for the long time limit, of ~0.31% for a phenomenological noise model using a simple decoding algorithm.
Quantum computers have been shown to be able to perform computations that are thus far thought to be infeasible through classical computation. This is achieved by taking advantage of certain properties and phenomena unique to quantum systems. Unfortunately, engineering particular quantum systems that are useful for computation is difficult and there is still a long road towards building a robust, large-scale quantum computer. A key approach to building quantum computers that are robust to noise is the development of Quantum Error Correcting codes. In recent years, there have been a surge of progress in the development and realisation of bosonic codes, which are quantum error correcting codes that encode quantum information into the infinite-dimensional Hilbert space of an oscillator. Due to its large Hilbert space, bosonic codes are able to protect quantum information using a single, or a few physical systems. This thesis will take two different but complementary approaches to the development of bosonic codes and bosonic code qubits. The first will be a numerical study of errors affecting bosonic codes within a fault-tolerant system. Specifically, we introduce the concatenated Bacon-Shor rotation-symmetric bosonic code and evaluate the entanglement fidelity of a teleportation based error correction scheme against pure loss errors. In the second approach, we study the recently proposed gyrator qubit by Rymarz et al., which realises a bosonic code known as the Gottesman-Kitaev-Preskill (GKP) code in its low energy eigenspace. We support this study with a Wentzel-Kramers-Brillouin (WKB) analysis of the Zak transformed Hamiltonian of the qubit. This allows us to derive the low-energy spectrum and eigenstates of the qubit and derive matrix elements corresponding to transitions between qubit states when the system is weakly coupled to a thermal environment.
In this thesis, we consider steps towards building a useful quantum computer in the presence of realistic errors. We start by presenting a novel scheme for fault-tolerant quantum computation with Rydberg atoms. The scheme uses topological error correction codes to provide fault-tolerance and utilises electromagnetically induced transparency to perform entangling gates between qubits. We examine the benefits of this scheme compared to alternative approaches, and we investigate the errors that are likely to occur and how these can be managed. We then consider how to perform quantum computation with a surface code based quantum computer that has permanently faulty components. We study both faulty links between qubits, which prevent qubits from interacting, and faulty qubits themselves; such faults could affect a wide variety of physical implementations, including schemes that use superconducting qubits and those that use trapped ions. The approach we propose for dealing with these faulty components requires minimal modification to the quantum operations required by the surface code and should therefore be implementable by almost all current and future proposals for surface code based quantum devices. Finally, we consider how to perform fault-tolerant quantum computation with components that fail probabilistically. This section is largely motivated by quantum computation with linear optics and therefore focuses on quantum computation with cluster states. We show that these probabilistic failures can be tolerated providing the failure rate is suitably low, and we present methods for increasing error thresholds in the presence of such errors.
Quantum error correction codes are essential for fault-tolerant quantum computing. They are a method of detecting and correcting errors in a quantum computer by encoding logical qubits across multiple physical qubits. Several prominent error correction codes have been developed and larger and more complex codes are being developed continuously. However, evaluating the fault-tolerance of these larger codes is becoming exponentially more complicated. While conventional methods of proving and evaluating the fault-tolerance of these circuits have worked thus far, they are soon to be obsolete. The aim of this thesis is to develop a framework that automatically evaluates the fault-tolerance of a quantum error correction circuit across different hardware architectures. The framework works as follows: it takes a noiseless quantum error correction code; injects hardware-realistic noise into it; and evaluates the fault-tolerance of the resulting noisy circuit by estimating its logical error rate through Monte Carlo sampling. For the injection of hardware-realistic noise, this thesis considers noise stemming from five different quantum computing hardware architectures: superconducting qubits, neutral atoms, trapped ions, photonic qubits, and spin qubits. The noise model was constructed by extracting single-qubit gate, two-qubit gate and measurement error fidelities from current experimental literature. The noise model and circuit generation is implemented in Python, circuit representation and noise injection is executed in Stim and decoding and estimating the logical error rate is achieved through PyMatching. The framework is evaluated on the repetition code, the surface code, and the color code; the logical error rate is estimated across all five hardware architectures under the noise model; and the results are discussed in the context of hardware compatibility for the given codes.