Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2602.06089

High-Level Fault-Tolerant Abstractions for Quantum-Gate Circuit Design and Synthesis: PQC and Topological Anyon Architectures (TQC) for Categorical Computations in SU(2)_3 TQFT and D-brane Stability

Vaidik A Sharma, Sainath Bitragunta

Published Feb 5, 2026• 0 citations
arXivHTMLPDF

Abstract

We propose a dual-architecture quantum simulation framework for modeling morphisms and stability conditions in the bounded derived category $\mathbf{D}^b(\mathrm{Coh}(X))$, with applications to D-brane physics on Kähler and non-Kähler manifolds. Two physically executable quantum realizations are constructed: parameterized quantum circuits (PQCs) implemented on conventional gate-based qubit platforms, and a topological quantum computing (TQC) realization using braiding and fusion of Fibonacci anyons modeled via SU(2)$_3$ modular tensor categories. In the PQC model, we encode slope functionals S(F) and stability constraints as variational observables, mapping derived morphisms to unitaries that evolve over parameterized angles. The output expectation values simulate quantum-corrected Chern class inequalities with deformation terms $δ$, capturing quantum corrections to classical geometric stability. In the TQC model, we engineer braid group representations to implement functorial transformations such as spherical twists and autoequivalences as sequences of fault-tolerant braid operations. This bifurcated approach provides a robust engineering pipeline for simulating categorical stability and homological algebra on quantum hardware, bridging abstract derived category theory with executable quantum architectures.

DOI
10.48550/arxiv.2602.06089

Related papers

Experimental quantum simulation of a topologically protected Hadamard gate via braiding Fibonacci anyons

Yu-ang Fan, Yingcheng Li, Yuting Hu +9 more

Topological quantum computation (TQC) is one of the most striking architectures that can realize fault-tolerant quantum computers. In TQC, the logical space and the quantum gates are topologically protected, i.e., robust against local disturbances. The topological protection, however, requires complicated lattice models and hard-to-manipulate dynamics; even the simplest system that can realize universal TQC—the Fibonacci anyon system—lacks a physical realization, let alone braiding the non-Abelian anyons. Here, we propose a disk model that can simulate the Fibonacci anyon system and construct the topologically protected logical spaces with the Fibonacci anyons. Via braiding the Fibonacci anyons, we can implement universal quantum gates on the logical space. Our disk model merely requires two physical qubits to realize three Fibonacci anyons at the boundary. By 15 sequential braiding operations, we construct a topologically protected Hadamard gate, which is to date the least-resource requirement for TQC. To showcase, we implement a topological Hadamard gate with two nuclear spin qubits, which reaches 97.18 % fidelity by randomized benchmarking. We further prove by experiment that the logical space and Hadamard gate are topologically protected: local disturbances due to thermal fluctuations result in a global phase only. As a platform-independent proposal, our work is a proof of principle of TQC and paves the way toward fault-tolerant quantum computation.

The Innovation•Jul 12, 2023•7 citations

AI-Enhanced Simulation of Superalgebra-Based Topological Quantum Computation

Murali Krishna Pasupuleti

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

International Journal of Academic and Industrial Research Innovations(IJAIRI)•Apr 11, 2025•0 citations

Experimental realization of a topologically protected Hadamard gate via braiding Fibonacci anyons

Yu-ang Fan, Li, Yingcheng, Yuting Hu +9 more

Topological quantum computation (TQC) is one of the most striking architectures that can realize fault-tolerant quantum computers. In TQC, the logical space and the quantum gates are topologically protected, i.e., robust against local disturbances. The topological protection, however, requires rather complicated lattice models and hard-to-manipulate dynamics; even the simplest system that can realize universal TQC--the Fibonacci anyon system--lacks a physical realization, let alone braiding the non-Abelian anyons. Here, we propose a disk model that can realize the Fibonacci anyon system, and construct the topologically protected logical spaces with the Fibonacci anyons. Via braiding the Fibonacci anyons, we can implement universal quantum gates on the logical space. Our proposal is platform-independent. As a demonstration, we implement a topological Hadamard gate on a logical qubit through a sequence of $15$ braiding operations of three Fibonacci anyons with merely $2$ nuclear spin qubits. The gate fidelity reaches 97.18% by randomized benchmarking. We further prove by experiment that the logical space and Hadamard gate are topologically protected: local disturbances due to thermal fluctuations result in a global phase only. Our work is a proof of principle of TQC and paves the way towards fault-tolerant quantum computation.

