arXiv:1804.00866

On the Local Equivalence of 2D Color Codes and Surface Codes with Applications

Arun B. Aloshious, Arjun Nitin Bhagoji, Pradeep Kiran Sarvepalli

Published Apr 3, 2018• 3 citations

Abstract

In recent years, there have been many studies on local stabilizer codes. Under the assumption of translation and scale invariance Yoshida classified such codes. His result implies that translation invariant 2D color codes are equivalent to copies of toric codes. Independently, Bombin, Duclos-Cianci, and Poulin showed that a local translation invariant 2D topological stabilizer code is locally equivalent to a finite number of copies of Kitaev's toric code. In this paper we focus on 2D topological color codes and relax the assumption of translation invariance. Using a linear algebraic framework we show that any 2D color code (without boundaries) is locally equivalent to two copies of a related surface code. This surface code is induced by color code. We study the application of this equivalence to the decoding of 2D color codes over the bit flip channel as well as the quantum erasure channel. We report the performance of the color code on the square octagonal lattice over the quantum erasure channel. Further, we provide explicit circuits that perform the transformation between 2D color codes and surface codes. Our circuits do not require any additional ancilla qubits.

DOI: 10.48550/arxiv.1804.00866

Related papers

Equivalence of 2D color codes (without translational symmetry) to surface codes

Arjun Nitin Bhagoji, Pradeep Kiran Sarvepalli

In a recent work, Bombin, Duclos-Cianci, and Poulin showed that every local translationally invariant 2D topological stabilizer code is locally equivalent to a finite number of copies of Kitaev's toric code. For 2D color codes, Delfosse relaxed the constraint on translation invariance and mapped a 2D color code onto three surface codes. In this paper, we propose an alternate map based on linear algebra. We show that any 2D color code can be mapped onto exactly two copies of a related surface code. The surface code in our map is induced by the color code and easily derived from the color code. Furthermore, our map does not require any ancilla qubits for the surface codes.

arXiv:1503.03009IEEE International Symposium on Information Theory (ISIT)Jun 1, 201510 citations

Equivalence of topological color codes (without translational symmetry) to surface codes.

Arjun Nitin Bhagoji, Pradeep Kiran Sarvepalli

In a recent work, Bombin, Duclos-Cianci, and Poulin showed that every local translationally invariant 2D topological stabilizer code is locally equivalent to a finite number of copies of Kitaev’s toric code. In this paper, we focus on color codes and relax the constraint on translation invariance. We show that any color code can be mapped to exactly two copies of a related surface code. The surface code in our map is induced by the color code and easily derived from the color code. Furthermore, our map does not require any ancilla qubits for the surface codes. We also indicate the various degrees of freedom in constructing the map and the consequent variations.

Mar 10, 20150 citations

Erasure decoding of two-dimensional color codes

Arun B. Aloshious, Pradeep Kiran Sarvepalli

The quantum erasure channel models phenomena such as loss or leakage of qubits. Using quantum codes, we can recover from such errors. In this paper, we are interested in studying the performance of two-dimensional color codes over the quantum erasure channel. Our approach makes use of the local equivalence between color codes and surface codes. We propose a variety of decoding algorithms for color codes over the erasure channel. First, we propose algorithms that decode by projecting the erasures on the color to surface codes. Then, instead of directly decoding on the color code or on the equivalent copies of surface codes, we decode jointly on the color code and the equivalent surface codes. We observe a threshold of 44.3% for the color code on the square octagonal lattice.

Physical Review AOct 14, 20196 citations

Decoupling 2D translation-invariant topological CSS codes

Yifei Wang, Zhongyi Ni, Mingxin He +2 more

Two-dimensional translation-invariant topological CSS codes on qubits are known to be locally equivalent, after coarse-graining, to stacks of toric codes. However, existing constructions generally break more translation symmetry than is required to remove anyon-permuting translations, leaving open whether any further obstruction exists. We prove that no such obstruction occurs: after passing to the maximal anyon-preserving superlattice, every such code admits a local unitary decoupling into toric codes and product states. We further provide an efficient algorithm for explicitly constructing the decoupling map, together with bounds on the required supercell size and operator spreading. The decoupling requires no additional ancillas in generic cases and extends to finite systems with suitable boundary conditions.

quant-pharXiv:2608.09915Aug 11, 20260 citations

Local disentanglers for the equivalence of two-dimensional topological quantum codes

Mohsen Rahmani Haghighi, Mohammad Hossein Zarei

Studying equivalence classes under local unitary transformations is one of the most important approaches for the classification of topological quantum states. It has specially attracted much attention for topological quantum codes due to their application in quantum computing. In particular, It has been shown that each D dimensional color code is local unitary equivalence to many copies of D dimensional toric codes. In this paper, we consider such transformations for two- dimensional (2D) topological codes by introducing GHZ disentanglers. We apply the above disentanglers on qubits corresponding to one particular color in the color code defined on a three-colorable honeycomb lattice. Then, we show that it leads to disentangling other colors because the initial color code is converted to two copies of the triangular toric codes. Furtheremore we extend the above transformations for color codes on different three-colorable lattices. We show that by applying GHZ disentanglers corresponding to one particular color, the color code is converted to two toric codes defined on dual lattices corresponding to other colors. This result is also useful for comparing color codes on different lattices regarding the difference between their dual lattices.

Iranian Journal of Physics ResearchMar 1, 20240 citations

Unfolding the color code

Aleksander Kubica, Beni Yoshida, Fernando Pastawski

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 the d -dimensional toric code up to local unitary transformations and adding or removing ancilla qubits. Our result not only generalizes the proven equivalence for d = 2, but also provides an explicit recipe of how to decouple independent components of the color code, highlighting the importance of colorability in the construction of the code. Moreover, for the d -dimensional color code with boundaries of distinct colors, we find that the code is equivalent to multiple copies of the d -dimensional toric code which are attached along a -dimensional boundary. In particular, for d = 2, we show that the (triangular) color code with boundaries is equivalent to the (folded) toric code with boundaries. We also find that the d -dimensional toric code admits logical non-Pauli gates from the d th level of the Clifford hierarchy, and thus saturates the bound by Bravyi and König. In particular, we show that the logical d -qubit control- Z gate can be fault-tolerantly implemented on the stack of d copies of the toric code by a local unitary transformation.

arXiv:1503.02065New Journal of PhysicsAug 13, 2015179 citations