Current quantum computing platforms, primarily based on Z2-graded qubits, suffer from fragility against decoherence and limited error correction thresholds. Here, we propose a topological quantum computing architecture founded on the finite-dimensional 19-dimensional Z3-graded Lie superalgebra and its emergent discrete 44-vector vacuum lattice—a minimal, closed geometric realization of ternary symmetry in 3D embedding space. The lattice supports stable non-Abelian anyonic excitations encoded as native qutrits, with triality-protected braiding offering intrinsic topological error correction and enhanced coherence times. We derive universal gate operations from graded bracket closure, estimate fault-tolerance thresholds exceeding 1.5% noise (significantly surpassing conventional surface code thresholds of ∼0.7–1%), and outline near-term experimental pathways in photonic lattices, cold atoms, and superconducting circuits. This Z3 framework provides a promising candidate for scalable, decoherenceresistant quantum computation, potentially resolving current bottlenecks in qubit-based platforms while bridging algebraic unification with practical quantum hardware.
Current quantum computing platforms, primarily based on Z2-graded qubits, suffer from fragility against decoherence and limited error correction thresholds. Here, we propose a topological quantum computing architecture founded on the finite-dimensional 19-dimensional Z3-graded Lie superalgebra and its emergent discrete 44-vector vacuum lattice—a minimal, closed geometric realization of ternary symmetry in 3D embedding space. The lattice supports stable non-Abelian anyonic excitations encoded as native qutrits, with triality-protected braiding offering intrinsic topological error correction and enhanced coherence times. We derive universal gate operations from graded bracket closure, estimate fault-tolerance thresholds exceeding 1.5% noise (significantly surpassing conventional surface code thresholds of ∼0.7–1%), and outline near-term experimental pathways in photonic lattices, cold atoms, and superconducting circuits. This Z3 framework provides a promising candidate for scalable, decoherenceresistant quantum computation, potentially resolving current bottlenecks in qubit-based platforms while bridging algebraic unification with practical quantum hardware.
This paper proposes a novel architecture for quantum computing based on topological crystalline transistors protected by topological principles. The core concept leverages non-Abelian anyons to implement a topological quantum error correction code, offering a pathway to robust quantum computation resistant to local disturbances. We detail the theoretical framework, focusing on the design principles and mathematical formalism underlying this approach. The architecture utilizes specially engineered topological crystals to confine and manipulate anyons, enabling reliable quantum operations. We present a rigorous analysis of the error correction mechanisms, demonstrating the potential for significantly improved fault tolerance compared to conventional qubit designs. Key aspects include the encoding scheme using braiding operations of anyons, the topological redundancy for error detection and correction, and the resulting improved qubit fidelity. The proposed design represents a significant step towards practical, scalable quantum computers capable of enduring the inherent challenges of quantum decoherence. The presented model highlights the crucial role of topological protection in realizing a stable and reliable quantum computing platform. Our focus is on the theoretical development and the underlying mathematical structure of this approach, laying the groundwork for future experimental investigations.
This paper presents a novel framework that integrates artificial intelligence with superalgebraic structures to simulate topological quantum computation (TQC) in systems governed by Lie superalgebras such as osp(1∣2) and sl(2∣1). By combining symbolic algebra, modular tensor category theory, and generative AI models—including variational autoencoders and diffusion models—the proposed system enables accurate, scalable simulation of non-Abelian anyonic braiding and fusion operations within graded symmetry constraints. The framework encodes superalgebraic invariants and topological rules into neural architectures, allowing physically valid and symmetry-preserving generation of braid paths and fusion outcomes. Experimental results demonstrate high fidelity, topological consistency, and robustness against noise, with successful emulation on quantum hardware platforms such as IBM Q and IonQ. This research opens new avenues for fault-tolerant, algebraically informed quantum simulation, circuit synthesis, and adaptive control in next-generation quantum technologies. Keywords: topological quantum computation, superalgebra, Lie superalgebras, modular tensor categories, osp(1∣2), sl(2∣1), anyons, braiding, fusion rules, symbolic AI, generative models, quantum simulation, quantum invariants, diffusion models, fault-tolerant quantum computing
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.
Topological quantum codes are intrinsically fault-tolerant to local noise, and underlie the theory of topological phases of matter. We explore geometry to enhance the performance of topological quantum codes by rotating the four dimensional self-correcting quantum memory, and present codes targeted to both near-term and utility-scale quantum computers. We identify a full set of logical Clifford operations and with it design a universal fault-tolerant quantum architecture. Our design achieves single-shot error correction, significant reductions in required qubits, and low-depth logical operations. In turn, our proposed architecture relaxes the requirements for achieving fault tolerance and offers an efficient path for realization in several near-term quantum hardware implementations. Our [[96,6,8]] 4D Hadamard lattice code has low weight-6 stabilizers and depth-8 syndrome extraction circuits, a high pseudo-threshold of ∼0.01, and a logical error rate of ∼10−6 per logical qubit per round of error correction at 10−3 physical error rate under a standard circuit-level noise model. A Clifford-complete logical gate set is presented, including a constructive and efficient method for Clifford gate synthesis.
A central challenge at the intersection of quantum condensed-matter physics and quantum information science is to understand how exotic topological phases and quantum resources govern the power of quantum computation and simulation---and to translate that understanding into practical architectures. This thesis contributes to this program along three interconnected directions: enabling fault-tolerant universal quantum computation with non-Abelian topological order, establishing the fundamental computational reach of near-term analog quantum simulators, and delineating the boundary between classical and quantum computational power through the lenses of topology and magic. In the first direction, drawing on the structure of non-Abelian topological order, we address the dominant resource overhead in current quantum computing architectures---magic-state distillation---by moving beyond the standard stabilizer formalism entirely. We construct a comprehensive framework for fault-tolerant universal quantum computation based on the non-Abelian quantum double model D(S3), with all operations realized on qubit--qutrit degrees of freedom in a planar, geometrically local architecture feasible on all current experimental platforms. This work addresses the long-standing open question of realizable, fault-tolerant universal topological quantum computation. In the second direction, we establish the computational universality of analog quantum simulators operating under global control---platforms that circumvent the demanding requirements of digitization and individual addressability. We prove a necessary and sufficient condition for universality in globally controlled qubit chains, showing that widely used platforms such as Rydberg atom arrays and trapped ions are generically universal once lattice reflection symmetry is broken. We further derive sufficient conditions for universality in fermionic and bosonic optical superlattices. As an experimental demonstration of this framework, we realize the dynamics of the cluster-state ZXZ model---an exemplar of symmetry-protected topological order---in Rydberg atom arrays, validating the theoretical foundation. In the third direction, we sharpen the classical--quantum computational boundary from both sides. We show that non-Abelian Majorana braiding realized in classical mechanical metamaterials admits a faithful classical simulation, establishing that braiding-only architectures are classically simulable without supplementary non-Clifford resources. Conversely, we prove that random matrix product states carry magic growing exponentially with system size, demonstrating that generic one-dimensional many-body states harbor ample non-stabilizer resources. Together, these results delineate precisely where genuine quantum advantage emerges in topological and many-body systems. Taken as a whole, this thesis leverages the convergence of topological matter and quantum information to remove key bottlenecks toward fault-tolerant quantum computation, to place near-term quantum simulation on rigorous footing, and to clarify the fundamental resources that separate classical from quantum computational power.
This paper proposes a novel architecture for quantum neural networks (QNNs) that leverages the benefits of topological protection and quantum error correction (QEC). The core idea is to construct a QNN based on a network of non-Abelian anyons, exploiting their inherent robustness against local perturbations. We introduce a framework where topological protection significantly reduces the impact of noise on the network, while LDPC (Low-Density Parity-Check) codes are employed to actively correct errors in the quantum information. The resulting system demonstrates a high tolerance to noise, a critical requirement for scalable QNN implementations. This approach represents a significant advancement in QNN design, merging the strengths of topological quantum computing and established QEC techniques. The theoretical framework outlines the key components and provides a pathway toward realizing fault-tolerant QNNs. The proposed architecture offers a promising route toward building practical and reliable quantum computing systems.