arXiv:2210.12145•Oct 21, 2022•2 citations

A Three-Layer Architecture for Fault-Tolerant Quantum Computing

Zhirao Wang, Zhou You, Yiming Huang +4 more

Fault tolerance is an indispensable prerequisite for constructing large-scale universal quantum computers. Drawing philosophies from classical computer architecture, this paper presents a hardware-agnostic three-layer high-level architectural framework for generic fault-tolerant quantum computation. Guided by the real execution workflows of fault-tolerant quantum algorithms, the proposed model is decoupled from specific physical qubit hardware platforms and quantum error correction codes, serving as a universal abstract standard rather than a platform-specific implementation scheme. Special attention is devoted to the intermediate Fault-Tolerance Layer, which serves as the architectural bridge between application-level logical programs and hardware-level execution. We systematically characterize its five internal components, the interfaces and data exchanged among them, and the execution, correction, and adaptation paths that together enable logical synthesis, fault-tolerant resources management, decoding, and runtime fault-tolerant control. An end-to-end example is further provided to illustrate the full-stack operating pipeline of fault-tolerant quantum algorithms under this framework. Given the increasing emphasis on modular, heterogeneous, and cross-layer fault-tolerant quantum systems, our architecture provides a unified foundational model for organizing such designs.

quant-pharXiv:2606.22418•Jun 23, 2026•0 citations

Consistent Simulation of Fibonacci Anyon Braiding within a Qubit Quasicrystal Inflation Code

Marcelo M. Amaral

The simulation of non-Abelian anyon braiding is a critical step towards fault-tolerant quantum computation. We introduce a framework for this task based on a one-dimensional Quasicrystal Inflation Code (QIC). The code is defined by a local Hamiltonian whose ground state manifold enforces Fibonacci tiling constraints and possesses the correct Fibonacci degeneracy. We derive the corresponding braid operators and demonstrate that, while they are formally non-local, they possess an exact, local 3-qubit structure. This allows us to distill their action into a single, physically realizable $8 \times 8$ gate, which we term the $B_{gate}$. We prove through comparative compilation for systems with different numbers of qubits that constructing circuits by composing these local gates is dramatically more scalable than compiling the equivalent global unitary, showing a greater than tenfold reduction in circuit depth. To validate the framework, we successfully executed a braiding algorithm for the Jones polynomial, a topological invariant of knots, on an IBM Quantum processor, quantifying the signal degradation due to hardware noise. Finally, we numerically confirm for systems up to 17 qubits that our construction rigorously satisfies the required Temperley-Lieb and braid group relations while preserving the code subspace. This work establishes a validated and physically grounded pathway for the scalable simulation of anyonic braiding on programmable quantum systems.

arXiv:2506.21643•Jun 25, 2025•0 citations

Bicategorical aspects of topological quantum computation

Ahmadi, Fatimah Rita

