Related papers: Clifford Gates by Code Deformation
We estimate the success probability of quantum protocols composed of Clifford operations in the presence of Pauli errors. Our method is derived from the fault-point formalism previously used to determine the success rate of low-distance…
The creation of topological quantum gates using Majorana zero modes -- an outstanding problem in the field of topological quantum computing -- relies on our ability to control the braiding process of these particles in time and space. Here,…
This paper investigates centralizers and twisted centralizers in degenerate and non-degenerate Clifford (geometric) algebras. We provide an explicit form of the centralizers and twisted centralizers of the subspaces of fixed grades,…
The topological color code and the toric code are two leading candidates for realizing fault-tolerant quantum computation. Here we show that the color code on a $d$-dimensional closed manifold is equivalent to multiple decoupled copies of…
A divisible binary classical code is one in which every code word has weight divisible by a fixed integer. If the divisor is $2^\nu$ for a positive integer $\nu$, then one can construct a Calderbank-Shor-Steane (CSS) code, where…
We provide a detailed study of the general structure of two-dimensional topological stabilizer quantum error correcting codes, including subsystem codes. Under the sole assumption of translational invariance, we show that all such codes can…
A great deal of work has been done developing quantum codes with varying overhead and connectivity constraints. However, given the such an abundance of codes, there is a surprising shortage of fault-tolerant logical gates supported therein.…
We introduce a general framework for weak transversal gates -- probabilistic implementation of logical unitaries realized by local physical unitaries -- and propose a novel partially fault-tolerant quantum computing architecture that…
The $[[7,1,3]]$ Steane code and $[[23,1,7]]$ quantum Golay code have been identified as good candidates for fault-tolerant quantum computing via code concatenation. These two codes have transversal implementations of all Clifford gates, but…
We propose a scheme for detecting and correcting faults in any Clifford circuit. The scheme is based on the observation that the set of all possible outcome bit-strings of a Clifford circuit is a linear code, which we call the outcome code.…
We propose a scheme that converts a stabilizer code into another stabilizer code in a fault tolerant manner. The scheme first puts both codes in specific forms, and proceeds the conversion from a source code to a target code by applying…
In order to perform universal fault-tolerant quantum computation, one needs to implement a logical non-Clifford gate. Consequently, it is important to understand codes that implement such gates transversally. In this paper, we adopt an…
An algorithm which encodes the $L\times L$ 2D toric code logical state with a circuit of depth $2L+1$, using only local controlled-NOT($CX$) and Hadamard($H$) gates, is presented.
NOTE: PAPER WITHDRAWN (See Comments) The Clifford and Local Clifford groups for $d > 2$ dimensional systems have been topics of recent interest due to their applications in graph states, quantum codes, and possible applications in fast…
Clifford algebras are important structures in Geometric Algebra and Quantum Mechanics. They have allowed a formalization of the primitive operators in Quantum Theory. The algebras are built over vector spaces with dimension a power of 2…
In this paper we study a Clifford algebra generalization of the quaternions and its relationship with braid group representations related to Majorana fermions. The Fibonacci model for topological quantum computing is based on the fusion…
Topological quantum error correction codes are currently among the most promising candidates for efficiently dealing with the decoherence effects inherently present in quantum devices. Numerically, their theoretical error threshold can be…
Quantum information protected by the topology of the storage medium is expected to exhibit long coherence times. Another feature are topologically protected gates generated through braiding of Majorana bound states. However, braiding…
The color code is remarkable for its ability to perform fault-tolerant logic gates. This motivates the design of practical decoders that minimise the resource cost of color-code quantum computation. Here we propose a decoder for the planar…
In this work, we introduce constructions for non-Abelian qLDPC codes obtained by gauging transversal Clifford gates using measurement and feedback. In particular, we identify two qualitatively different approaches to gauging qLDPC codes to…