Decoding Toric Codes on Three Dimensional Simplical Complexes

@article{Aloshious2019DecodingTC,
  title={Decoding Toric Codes on Three Dimensional Simplical Complexes},
  author={Arun B. Aloshious and Pradeep Kiran Sarvepalli},
  journal={IEEE Transactions on Information Theory},
  year={2019},
  volume={67},
  pages={931-945}
}
Three dimensional (3D) toric codes are a class of stabilizer codes with local checks and come under the umbrella of topological codes. While decoding algorithms have been proposed for the 3D toric code on a cubic lattice, there have been very few studies on the decoding of 3D toric codes over arbitrary lattices. Color codes in 3D can be mapped to toric codes. However, the resulting toric codes are not defined on cubic lattice. They are arbitrary lattices with triangular faces. Decoding toric… 
[PDF] Semantic Reader
6 Citations
Background Citations
2
Methods Citations
1

6 Citations

Decoding Pauli-Z Errors on the 3-Dimensional Tetrahedral Color Code with Boundaries

The tetrahedral color code can be utilized for measurement-based quantum computing, for which all entanglement is present in a cluster state at the beginning of the computation and gate operations are performed by local measurements and classical operations.

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.

Non-CSS color codes on 2D lattices : Models and Topological Properties

Pramod Padmanabhan,1 Abhishek Chowdhury,1 Fumihiko Sugino,2 Mrittunjoy Guha Majumdar,3 Krishna Kumar Sabapathy4 1School of Basic Sciences, Indian Institute of Technology, Bhubaneswar, India∗…

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.

Single-Shot Error Correction of Three-Dimensional Homological Product Codes

It is proved that all three-dimensional homological product codes exhibit confinement in their $X$-components and are therefore single-shot for adversarial phase-flip noise, and confinement is sufficient for single- shot decoding of adversarial errors.

A Decoder for the Color Code with Boundaries

A decoder for the 3D color code with boundaries is introduced, which is a variation of the restriction decoder introduced by Kubicka and Delfosse, and the lift procedure is adapted to efficiently find a correction on qubits adjacent to a boundary.

References

SHOWING 1-10 OF 29 REFERENCES

Projecting three-dimensional color codes onto three-dimensional toric codes

This paper proposes an alternate map of 3D color codes to 3D toric codes with a view to decoding 3Dcolor codes and reduces the decoding of3D color code codes to that of 3d toric code.

Unfolding the color code

It is shown that the color code on a d-dimensional closed manifold is equivalent to multiple decoupled copies of the d- dimensional toric code up to local unitary transformations and adding or removing ancilla 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.

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.

Topological quantum memory

We analyze surface codes, the topological quantum error-correcting codes introduced by Kitaev. In these codes, qubits are arranged in a two-dimensional array on a surface of nontrivial topology, and…

Renormalization Group Decoder for a Four-Dimensional Toric Code

We describe a computationally efficient heuristic algorithm based on a renormalization-group procedure which aims at solving the problem of finding a minimal surface given its boundary (curve) in any…

Almost-linear time decoding algorithm for topological codes

This work designs a fast decoding algorithm for topological codes to correct for Pauli errors and erasure and combination of both errors and Erasure and has a worst case complexity of O(nα(n), where n is the number of physical qubits and α is the inverse of Ackermann's function, which is very slowly growing.

Topological order in a three-dimensional toric code at finite temperature

We study topological order in a toric code in three spatial dimensions or a $3+1\text{D}$ ${\mathbb{Z}}_{2}$ gauge theory at finite temperature. We compute exactly the topological entropy of the…

Stabilizer Codes and Quantum Error Correction

An overview of the field of quantum error correction and the formalism of stabilizer codes is given and a number of known codes are discussed, the capacity of a quantum channel, bounds on quantum codes, and fault-tolerant quantum computation are discussed.

Stacked codes: Universal fault-tolerant quantum computation in a two-dimensional layout

We introduce a class of 3D color codes, which we call stacked codes, together with a fault-tolerant transformation that will map logical qubits encoded in two-dimensional (2D) color codes into…