Topological quantum computation offers a paradigm shift for fault-tolerant quantum computation. It proposes encoding qubits in the mutual states of quasiparticles (called anyons) of 2-dimensional topologically ordered matter. Unitary ribbon fusion categories describe the algebraic theory of anyons. Although the category of an anyonic theory specifies suitable computational spaces, qubits, and quantum gates, it does not precisely formalise the category of topological quantum computation (TQC). We describe the TQC category using the elements of categorical quantum mechanics (CQM). Given the qubit-based graphical calculus accompanying CQM, called the ZX-calculus, we present the details of the ZX-representation of Fibonacci and Ising anyons. Finally, we propose a bicategorical approach to convene anyonic theory and TQC in one (bi)category. In the second part of the thesis, we discuss how the bicategory of module categories formalises boundary types and their excitations. We show theorems that reduce the data to physically meaningful data. A 2-category capable of describing topological quantum computation with point-like and string-like excitations is speculated to be a fusion 2-category. We discuss the available definition in the literature. The paper particularly lacks a rigorous definition for additive 2-categories; in this thesis, we give a definition. We propose the idea of typing higher-ranked matrices in additive 2-categories. Lastly, we overview the complete definition of monoidal 2-categories and recover Kapranov and Voevodsky's definition from the algebraic definition of tricategory by Gurski. This definition and the detailed list of data are the complete ingredients physicists need for quantum computation with higher dimensional excitations.

