Majorana-based quantum computing seeks to use the non-local nature of Majorana zero modes to store and manipulate quantum information in a topologically protected way. While noise is anticipated to be significantly suppressed in such systems, finite temperature and system size result in residual errors. In this work, we connect the underlying physical error processes in Majorana-based systems to the noise models used in a fault tolerance analysis. Standard qubit-based noise models built from Pauli operators do not capture leading order noise processes arising from quasiparticle poisoning events, thus it is not obvious a priori that such noise models can be usefully applied to a Majorana-based system. We develop stochastic Majorana noise models that are generalizations of the standard qubit-based models and connect the error probabilities defining these models to parameters of the physical system. Using these models, we compute pseudo-thresholds for the d=5 Bacon-Shor subsystem code. Our results emphasize the importance of correlated errors induced in multi-qubit measurements. Moreover, we find that for sufficiently fast quasiparticle relaxation the errors are well described by Pauli operators. This work bridges the divide between physical errors in Majorana-based quantum computing architectures and the significance of these errors in a quantum error correcting code.
Majorana-based quantum computing seeks to use the non-local nature of Majorana zero modes to store and manipulate quantum information in a topologically protected way. While noise is anticipated to be significantly suppressed in such systems, finite temperature and system size result in residual errors. In this work, we connect the underlying physical error processes in Majorana-based systems to the noise models used in a fault tolerance analysis. Standard qubit-based noise models built from Pauli operators do not capture leading order noise processes arising from quasiparticle poisoning events, thus it is not obvious a priori that such noise models can be usefully applied to a Majorana-based system. We develop stochastic Majorana noise models that are generalizations of the standard qubit-based models and connect the error probabilities defining these models to parameters of the physical system. Using these models, we compute pseudo-thresholds for the d=5 Bacon-Shor subsystem code. Our results emphasize the importance of correlated errors induced in multi-qubit measurements. Moreover, we find that for sufficiently fast quasiparticle relaxation the errors are well described by Pauli operators. This work bridges the divide between physical errors in Majorana-based quantum computing architectures and the significance of these errors in a quantum error correcting code.
Building a fault-tolerant quantum computer requires physical qubits with exceptionally low error rates. An exciting proposal for achieving this goal is to employ Majorana-based qubits, which may have error rates that are exponentially suppressed in macroscopic system parameters. Specifically, for Majorana qubits based on topological superconducting nanowires, errors are expected to be exponentially suppressed in the nanowire length, superconducting gap, and decreasing temperature. This thesis investigates errors in Majorana-based qubits from excited quasiparticles due to changes in chemical potentials and 1/f charge noise, and shows that such errors are not exponentially suppressed and can be quite substantial. In the first study of this thesis, we show that small temporal variations of the chemical potential can cause errors that grow linearly with the length of the nanowire. These errors stem from leakage into excited bulk quasiparticle states, which poison Majorana modes at opposite ends of the nanowire. We further demonstrate that the dynamics of this leakage are captured by the half Landau-Zener effect, which dictates its dependence on key parameters such as the superconducting gap, chemical potential variations, and dynamic changes in the spatial profile of Majorana modes. In the second study we investigate quasiparticle excitations due to high-frequency components of 1/f charge noise, which is ubiquitous in the materials surrounding the nanowire. We model 1/f noise as arising from two level fluctuators which cause chemical potential fluctuations following random telegraph noise. We demonstrate that 1/f noise causes error rates which grow linearly with the system size and are not exponentially suppressed in the superconducting gap. For existing tetron qubit designs, we estimate decoherence times to be an order of magnitude shorter than the target 1μs measurement time. This thesis also develops an algorithmic framework for applying the covariance matrix method to the time-dependent Kitaev chain model. This extends upon existing approaches, providing a key numerical tool used throughout this thesis. This work motivates engineering strategies to reduce coupling to two level systems in Majorana qubits, such as increasing the nanowire capacitance. Beyond Majoranas, a promising avenue is to investigate the impact of this quasiparticle excitation mechanism on superconducting circuits, such as superconducting qubits, resonators, and single-photon detectors.
Quasiparticle poisoning errors in Majorana-based qubits are not suppressed by the underlying topological properties, which undermines the usefulness of this proposed platform. This work tackles the errors originating from intrinsically excited quasiparticles by developing an erasure conversion scheme based on local quasiparticle detection. To model such measurements, we begin by constructing the quasiparticle position operator for the Kitaev chain. A measurement probe coupling to this operator is shown to allow projective measurements in the Wannier quasiparticle basis. Detection of quasiparticles in a region of width d adjacent to each Majorana zero-energy mode allows implementation of an error-detecting Majorana stabilizer code C d based on microscopic fermionic (nontopological) physical degrees of freedom. The implementation of C d converts a large fraction of Pauli errors to erasure errors, thus achieving “erasure conversion” in Majorana qubits. We show that the fraction of Pauli errors escaping conversion to erasure errors is exponentially small in d , a result tied to the exponential localization of Wannier functions which we prove rigorously. The suppression in Pauli error rate comes at the cost of the erasure rate increasing sublinearly with d , but this can be readily compensated for by a suitable outer code, with the net effect being a higher threshold rate of quasiparticle poisoning. The framework developed here serves as a basis for understanding how realistic measurements, such as conductance measurements, could be utilized for achieving fault tolerance in these systems. Published by the American Physical Society 2024
Quantum computers based on Majorana fermions offer intrinsic robustness due to the topological nature of these quasiparticles. However, active quantum error correction is still necessary in order to perform fully protected quantum gates and reliably store information due to the presence of unwanted errors, such as quasiparticle poisoning. Here, the authors demonstrate that using networks of interacting Majorana particles achieves a higher error tolerance than traditional qubit-based quantum computers, thereby offering potential advantages for large-scale quantum information processing.
Correlated noise is a critical failure mode in quantum error correction (QEC), yet a gap remains between the stochastic Pauli models used for scalable QEC analyses and the microscopic, non-Markovian descriptions of noise in physical devices. We bridge this gap by introducing Spatiotemporal Pauli Processes (SPPs): the natural multi-time generalization of Pauli channels, joint probability distributions over Pauli faults across space and time, obtained exactly from any noise process, however non-Markovian, under standard Pauli-frame randomization. SPPs thereby provide a single language in which correlated noise can be recast, compared, and extended, compatible with both microscopic open systems modeling and the stabilizer workflow of QEC design and analysis. Our central result is constructive: the multi-time Pauli twirl acts by local contractions on a process tensor network, yielding an explicit classical tensor network whose virtual bonds encode memory, bounded by the environment's Liouville-space dimension. Transfer operator diagnostics link memory spectra to correlation decay, and hidden Markov representations enable efficient sampling of correlated Pauli fault trajectories, mapping microscopically derived noise directly into circuit-level QEC simulation. We demonstrate this with surface code memory and stability benchmarks up to distance 19. A temporal "storm" model with tunable correlation time shows that memory alone, at strictly fixed marginal error rates, systematically erodes the exponential error suppression expected from code distance. A genuinely spatiotemporal quantum cellular automaton bath maps exactly, under system twirling, to a nonlinear probabilistic cellular automaton; tuning its coherent interactions drives the noise into a pseudo-critical regime with critical slowing down and macroscopic error avalanches that reverse surface code distance scaling.
Topological quantum computing seeks to store and manipulate information in a protected manner using topological phases of matter. Information encoded in the degenerate state space of pairs of non-Abelian anyons or defects is robust to local perturbations, reducing its susceptiblity to environmental errors and potentially providing a scalable approach to quantum computing. However, topological quantum computing faces significant challenges, not least of which is identifying an experimentally accessible platform supporting non-Abelian topological physics. In this thesis, we critically analyze topological quantum computing with Majorana zero modes, non-Abelian defects of a topological superconductor. We identify intrinsic error sources for Majorana-based systems and propose quantum computing architectures that minimize their effects. Additionally, we consider a new approach for realizing and detecting non-Abelian topological defects in fractional Chern insulators. Topological quantum computing is predicated on the idea that braiding non-Abelian anyons adiabatically can implement quantum gates fault tolerantly. However, any braiding experiment will necessarily depart from the strict adiabatic limit. We begin by analyzing the nature of diabatic errors for anyon braiding, paying particular attention to how such errors scale with braiding time. We find that diabatic errors are unfavorably large and worryingly sensitive to details of the time evolution. We present a measurement-based correction protocol for such errors, and illustrate its application in a particular Majorana-based qubit design. We next propose designs for Majorana-based qubits operated entirely by a measurement-based protocol, thereby avoiding the diabatic errors discussed above. Our designs can be scaled into large two dimensional arrays amenable to long-term quantum computing goals, whose core components are testable in near-term devices. These qubits are robust to quasiparticle poisoning, anticipated to be one of the dominant error sources coupling to Majorana zero modes. We demonstrate that our designs support topologically protected Clifford operations and can be augmented to a universal gate set without requiring additional control parameters.While topological protection greatly suppresses errors, residual coupling to noise limits the lifetimes of our proposed Majorana-based qubits. We analyze the dephasing times for our quasiparticle-poisoning-protected qubits by calculating their charge distribution using a particle number-conserving formalism. We find that fluctuations in the electromagnetic environment couple to an exponentially suppressed topological dipole moment. We estimate dephasing times due to 1/f noise, thermal quasiparticle excitations, and phonons for different qubit sizes.The residual errors discussed above will necessarily require error correction for a sufficiently long quantum computation. We develop physically motivated noise models for Majorana-based qubits that can be used to analyze the performance of a quantum error correcting code. We apply this noise model to estimate pseudo-thresholds for a small subsystem code, identifying the relative importance of difference error processes from a fault tolerance perspective. Our results emphasize the necessity of suppressing long-lived quasiparticle excitations that can spread across the code.Finally, we turn our attention to a different platform that could host non-Abelian topological defects: fractional Chern insulators in graphene. We study the edge states of fractional Chern insulators using the field theory of fractional quantum Hall edges supplemented with a symmetry action. We find that lattice symmetries impose a quantized momentum difference for edge electrons in a fractional state of a C=2 Chern band. This momentum difference can be used to selectively contact the different edge states, thereby allowing detection of topological defects in the bulk with a standard four terminal measurement. Our proposal could be implemented in graphene subject to an artificially patterned lattice.
Quantum computers have the potential to solve several interesting problems in polynomial \ntime for which no polynomial time classical algorithms have been found. However, \none of the major challenges in building quantum devices is that quantum systems are very \nsensitive to noise arising from undesired interactions with the environment. Noise can lead \nto errors which can corrupt the results of the computation. Quantum error correction is \none way to mitigate the effects of noise arising in quantum devices. \nWith a plethora of quantum error correcting codes that can be used in various settings, \none of the main challenges of quantum error correction is understanding how well various \ncodes perform under more realistic noise models that can be observed in experiments. \nThis thesis proposes a new decoding algorithm which can optimize threshold values of \nerror correcting codes under different noise models. The algorithm can be applied to \nany Markovian noise model. Further, it is shown that for certain noise models, logical \nClifford corrections can further improve a code's threshold value if the code obeys certain \nsymmetries. \n \nSince gates and measurements cannot in general be performed with perfect precision, \nthe operations required to perform quantum error correction can introduce more errors \ninto the system thus negating the benefits of error correction. Fault-tolerant quantum \ncomputing is a way to perform quantum error correction with imperfect operations while \nretaining the ability to suppress errors as long as the noise is below a code's threshold. \nOne of the main challenges in performing fault-tolerant error correction is the high resource \nrequirements that are needed to obtain very low logical noise rates. With the use of \nflag qubits, this thesis develops new fault-tolerant error correction protocols that are applicable \nto arbitrary distance codes. Various code families are shown to satisfy the requirements \nof flag fault-tolerant error correction. We also provide circuits using a constant number of \nqubits for these codes. It is shown that the proposed flag fault-tolerant method uses fewer \nqubits than previous fault-tolerant error correction protocols. \n \nIt is often the case that the noise afflicting a quantum device cannot be fully characterized. \nFurther, even with some knowledge of the noise, it can be very challenging to use \nanalytic decoding methods to improve the performance of a fault-tolerant scheme. This \nthesis presents decoding schemes using several state of the art machine learning techniques \nwith a focus on fault-tolerant quantum error correction in regimes that are relevant to near \nterm experiments. It is shown that even in low noise rate regimes and with no knowledge \nof the noise, noise can be further suppressed for small distance codes. Limitations of machine \nlearning decoders as well as the classical resources required to perform active error \ncorrection are discussed. \n \nIn many cases, gate times can be much shorter than typical measurement times of \nquantum states. Further, classical decoding of the syndrome information used in quantum \nerror correction to compute recovery operators can also be much slower than gate times. \nFor these reasons, schemes where error correction can be implemented in a frame (known \nas the Pauli frame) have been developed to avoid active error correction. In this thesis, we \ngeneralize previous Pauli frame schemes and show how Clifford frame error correction can \nbe implemented with minimal overhead. Clifford frame error correction is necessary if the \nlogical component of recovery operators were chosen from the Clifford group, but could \nalso be used in randomized benchmarking schemes.