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

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.

[1]  Fernando Pastawski,et al.  Unfolding the color code , 2015, 1503.02065.

[2]  A. Calderbank,et al.  Quantum Error Correction and Orthogonal Geometry , 1996, quant-ph/9605005.

[3]  Austin G. Fowler,et al.  Graphical algorithms and threshold error rates for the 2d color code , 2009, Quantum Inf. Comput..

[4]  Nicolai Friis,et al.  Fault-tolerant interface between quantum memories and quantum processors , 2016, Nature Communications.

[5]  Nicolas Delfosse,et al.  Decoding color codes by projection onto surface codes , 2013, ArXiv.

[6]  H. Bombin,et al.  Topological quantum distillation. , 2006, Physical review letters.

[7]  Arjun Bhagoji,et al.  Equivalence of 2D color codes (without translational symmetry) to surface codes , 2015, 2015 IEEE International Symposium on Information Theory (ISIT).

[8]  Héctor Bombín Structure of 2D Topological Stabilizer Codes , 2011 .

[9]  Ashley M. Stephens,et al.  Efficient fault-tolerant decoding of topological color codes , 2014, 1402.3037.

[10]  Gilles Zémor,et al.  Linear-Time Maximum Likelihood Decoding of Surface Codes over the Quantum Erasure Channel , 2017, Physical Review Research.

[11]  Todd A. Brun,et al.  Quantum Error Correction , 2019, Oxford Research Encyclopedia of Physics.

[12]  Miguel Angel Martin-Delgado,et al.  Twins Percolation for Qubit Losses in Topological Color Codes. , 2018, Physical review letters.

[13]  J. Preskill,et al.  Topological quantum memory , 2001, quant-ph/0110143.

[15]  Andrew J. Landahl,et al.  Fault-tolerant quantum computing with color codes , 2011, 1108.5738.

[16]  Beni Yoshida,et al.  Classification of quantum phases and topology of logical operators in an exactly solved model of quantum codes , 2010, 1007.4601.

[17]  D. Gottesman Theory of fault-tolerant quantum computation , 1997, quant-ph/9702029.

[18]  A. Kitaev Fault tolerant quantum computation by anyons , 1997, quant-ph/9707021.

[19]  R. Raussendorf,et al.  Efficient decoding of topological color codes , 2011, 1111.0831.