Quantum spin systems have been providing modern physics with ever new challenges to tackle in the past several decades; from the theoretical postulation of topological quantum order, a new chapter was revealed in the understanding of phase transitions in quantum systems. The novel properties of topologically ordered systems had caught the interest of quantum information scientists, and research into their potential in the field of quantum computing soon began. Nowadays, this utility of topologically ordered systems is thoroughly researched in the field of topological quantum computing. Systems that exhibit topological order present a valuable resource for quantum computing – by use of the global observables that remain robust when such a system is acted on by a local perturbation. Under these conditions, the information stored in the system remains stable, providing a unique modus of circumventing the problems that plague standard quantum computing schemes. To improve on the applicability of such systems in fault-tolerant quantum computation, there exists a need to understand the exact behavior of the encoded information under perturbation. To this end, this thesis presents critical mathematical methods used to research the dynamics of local quantum systems — the quasi-adiabatic continuation, the Lieb-Robinson bounds, and the self-energy expansion—and utilizes them to further the understanding of the effect of weak local perturbations on the information stored in a topologically ordered system. In particular, the influence of perturbation on topologically ordered systems with local puncture defects is examined, and general bounds on the stability of topological order in such systems are derived.
Quantum spin systems have been providing modern physics with ever new challenges to tackle in the past several decades; from the theoretical postulation of topological quantum order, a new chapter was revealed in the understanding of phase transitions in quantum systems. The novel properties of topologically ordered systems had caught the interest of quantum information scientists, and research into their potential in the field of quantum computing soon began. Nowadays, this utility of topologically ordered systems is thoroughly researched in the field of topological quantum computing. Systems that exhibit topological order present a valuable resource for quantum computing – by use of the global observables that remain robust when such a system is acted on by a local perturbation. Under these conditions, the information stored in the system remains stable, providing a unique modus of circumventing the problems that plague standard quantum computing schemes. To improve on the applicability of such systems in fault-tolerant quantum computation, there exists a need to understand the exact behavior of the encoded information under perturbation. To this end, this thesis presents critical mathematical methods used to research the dynamics of local quantum systems — the quasi-adiabatic continuation, the Lieb-Robinson bounds, and the self-energy expansion—and utilizes them to further the understanding of the effect of weak local perturbations on the information stored in a topologically ordered system. In particular, the influence of perturbation on topologically ordered systems with local puncture defects is examined, and general bounds on the stability of topological order in such systems are derived.
The superposition principle of quantum mechanics implies that the amount of classical (i.e., non-quantum) information needed to describe a quantum system is in general exponentially large in the size of the system. This makes simulating quantum physics on a classical computer quickly infeasible, even for moderately-sized systems and using the best present-day supercomputers in the world. This is unfortunate, since systems for which quantum effects are relevant are of interest in many areas of science and engineering, ranging from drug design to materials research. In 1982, Richard Feynman gave birth to the idea of a quantum computer, when he realized that simulating quantum physics could be achieved much more efficiently with a computer that was itself a quantum system. Since then, the number of problems for which a quantum computer is known to enjoy an advantage over a classical computer has steadily increased, ranging now far beyond the task of simulating quantum physics. A quantum computation of any interest will need to create complicated superposition states, for otherwise it would not achieve anything that could not be simulated on a classical computer. These superposition states, however, are highly fragile, and this fragility is the main obstacle that the scientific community faces on the road towards a useful quantum computer. Quantum computing will only be possible if it can be performed in a fault-tolerant way. It is due to seminal work by Alexei Kitaev from 1997 that the modern theory of quantum fault-tolerance is closely related to the term topology. Topology, as a sub-field of mathematics, is concerned with the properties of space that are preserved under continuous deformations. Topological order, a purely quantum phenomenon, refers to states which cannot be distinguished or evolved into each other locally, yet are globally distinct. The information that distinguishes between these states is stored in non-local degrees of freedom. If it were possible to store quantum information in these non-local degrees of freedom, this would be hugely attractive from a practical perspective, as it would mean that the information stored this way is immune to many forms of local errors. Two-dimensional topologically ordered states support excitations known as anyons. These are exotic quasi-particles that defy the dichotomy between fermions and bosons that applies to quantum particles in three spatial dimensions. In a topological quantum computer, the non-locally stored quantum information is processed by braiding these anyons around each other. Such a computation would be insensitive to small perturbations of the path along which anyons are braided, but would only depend on its topological properties. An open problem is whether topological order can persist at finite temperature. Equivalently, one can ask whether it is possible to build a system in which quantum information can be stored in a stable manner for arbitrarily long times, without performing active error correction and despite constant influence of a thermal environment. Such a system would constitute a self-correcting quantum memory and would extend the concept of a hard disk drive to the quantum realm. Whether nature allows for such a system to be built is of tremendous interest from both a fundamental and a practical perspective. Two-dimensional topologically ordered systems – those hosting anyons – do not qualify as self-correcting quantum memories; any finite temperature corrupts them in a time that is independent of the size of the system. In the present thesis, we propose and study systems in which the thermal stability of a simple toy model of an anyonic system, Kitaev’s toric code, is enhanced in various ways. We consider coupling it to optical cavity modes, to bosonic particles, or to a ferromagnet. These auxiliary systems then induce long-ranged interactions between the anyons, which allow to increase the finite-temperature lifetime of the stored quantum information arbitrarily by increasing the size of the system. While a topological quantum computer is naturally immune to many forms of imperfections and perturbations, accidental creation of anyonic quasi-particles due to coupling to an external environment is a form of error that requires active correction. This problem has seen surprisingly little attention until recently and is still poorly understood. In this thesis, we develop algorithms that are able to perform this task and provide the first proofs of its in-principle feasibility. Furthermore, we develop a system with the rare property that it both supports anyons that can be used for topological quantum computing, and allows for error correction with well-established techniques. Historically, the first proposals for building a fault-tolerant quantum \ncomputer involved an array of qubits (quantum bits) and a set of elementary operations that can be performed on individual and pairs of qubits. Fault-tolerant qubit-based quantum computing has been inspired tremendously from the insights gained in the study of topological quantum information processing. The surface code, which combines a qubit-based architecture with topological methods, is now at the forefront of the quest towards a fault-tolerant, scalable quantum computer. In the surface code, a large number of measurements are performed on a continuous basis to get some information about what errors have occurred. This information then needs to be converted by a classical algorithm into a prescription for performing error correction. In this thesis, we develop such an algorithm that, at the time of its publication, was the best efficient algorithm known for the surface code. Error correction for qubit-based quantum computers is typically studied with simplistic error models in which the errors on each qubit are independent from each other. We study what kinds of spatial and temporal correlations between the errors arise when a surface code is coupled to a typical model of an environment, and how they affect its correctability.
Developing quantum systems which are robust against noise are of prime importance to the realisation of quantum technologies. Without fault tolerance, we will never be able to preserve delicate quantum states for macroscopic time scales, a necessary requirement in the construction of scalable quantum computer. Topologically ordered models offer very beautiful mechanisms for preserving quantum states. In such models, quantum information is encoded globally over a degenerate topological Hilbert space which offers a natural robustness against local environmental noise. Remarkably, topological order is present in certain realistic condensed-matter systems. This provides a platform for accessing topological order in a laboratory. Moreover, considering condensed-matter systems enables us to combine topological features with other physical effects to enhance their behaviour. In this Thesis we study the physics of topologically ordered lattice models with defects. We seek practical applications of lattice defects for the realisation of a fault-tolerant quantum computer. The first result we present shows that anyonic data of point-like lattice defects, called twists, can be found by measuring the entanglement of the ground state of the host system. The data we learn relates to the capacity of a twist defect to perform quantum computational tasks. The second result in this Thesis concerns the dynamics of the qudit toric code model with line-like defects coupled to a thermal bath. We show we can entropically inspire fragile glassy dynamics in the system. Such dynamics qualitatively improve the coherence times of quantum information encoded in the ground state of the lattice. A novel way of achieving fault-tolerant quantum computation is by producing and manipulating twist defects of topologically ordered systems. In many ways, this paradigm of topological quantum computation is analogous to quantum computation using anyons. The first area of study in this Thesis extends the analogy between anyons and twists. Specifically, we show that the anyonic data of twists in Kitaev's toric code model can be extracted using topological entanglement entropy calculations in the same way as the same data can be extracted from anyons. We show this using a rigorously solvable lattice model as an example to produce exact analytic results. In particular, our results show we can extract the quantum dimension of a twist, and that we can study the quantum dimension of their fusion products. We compare the obtained results with the anyonic data of the Ising anyon model, further probing an analogy drawn previously in the literature. The second result presented in this Thesis shows that the application of lattice defects can introduce novel dynamics to a two-dimensional topologically ordered quantum memory where excitations carry different masses. A two-dimensional topological model which supports an anyon model with a splitting structure allowed by its fusion channels should be able to entropically achieve high-energy excitation configurations before quantum information encoded in its ground state decoheres. We introduce a grid of lattice defects to a local two-dimensional Hamiltonian model, which, when coupled to a thermal bath, will dynamically steer the excitations into high energy configurations with high probability within a suitable temperature regime. We demonstrate the proliferating dynamics using numerical simulations in a low-temperature regime where we show polynomial improvements in coherence times by increasing the system size for small system sizes, as well as coherence times which scale weakly super exponentially with the inverse temperature of the bath. The dynamics we demonstrate provide the first example of a system which entropically steers excitations into high-energy configurations. The dynamics we demonstrate may lead to the development of experimentally tractable architectures for low dimensional quantum memories. The study of thermal stability in this Thesis requires the development of methods of correcting topologically ordered lattices which have suffered errors. Namely, we require a decoding algorithm for the qudit generalisation of Kitaev's toric code. Further work presented in this Thesis compares rigorously two different decoding algorithms which use renormalisation-group techniques to process classical syndrome information about noise suffered by the topological code. In particular, we study the improvement in their thresholds as the local dimension of its physical systems increase. Our numerical results enable us to analyse and identify the limitations of the different methods of decoding.
In recent years, topological phases of matter have presented exciting new avenues to achieve scalable quantum computation. In this thesis, we investigate a class of quantum many-body spin models known as symmetry-protected topological (SPT) phases for use in quantum information processing and storage. We explore the fault-tolerant properties of SPT phases, and how they can be utilized in the design of a quantum computer. Of central importance in this thesis is the concept of quantum error-correction, which in addition to its importance in fault-tolerant quantum computation, is used to characterise the stability of topological phases at finite temperature. We begin with an introduction to quantum computation, quantum error correction, and topological phases of matter. We then focus on the fundamental question of whether symmetry-protected topological phases of matter can exist in thermal equilibrium; we prove that systems protected by global onsite symmetries cannot be ordered at nonzero temperature. Subsequently, we show that certain three-dimensional models with generalised higher-form symmetries can be thermally SPT ordered, and we relate this order to the ability to perform fault-tolerant measurement-based quantum computation. Following this, we assess feasibility of these phases as quantum memories, motivated by the fact that SPT phases in three dimensions can possess protected topological degrees of freedom on their boundary. We find that certain SPT ordered systems can be self-correcting, allowing quantum information to be stored for arbitrarily long times without requiring active error correction. Finally, we develop a framework to construct new schemes of fault-tolerant measurement-based quantum computation. As a notable example, we develop a cluster-state scheme that simulates the braiding and fusion of surface-code defects, offering novel alternative methods to achieve fault-tolerant universal quantum computation.
In quantum many-body systems subjected to generic perturbations, eigenstates are typically fragile and prone to strong mixing, leading to rapid thermalization in dynamics to an equilibrium state described by statistical mechanics. However, there exist robust counterexamples that defy this typical expectation, exhibiting novel non-equilibrium phenomena and offering potential applications in (quantum) information processing. This dissertation explores such systems and establishes their stability against perturbations with mathematical rigor. First, by generalizing the exponentially slow tunneling effect in single-particle quantum mechanics, we develop a theory of metastability in quantum many-body systems, demonstrating their nonperturbatively long lifetimes. As a canonical application, we provide the first general and tight bounds on the slow decay of false vacua. Second, it is known that ground states in finite spatial dimensions can resist arbitrary local perturbations through topologically ordered phases of matter. We extend this notion of stability to quantum error-correcting codes in infinite dimensions, specifically quantum low-density parity-check (LDPC) codes. These codes are of significant interest due to their promise of lower fault-tolerance overhead compared to finite-dimensional codes. Lastly, we analyze classical counterparts of LDPC codes and prove that their eigenstates remain localized in the many-body Hilbert space under generic perturbations. This finding presents the first unambiguous example of a robust violation of the eigenstate thermalization hypothesis. To achieve these results, we introduce advanced techniques to control operator locality, leveraging and generalizing methods such as Lieb-Robinson bounds, cluster expansions, and Schrieffer-Wolff transformations. These tools not only underpin our specific findings but may also prove valuable for broader challenges in mathematical physics of quantum many-body systems.
Quantum computing holds immense promise for scientific discovery and technological advancement, but the inherent fragility of quantum states necessitates robust error correction. Traditional methods, while effective, often struggle with scalability and computational complexity. This paper explores a novel self-organizing quantum error correction protocol predicated on the utilization of topological defects – microscopic, stable quantum states – to encode and correct errors without the associated degradation inherent in conventional techniques. We detail the design of a dynamic system that exploits the unique properties of these defects to achieve significantly enhanced robustness and scalability in quantum information processing. The core mechanism centers around the creation and management of these defects, allowing for self-corrective operation and potentially enabling the creation of fault-tolerant quantum computers. This work presents a fundamentally different approach to error correction, leveraging the unexpected potential of topological defects to address critical challenges in the field.
The construction of a large-scale fault-tolerant quantum computer is an outstanding scientific and technological goal. It holds the promise to allow us to solve a variety of complex problems such as factoring large numbers, quick database search, and the quantum simulation of many-body quantum systems in fields as diverse as condensed matter, quantum chemistry, and even high-energy physics. Sophisticated theoretical protocols for reliable quantum information processing under imperfect conditions have been de-veloped, when errors affect and corrupt the fragile quantum states during storage and computations. Arguably, the most realistic and promising ap-proach towards practical fault-tolerant quantum computation are topologi-cal quantum error-correcting codes, where quantum information is stored in interacting, topologically ordered 2D or 3D many-body quantum systems. This approach offers the highest known error thresholds, which are already today within reach of the experimental accuracy in state-of-the-art setups. A combination of theoretical and experimental research is needed to store, protect and process fragile quantum information in logical qubits effectively so that they can outperform their constituting physical qubits. Whereas small-scale quantum error correction codes have been implemented, one of the main theoretical challenges remains to develop new and improve existing efficient strategies (so-called decoders) to derive (near-)optimal error cor-rection operations in the presence of experimentally accessible measurement information and realistic noise sources. One main focus of this project is the development and numerical implementation of scalable, efficient decoders to operate topological color codes. Additionally, we study the feasibility of im-plementing quantum error-correcting codes fault-tolerantly in near-term ion traps. To this end, we use realistic modeling of the different noise sources, computer simulations, and most modern quantum information approaches to quantum circuitry and noise suppression techniques.