•Jan 1, 2022•0 citations
We propose a dual-architecture quantum simulation framework for modeling morphisms and stability conditions in the bounded derived category Db(Coh(X))\mathbf{D}^b(\mathrm{Coh}(X))Db(Coh(X)), with applications to D-brane physics on Kähler and non-Kähler manifolds. Two physically executable quantum realizations are constructed: parameterized quantum circuits (PQCs) implemented on conventional gate-based qubit platforms, and a topological quantum computing (TQC) realization using braiding and fusion of Fibonacci anyons modeled via SU(2)3_33​ modular tensor categories. In the PQC model, we encode slope functionals S(F) and stability constraints as variational observables, mapping derived morphisms to unitaries that evolve over parameterized angles. The output expectation values simulate quantum-corrected Chern class inequalities with deformation terms δδδ, capturing quantum corrections to classical geometric stability. In the TQC model, we engineer braid group representations to implement functorial transformations such as spherical twists and autoequivalences as sequences of fault-tolerant braid operations. This bifurcated approach provides a robust engineering pipeline for simulating categorical stability and homological algebra on quantum hardware, bridging abstract derived category theory with executable quantum architectures.
Topological quantum computation (TQC) is one of the most striking architectures that can realize fault-tolerant quantum computers. In TQC, the logical space and the quantum gates are topologically protected, i.e., robust against local disturbances. The topological protection, however, requires complicated lattice models and hard-to-manipulate dynamics; even the simplest system that can realize universal TQC—the Fibonacci anyon system—lacks a physical realization, let alone braiding the non-Abelian anyons. Here, we propose a disk model that can simulate the Fibonacci anyon system and construct the topologically protected logical spaces with the Fibonacci anyons. Via braiding the Fibonacci anyons, we can implement universal quantum gates on the logical space. Our disk model merely requires two physical qubits to realize three Fibonacci anyons at the boundary. By 15 sequential braiding operations, we construct a topologically protected Hadamard gate, which is to date the least-resource requirement for TQC. To showcase, we implement a topological Hadamard gate with two nuclear spin qubits, which reaches 97.18 % fidelity by randomized benchmarking. We further prove by experiment that the logical space and Hadamard gate are topologically protected: local disturbances due to thermal fluctuations result in a global phase only. As a platform-independent proposal, our work is a proof of principle of TQC and paves the way toward fault-tolerant quantum computation.
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 computation (TQC) is one of the most striking architectures that can realize fault-tolerant quantum computers. In TQC, the logical space and the quantum gates are topologically protected, i.e., robust against local disturbances. The topological protection, however, requires rather complicated lattice models and hard-to-manipulate dynamics; even the simplest system that can realize universal TQC--the Fibonacci anyon system--lacks a physical realization, let alone braiding the non-Abelian anyons. Here, we propose a disk model that can realize the Fibonacci anyon system, and construct the topologically protected logical spaces with the Fibonacci anyons. Via braiding the Fibonacci anyons, we can implement universal quantum gates on the logical space. Our proposal is platform-independent. As a demonstration, we implement a topological Hadamard gate on a logical qubit through a sequence of 151515 braiding operations of three Fibonacci anyons with merely 222 nuclear spin qubits. The gate fidelity reaches 97.18% by randomized benchmarking. We further prove by experiment that the logical space and Hadamard gate are topologically protected: local disturbances due to thermal fluctuations result in a global phase only. Our work is a proof of principle of TQC and paves the way towards fault-tolerant quantum computation.
Fault tolerance is an indispensable prerequisite for constructing large-scale universal quantum computers. Drawing philosophies from classical computer architecture, this paper presents a hardware-agnostic three-layer high-level architectural framework for generic fault-tolerant quantum computation. Guided by the real execution workflows of fault-tolerant quantum algorithms, the proposed model is decoupled from specific physical qubit hardware platforms and quantum error correction codes, serving as a universal abstract standard rather than a platform-specific implementation scheme. Special attention is devoted to the intermediate Fault-Tolerance Layer, which serves as the architectural bridge between application-level logical programs and hardware-level execution. We systematically characterize its five internal components, the interfaces and data exchanged among them, and the execution, correction, and adaptation paths that together enable logical synthesis, fault-tolerant resources management, decoding, and runtime fault-tolerant control. An end-to-end example is further provided to illustrate the full-stack operating pipeline of fault-tolerant quantum algorithms under this framework. Given the increasing emphasis on modular, heterogeneous, and cross-layer fault-tolerant quantum systems, our architecture provides a unified foundational model for organizing such designs.
The simulation of non-Abelian anyon braiding is a critical step towards fault-tolerant quantum computation. We introduce a framework for this task based on a one-dimensional Quasicrystal Inflation Code (QIC). The code is defined by a local Hamiltonian whose ground state manifold enforces Fibonacci tiling constraints and possesses the correct Fibonacci degeneracy. We derive the corresponding braid operators and demonstrate that, while they are formally non-local, they possess an exact, local 3-qubit structure. This allows us to distill their action into a single, physically realizable 8×88 \times 88×8 gate, which we term the BgateB_{gate}Bgate​. We prove through comparative compilation for systems with different numbers of qubits that constructing circuits by composing these local gates is dramatically more scalable than compiling the equivalent global unitary, showing a greater than tenfold reduction in circuit depth. To validate the framework, we successfully executed a braiding algorithm for the Jones polynomial, a topological invariant of knots, on an IBM Quantum processor, quantifying the signal degradation due to hardware noise. Finally, we numerically confirm for systems up to 17 qubits that our construction rigorously satisfies the required Temperley-Lieb and braid group relations while preserving the code subspace. This work establishes a validated and physically grounded pathway for the scalable simulation of anyonic braiding on programmable quantum systems.
Topological quantum computation offers a paradigm shift for fault-tolerant quantum computation. It proposes encoding qubits in the mutual states of quasiparticles (called anyons) of 2-dimensional topologically ordered matter. Unitary ribbon fusion categories describe the algebraic theory of anyons. Although the category of an anyonic theory specifies suitable computational spaces, qubits, and quantum gates, it does not precisely formalise the category of topological quantum computation (TQC). We describe the TQC category using the elements of categorical quantum mechanics (CQM). Given the qubit-based graphical calculus accompanying CQM, called the ZX-calculus, we present the details of the ZX-representation of Fibonacci and Ising anyons. Finally, we propose a bicategorical approach to convene anyonic theory and TQC in one (bi)category. In the second part of the thesis, we discuss how the bicategory of module categories formalises boundary types and their excitations. We show theorems that reduce the data to physically meaningful data. A 2-category capable of describing topological quantum computation with point-like and string-like excitations is speculated to be a fusion 2-category. We discuss the available definition in the literature. The paper particularly lacks a rigorous definition for additive 2-categories; in this thesis, we give a definition. We propose the idea of typing higher-ranked matrices in additive 2-categories. Lastly, we overview the complete definition of monoidal 2-categories and recover Kapranov and Voevodsky's definition from the algebraic definition of tricategory by Gurski. This definition and the detailed list of data are the complete ingredients physicists need for quantum computation with higher dimensional excitations.