Related papers: Quantum double aspects of surface code models
This article consists of two parts. In Part 1, we present a formulation of two-dimensional topological quantum field theories in terms of a functor from a category of Ribbon graphs to the endofuntor category of a monoidal category. The key…
We present and analyze protocols for fault-tolerant quantum computing using color codes. We present circuit-level schemes for extracting the error syndrome of these codes fault-tolerantly. We further present an integer-program-based…
In this paper, we give a generalization of Kitaev's stabilizer code based on chain complex theory of bicommutative Hopf algebras. Due to the bicommutativity, the Kitaev's stabilizer code extends to a broader class of spaces, e.g. finite…
We define solvable quantum mechanical systems on a Hilbert space spanned by bipartite ribbon graphs with a fixed number of edges. The Hilbert space is also an associative algebra, where the product is derived from permutation group…
Topological error-correcting codes, such as surface codes and color codes, are promising because quantum operations are realized by two-dimensionally (2D) arrayed quantum bits (qubits). However, physical wiring of electrodes to qubits is…
We propose a nonperturbative construction of Hopf algebras that represent categories of line operators in topological quantum field theory, in terms of semi-extended operators (spark algebras) on pairs of transverse topological boundary…
One potential route toward fault-tolerant universal quantum computation is to use non-Abelian topological codes. In this work, we investigate how to achieve this goal with the quantum double model $\mathcal{D}(S_3)$ -- a specific…
We introduce group surface codes, which are a natural generalization of the $\mathbb{Z}_2$ surface code, and equivalent to quantum double models of finite groups with specific boundary conditions. We show that group surface codes can be…
Quantum bits have technological imperfections. Additionally, the capacity of a component that can be implemented feasibly is limited. Therefore, distributed quantum computation is required to scale up quantum computers. This dissertation…
Distributed architectures are a route to scalable quantum computing, but the performance of fault-tolerant operations across noisy inter-module links remains poorly characterized. We present circuit-level simulations of two key distributed…
The color code model is a crucial instance of a Calderbank--Shor--Steane (CSS)-type topological quantum error-correcting code, which notably supports transversal implementation of the full Clifford group. Its robustness against local noise…
In a companion work on the combinatorial quantization of 4d 2-Chern-Simons theory, the author has constructed the Hopf category of quantum 2-gauge transformations $\tilde{C}=\mathbb{U}_q\mathfrak{G}$ acting on the discrete surface-holonomy…
Topological quantum computing promises intrinsic fault tolerance by encoding quantum information in non-Abelian anyons, where quantum gates are implemented via braiding. While braiding operations are robust against local perturbations, a…
We introduce a quantum double quasitriangular quasi-Hopf algebra $D(H)$ associated to any quasi-Hopf algebra $H$. The algebra structure is a cocycle double cross product. We use categorical reconstruction methods. As an example, we recover…
We analyze the class of Generalized Double Semion (GDS) models in arbitrary dimensions from the point of view of lattice Hamiltonians. We show that on a $d$-dimensional spatial manifold $M$ the dual of the GDS is equivalent, up to constant…
Surface codes are quantum error correcting codes normally defined on 2D arrays of qubits. In this paper, we introduce a surface code design based on the fact that the severity of bit flip and phase flip errors in the physical quantum…
Quantum computation can be formulated through various models, each highlighting distinct structural and resource-theoretic aspects of quantum computational power. This paper develops a unified categorical framework that encompasses these…
In this paper, we explore the relationship between the width of a qubit lattice constrained in one dimension and physical thresholds for scalable, fault-tolerant quantum computation. To circumvent the traditionally low thresholds of small…
We show how to perform scalable fault-tolerant non-Clifford gates in two dimensions by introducing domain walls between the surface code and a non-Abelian topological code whose codespace is stabilized by Clifford operators. We formulate a…
High-rate quantum error correcting codes mitigate the imposing scale of fault-tolerant quantum computers but require efficient generation of non-local, many-body entanglement. We provide a linear-optical architecture with these properties,…