Four-dimensional toric code with non-Clifford transversal gates

  title={Four-dimensional toric code with non-Clifford transversal gates},
  author={Tomas Jochym-O'Connor and Theodore J. Yoder},
  journal={arXiv: Quantum Physics},
The design of a four-dimensional toric code is explored with the goal of finding a lattice capable of implementing a logical $\mathsf{CCCZ}$ gate transversally. The established lattice is the octaplex tessellation, which is a regular tessellation of four-dimensional Euclidean space whose underlying 4-cell is the octaplex, or hyper-diamond. This differs from the conventional 4D toric code lattice, based on the hypercubic tessellation, which is symmetric with respect to logical $X$ and $Z$ and… 
Numerical Implementation of Just-In-Time Decoding in Novel Lattice Slices Through the Three-Dimensional Surface Code.
A fully detailed set of bounded-height lattice slices through the 3D codes which retain the code distance and measurement-error detecting properties of the full 3D code and admit a dimension-jumping process which expands from/collapses to 2D surface codes supported on the boundaries of each slice.
Partitioning qubits in hypergraph product codes to implement logical gates
It is demonstrated that transversal gates can be used as the basis for universal quantum computing on LDPC codes, when supplemented with state injection.
Non-Pauli Errors in the Three-Dimensional Surface Code
This work generalises results to the case of a CCZ gate in the three-dimensional surface code and finds that many aspects of the problem are much more easily understood in this setting, particularly the emergence of linking charge, which is a local effect rather than a non-local one.
Morphing quantum codes
A morphing procedure that can be used to generate new quantum codes from existing quantum codes, including the 15-qubit Reed-Muller code, is introduced, and a family of hybrid color-toric codes is constructed by morphing the color code.
Analyzing the code structures of multidimensional signals for a continuous information transmission channel
The results reported here make it possible to build an acceptably complex demodulation procedure according to the specified types of code structures, on the condition that for each code of the code construct the encoding procedure is known when using binary codes.
Finding the disjointness of stabilizer codes is NP-complete
The results indicate that finding fault-tolerant logical gates for generic quantum error-correcting codes is a computationally challenging task.


Three-dimensional surface codes: Transversal gates and fault-tolerant architectures
This work examines three-dimensional (3D) surface codes in the context of quantum computation and proposes two quantum computing architectures based on 3D surface codes and shows that a stack of three 3Dsurface codes can be transformed into a single 3D color code using code concatenation.
The disjointness of stabilizer codes and limitations on fault-tolerant logical gates
The disjointness is introduced, which, roughly speaking, is the number of mostly non-overlapping representatives of any given non-trivial logical Pauli operator, and is used to prove that transversal gates on error-detecting stabilizer codes are necessarily in a finite level of the Clifford hierarchy.
Triangular color codes on trivalent graphs with flag qubits
This work numerically estimates the storage threshold of the triangular color code to be 0.2%, which is competitive with the thresholds of other topological quantum codes, and proves that 1-flag stabilizer measurement circuits are sufficient to preserve the full code distance.
Topological and Subsystem Codes on Low-Degree Graphs with Flag Qubits
This work modify minimum weight perfect matching decoding to efficiently and scalably incorporate information from measurements of the flag qubits and correct up to the full code distance while respecting the limited connectivity.
Universal transversal gates with color codes: A simplified approach
This work describes how to implement the Hadamard gate H fault tolerantly using code switching and shows how to transversally implement the generalized phase gate R_n =diag(1,e^(2πi/2^n)), which deviates from the method in the aforementioned paper, allowing an arguably simpler proof.
The surface code with a twist
A patch-based encoding involving a modified twist of defect-based logical encodings of a new variety called twists is investigated, and the smallest triangle code can demonstrate high-pseudothreshold fault-tolerance to depolarizing noise using just 13 physical qubits.
Cellular-Automaton Decoders with Provable Thresholds for Topological Codes.
A new cellular automaton (CA), the sweep rule, is proposed, which generalizes Toom's rule to any locally Euclidean lattice and leads to new CA decoders with provable error-correction thresholds for other topological quantum codes including the color code.
Classification of topologically protected gates for local stabilizer codes.
This Letter focuses on topological stabilizer codes and encoded unitary gates that can be implemented by a constant-depth quantum circuit and shows that topological protection must be turned off for at least some steps in the computation in order to achieve universality.
Cellular automaton decoders for topological quantum codes with noisy measurements and beyond
An error correction procedure based on a cellular automaton, the sweep rule, is proposed, which is applicable to a broad range of codes beyond topological quantum codes and is also essentially insensitive to the details of the lattice and noise model.
Fault-tolerant quantum computing with three-dimensional surface codes
The utility of using three-dimensional (3D) surface codes in a fault-tolerant quantum computer, and how one of the architectures may be competitive with the leading architectures, depending on the properties of the physical systems used to build the qubits.