Paper The following article is Open access

Unfolding the color code

, and

Published 13 August 2015 © 2015 IOP Publishing Ltd and Deutsche Physikalische Gesellschaft
, , Citation Aleksander Kubica et al 2015 New J. Phys. 17 083026 DOI 10.1088/1367-2630/17/8/083026

1367-2630/17/8/083026

Abstract

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 $d+1$ boundaries of $d+1$ distinct colors, we find that the code is equivalent to multiple copies of the d-dimensional toric code which are attached along a $(d-1)$-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 dth 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.

Export citation and abstract BibTeX RIS

1. Introduction

Quantum error-correcting codes [1, 2] are vital for fault-tolerant realization of quantum information processing tasks. Of particular importance are topological quantum codes [3, 4] where quantum information is stored in non-local degrees of freedom while the codes are characterized by geometrically local generators. An essential feature of such codes is to admit a fault-tolerant implementation of a universal gate set as this would guarantee that the physical errors propagate in a benign and controlled manner. Thus, the search for novel quantum error-correcting codes and the classification of fault-tolerantly implementable logical gates in these codes have been central problems in quantum information science [510].

The quest of analyzing topological quantum codes is also closely related to the central problem in quantum many-body physics, namely the classification of quantum phases [11, 12]. A fruitful approach is to view topological quantum codes as exactly solvable toy models which correspond to representatives of gapped quantum phases. This approach has led to a complete classification of translation symmetric two-dimensional stabilizer Hamiltonians [13, 14], as well as to the discovery of novel three-dimensional topological phases which do not fit into previously known theoretical framework [15, 16].

Topological color codes [17] are important examples of topological stabilizer codes that admit transversal implementation of a variety of logical gates, which may not be fault-tolerantly implementable in other topological stabilizer codes. In two spatial dimensions, the color code admits transversal implementation of all logical Clifford gates. In three and higher dimensions, the color code admits transversal implementation of logical non-Clifford gates [18]. A naturally arising question is to identify the physical properties allowing to extend the set of transversally implementable logical gates with respect to other topological codes.

Given two codes with different sets of fault-tolerantly implementable logical gates, one may naturally expect that they correspond to different topological phases of matter. However, physical properties of color codes and toric codes are known to be very similar. For instance, both of the codes have logical Pauli operators with similar geometric shapes, which leads to essentially identical braiding properties of anyonic excitations from the viewpoint of long-range physics. Furthermore, it has been proven that translation symmetric stabilizer codes, supported on a two-dimensional torus, are equivalent to multiple decoupled copies of the two-dimensional toric code up to local unitary transformations and adding or removing ancilla qubits [13]. This result implies that the two-dimensional color code supported on a torus is equivalent to two decoupled copies of the toric code, and thus they belong to the same quantum phase [19].

However, the aforementioned results do not consider the effect of boundaries on the classification of quantum phases [2022]. In fact, the color code admits transversal implementation of computationally useful logical gates only if it is supported on a system with appropriately designed boundaries. Perhaps, the presence of boundaries may render additional computational power to topological quantum codes and may result in richer structure of topological phases of matter. Complete understanding of the relation between the color code and the toric code will be the necessary first step to clarify the connection between boundaries and achievable fault-tolerant logical gates, and its implications to the classification of quantum phases.

1.1. Summary of main results

In this paper, we establish a connection between the color code and the toric code in the presence or absence of boundaries, and study fault-tolerantly implementable logical gates in these two codes. Our first result, presented in section 2, focuses on the equivalence between the color code and the toric code on d-dimensional lattices without boundaries, $d\geqslant 2$.

Result 1 (Closed manifold). The topological color code on a d-dimensional closed manifold (without boundaries) is equivalent to multiple decoupled copies of the d-dimensional toric code up to local unitary transformations and adding or removing ancilla qubits.

This extends the known results from [13, 14, 19] to the family of color codes in arbitrary dimensions. While previous results are limited to either translation symmetric systems or do not provide an explicit method of transformations, we provide a specific construction of how to map the color code into multiple decoupled toric code components. The recipe emphasizes the importance of colorability in the construction of the color code. Our result implies that the topological color code belongs to the same quantum phase as two copies of the toric code, according to the definition widely accepted in condensed matter physics community [12].

In section 3, we analyze the case of topological codes with boundaries and present the following result.

Result 2 (Boundaries). The d-dimensional topological color code with boundaries is equivalent to d copies of the d-dimensional toric code which are attached along a $(d-1)$-dimensional boundary.

In two-dimensions, we find that the (triangular) color code with three boundaries is equivalent to the toric code with boundaries (i.e. the surface code) which is folded (see figure 1). We find that the $d\gt 2$ version of the color code with point-like excitations and $d+1$ distinctly colored boundaries is equivalent to d copies of the toric code which are attached along a $(d-1)$-dimensional boundary. On this $(d-1)$-dimensional boundary, a composite point-like electric charge composed of all d electric charges from the different copies of the toric code may condense. Other boundaries are decoupled and allow condensation of a single electric charge associated with a specific copy.

Figure 1.

Figure 1. The topological color code (a) with three boundaries ${\partial }_{A}{\mathcal{L}}$, ${\partial }_{B}{\mathcal{L}}$ and ${\partial }_{C}{\mathcal{L}}$ viewed as the folded toric code (b) with two smooth and two rough boundaries. The boundary ${\partial }_{A}{\mathcal{L}}$ of color A is equivalent to a pair of boundaries—smooth in the front and rough in the rear layer; similarly ${\partial }_{B}{\mathcal{L}}$. The boundary ${\partial }_{C}{\mathcal{L}}$ is the fold.

Standard image High-resolution image

In section 4, we study logical non-Clifford gates fault-tolerantly implementable in the d-dimensional toric code. Our third result concerns the implementability of the d-qubit control-Z gate, i.e. a gate which applies −1 phase only if all d qubits are in $| 1\rangle $ state.

Result 3 (Logical gate). A stack of d copies of the d-dimensional toric code with point-like excitations admits fault-tolerant implementation of the logical d-qubit control-Z gate by local unitary transformations.

In particular, we find that transversal application of physical ${R}_{d}=\mathrm{diag}(1,{{\rm{e}}}^{2\pi {\rm{i}}/{2}^{d}})$ phase gates in the d-dimensional topological color code is equivalent to the logical d-qubit control-Z gate acting on d copies of the toric code. Note that the d-qubit control-Z gate belongs to the dth level of the Clifford hierarchy, but is outside of the $(d-1)$ th level. Thus, a stack of d copies of the d-dimensional toric code saturates the bound by Bravyi and König on fault-tolerant logical gates which are implementable by local unitary transformations [23]. For a definition of the Clifford hierarchy, see [8, 23, 24] and subsection 4.2.

We believe that our findings will shed light on the techniques of code deformation [18] and lattice surgery [25, 26], allowing for computation with less physical qubits, higher fault-tolerant error suppression and shorter time. The ability to transform and relate different codes may turn out to be crucial in analyzing the available methods of computation with topological codes. In particular, we might be able to improve the decoding scheme for the color code proposed in [27], and generalize it to any dimensions. Also, our findings may lead to a systematic method of composing known quantum codes to construct new codes with larger set of fault-tolerant logical gates. Finally, an interesting future problem is to apply the disentangling unitary to the gauge color codes [28, 29].

While the paper is written in a relatively self-contained manner, we assume some prior exposure to the construction of the topological color code. A pedagogical description of the color code has been given by one of the authors in [29]. Our discussion mostly concerns the d-dimensional topological color code and the toric code with point-like excitations as it is the most interesting case from the viewpoint of transversal non-Clifford gates. For the sake of simplicity, we present proof sketches relying on many figures. Rigorous proofs require the language of algebraic topology [30, 31], which might be technically challenging and could obscure the main ideas presented in the paper. Thus, we defer them until the appendix.

2. Topological color code without boundaries

In this section, we show that the d-dimensional topological color code supported on a closed manifold is equivalent to multiple decoupled copies of the toric code.

2.1. Brief introduction to the color code and the toric code

We begin by briefly reviewing the construction of the topological color code and the toric code. The starting point to define either the toric code or the color code is a two-dimensional lattice ${\mathcal{L}}$. We can think of ${\mathcal{L}}$ as a homogeneous cell 2-complex, i.e. a collection of vertices V, edges E and faces F, glued together in a certain way. In general, ${\mathcal{L}}$ can be defined on a manifold with boundaries, but in this section we restrict our attention to closed manifolds.

The toric code in two dimensions is defined on a lattice ${\mathcal{L}}$ by placing one qubit on every edge, and associating X- and Z-type stabilizer generators with vertices and faces of ${\mathcal{L}}$, namely

Equation (1)

Here, X(e) and Z(e) denote Pauli X and Z operators on the qubit placed on the edge $e\in E$; see figure 2(a) for an example. We denote such a code, as well as its stabilizer group by ${TC}({\mathcal{L}})$. One can verify that X- and Z-type stabilizer generators commute.

Figure 2.

Figure 2. The toric code and the color code in two dimensions. (a) The toric code has qubits (red dots) placed on edges, and X-vertex (green) and Z-face (blue) stabilizer generators. (b) The color code has qubits placed on vertices, and X-face and Z-face stabilizer generators. Note that the color code can only be defined on a three-valent and three-colorable lattice.

Standard image High-resolution image

The color code is defined on a lattice ${\mathcal{L}}$, which satisfies two additional conditions:

  • valence—each vertex belongs to exactly three edges,
  • colorability—there is a coloring1 of faces of ${\mathcal{L}}$ with three colors, A, B and C, such that any two adjacent faces have different colors. For instance, the honeycomb lattice satisfies the valence and colorability conditions; also see figure 2(b). In the case of the color code, we place one qubit at every vertex, and associate X- and Z-type stabilizer generators with every face of ${\mathcal{L}}$, namely

Equation (2)

To verify that X- and Z-type stabilizers commute, one uses the valence and colorability conditions. We denote such a code, as well as its stabilizer group by ${CC}({\mathcal{L}})$.

We can generalize the definition of the toric code and the color code to d dimensions by considering a d-dimensional lattice (i.e. a homogeneous cell d-complex) ${\mathcal{L}}$. There are $d-1$ different ways of defining the toric code on ${\mathcal{L}}$—place qubits on m-cells, $m=1,2,\ldots ,d-1$, and associate X- and Z-type stabilizer generators with $(m-1)$- and $(m+1)$-cells, respectively. In the case of the color code, the additional conditions are that ${\mathcal{L}}$ is $(d+1)$-valent and its d-cells are $(d+1)$-colorable. There are $d-1$ ways of defining the color code on ${\mathcal{L}}$—place qubits on vertices, and associate X- and Z-type stabilizer generators with m- and $(d+2-m)$-cells, where $m=2,3,\ldots ,d$. For a rigorous definition of the toric code and the color code in d dimensions see appendix.

In the main body of the paper, we restrict our attention to the color code and the toric code with point-like excitations, which significantly simplifies the discussion. In particular, the color code has X- and Z-type stabilizers associated with d-cells and two-cells (faces), whereas the toric code has qubits placed on edges. We defer the discussion of the general case until the appendix.

2.2. Equivalence in two-dimensions

In this subsection, we prove that the two-dimensional color code supported on a closed manifold (without boundaries) is equivalent to two copies of the toric code.

Theorem 1. Let ${CC}({\mathcal{L}})$ be the two-dimensional topological color code defined on a lattice ${\mathcal{L}}$ without boundaries, colored in A, B and C. There exists a local Clifford unitary U, and two lattices ${{\mathcal{L}}}_{A}$ and ${{\mathcal{L}}}_{B}$ obtained from ${\mathcal{L}}$ by shrinking faces of color A and B, respectively, such that

Equation (3)

Moreover, one can choose U to be

Equation (4)

where ${\mathcal{C}}$ represents the set of all faces in ${\mathcal{L}}$ colored with C, and Uf is a Clifford unitary acting only on qubits of the face f.

Here, the tensor product ${TC}({{\mathcal{L}}}_{A})\otimes {TC}({{\mathcal{L}}}_{B})$ indicates that the stabilizer group can be factored into two independent stabilizer groups associated with two decoupled copies of the toric code on the lattices ${{\mathcal{L}}}_{A}$ and ${{\mathcal{L}}}_{B}$. We shall refer to ${{\mathcal{L}}}_{A}$ and ${{\mathcal{L}}}_{B}$ supporting two decoupled copies of the toric code as shrunk lattices (see [32, 33]).

As described in the theorem, the disentangling unitary transformation U has a tensor product structure, $U={\displaystyle \otimes }_{f\in {\mathcal{C}}}{U}_{f}$. Thus, U is a local unitary transformation, and two systems belong to the same quantum phase.

The proof of the theorem 1 consists of three steps:

  • (1)  
    performing certain local unitary Uf at each and every face f of color C in ${\mathcal{L}}$,
  • (2)  
    checking that the stabilizer generators ${CC}({\mathcal{L}})$ are mapped by $U={\displaystyle \otimes }_{f\in {\mathcal{C}}}{U}_{f}$ into two sets of generators ${TC}({{\mathcal{L}}}_{A})$ and ${TC}({{\mathcal{L}}}_{B})$ supported on disjoint sets of qubits,
  • (3)  
    visualizing two codes ${TC}({{\mathcal{L}}}_{A})$ and ${TC}({{\mathcal{L}}}_{B})$ as codes defined on lattices ${{\mathcal{L}}}_{A}$ and ${{\mathcal{L}}}_{B}$ obtained from ${\mathcal{L}}$ by local deformations.

Step 1: let us pick a face f of ${\mathcal{L}}$ colored in C. Since ${\mathcal{L}}$ is three-colorable and three-valent, the face f has even number of vertices, $2n$. Moreover, we can color every edge in two distinct colors of faces it separates. Let us enumerate vertices of f in counter-clockwise order in such a way that the edge $(1,2)$ between vertices 1 and 2 has color AC. We would like to find a unitary transformation Uf of the Hilbert space ${{\mathcal{H}}}_{V}$ of (color code) qubits placed on vertices into the Hilbert space ${{\mathcal{H}}}_{E}$ of (toric code) qubits placed on edges2 such that some operators on ${{\mathcal{H}}}_{V}$ are mapped into certain operators on ${{\mathcal{H}}}_{E}$. In particular, we would require the following mappings to hold

Equation (5)

Equation (6)

Equation (7)

Equation (8)

where Xj represents Pauli X operator on a qubit on the vertex j, while ${X}_{(j,j+1)}$ represents Pauli X operator on a qubit on the edge $(j,j+1)$ and $2n+1\equiv 1$; similarly for Zj and ${Z}_{(j,j+1)}$. The conditions imposed on Uf by equations (5)–(8) for the face f with six vertices are illustrated in figure 3.

Figure 3.

Figure 3. Transformation of the operators of the color code ${CC}({\mathcal{L}})$ supported on qubits of the face f colored in C under the disentangling unitary transformation Uf.

Standard image High-resolution image

We claim that there exists a Clifford unitary Uf which satisfies equations (5)–(8). The proof of existence of such a unitary transformation is presented later. Note that under the unitary Uf the operators on the qubits on vertices of f (up to the stabilizer ${\displaystyle \otimes}_{j=1}^{2n}{X}_{j}$) transform into the operators on the qubits placed on edges of f in the following way

Equation (9)

where parenthesis indicate that operators might be multiplied by the stabilizer ${\displaystyle \otimes}_{j=1}^{2n}{X}_{j}$.

Step 2: let us analyze what happens to the stabilizer generators of the color code ${CC}({\mathcal{L}})$ after performing Step 1 for each and every face of color C, i.e. after action of $U={\displaystyle \otimes }_{f\in {\mathcal{C}}}{U}_{f}$ by conjugation. Note that the stabilizer group ${CC}({\mathcal{L}})$ does not have a unique representation in terms of its generators—for instance, ${CC}({\mathcal{L}})$ can be generated by Y- and Z-type stabilizers associated with every face of ${\mathcal{L}}$.

For a face f colored in C, the unitary U transforms the Z-face stabilizer on qubits on vertices into the Z-type operator on qubits on edges colored in AC. Similarly, the Y-face stabilizer on vertices is transformed into the Z-type operator on qubits on edges of f colored in BC. For a face f' colored in A (respectively B), the unitary U transforms the Z-face stabilizer on vertices (up to multiplication by X-face stabilizers on faces of color C neighboring f'—this depends on the choice of U in Step 1) into the Z-type operator on qubits on edges of f' colored in AC (respectively BC). On the other hand, the X-face stabilizer is transformed into the X-type operator on qubits on edges radiating out of f', which are colored in BC (respectively AC).

Figure 4 summarizes how the stabilizers of the color code transform under U described in figure 3. The parenthesis to the left indicate that the stabilizer of the color code might be multiplied by the X-face stabilizers on certain neighboring faces of color C, depending on the disentangling procedure, i.e. the choice of U.

Figure 4.

Figure 4. The effect of applying the disentangling unitary transformation U to the stabilizer group of the color code ${CC}({\mathcal{L}})$. The parenthesis indicate that the stabilizer of the color code might be multiplied by the X-face stabilizers on certain neighboring faces of color C, depending on the disentangling procedure, i.e. Step 1.

Standard image High-resolution image

One can observe that after performing $U={\displaystyle \otimes }_{f\in {\mathcal{C}}}{U}_{f}$, the Z-type stabilizers on faces of color A and C, as well as the X-type stabilizers on faces of color B transform into Z- and X-type stabilizers, respectively, on qubits on AC edges. Similarly, the Y-type stabilizers on faces of color C, the Z-type stabilizers on faces of color B, and the X-type stabilizers on faces of color A transform into stabilizers on qubits on BC edges.

We conclude that after performing U, the stabilizer generators ${CC}({\mathcal{L}})$ transform into two sets of stabilizer generators ${TC}({{\mathcal{L}}}_{A})$ and ${TC}({{\mathcal{L}}}_{B})$ supported on two disjoint sets of qubits, either placed on BC or AC edges.

Step 3: we would like to show that the stabilizer generators ${TC}({{\mathcal{L}}}_{A})$ and ${TC}({{\mathcal{L}}}_{B})$ define the toric code on two lattices, ${{\mathcal{L}}}_{A}$ and ${{\mathcal{L}}}_{B}$, obtained from ${\mathcal{L}}$ by local deformations. A recipe for the shrunk lattice ${{\mathcal{L}}}_{A}$ is as follows:

  • vertices of ${{\mathcal{L}}}_{A}$ are centers of A faces in ${\mathcal{L}}$,
  • edges of ${{\mathcal{L}}}_{A}$ are BC edges in ${\mathcal{L}}$,
  • faces of ${{\mathcal{L}}}_{A}$ are B and C faces in ${\mathcal{L}}$.

In short, one obtains ${{\mathcal{L}}}_{A}$ by shrinking A faces to points while expanding B and C faces [32, 33]. Similarly, ${{\mathcal{L}}}_{B}$ is obtained by shrinking B faces. Examples of shrunk lattices are depicted in figure 5 for the case of the hexagonal lattice ${\mathcal{L}}$. In this case, one obtains two copies of the toric code supported on triangular lattices.

Figure 5.

Figure 5. Fragments of the shrunk lattices: (a) ${{\mathcal{L}}}_{A}$ and (b) ${{\mathcal{L}}}_{B}$, obtained from ${\mathcal{L}}$ by shrinking A and B faces, respectively. Qubits are placed on edges, and the stabilizer generators are X-vertex and Z-face operators.

Standard image High-resolution image

The stabilizer generators ${TC}({{\mathcal{L}}}_{A})$ and ${TC}({{\mathcal{L}}}_{B})$ are respectively supported on ${{\mathcal{L}}}_{A}$ and ${{\mathcal{L}}}_{B}$ lattices. In particular

  • the X-vertex stabilizers in ${TC}({{\mathcal{L}}}_{A})$ (respectively ${TC}({{\mathcal{L}}}_{B})$) are obtained from X-face stabilizers3 of ${CC}({\mathcal{L}})$ on A (respectively B) faces,
  • the Z-face stabilizers in ${TC}({{\mathcal{L}}}_{A})$ (respectively ${TC}({{\mathcal{L}}}_{B})$) are obtained from Z-face $\mathrm{stabilizers}(\mathrm{see}\;\mathrm{footnote}\;3)$ on B faces (respectively A) and Y-face (respectively Z-face) stabilizers on C faces.

To summarize, the unitary $U={\displaystyle \otimes }_{f\in {\mathcal{C}}}{U}_{f}$ transforms the generators of the stabilizer group ${CC}({\mathcal{L}})$ of the color code into generator sets for two stabilizer groups ${TC}({{\mathcal{L}}}_{A})$ and ${TC}({{\mathcal{L}}}_{B})$, which define the toric code on two disjoint lattices ${{\mathcal{L}}}_{A}$ and ${{\mathcal{L}}}_{B}$ obtained from ${\mathcal{L}}$ by shrinking either A or B faces. This concludes the proof of the equivalence in two-dimensions.

Note that the equivalence between the two-dimensional color code and copies of the toric code has been proven for systems with translation symmetries [13, 19]. Our work not only generalizes the previous results to the color code on an arbitrary lattice ${\mathcal{L}}$ on a closed manifold, but also presents an explicit construction of the local unitary and shrunk lattices. This leads to new observations for topological color codes with boundaries, which are presented in section 3.

2.3. Isomorphism between Pauli subgroups

In this subsection, we prove the existence of the disentangling unitary transformation $U={\displaystyle \otimes }_{f\in {\mathcal{C}}}{U}_{f}$. We begin by developing some useful technical tool concerning subgroups of the Pauli operator group. Consider a system of n qubits and two subgroups of Pauli operators ${{\mathcal{O}}}_{1},{{\mathcal{O}}}_{2}\subseteq \mathrm{Pauli}(n)$, where $\mathrm{Pauli}(n)$ is the Pauli operator group on n qubits. We shall neglect complex phases in ${{\mathcal{O}}}_{1},{{\mathcal{O}}}_{2}$. We say that ${{\mathcal{O}}}_{1}$ and ${{\mathcal{O}}}_{2}$ are isomorphic to each other iff there exists a Clifford unitary transformation U such that

Equation (10)

Let $Z({{\mathcal{O}}}_{1})$ and $Z({{\mathcal{O}}}_{2})$ be centers of ${{\mathcal{O}}}_{1}$ and ${{\mathcal{O}}}_{2}$, respectively. Then, the following lemma holds [34]:

Lemma 1  (Isomorphic groups). Two subgroups of Pauli operators ${{\mathcal{O}}}_{1},{{\mathcal{O}}}_{2}\subset {Pauli}(n)$ are isomorphic iff

Equation (11)

where $G({\mathcal{O}})$ represents the number of independent generators of ${\mathcal{O}}\subset {Pauli}(n)$.

Let $\{{g}_{j}\}$ and $\{{h}_{j}\}$ be two sets of independent generators for two isomorphic groups ${{\mathcal{O}}}_{1}$ and ${{\mathcal{O}}}_{2}$. We say that $\{{g}_{j}\}$ and $\{{h}_{j}\}$ satisfy the same commutation relations if

Equation (12)

We have the following lemma.

Lemma 2  (Clifford transformation). Let ${{\mathcal{O}}}_{1}$ and ${{\mathcal{O}}}_{2}$ be two isomorphic groups generated by two sets of independent generators, $\{{g}_{j}\}$ and $\{{h}_{j}\}$. If $\{{g}_{j}\}$ and $\{{h}_{j}\}$ have the same commutation relations, then there exists a Clifford unitary transformation U such that

Equation (13)

Proof. Let us find a set of independent generators for ${{\mathcal{O}}}_{1}$, which we call canonical:

Equation (14)

where ${n}_{2}\geqslant {n}_{1}$, and two Pauli operators Ai and Aj commute unless they are in the same column, in which case they anti-commute by definition. Note that n1 is the number of pairs of anticommuting canonical generators, whereas n2 is the number of commuting canonical generators. Observe that any canonical generator can be written as a product of generators $\{{g}_{j}\}$.

For a binary vector $\vec{a}=({a}_{1},\ldots ,{a}_{{n}_{1}+{n}_{2}})$, we define

Equation (15)

Then, there exists a set of independent ${n}_{1}+{n}_{2}$ binary vectors ${\vec{a}}^{(j)}$ such that

Equation (16)

Let ${B}_{j}={{\mathcal{O}}}_{2}({\vec{a}}^{(j)})$. Since commutation relations of $\{{g}_{j}\}$ and $\{{h}_{j}\}$ are identical, then Bj are canonical generators for ${{\mathcal{O}}}_{2}$:

Equation (17)

Then, as shown in [34], there exists a Clifford unitary U such that

Equation (18)

Such a unitary transformation also satisfies

Equation (19)

which completes the proof of the (Clifford transformation) lemma 2.

We are ready to show the existence of a Clifford unitary Uf, which satisfies the rules in equations (5)–(8). First, let us introduce the notion of the overlap group of the stabilizer group [34]. For a given subset of qubits, denoted by Q, the overlap group on Q is defined as the group generated by the restriction of generators of the stabilizer group ${\mathcal{S}}$ onto Q. Namely

Equation (20)

where $u{| }_{Q}$ represents a restriction of u onto Q (see figure 6). Note that the overlap group is not necessarily Abelian and is defined up to a global phase.

Figure 6.

Figure 6. The overlap group of the stabilizer group ${\mathcal{S}}$ on the region Q is defined as the group generated by the restriction of the generators of ${\mathcal{S}}$ onto Q. Dotted circles represent the stabilizer generators of ${\mathcal{S}}$ with support intersecting Q.

Standard image High-resolution image

The key idea in the proof of existence of U is that the overlap groups for the color code and the toric code for the set of C faces are isomorphic. In particular, let us consider a C face $f\in {\mathcal{L}}$ with $2n$ vertices, and two corresponding faces ${f}^{A}\in {{\mathcal{L}}}_{A}$ and ${f}^{B}\in {{\mathcal{L}}}_{B}$ derived from f. Then, the overlap group of ${CC}({\mathcal{L}})$ on f is generated by

Equation (21)

whereas the overlap group of ${TC}({{\mathcal{L}}}_{A})$ and ${TC}({{\mathcal{L}}}_{B})$ on ${f}^{A}\bigsqcup {f}^{B}$ is generated by

Equation (22)

Observe that both ${{\mathcal{O}}}_{f}$ and ${{\mathcal{O}}}_{{f}^{A}\bigsqcup {f}^{B}}$ have $4n-2$ independent generators and their centers are generated by 2 independent operators. Namely

Equation (23)

Equation (24)

Using the (isomorphic groups) lemma 1, we obtain that ${{\mathcal{O}}}_{f}$ and ${{\mathcal{O}}}_{{f}^{A}\bigsqcup {f}^{B}}$ are isomorphic.

Let us choose a set of independent generators for ${{\mathcal{O}}}_{f}$ as follows

Equation (25)

Equation (26)

Equation (27)

We then label a set of independent generators for ${{\mathcal{O}}}_{{f}^{A}\bigsqcup {f}^{B}}$ in the following way

Equation (28)

Equation (29)

By direct calculation one can verify that $\{{g}_{j}\}$ and $\{{h}_{j}\}$ have the same commutation relations. Thus, from the (Clifford transformation) lemma 2, there exists a Clifford unitary Uf such that

Equation (30)

Therefore, the local Clifford unitary $U={\displaystyle \otimes }_{f\in {\mathcal{C}}}{U}_{f}$ transforms ${CC}({\mathcal{L}})$ into ${TC}({{\mathcal{L}}}_{A})\otimes {TC}({{\mathcal{L}}}_{B})$, and this completes the proof of the theorem 1.

One might find the labelings in equations (25)–(29) arbitrary. Yet, once we have chosen gj for $j=1,\ldots ,2n$, it is not difficult to find the right labeling for $j=2n+1,\ldots ,4n-2$ by checking the commutation relations. Note that the choice of ${g}_{2n}=\left({\displaystyle \otimes }_{j=1}^{2n}{X}_{j}\right){Z}_{2n}{Z}_{1}$ is crucial to ensure that the generators ${\{{g}_{j}\}}_{j=1}^{2n}$ are independent.

2.4. Three (or more) dimensions

A similar equivalence between the topological color code and the toric code holds in any dimensions. It can be summarized in the following theorem.

Theorem 2  (Equivalence). Let ${CC}({\mathcal{L}})$ be the stabilizer group of the topological color code defined on a d-dimensional lattice ${\mathcal{L}}$ without boundaries, which is $(d+1)$-valent and colored with ${C}_{0},\ldots ,{C}_{d}$. Let X- and Z-type stabilizer generators be supported on respectively d-cells and 2-cells, where $d\geqslant 2$. Then, there exists a local Clifford unitary U such that

Equation (31)

where ${\mathcal{S}}$ represents the stabilizer group of decoupled ancilla qubits, and ${TC}({{\mathcal{L}}}_{j})$—the stabilizer group of the toric code defined on the shrunk lattice ${{\mathcal{L}}}_{j}$ derived from ${\mathcal{L}}$ by local deformations, i.e. shrinking d-cells of color Cj. Moreover, one can choose the disentangling unitary U to be of the form

Equation (32)

where ${{\mathcal{C}}}_{0}$ is the set of d-cells of color C0 in ${\mathcal{L}}$, and Uc is a Clifford unitary acting only on qubits on vertices of the d-cell c.

Note that the color code qubits are placed on vertices, whereas the toric code qubits—on edges. Thus, for every d-cell c colored in C0, we shall add $E-V$ ancilla qubits, where V and E denote the number of vertices and edges in c. We can assume that ancilla qubits are stabilized by single-qubit Pauli Z operators. Since the lattice ${\mathcal{L}}$ is $(d+1)$-valent, then $E={dV}/2$ and $E-V\geqslant 0$ for $d\geqslant 2$. In particular, ancilla qubits are required for the three- or higher-dimensional case.

Since the color code and the toric code in d dimensions support excitations whose braiding properties are similar (there exists an isomorphism between anyon labels for two codes), the equivalence should not be very surprising. The study of topological invariants gives valuable insight into the equivalence of models. It has been argued that two topologically ordered systems with isomorphic anyon labels and modular matrices belong to the same topological phase [12, 35, 36]. This hypothesis has been proven for two-dimensional stabilizer Hamiltonians with translation symmetries [13]. Also, this hypothesis has been tested for the two-dimensional Levin–Wen model in [20], where a construction of a transparent domain wall between two Levin–Wen models (with tensor unitary categories satisfying certain equivalence conditions) was presented.

The idea of the mapping is a straightforward generalization of the proof of the theorem 1 presented in section 2.2. First, we perform a local Clifford unitary, whose existence is guaranteed by the (Clifford transformation) lemma 2. Then, we analyze how the stabilizer generators of the color code transform under such a unitary. Finally, we check that the stabilizers can be split into d sets, each of them defining a copy of the toric code on a lattice obtained by deforming the initial lattice ${\mathcal{L}}$. For the sake of clarity, we focus on d = 3. We also first present the construction of shrunk lattices, before explaining how to construct a local Clifford unitary transforming the color code into d decoupled copies of the toric code.

In three-dimensions, the lattice ${\mathcal{L}}$ has volumes colored with four colors, A, B, C and D. Recall that we can assign colors to faces and edges, too. Namely, a face has two colors of two volumes it belongs to, whereas an edge has three colors (of three volumes it belongs to). We obtain three shrunk lattices ${{\mathcal{L}}}_{A}$, ${{\mathcal{L}}}_{B}$ and ${{\mathcal{L}}}_{C}$ by shrinking volumes of color A, B and C, respectively. In particular, ${{\mathcal{L}}}_{A}$ consists of

  • vertices—centers of A volumes in ${\mathcal{L}}$,
  • edges—BCD edges in ${\mathcal{L}}$,
  • faces—BC, BD and CD faces in ${\mathcal{L}}$,
  • volumes—B, C and D volumes in ${\mathcal{L}}$.

For an example, see figure 7. Similarly for other shrunk lattices ${{\mathcal{L}}}_{B}$ and ${{\mathcal{L}}}_{C}$. In general, a d-dimensional lattice ${\mathcal{L}}$ is colored with $d+1$ colors, ${C}_{0},\ldots ,{C}_{d}$, and one obtains the shrunk lattice ${{\mathcal{L}}}_{i}$, where i = 1,...,d, by shrinking d-cells of color Ci. Namely, ${{\mathcal{L}}}_{i}$ consists of

  • vertices—centers of d-cells in ${\mathcal{L}}$ of color Ci,
  • edges—edges in ${\mathcal{L}}$ of color $\{{C}_{0},\ldots ,{C}_{d}\}\setminus \{{C}_{i}\}$,
  • faces—faces in ${\mathcal{L}}$ of color $\{{C}_{0},\ldots ,{C}_{d}\}\setminus \{{C}_{i},{C}_{j}\}$ for all $j\ne i$.

Figure 7.

Figure 7. (a) The boundary $\partial c$ of a volume c of color D in the lattice ${\mathcal{L}}$. Note that $\partial c$ can be viewed as a three-colorable and three-valent lattice on a closed manifold (a sphere), with faces colored in AD, BD and CD. (b) A volume in the shrunk lattice ${{\mathcal{L}}}_{A}$ derived from c after shrinking volumes of color A. Note that qubits are placed on (a) vertices and (b) edges. The figures were created using Robert Webb's Stella software (http://software3d.com/Stella.php).

Standard image High-resolution image

We construct the disentangling unitary U as a tensor product of local Clifford unitaries, $U={\displaystyle \otimes }_{c\in {\mathcal{D}}}{U}_{c}$, where ${\mathcal{D}}$ is the set of all volumes of color D. Let us consider a volume c of color D. The overlap group ${{\mathcal{O}}}_{c}$ of the stabilizer group of the color code on c is generated by Z-edge operators and X-face operators, for each and every edge and face belonging to c. Namely

Equation (33)

Let ${{\mathcal{H}}}_{V}\simeq {({{\mathbb{C}}}^{2})}^{\otimes V}$ and ${{\mathcal{H}}}_{E}\simeq {({{\mathbb{C}}}^{2})}^{\otimes E}$ be the Hilbert spaces of color code qubits and toric code qubits, respectively placed on vertices and edges of the volume c. Since $E-V\gt 0$, we need to add $E-V$ ancilla qubits to qubits on vertices to match the dimensionality of Hilbert spaces, ${{\mathcal{H}}}_{V}\otimes {{\mathcal{H}}}_{\mathrm{ancilla}}\simeq {{\mathcal{H}}}_{E}$, where ${{\mathcal{H}}}_{\mathrm{ancilla}}$ is the Hilbert space of ancilla qubits. Let ${{\mathcal{S}}}_{c}=\langle {Z}_{i}| \ \forall i\in \{1,\ldots ,E-V\}\rangle $ be the stabilizer group of the ancilla qubits, where Zi is the Pauli Z operator acting on the ancilla qubit i. We would like to construct a Clifford unitary Uc which maps the group ${{\mathcal{O}}}_{c}\otimes {{\mathcal{S}}}_{c}$ of operators on the Hilbert space ${{\mathcal{H}}}_{V}\otimes {{\mathcal{H}}}_{\mathrm{ancilla}}$ into the group

Equation (34)

of operators on ${{\mathcal{H}}}_{E}$ according to the rules

Equation (35)

The parenthesis indicate that the mapping holds up to multiplication by the elements of the center $Z({{\mathcal{O}}}_{c}\otimes {{\mathcal{S}}}_{c})$.

Let us analyze what happens to the stabilizer group of the color code and the stabilizer group of ancilla qubits, ${CC}({\mathcal{L}}){\displaystyle \otimes }_{c\in {\mathcal{D}}}{{\mathcal{S}}}_{c}$, after applying the unitary $U={\displaystyle \otimes }_{c\in {\mathcal{D}}}{U}_{c}$. One can verify that

  • X-vertex stabilizers of ${TC}({{\mathcal{L}}}_{A})$, ${TC}({{\mathcal{L}}}_{B})$ and ${TC}({{\mathcal{L}}}_{C})$ are obtained from X-volume stabilizers4 in ${CC}({\mathcal{L}})$ of color A, B and C, respectively,
  • Z-face stabilizers in ${TC}({{\mathcal{L}}}_{A})$ are obtained from Z-face ${\mathrm{stabilizers}}^{}$ (see footnote 4) of color BD, CD and BC; similarly for ${TC}({{\mathcal{L}}}_{B})$ and ${TC}({{\mathcal{L}}}_{C})$,
  • the elements in the center $Z({{\mathcal{O}}}_{c}\otimes {{\mathcal{S}}}_{c})$ are mapped into the center $Z({{\mathcal{O}}}_{c}^{{TC}})$.

Moreover, the generators of the group $U\left({CC}({\mathcal{L}}){\displaystyle \otimes }_{c\in {\mathcal{D}}}{{\mathcal{S}}}_{c}\right){U}^{\dagger }$ are supported on either ${{\mathcal{L}}}_{A}$, or ${{\mathcal{L}}}_{B}$, or ${{\mathcal{L}}}_{C}$, and thus one obtains three decoupled copies of the toric code.

The last thing we need to justify is the existence of Uc consistent with the rules in equation (35). We start with showing that ${{\mathcal{O}}}_{c}\otimes {{\mathcal{S}}}_{c}$ and ${{\mathcal{O}}}_{c}^{{TC}}$ are isomorphic. Clearly, ${{\mathcal{O}}}_{c}\otimes {{\mathcal{S}}}_{c},{{\mathcal{O}}}_{c}^{{TC}}\subset \mathrm{Pauli}(n=E)$. First, let us look at the independent generators of ${{\mathcal{O}}}_{c}\otimes {{\mathcal{S}}}_{c}$. There are $V-1$ independent operators of type denoted by ${\{{g}_{i}\}}_{i=1}^{V-1}$, supported on edges of a (spanning) tree $T\subset E$ of the graph $G=(V,E)$. To see this, note that edge operators are independent as long as the corresponding edges do not form a closed loop. This implies that independent edge generators correspond to a tree consisting of $V-1$ edges in the graph G. In the case of operators of type there are exactly two independent relations between them, namely

Equation (36)

where the products are taken over all X-face operators associated with faces of c of color AD, BD, and CD, respectively. Thus, there are $F-2$ independent X-face operators. We set $F-3$ generators ${\{{g}_{i}\}}_{i=V}^{V+F-4}$ to be X-face operators, associated with all faces of c but three—one of each color AD, BD and CD. We also set ${g}_{V+F-3}={\displaystyle \otimes }_{v\in V}X(v)$, where ${\displaystyle \otimes }_{v\in V}X(v)$ is the X-volume operator on c. Including $E-V$ single-qubit Pauli Z stabilizer generators ${\{{g}_{i}\}}_{i=V+F-2}^{E+F-3}$ for ancilla qubits, there are

Equation (37)

independent generators of ${{\mathcal{O}}}_{c}\otimes {{\mathcal{S}}}_{c}$, and thus $G({{\mathcal{O}}}_{c}\otimes {{\mathcal{S}}}_{c})=E+F-3$. Note that since

Equation (38)

then $G(Z({{\mathcal{O}}}_{c}\otimes {{\mathcal{S}}}_{c}))=(F-2)+1+(E-V)$.

In the case of ${{\mathcal{O}}}_{c}^{{TC}}$, there are E independent generators of type Observe that there are only three independent relations between generators of type namely

Equation (39)

and thus $G({{\mathcal{O}}}_{c}^{{TC}})=E+(F-3)$. Since the group ${{\mathcal{O}}}_{c}^{{TC}}$ has single qubit Pauli Z operators as generators, the center $Z({{\mathcal{O}}}_{c}^{{TC}})$ can only be generated by Z-type operators

Equation (40)

There are $2F$ operators of type and they satisfy three independent relations, namely a product of all Z-face operators with qubits placed on edges not colored in i is equal to identity, for $i\in \{A,B,C\}$. Thus $G(Z({{\mathcal{O}}}_{c}^{{TC}}))=2F-3$ and using the Euler characteristic for c, $V-E+F=2$, we obtain $G(Z({{\mathcal{O}}}_{c}^{{TC}}))=G(Z({{\mathcal{O}}}_{c}\otimes {{\mathcal{S}}}_{c}))$. From the (isomorphic groups) lemma 1 we obtain that ${{\mathcal{O}}}_{c}\otimes {{\mathcal{S}}}_{c}$ and ${{\mathcal{O}}}_{c}^{{TC}}$ are isomorphic.

We have already chosen independent generators $\{{g}_{i}\}$ of ${{\mathcal{O}}}_{c}\otimes {{\mathcal{S}}}_{c}$. We choose independent generators $\{{h}_{i}\}$ of ${{\mathcal{O}}}_{c}^{{TC}}$ as follows:

  • for $i=1,\ldots ,V-1$:
  • for $i=V,\ldots ,V+F-4$:
  • for $i=V+F-3$: ${g}_{i}={\displaystyle \otimes }_{v\in V}X(v)\to {h}_{i}={\displaystyle \otimes }_{e\in E}Z(e)$,
  • for $i=V+F-2,\ldots ,E+F-3$: ${g}_{i}={Z}_{i}\to {h}_{i}\in Z({{\mathcal{O}}}_{c}^{{TC}})$,where Zi is the Pauli Z operator on the ancilla qubit i. We would like to emphasize that the choice of ${\{{h}_{i}\}}_{i=V+F-2}^{E+F-3}$ does not matter, as long as they belong to the center $Z({{\mathcal{O}}}_{c}^{{TC}})$ and ${\{{h}_{i}\}}_{i=1}^{E+F-3}$ is the set of independent operators. One can verify that $\{{g}_{i}\}$ and $\{{h}_{i}\}$ have the same commutation relations, and thus from the (Clifford transformation) lemma 2, there exists a Clifford unitary Uc such that
    Equation (41)
    Moreover, the choice of generators $\{{g}_{i}\}$ and $\{{h}_{i}\}$ guarantees that the rules in equation (35) are satisfied. This concludes the proof of the (equivalence) theorem 2 in d = 3 dimensions.

Finally, we present a proof sketch for higher-dimensional case (for a rigorous proof, see the appendix). The color code is defined on a d-dimensional lattice ${\mathcal{L}}$ with d-cells colored in ${C}_{0},{C}_{1},\ldots ,{C}_{d}$. Let c be a d-cell in ${\mathcal{L}}$ of color C0 with V vertices, E edges and F $(d-1)$-cells. Let ${{\mathcal{O}}}_{c}$ be the overlap group of the stabilizer group ${CC}({\mathcal{L}})$ of the color code on c and ${{\mathcal{S}}}_{c}$ be the stabilizer group of $E-V$ ancilla qubits. Note that ${{\mathcal{O}}}_{c}\otimes {{\mathcal{S}}}_{c}$ is generated by Z-edge operators, X-type $(d-1)$-cell-like operators and single Pauli Z operators on ancilla qubits. Thus, $G({{\mathcal{O}}}_{c}\otimes {{\mathcal{S}}}_{c})=(V-1)+(F-d+1)+(E-V)=E+F-d$. Let ${{\mathcal{O}}}_{c}^{{TC}}$ be defined as a group of operators on qubits placed on edges of c. Namely, ${{\mathcal{O}}}_{c}^{{TC}}$ is generated by single qubit Pauli Z operators on edges and X-vertex-like operators with support on all edges radiating out of $(d-1)$-cells of c. Note that there are d independent relations between X-vertex-like operators, namely a product of all X-vertex-like operators associated with $(d-1)$-cells of certain color is identity. Thus, $G({{\mathcal{O}}}_{c}^{{TC}})=E+F-d$. By relating the number of independent generators of $Z({{\mathcal{O}}}_{c}\otimes {{\mathcal{S}}}_{c})$ and $Z({{\mathcal{O}}}_{c}^{{TC}})$ to the number of i-cells of c, for $i=0,1,\ldots ,d$, and the Betti numbers of c, we can prove $G(Z({{\mathcal{O}}}_{c}\otimes {{\mathcal{S}}}_{c}))=G(Z({{\mathcal{O}}}_{c}^{{TC}}))$ (see the appendix for more details). From the (isomorphic groups) lemma 1 we obtain that ${{\mathcal{O}}}_{c}\otimes {{\mathcal{S}}}_{c}$ and ${{\mathcal{O}}}_{c}^{{TC}}$ are isomorphic. We then choose independent generators $\{{g}_{i}\}$ and $\{{h}_{i}\}$ of ${{\mathcal{O}}}_{c}\otimes {{\mathcal{S}}}_{c}$ and ${{\mathcal{O}}}_{c}^{{TC}}$ as follows

  • ${\{{g}_{i}\}}_{i=1}^{V-1}$—independent Z-edge operators related to a spanning tree $T\subset E$ of the graph $G=(V,E)$ $\to {\{{h}_{i}\}}_{i=1}^{V-1}$ —single qubit Pauli Z operators on qubits placed on edges associated with the spanning tree T,
  • ${\{{g}_{i}\}}_{i=V}^{F+V-d-1}$—independent X-type $(d-1)$-cell operators associated with all $(d-1)$-cells of c except for d of them, namely one $(d-1)$-cell for each colors ${C}_{0}{C}_{1}$, ${C}_{0}{C}_{2},\ldots ,{C}_{0}{C}_{d}\to {\{{h}_{i}\}}_{i=V}^{F+V-d-1}$X-vertex-like operators with support on edges radiating out of $F-d$ corresponding $(d-1)$-cells of c,
  • ${g}_{i=F+V-d}={\displaystyle \otimes }_{v\in V}X(v)\to {h}_{i=F+V\;-\;d}={\displaystyle \otimes }_{e\in E}Z(e)$,
  • ${\{{g}_{i}\}}_{i=F+V-d+1}^{E+F-d}$—single Pauli Z operators on ancilla qubits $\to $ ${\{{h}_{i}\}}_{i=F+V-d+1}^{E+F-d}\in Z({{\mathcal{O}}}_{c}^{{TC}})$—elements of the center of ${{\mathcal{O}}}_{c}^{{TC}}$ chosen in such a way that all the operators $\{{h}_{i}\}$ are independent.

One can verify that $\{{g}_{i}\}$ and $\{{h}_{i}\}$ have the same commutation relations. From the (Clifford transformation) lemma 2, there exists a local Clifford unitary Uc such that

Equation (42)

By applying the disentangling unitary transformation $U={\displaystyle \otimes }_{c\in {{\mathcal{C}}}_{0}}{U}_{c}$ to the stabilizer group ${CC}({\mathcal{L}})$ of the color code and the stabilizer group ${\mathcal{S}}={\displaystyle \otimes }_{c\in {{\mathcal{C}}}_{0}}{{\mathcal{S}}}_{c}$ of ancilla qubits, one obtains the stabilizer groups of the toric code supported on d decoupled lattices ${{\mathcal{L}}}_{1},\ldots ,{{\mathcal{L}}}_{d}$, namely

Equation (43)

which concludes the proof of the (equivalence) theorem 2.

3. Topological color code with boundaries

Realistic physical systems have boundaries. Moreover, the transversal implementability of logical gates in the topological color code crucially depends on the choice of boundaries. In this section we show that the color code defined on a d-dimensional lattice with $d+1$ boundaries of $d+1$ distinct colors is equivalent to d copies of the toric code attached together at a $(d-1)$-dimensional boundary. We also briefly describe how the choice of boundaries of the color code determines if the copies of the toric code are attached or decoupled. We then discuss such boundaries from the viewpoint of condensation of excitations.

3.1. Physical intuition behind folding

We begin with presenting some physical intuition why the toric code with two smooth and two rough boundaries needs to be folded if one hopes for transversal logical non-Pauli gates such as the Hadamard gate $\bar{H}$. Let us recall known results about gapped boundaries of the toric code. In two spatial dimensions, the toric code may have two types of boundaries, smooth and rough [20]. The rough boundaries are defined as the boundaries with open edges (see figure 8). Similarly to the toric code without boundaries, there are X-vertex and Z-face stabilizers, although Z-face stabilizers have to be modified along the rough boundaries. An X-type (Z-type) string-like logical operator can only start from and end on smooth (rough) boundaries. One says that the electric charge e, i.e. the violated X-vertex stabilizer, condenses on the rough boundary and the magnetic flux m, i.e. the violated Z-face stabilizer, is confined since single e, unlike m, can be created or absorbed on the rough boundary. Similarly, m condenses and e is confined on the smooth boundary.

Figure 8.

Figure 8. Origami of the toric code with boundaries. (a) Blue line, starting from and ending on rough boundaries, represents the logical Z operator. Green lines, starting from and ending on smooth boundaries, represent the logical X operator. (b) The color code with three boundaries, ${\partial }_{A}{\mathcal{L}}$, ${\partial }_{B}{\mathcal{L}}$ and ${\partial }_{C}{\mathcal{L}}$, obtained by folding the toric code with two smooth and two rough boundaries. After folding, two logical operators $\bar{X}$ and $\bar{Z}$ are supported on overlapping regions.

Standard image High-resolution image

Consider the two-dimensional toric code with two smooth and two rough boundaries as depicted in figure 8(a). Since there is only one pair of anti-commuting logical operators, $\bar{X}$ and $\bar{Z}$, the code encodes a single logical qubit. There is one crucial difference between the toric code and the color code (with boundaries)—the latter admits transversal implementation of the Hadamard gate $\bar{H}$ while the former does not. Recall that the Hadamard gate swaps Pauli X and Z operators. Suppose that the Hadamard gate can be implemented by a local unitary operator U. Let $\bar{X}$ and $\bar{X^{\prime} }$ be two equivalent implementations of the logical X operator, supported on string-like horizontal regions (see figure 8(a)). Then, $U\bar{X}{U}^{\dagger }$ implements the logical Z operator, which has to anti-commute with $\bar{X^{\prime} }$. On the other hand, since U is a local unitary, then $U\bar{X}{U}^{\dagger }$ and $\bar{X^{\prime} }$ have no overlap, and thus they commute, leading to a contradiction. We conclude that the logical Hadamard gate cannot be implemented by a local unitary operator in the toric code with boundaries. This is a simple version of the argument presented in [10].

We note that if the logical Hadamard is transversal, then both logical X and Z operators must have representations which are supported on overlapping regions. By folding the toric code, both logical X and Z operators can be supported on overlapping regions, as shown in figure 8(b). Thus, for the logical Hadamard to be transversal folding of the toric code is indeed necessary.

3.2. Unfolding in two dimensions

We now return to the analysis of the topological color code ${CC}({\mathcal{L}})$ supported on a (three-valent and three-colorable) two-dimensional lattice ${\mathcal{L}}$ with the Euler characteristic5 χ=2 − 2gb and the boundary $\partial {\mathcal{L}}={\bigsqcup}_{i=1}^{n}{\partial }_{i}{\mathcal{L}}$, where ${\partial }_{i}{\mathcal{L}}$ is the (maximum) connected component of the boundary $\partial {\mathcal{L}}$ of certain color. For conciseness, we simply refer to ${\partial }_{i}{\mathcal{L}}$ as a boundary. We say that the boundary ${\partial }_{i}{\mathcal{L}}$ is of color C1 if all the faces adjacent to ${\partial }_{i}{\mathcal{L}}$ have colors C2 and C3, where $\{{C}_{1},{C}_{2},{C}_{3}\}=\{A,B,C\}$. One can show that the color code ${CC}({\mathcal{L}})$ encodes $\mu -2\chi +2({\partial }_{n,0}+{\partial }_{n,b})$ logical qubits where μ is the number of two-valent vertices belonging to $\partial {\mathcal{L}}$ and δi,j is the Kronecker delta. In particular, one important case corresponds to the triangular color code(with three boundaries of color A, B and C as shown in figure 9(a); see also figure 8(b)), which encodes one logical qubit regardless of the system size, and has transversal logical Hadamard $\bar{H}$ and the phase gate $\bar{{R}_{2}}$.

Figure 9.

Figure 9. (a) The (triangular) color code on a two-dimensional lattice ${\mathcal{L}}$ with the boundary $\partial {\mathcal{L}}$ comprising of three components of color A, B and C, namely $\partial {\mathcal{L}}={\partial }_{A}{\mathcal{L}}\bigsqcup {\partial }_{B}{\mathcal{L}}\bigsqcup {\partial }_{C}{\mathcal{L}}$. Qubits are represented by dots. (b) A fragment of the lattice ${{\mathcal{L}}}_{A}$ derived from ${\mathcal{L}}$ by shrinking faces of color A. The smooth boundary arises in ${{\mathcal{L}}}_{A}$ on the boundary ${\partial }_{B}{\mathcal{L}}$. (c) A fragment of the lattice ${{\mathcal{L}}}_{B}$ derived from ${\mathcal{L}}$ by shrinking faces of color B. The rough boundary arises in ${{\mathcal{L}}}_{B}$ on the boundary ${\partial }_{B}{\mathcal{L}}$.

Standard image High-resolution image

We would like to understand how the color code ${CC}({\mathcal{L}})$ with boundaries transforms under the disentangling unitary $U={\displaystyle \otimes }_{f\in {\mathcal{C}}}{U}_{f}$ described in section 2.2. In the bulk, the disentangling unitary U transforms the stabilizers of the color code into stabilizers of the toric code supported on two decoupled lattices ${{\mathcal{L}}}_{A}$ and ${{\mathcal{L}}}_{B}$, obtained from ${\mathcal{L}}$ by shrinking faces of color A and B, respectively. On the other hand, the stabilizers of the color code supported on qubits near the boundaries may transform into stabilizers supported on both shrunk lattices ${{\mathcal{L}}}_{A}$ and ${{\mathcal{L}}}_{B}$, depending on the colors of $\partial {\mathcal{L}}$. Unless there is no boundary of color C, we cannot transform the color code ${CC}({\mathcal{L}})$ into the toric code supported on two decoupled lattices, ${TC}({{\mathcal{L}}}_{A})\otimes {TC}({{\mathcal{L}}}_{B})$. Rather, the toric code is defined on a lattice ${{\mathcal{L}}}_{A}\#{{\mathcal{L}}}_{B}$ obtained by attaching6 ${{\mathcal{L}}}_{A}$ and ${{\mathcal{L}}}_{B}$, i.e. identifying some of their boundaries. Namely

Equation (44)

In the rest of this subsection we analyze the triangular color code (see figure 9), but the discussion is applicable to the color code on any homogeneous cell two-complex with boundary, which is three-colorable and three-valent.

Let us describe how to obtain the lattice ${{\mathcal{L}}}_{A}\#{{\mathcal{L}}}_{B}$ supporting the toric code. Recall that in the bulk, ${{\mathcal{L}}}_{A}$ and ${{\mathcal{L}}}_{B}$ are obtained from ${\mathcal{L}}$ by shrinking faces of color A and B. Let ${\partial }_{A}{\mathcal{L}}$, ${\partial }_{B}{\mathcal{L}}$ and ${\partial }_{C}{\mathcal{L}}$ be the boundaries of color A, B and C, respectively. We find that shrunk lattices ${{\mathcal{L}}}_{A}$ and ${{\mathcal{L}}}_{B}$ are decoupled along ${\partial }_{A}{\mathcal{L}}$ and ${\partial }_{B}{\mathcal{L}}$, but are identified along ${\partial }_{C}{\mathcal{L}}$. In particular

  • on the boundary ${\partial }_{A}{\mathcal{L}}$: the lattice ${{\mathcal{L}}}_{A}$ has open edges (rough boundary), whereas ${{\mathcal{L}}}_{B}$—no open edges (smooth boundary),
  • on the boundary ${\partial }_{B}{\mathcal{L}}$: the lattice ${{\mathcal{L}}}_{B}$ has open edges (rough boundary), whereas ${{\mathcal{L}}}_{A}$—no open edges (smooth boundary),
  • on the boundary ${\partial }_{C}{\mathcal{L}}$: since the disentangling unitary U does not affect the qubits placed on vertices belonging to ${\partial }_{C}{\mathcal{L}}$, both lattices ${{\mathcal{L}}}_{A}$ and ${{\mathcal{L}}}_{B}$ share these qubits.

See figures 9 and 10(a), (b) for examples of how smooth and rough boundaries arise in the disentangling procedure. Note that along ${\partial }_{C}{\mathcal{L}}$, the lattices ${{\mathcal{L}}}_{A}$ and ${{\mathcal{L}}}_{B}$ are identified. This implies that the electric excitation e on ${{\mathcal{L}}}_{A}$ can be transformed into the excitation e on ${{\mathcal{L}}}_{B}$ by going through the boundary ${\partial }_{C}{\mathcal{L}}$; similarly for the magnetic excitation m.

Figure 10.

Figure 10. Attaching two lattices: (a) ${{\mathcal{L}}}_{A}$ and (b) ${{\mathcal{L}}}_{B}$ by identifying qubits along the boundary ${\partial }_{C}{\mathcal{L}}$. (c) Unfolded toric code ${TC}({{\mathcal{L}}}_{A}\#{{\mathcal{L}}}_{B})$. Blue qubits belong to the lattice ${{\mathcal{L}}}_{A}$, whereas red qubits belong to the (flipped) lattice ${{\mathcal{L}}}_{B}$.

Standard image High-resolution image

We can visualize the lattice ${{\mathcal{L}}}_{A}\#{{\mathcal{L}}}_{B}$ by flipping horizontally ${{\mathcal{L}}}_{B}$ and attaching it to ${{\mathcal{L}}}_{A}$ (see figure 10(c)). Observe that starting from the color code ${CC}({\mathcal{L}})$ with three boundaries, performing the disentangling unitary $U={\displaystyle \otimes }_{f\in {\mathcal{C}}}{U}_{f}$ and unfolding the resulting lattice ${{\mathcal{L}}}_{A}\#{{\mathcal{L}}}_{B}$, one obtains a single copy of the toric code ${TC}({{\mathcal{L}}}_{A}\#{{\mathcal{L}}}_{B})$ with two smooth and two rough boundaries. We can summarize the discussion by the following theorem.

Theorem 3  (Unfolding). The (triangular) color code ${CC}({\mathcal{L}})$ on a two-dimensional lattice ${\mathcal{L}}$ with three boundaries, ${\partial }_{A}{\mathcal{L}}$, ${\partial }_{B}{\mathcal{L}}$ and ${\partial }_{C}{\mathcal{L}}$, is equivalent to one folded copy of the toric code ${TC}({{\mathcal{L}}}_{A}\#{{\mathcal{L}}}_{B})$ defined on a lattice ${{\mathcal{L}}}_{A}\#{{\mathcal{L}}}_{B}$ with two smooth and two rough boundaries. Moreover, ${{\mathcal{L}}}_{A}\#{{\mathcal{L}}}_{B}$ is constructed by attaching two lattices ${{\mathcal{L}}}_{A}$ and ${{\mathcal{L}}}_{B}$ (derived from ${\mathcal{L}}$ by shrinking faces of color A and B, respectively) along the boundary ${\partial }_{C}{\mathcal{L}}$.

3.3. Three (or more) dimensions

The toric code on a d-dimensional lattice with boundaries, $d\geqslant 3$, does not differ substantially from the two-dimensional model—qubits are placed on edges, and X- and Z-type stabilizer generators are associated with vertices and faces. There are two types of boundaries, rough and smooth, which may absorb point-like electric charges and $(d-1)$-dimensional magnetic fluxes, respectively. Moreover, string-like logical Z (respectively $(d-1)$-dimensional membrane-like logical X) operators can only start from and end on rough (respectively smooth) boundaries (see figure 14(b)).

Figure 14.

Figure 14. (a) The color code ${CC}({\mathcal{L}})$ on a three-dimensional cube-like lattice ${\mathcal{L}}$ with pairs of boundaries perpendicular to the direction $\hat{i}$ colored with Ci. (b) The toric code ${TC}({{\mathcal{L}}}_{3})$ on a cube-like lattice ${{\mathcal{L}}}_{3}$ derived from ${\mathcal{L}}$ by shrinking three-cells of color C3. Note that ${{\mathcal{L}}}_{3}$ has two rough boundaries (shaded) and ${TC}({{\mathcal{L}}}_{3})$ encodes one logical qubit with a string-like logical Z operator (red) connecting two opposite rough boundaries and a membrane-like logical X operator (blue).

Standard image High-resolution image

The color code can be defined on a $(d+1)$-valent and $(d+1)$-colorable d-dimensional lattice ${\mathcal{L}}$ with the boundaries $\partial {\mathcal{L}}={\bigsqcup}_{i=1}^{n}{\partial }_{i}{\mathcal{L}}$, where each (maximum) connected component ${\partial }_{i}{\mathcal{L}}$ has one out of $d+1$ colors, ${C}_{0},\ldots ,{C}_{d}$. We say that ${\partial }_{i}{\mathcal{L}}$ is of color Cj if all d-cells adjacent to ${\partial }_{i}{\mathcal{L}}$ have colors different from Cj. Qubits are placed on vertices, and X- and Z-type stabilizer generators are associated with d-cells and two-cells (faces), respectively. For the sake of clarity, in the rest of this subsection we focus on the three-dimensional color code ${CC}({\mathcal{L}})$ defined on a tetrahedron-like lattice ${\mathcal{L}}$ with four boundaries of color A, B, C and D (see figure 11(a)).

Figure 11.

Figure 11. (a) A tetrahedron-like lattice ${\mathcal{L}}$ with boundaries ${\partial }_{A}{\mathcal{L}}$, ${\partial }_{B}{\mathcal{L}}$, ${\partial }_{C}{\mathcal{L}}$ and ${\partial }_{D}{\mathcal{L}}$. Three shrunk lattices: (b) ${{\mathcal{L}}}_{A}$, (c) ${{\mathcal{L}}}_{B}$, (d) ${{\mathcal{L}}}_{C}$ derived from ${\mathcal{L}}$. The shaded boundary represents the attaching boundary ${\partial }_{D}{\mathcal{L}}$.

Standard image High-resolution image

We would like to analyze what happens to ${CC}({\mathcal{L}})$ if we apply the disentangling unitary $U={\displaystyle \otimes }_{c\in {\mathcal{D}}}{U}_{c}$ described in section 2.4. In the bulk, the disentangling unitary U transforms the stabilizers of the color code into stabilizers of the toric code supported on three decoupled lattices, ${{\mathcal{L}}}_{A}$, ${{\mathcal{L}}}_{B}$ and ${{\mathcal{L}}}_{C}$, obtained from ${\mathcal{L}}$ by shrinking volumes of color A, B and C, respectively. Since ${{\mathcal{L}}}_{A}$, ${{\mathcal{L}}}_{B}$ and ${{\mathcal{L}}}_{C}$ share qubits along the boundary ${\partial }_{D}{\mathcal{L}}$, we cannot transform the color code ${CC}({\mathcal{L}})$ into the toric code supported on three decoupled lattices, ${TC}({{\mathcal{L}}}_{A})\otimes {TC}({{\mathcal{L}}}_{B})\otimes {TC}({{\mathcal{L}}}_{C})$. Rather, the toric code is defined on a lattice ${{\mathcal{L}}}_{A}\#{{\mathcal{L}}}_{B}\#{{\mathcal{L}}}_{C}$ obtained by attaching three shrunk lattices along the boundary ${\partial }_{D}{\mathcal{L}}$. We then obtain

Equation (45)

where ${\mathcal{S}}$ is the stabilizer group of the ancilla qubits. Note that U does not transform qubits on vertices belonging to the boundary ${\partial }_{D}{\mathcal{L}}$.

Let us have a closer look at the shrunk lattices and the identified boundary. ${{\mathcal{L}}}_{i}$ has one rough boundary ${\partial }_{i}{\mathcal{L}}$, and two smooth boundaries ${\partial }_{j}{\mathcal{L}}$ and ${\partial }_{k}{\mathcal{L}}$, where $\{i,j,k\}=\{A,B,C\}$ (see figure 11). Recall that shrunk lattices share only qubits placed on vertices of the identified boundary ${\partial }_{D}{\mathcal{L}}$. To obtain ${{\mathcal{L}}}_{A}\#{{\mathcal{L}}}_{B}\#{{\mathcal{L}}}_{C}$ one attaches the shrunk lattices by identifying the qubits placed on vertices of ${\partial }_{D}{\mathcal{L}}$ (see figure 12). Note that a single-qubit Pauli Z operator on a qubit on the boundary ${\partial }_{D}{\mathcal{L}}$ causes three X-vertex stabilizers to be violated, i.e. one in each of three shrunk lattices. Put another way, such an operator creates a triple of electric charges, eA, eB and eC. This implies that the composite electric charge ${e}_{A}{e}_{B}{e}_{C}$ can condense on the boundary ${\partial }_{D}{\mathcal{L}}$. We focus on condensation of excitations on the boundaries in the next subsection.

Figure 12.

Figure 12. The identified boundary ${\partial }_{D}{\mathcal{L}}$ of three shrunk lattices: (a) ${{\mathcal{L}}}_{A}$, (b) ${{\mathcal{L}}}_{B}$ and (c) ${{\mathcal{L}}}_{C}$. The shrunk lattices are attached by identifying qubits on vertices of ${\partial }_{D}{\mathcal{L}}$.

Standard image High-resolution image

The discussion here can be straightforwardly generalized to d dimensions, yielding the equivalence between the color code and the toric code with boundaries. We conclude with the following theorem.

Theorem 4  (Attaching). Let ${CC}({\mathcal{L}})$ be the color code on a d-simplex-like lattice ${\mathcal{L}}$ with $d+1$ boundaries ${\partial }_{0}{\mathcal{L}},\ldots ,{\partial }_{d}{\mathcal{L}}$, where ${\partial }_{i}{\mathcal{L}}$ has color Ci. Then, there exists a local Clifford unitary $U={\displaystyle \otimes }_{c\in {{\mathcal{C}}}_{0}}{U}_{c}$ (described in section 2.4) such that

Equation (46)

where ${\mathcal{S}}$ is the stabilizer group of the ancilla qubits. The toric code ${TC}({\#}_{i=1}^{d}{{\mathcal{L}}}_{i})$ is defined on the lattice ${\#}_{i=1}^{d}{{\mathcal{L}}}_{i}$ obtained by attaching lattices ${{\mathcal{L}}}_{1},\ldots ,{{\mathcal{L}}}_{d}$ along the boundary ${\partial }_{0}{\mathcal{L}}$, where ${{\mathcal{L}}}_{i}$ is derived from ${\mathcal{L}}$ by shrinking d-cells of color Ci, and has one rough boundary, $\partial {{\mathcal{L}}}_{i}$.

Let us mention that the lattice ${\mathcal{L}}$ from the theorem 4 can be obtained from a certain tiling of a d-sphere (see [29] for details).

3.4. Condensation of anyonic excitations

It is instructive to interpret the equivalence between the color code and the toric code with boundaries from the viewpoint of condensation of anyonic excitations. In the two-dimensional toric code, the anyonic excitations are: electric e—a single violated X-vertex stabilizer, magnetic m—a single violated Z-face stabilizer, and fermionic $\epsilon =e\times m$—a composite excitation obtained by fusing e and m. The label 1 corresponds to the vacuum (no excitations).

The gapped boundaries of two-dimensional systems are classified by maximum sets of mutually bosonic excitations which may condense [21, 3841]. In the case of a single layer of the toric code, possible sets of anyons which may condense on the boundaries are $\{1,e\}$ and $\{1,m\}$. Note that epsilon has fermionic self-statistics and thus cannot condense on the gapped boundaries. The sets $\{1,e\}$ and $\{1,m\}$ correspond to rough and smooth boundaries, respectively [20]. On the other hand, the folded toric code has three boundaries (see figure 8(b)). If we denote by ei, mi and ${\epsilon }_{i}$ the excitations in the rear (i = 1) and front (i = 2) layer of the folded toric code, then we can associate the boundaries with the sets of condensing anyons. Namely

Equation (47)

Equation (48)

Equation (49)

As depicted in figure 13(a), two electric charges e1 and e2 created on boundaries ${\partial }_{A}{\mathcal{L}}$ and ${\partial }_{B}{\mathcal{L}}$ can be jointly annihilated (or created) on ${\partial }_{C}{\mathcal{L}}$.

Figure 13.

Figure 13. Condensation of electric charges in (a) two and (b) three dimensions. Observe that single electric charges can condense on all but one boundary, which is the identified boundary. On the identified boundary, a composite electric charge (a) ${e}_{1}{e}_{2}$ and (b) ${e}_{1}{e}_{2}{e}_{3}$ can be created or annihilated.

Standard image High-resolution image

By associating the boundaries with the sets of condensing anyons we can find the correspondence between anyonic excitations in the toric code and the color code. We can label excitations in the color code by iP, where $P\in \{X,Z\}$ indicates the type of the violated stabilizer, and $i\in \{A,B,C\}$ indicates the color of the face associated with the violated stabilizer. Observe that not all six excitations are independent. For instance, a single qubit Pauli X operator on a vertex v creates excitations, AZ, BZ and CZ, on three neighboring faces sharing v. This implies that in the bulk the following fusion channels exist

Equation (50)

Note that excitations iX and iZ can only condense on the boundary ${\partial }_{i}{\mathcal{L}}$. This leads to the following isomorphism between labels of anyonic excitations of the toric and color codes

Equation (51)

In $d\gt 2$ dimensions, the excitations of the color code are point-like electric charges and $(d-1)$-dimensional magnetic fluxes. Let us first focus on condensation of electric charges. We find that the boundaries of the d-dimensional color code on a d-simplex-like lattice are given by

Equation (52)

Equation (53)

(See figure 13 for two- and three-dimensional examples.) Yet, none of the magnetic fluxes can individually condense on the boundary ${\partial }_{0}{\mathcal{L}}$. Rather, any pair of fluxes can condense on ${\partial }_{0}{\mathcal{L}}$, and thus we might think of the fluxes as being equivalent. To sum up, we find the following condensations of $(d-1)$-dimensional magnetic fluxes:

Equation (54)

Equation (55)

One may observe that, as expected, the set of condensing magnetic and electric excitations on every boundary is mutually bosonic.

We would like to emphasize that while the gapped boundaries in $(2+1)$-dimensional TQFTs have been throughly classified [21, 22], the understanding of the gapped boundaries in higher-dimensional TQFTs is still incomplete. Characterization of condensing excitations in the color code may provide instructive examples helping with classification of the gapped boundaries in higher-dimensional TQFTs. Namely, different boundaries of various colors in the color code may lead to a rich variety of gapped boundaries in the corresponding toric code models. Moreover, logical action of the transversal ${\tilde{R}}_{n}$ operator (see equation (56)) on the code space crucially depends on the choice of boundaries in the color code. Thus, one may be able to characterize gapped boundaries by analyzing the logical action of transversal operators, and vice versa.

4. Transversal gates

We have seen that the color code is equivalent to (multiple copies of) the toric code, both in the presence or the absence of boundaries. Our findings hint that there might be non-trivial logical gates from the dth level of the Clifford hierarchy in the d-dimensional toric code which admit fault-tolerant implementation. In this section, we show that one can implement by local unitary transformations the logical d-qubit control-Z gate on the stack of d copies of the d-dimensional toric code with point-like excitations.

4.1. Transversal Rd operator and boundaries

Let us start with reviewing the transversal implementation of the physical phase gate ${R}_{n}=\mathrm{diag}(1,{{\rm{e}}}^{2\pi {\rm{i}}/{2}^{n}})$ in the color code [29, 42]. Consider the topological color code ${CC}({\mathcal{L}})$ on a d-dimensional lattice ${\mathcal{L}}$, which is $(d+1)$-valent and $(d+1)$-colorable. It is known that the graph $G=(V,E)$ of vertices and edges of ${\mathcal{L}}$ is bipartite, namely the set of vertices V can be split into two subsets, T and Tc, such that $V=T\bigsqcup {T}^{c}$ and vertices in T are connected only to vertices in Tc, and vice versa. Then, regardless of the lattice ${\mathcal{L}}$, the following unitary operator preserves the code space

Equation (56)

Here, we adopt a convention that $\tilde{{R}_{d}}$ denotes a transversal operator implemented by physical Rd gates or their powers. When the lattice ${\mathcal{L}}$ is d-simplex-like (see section 3.3 and figure 11), then $\tilde{{R}_{d}}$ implements the logical Rd gate in the code space. For other choices of boundaries, the action of $\tilde{{R}_{d}}$ in the code space does not necessarily coincide with the logical Rd gate.

For the sake of simplicity, in the rest of this section we shall consider the d-dimensional color code supported on a d-hypercube-like lattice ${\mathcal{L}}$ colored with ${C}_{0},\ldots ,{C}_{d}$ (see figures 14(a) and 15(a)). In particular, we choose ${\mathcal{L}}$ to have the opposite boundaries colored in the same color. Namely, we assume that two boundaries perpendicular to the direction $\hat{j}$ have color Cj, where j = 1,...,d. One can show that the color code ${CC}({\mathcal{L}})$ encodes d logical qubits. In order to do this, consider the disentangling unitary $U={\displaystyle \otimes }_{c\in {{\mathcal{C}}}_{0}}{U}_{c}$, which is a tensor product of local unitaries supported on d-cells of color C0 (see sections 2.4 and 3.3). Then, U transforms the color code ${CC}({\mathcal{L}})$ into d decoupled copies of the toric code

Equation (57)

where ${\mathcal{S}}$ is the stabilizer group of the ancilla qubits and the lattice ${{\mathcal{L}}}_{i}$ is derived from ${\mathcal{L}}$ by shrinking d-cells of color Ci. Moreover, ${{\mathcal{L}}}_{i}$ is a d-hypercube-like lattice with two rough boundaries which are perpendicular to the direction $\hat{i}$ and all the other boundaries smooth. Thus, for i = 1,...,d, the toric code ${TC}({{\mathcal{L}}}_{i})$ encodes one logical qubit, with a string-like logical Z operator in the direction $\hat{i}$, and a $(d-1)$-dimensional membrane-like logical X operator perpendicular to $\hat{i}$.

Figure 15.

Figure 15. (a) The topological color code ${CC}({\mathcal{L}})$ on a square-like lattice ${\mathcal{L}}$ with four boundaries of color C1 and C2 encodes two logical qubits, with logical operators $\bar{{X}^{(i)}}$ and $\bar{{Z}^{(i)}}$ for i = 1, 2. The toric code ${TC}({{\mathcal{L}}}_{i})$ (b) for i = 1 and (c) for i = 2 derived from ${\mathcal{L}}$ by shrinking faces of color Ci encodes one logical qubit with logical operators $\bar{{X}_{i}}$ and $\bar{{Z}_{i}}$.

Standard image High-resolution image

With the above choice of boundaries, $\tilde{{R}_{d}}$ does not implement the logical Rd gate in the code space. One verifies this by observing that ${\tilde{{R}_{d}}}^{2}=I$ in the code space of the color code. Rather, we find that $\tilde{{R}_{d}}$ implements the logical d-qubit control-Z gate on the stack of d copies of the toric code. (Note that a similar observation holds for the color code supported on a d-torus, i.e. a d-hypercube-like lattice with periodic boundary conditions.) We devote the rest of this section to describe this finding.

4.2. Transversal d-qubit control-Z gate in the toric code

We discuss the two-dimensional case first. The topological color code on a square-like lattice ${\mathcal{L}}$ with four boundaries of color C1 and C2 encodes two logical qubits (see figure 15(a)). We label by $\bar{{X}^{(i)}}$ and $\bar{{Z}^{(i)}}$ the logical Pauli X and Z operators, which are perpendicular or parallel to the direction $\hat{i}$, respectively, for i = 1, 2. Since a unitary operator R2 transforms Pauli X into Y and leaves Z unchanged, then the logical operators transform under the conjugation by $\tilde{{R}_{2}}$ as follows

Equation (58)

Note that since there is no boundary of color C0, then the disentangling unitary U (see equation (57)) transforms the color code ${CC}({\mathcal{L}})$ into two decoupled copies of the toric code, ${TC}({{\mathcal{L}}}_{1})$ and ${TC}({{\mathcal{L}}}_{2})$. The mapping defines an isomorphism between logical operators of the color code and the toric code (see figure 15). Namely

Equation (59)

where $\bar{{P}_{1}}\otimes \bar{{P}_{2}}$ denotes an operator which acts as a logical P1 operator on the first copy ${TC}({{\mathcal{L}}}_{1})$ of the toric code, and as P2 on the second copy ${TC}({{\mathcal{L}}}_{2})$. Thus, one can immediately deduce the effect of $U\tilde{{R}_{2}}{U}^{\dagger }$ on logical operators of ${TC}({{\mathcal{L}}}_{1})$ and ${TC}({{\mathcal{L}}}_{2})$

Equation (60)

This implies that the action of $\tilde{{R}_{2}}$ in the color code is equivalent (up to the local Clifford unitary U) to the logical control-Z gate between two copies of the toric code.

Let us consider d-dimensional case, $d\geqslant 2$. The d-qubit control-Z gate is a generalization of the control-Z gate and is defined in the computational basis as

Equation (61)

Note that the action of ${C}^{\otimes d-1}Z$ is invariant under permutation of qubits. Similar to the phase gate Rd, the d-qubit control-Z belongs to the dth level of the Clifford hierarchy7 but is outside the $(d-1)$ th level, which can be seen from the following relations

Equation (62)

Equation (63)

where $n\geqslant 2$ and the commutator is defined as ${\rm{K}}[A,B]={{ABA}}^{\dagger }{B}^{\dagger }$.

We label logical X and Z operators in the color code by $\bar{{X}^{(i)}}$ and $\bar{{Z}^{(i)}}$ for i = 1,...,d. Namely, $\bar{{Z}^{(i)}}$ is a string-like logical operator parallel to the direction $\hat{i}$ (i.e. connecting two opposite boundaries of color Ci) and $\bar{{X}^{(i)}}$ is a $(d-1)$-dimensional membrane-like logical operator perpendicular to the direction $\hat{i}$. We define the operator $\tilde{{R}_{i}}$ recursively for $i=d-1,\ldots ,1$ as follows

Equation (64)

Equation (65)

Equation (66)

Equation (67)

Note that the above relations hold for any permutation of colors ${C}_{1},\ldots ,{C}_{d}$. Let $\bar{{X}_{j}}$ and $\bar{{Z}_{j}}$ be logical X and Z operators in the toric code ${TC}({{\mathcal{L}}}_{j})$. Then, the following correspondence holds

Equation (68)

We can verify that using $\tilde{{R}_{d}}$ one can implement the logical d-qubit control-Z gate on the stack of d copies of the toric code. Namely,

Equation (69)

Equation (70)

Equation (71)

Equation (72)

In the above equations proportionality indicates the same action of the operators on the code space. Since the disentangling unitary U is a local unitary transformation, $U\tilde{{R}_{d}}{U}^{\dagger }$ is a local unitary transformation implementing the logical ${C}^{\otimes d-1}Z$ gate on the stack of d copies of the toric code. We summarize the discussion in this section by the following theorem.

Theorem 5  (Transversal implementation). Consider a $(d+1)$-colorable and $(d+1)$-valent d-hypercube-like lattice ${\mathcal{L}}$ with pairs of boundaries perpendicular to the direction $\hat{i}$ colored in Ci for i = 1,...,d. Let ${{\mathcal{L}}}_{i}$ be a lattice derived from ${\mathcal{L}}$ by shrinking all d-cells of color Ci. Then, the logical d-qubit control-Z gate can be implemented on ${TC}({{\mathcal{L}}}_{1}),\ldots ,{TC}({{\mathcal{L}}}_{d})$—the stack of d-copies of the toric code, by a local unitary transformation

Equation (73)

where $\tilde{{R}_{d}}$ is a transversal Rd gate (see equation (56)) implemented in the color code ${CC}({\mathcal{L}})$ and U is the disentangling unitary transforming ${CC}({\mathcal{L}})$ into ${\displaystyle \otimes }_{i=1}^{d}{TC}({{\mathcal{L}}}_{i})$.

Observe that the implementation of $\bar{{C}^{\otimes d-1}Z}$ seems to require a set of d lattices $\{{{\mathcal{L}}}_{i}\}$ which satisfy certain constraints, i.e. are derived from ${\mathcal{L}}$ described in the (transversal implementation) theorem 5. In general, it may not be clear whether there exists a local unitary transformation implementing $\bar{{C}^{\otimes d-1}Z}$ in d copies of the toric code. Yet, one can freely deform the lattices on which the toric code is supported by local operations. Specifically, consider the toric code ${TC}({\mathcal{L}})$ on a d-dimensional lattice ${\mathcal{L}}$. We claim that one can transform ${TC}({\mathcal{L}})$ into ${TC}({{\mathcal{L}}}^{\prime })$ by local unitary transformations (and adding or removing ancilla qubits), where ${\mathcal{L}}^{\prime} $ is a lattice derived from the original lattice ${\mathcal{L}}$ by adding or removing edges. Such local deformations of the lattices allow us to obtain d copies of the toric code with $\bar{{C}^{\otimes d-1}Z}$ implementable by local unitary transformations as long as the boundaries of d copies of the toric code are appropriately arranged. In particular, this implies that three copies of the three-dimensional toric code admit fault-tolerant implementation of a logical non-Clifford gate, which saturates the bound by Bravyi and König in three dimensions.

Acknowledgments

We would like to thank John Preskill, Olivier Landon-Cardinal and Dan Browne for helpful discussions. We acknowledge funding provided by the Institute for Quantum Information and Matter, an NSF Physics Frontiers Center (NFS Grant PHY-1125565) with support of the Gordon and Betty Moore Foundation (GBMF-12500028). BY is supported by the David and Ellen Lee Postdoctoral fellowship.

Appendix

Here, we briefly revisit the equivalence of the color code and (multiple decoupled copies of) the toric code in d dimensions without the restriction of point-like excitations. In particular, we focus on the construction of lattices supporting the decoupled copies of the toric code, which can be succinctly described using some notions from algebraic topology. The discussion in the appendix is presented in the language of the dual lattice unless mention otherwise.

A.1. Basic definitions of combinatorial geometry

We start with some basic notions in combinatorial geometry. A d-simplex δ is a convex hull of $d+1$ affinely independent vertices ${v}_{0},{v}_{1},\ldots ,{v}_{d}$, namely

Equation (74)

There is a combinatorial definition of a simplex, which we adopt for the rest of the discussion. Namely, a d-simplex δ is the power set of the set of vertices $V=\{{v}_{0},\ldots ,{v}_{d}\}$ spanning it, $\delta ={\mathcal{P}}(V)$. A subset $W\subset V$ of size $k+1\leqslant d+1$ spans a k-simplex $\sigma ={\mathcal{P}}(W)$, and we call σ a k-face of δ. We denote the set of all k-faces of δ by ${\Delta }_{k}(\delta )$. Note that ${\Delta }_{k}(\delta )={{\mathcal{P}}}_{k+1}(V)$, where ${{\mathcal{P}}}_{k}(V)$ denotes the collection of subsets of V of cardinality k.

Let $V={\bigsqcup}_{i=1}^{k}{W}_{i}$ be a decomposition of the set of vertices V into the union of k disjoint sets ${W}_{1},\ldots ,{W}_{k}$. Let $\delta ={\mathcal{P}}(V)$ and ${\sigma }_{i}={\mathcal{P}}({W}_{i})$. Then, we can represent δ as a Cartesian product of its faces ${\sigma }_{1},\ldots ,{\sigma }_{k}$, namely

Equation (75)

We say that ${\mathcal{L}}$ is a simplicial d-complex if it is a set of simplices satisfying the following conditions

  • every face of a simplex in ${\mathcal{L}}$ is also in ${\mathcal{L}}$,
  • the intersection of two simplices in ${\mathcal{L}}$ is a face of both of them,
  • the dimension of the largest simplex in ${\mathcal{L}}$ is d.

If in addition

  • for every $k\lt d$, every k-simplex in ${\mathcal{L}}$ is a face of a d-simplex in ${\mathcal{L}}$,

then ${\mathcal{L}}$ is homogeneous. By ${\Delta }_{k}({\mathcal{L}})$ we denote the set of all k-simplices belonging to ${\mathcal{L}}$. An n-skeleton of ${\mathcal{L}}$, denoted by ${\mathrm{skel}}_{n}({\mathcal{L}})$, is a collection of all k-faces of ${\mathcal{L}}$ for all $k\leqslant n$, namely ${\mathrm{skel}}_{n}({\mathcal{L}})={\bigsqcup}_{k=0}^{n}{\Delta }_{k}({\mathcal{L}})$.

We might generalize the notion of a simplex to a cell. Namely, a (closed) d-cell δ is the image of a d-dimensional (closed) ball Bd under an attaching map. Similarly to the combinatorial definition of a simplex, we want to think about δ as a collection of all its k-faces, for all $k=0,1,\ldots ,d$. We can define a cell complex8 in an analogous way to a simplicial complex, allowing for the faces to be cells.

From now on, we only consider complexes containing finitely many simplices (cells). Although a homogeneous simplicial (cell) d-complex ${\mathcal{L}}$ is defined as a collection of simplices (cells), by the same symbol we also denote the union of these simplices (cells) as a topological space. In general, ${\mathcal{L}}$ is a manifold with a boundary embedded in real space, but for the rest of the discussion we assume ${\mathcal{L}}$ has no boundary. We also assume ${\mathcal{L}}$ is a homogeneous simplicial d-complex unless stated otherwise.

The n-star of $\delta \in {\Delta }_{k}({\mathcal{L}})$, denoted by ${\mathrm{St}}_{n}(\delta )$, is the set of all n-simplices in ${\mathcal{L}}$ which contain δ as a face, namely

Equation (76)

Note that $\sigma \in {\mathrm{St}}_{n}(\delta )\ \Longleftrightarrow \ \delta \in {\Delta }_{k}(\sigma )$.

The n-link of $\delta \in {\Delta }_{k}({\mathcal{L}})$, denoted by ${\mathrm{Lk}}_{n}(\delta )$, is the set of all n-simplices in ${\mathcal{L}}$ which are the n-faces of d-simplices containing δ, but do not intersect with δ, namely

Equation (77)

Observe that for a k-simplex δ in ${\mathcal{L}}$ there is a one-to-one mapping between the elements of ${\mathrm{Lk}}_{d-k-1}(\delta )$ and ${\mathrm{St}}_{d}(\delta )$, namely

Equation (78)

We say that ${\mathcal{L}}$ is $(d+1)$-colorable if there exists a function

Equation (79)

where ${{\mathbb{Z}}}_{d+1}=\{0,1,\ldots ,d\}$ is the set of $d+1$ colors, and two vertices connected by an edge have different colors. We define $\mathrm{color}(\delta )$ to be the set of colors assigned to vertices of a simplex δ, namely

Equation (80)

Now, we are ready to define the color code and the toric code in d dimensions. The color code is a stabilizer code with the stabilizer group ${{CC}}_{k}({\mathcal{L}})$ defined on a $(d+1)$-colorable homogeneous simplicial d-complex ${\mathcal{L}}$, where $k\in \{0,\ldots ,d-2\}$. One qubit is placed at each and every d-simplex in ${\mathcal{L}}$, and X- and Z-type stabilizer generators are associated with $(d-k-2)$- and k-simplices as follows

Equation (81)

Equation (82)

where $X(\sigma )$ is the Pauli X operator on a qubit placed at ${\sigma }\in {\Delta }_{d}({\mathcal{L}})$; similarly $Z(\sigma )$.

The toric code is a stabilizer code with the stabilizer group ${{TC}}_{k}({\mathcal{L}})$ defined on a homogeneous cell d-complex ${\mathcal{L}}$, where $k\in \{1,\ldots ,d-1\}$. One qubit is placed at each and every k-cell in ${\mathcal{L}}$, and X- and Z-type stabilizer generators are associated with $(k+1)$- and $(k-1)$-cells in the following way

Equation (83)

Equation (84)

A.2. Equivalence revisited

Let us revisit the (equivalence) theorem 2. Note that for the sake of simplicity we assumed earlier that the color code on a d-dimensional lattice ${\mathcal{L}}$ has point-like excitations, which corresponds to the ${{CC}}_{d-2}({\mathcal{L}})$ case. Now we state the equivalence between the color code and the toric code in full generality in the following theorem.

Theorem 6. Let the topological color code ${{CC}}_{k}({\mathcal{L}})$ be defined on a $(d+1)$-colorable homogeneous simplicial d-complex ${\mathcal{L}}$ without boundary, where $0\leqslant k\leqslant d-2$. Then, there exists a local Clifford unitary U such that

Equation (85)

where ${{\mathcal{S}}}_{1}$ and ${{\mathcal{S}}}_{2}$ represent the stabilizer groups of decoupled ancilla qubits, and ${{TC}}_{k+1}({{\mathcal{L}}}_{N})$ is a copy of the toric code defined on a homogeneous cell $(k+2)$-complex ${{\mathcal{L}}}_{N}$ obtained from ${\mathcal{L}}$ by removing all simplices with faces of colors in N. Moreover, one can choose the disentangling unitary U to be of the form

Equation (86)

where $U(\delta )$ is a Clifford unitary acting only on qubits placed on d-simplices in ${\mathrm{St}}_{d}(\delta )$, and some ancilla qubits associated with δ.

Note that after the disentangling one obtains $\displaystyle \left(\genfrac{}{}{0em}{}{d}{d-1-k}\right)=\displaystyle \left(\genfrac{}{}{0em}{}{d}{k+1}\right)$ decoupled copies of the toric code, enumerated by different choices of the subset N of $d-1-k$ colors from ${{\mathbb{Z}}}_{d}$. Moreover, one might need to locally add ancilla qubits either to the color code, or the toric code depending on the simplicial d-complex ${\mathcal{L}}$. Clearly, the (equivalence) theorem 2 is a special case of the theorem 6, with $k=d-2$, ${{\mathcal{S}}}_{2}=\varnothing $ and ${C}_{0}=d$. The rest of the appendix is devoted to the construction of the cell complexes supporting decoupled copies of the toric code and the explanation of how to find a local Clifford unitary U.

To obtain ${{\mathcal{L}}}_{N}$ from ${\mathcal{L}}$, where $N\in {{\mathcal{P}}}_{d-1-k}({{\mathbb{Z}}}_{d})$, one follows the following procedure.

  • (1)  
    Take the $(k+1)$-skeleton ${\mathrm{skel}}_{k+1}({\mathcal{L}})$ of ${\mathcal{L}}$ and construct a new $(k+1)$-skeleton, ${\mathrm{skel}}_{k+1}^{\prime }({\mathcal{L}})$, by removing from ${\mathrm{skel}}_{k+1}({\mathcal{L}})$ all simplices with faces of colors in N, namely
    Equation (87)
  • (2)  
    For every $\tau \in {\Delta }_{d-2-k}({\mathcal{L}})$, such that $\mathrm{color}(\tau )=N$, attach a $(k+2)$-cell to ${\mathrm{Lk}}_{k+1}(\tau )\subset {\mathrm{skel}}_{k+1}^{\prime }({\mathcal{L}})$. Resulting $(k+2)$-skeleton is ${{\mathcal{L}}}_{N}$.

Note that in Step 2 we used a fact that ${\mathrm{Lk}}_{k+1}(\tau )$ is homeomorphic to a $(k+1)$-sphere, and thus we can attach a $(k+2)$-ball to ${\mathrm{Lk}}_{k+1}(\tau )$ (see [30] for a proof and an illustrative discussion on combinatorial manifolds).

The disentangling unitary U in equation (86) has a tensor product structure. Thus, let us have a closer look at one of its constituents, $U(\delta )$, where δ is a 0-simplex in ${\mathcal{L}}$ of color $\{d\}$. Let $U(\delta )$ to be a Clifford unitary transforming the Hilbert space of color code qubits placed on d-simplices in ${\mathrm{St}}_{d}(\delta )$ and $A=| {\mathrm{St}}_{k+1}(\delta )| -| {\mathrm{St}}_{d}(\delta )| $ ancilla qubits9 , ${\mathcal{H}}({\mathrm{St}}_{d}(\delta ))\otimes {{\mathcal{H}}}_{\mathrm{ancilla}}$, into the Hilbert space ${\mathcal{H}}({\mathrm{St}}_{k+1}(\delta ))$ of toric code qubits placed on $(k+1)$-simplices in ${\mathrm{St}}_{k+1}(\delta )$. Let ${{\mathcal{O}}}_{\delta }:= {{\mathcal{O}}}_{{\mathrm{St}}_{d}(\delta )}$ be the overlap group of the color code ${{CC}}_{k}({\mathcal{L}})$ on the set of qubits ${\mathrm{St}}_{d}(\delta )$, and ${{\mathcal{S}}}_{\delta }$ be the stabilizer group generated by single-qubit Pauli Z operators on the ancilla qubits, namely

Equation (88)

Equation (89)

Let ${{\mathcal{O}}}_{\delta }^{{TC}}$ be a group of operators acting on qubits placed on $(k+1)$-simplices in ${\mathrm{St}}_{k+1}(\delta )$ defined as follows

Equation (90)

We require that $U(\delta )$ maps the generators of ${{\mathcal{O}}}_{\delta }\otimes {{\mathcal{S}}}_{\delta }$ into the generators of ${{\mathcal{O}}}_{\delta }^{{TC}}$ according to the following rules

Equation (91)

Equation (92)

Equation (93)

where the parenthesis indicate that the mapping holds up to multiplication by elements of the center $Z({{\mathcal{O}}}_{\delta }\otimes {{\mathcal{S}}}_{\delta })$ and we choose $\{{h}_{i},{h}_{i}^{\prime },{h}_{i}^{\prime\prime }\}$ to be independent. Note that we had to add $A=| {\mathrm{St}}_{k+1}(\delta )| -| {\mathrm{St}}_{d}(\delta )| $ ancilla qubits to guarantee that ${{\mathcal{O}}}_{\delta }\otimes {{\mathcal{S}}}_{\delta },{{\mathcal{O}}}_{\delta }^{{TC}}\in \mathrm{Pauli}(n=| {\mathrm{St}}_{k+1}(\delta )| )$. One can check that $\{{g}_{i},{g}_{i}^{\prime },{g}_{i}^{\prime\prime }\}$ and $\{{h}_{i},{h}_{i}^{\prime },{h}_{i}^{\prime\prime }\}$ have the same commutation relations. The existence of the unitary $U(\delta )$ follows from the (Clifford transformation) lemma 2, given ${{\mathcal{O}}}_{\delta }\otimes {{\mathcal{S}}}_{\delta }$ and ${{\mathcal{O}}}_{\delta }^{{TC}}$ are isomorphic. We will show this fact invoking the (isomorphic groups) lemma 1.

We want to verify that $G({{\mathcal{O}}}_{\delta }\otimes {{\mathcal{S}}}_{\delta })=G({{\mathcal{O}}}_{\delta }^{{TC}})$ and $G(Z({{\mathcal{O}}}_{\delta }\otimes {{\mathcal{S}}}_{\delta }))=G(Z({{\mathcal{O}}}_{\delta }^{{TC}}))$. First note that the elements of the center $Z({{\mathcal{O}}}_{\delta }^{{TC}})$ are generated by only Z-type operators which are derived from k-simplices in ${\mathrm{St}}_{k}(\delta )$, namely

Equation (94)

Since for any $\sigma \in {\mathrm{St}}_{k}(\delta )$ we can choose ${n}_{1}\in {{\mathbb{Z}}}_{d}\setminus \mathrm{color}(\sigma )$ in $\displaystyle \left(\genfrac{}{}{0em}{}{d-k}{1}\right)$ ways, then there are $\displaystyle \left(\genfrac{}{}{0em}{}{d-k}{1}\right)| {\mathrm{St}}_{k}(\delta )| $ generators of $Z({{\mathcal{O}}}_{\delta }^{{TC}})$. Note that not all of them are independent. Rather, they have to satisfy certain relations, which we call ${{\mathcal{R}}}_{1}$, namely

Equation (95)

Equation (96)

Since for any ${\rho }_{1}\in {\mathrm{St}}_{k-1}(\delta )$ we can choose $\{{n}_{1},{n}_{2}\}\subset {{\mathbb{Z}}}_{d}\setminus \mathrm{color}({\rho }_{1})$ in $\displaystyle \left(\genfrac{}{}{0em}{}{d-k+1}{2}\right)$ ways, then there are $\displaystyle \left(\genfrac{}{}{0em}{}{d-k+1}{2}\right)| {\mathrm{St}}_{k-1}(\delta )| $ relations ${{\mathcal{R}}}_{1}$. Note that not all relations ${{\mathcal{R}}}_{1}$ are independent. They have to satisfy $\displaystyle \left(\genfrac{}{}{0em}{}{d-k+2}{3}\right)| {\mathrm{St}}_{k-2}(\delta )| $ relations ${{\mathcal{R}}}_{2}$ obtained for any choice of ${\rho }_{2}\in {\mathrm{St}}_{k-2}(\delta )$ and $\{{n}_{1},{n}_{2},{n}_{3}\}\subset {{\mathbb{Z}}}_{d}\setminus \mathrm{color}({\rho }_{2})$. But relations ${{\mathcal{R}}}_{2}$ are not independent, and so on. Proper counting of independent relations between generators of $Z({{\mathcal{O}}}_{\delta }^{{TC}})$ gives the following alternating sum $| {{\mathcal{R}}}_{1}| -| {{\mathcal{R}}}_{2}| +| {{\mathcal{R}}}_{3}| -\ldots +{(-1)}^{k-1}| {{\mathcal{R}}}_{k}| $. Once the constraints have been properly accounted for, since $G(Z({{\mathcal{O}}}_{\delta }^{{TC}}))$ is equal to the number of generators minus the number of independent relations between them, then we obtain

Equation (97)

Using the fact that the toric code on an n-sphere does not encode logical qubits, we obtain that the number of independent X-type generators of ${{\mathcal{O}}}_{\delta }^{{TC}}$ is equal to $| {\mathrm{St}}_{k+1}(\delta )| -G(Z({{\mathcal{O}}}_{\delta }^{{TC}}))$. Thus, including $| {\mathrm{St}}_{k+1}(\delta )| $ independent Z-type generators

Equation (98)

To analyze the number of independent generators of ${{\mathcal{O}}}_{\delta }\otimes {{\mathcal{S}}}_{\delta }$ and its center $Z({{\mathcal{O}}}_{\delta }\otimes {{\mathcal{S}}}_{\delta })$, we use results from the appendix D in [32]. First, let us rephrase our problem in the language of the primal lattice. Note that a 0-simplex δ corresponds to a d-cell c, qubits are placed on vertices of c, and X- and Z-type stabilizers are supported on qubits on vertices of $(k+2)$- and $(d-k)$-faces of c. Let $\partial c$ be the boundary of c, which can be thought of as a d-colorable and d-valent homogeneous cell $(d-1)$-complex. Let us denote by Ci the number of i-faces of c, where i = 0,...,d. Clearly, ${C}_{i}=| {\mathrm{St}}_{d-i}(\delta )| $. The overlap group of the color code on the qubits of c is thus generated by X- and Z-type operators on $(k+1)$- and $(d-k-1)$-faces of c. Note that $(k+1)$- and $(d-k-1)$-faces of c can be thought of as faces of $\partial c$, and thus the number of independent generators of ${{\mathcal{O}}}_{\delta }\otimes {{\mathcal{S}}}_{\delta }$ is

Equation (99)

where we included $A={C}_{d-k-1}-{C}_{0}$ single-qubit Pauli Z operators on the ancilla qubits. By $I(d-1,i)$ we denote the number of independent relations between operators on i-cells of $\partial c$. In particular (see equation (D14) in [32]),

Equation (100)

Equation (101)

where hi is the ith Betti number of $\partial c$. Since $\partial c$ is homeomorphic to a $(d-1)$-sphere, then hi = 1 if $i=0,d-1$; otherwise hi = 0. The center $Z({{\mathcal{O}}}_{\delta }\otimes {{\mathcal{S}}}_{\delta })$ is generated by X- and Z-type operators on $(k+2)$- and $(d-k)$-faces of c, and single-qubit Pauli Z operators on ancilla qubits. Thus10

Equation (102)

We can express equations (97) and (98) is terms of Ci's, namely

Equation (103)

Equation (104)

Equation (105)

There are many relations between the number of i-cells of $\partial c$, which is a d-colorable and d-valent homogeneous cell $(d-1)$-complex homeomorphic to a $(d-1)$-sphere. In particular, the following identities hold

Equation (106)

for any $s=0,\ldots ,d-1$, where $\chi =1+{(-1)}^{d-1}$ (see equation (D16) in [32]). One can straightforwardly verify that $G({\mathcal{O}}{}_{\delta }\otimes {\mathcal{S}}{}_{\delta })-G({\mathcal{O}}{}_{\delta }^{{TC}})=0$ and $G(Z({\mathcal{O}}{}_{\delta }\otimes {\mathcal{S}}{}_{\delta }))-G(Z({\mathcal{O}}{}_{\delta }^{{TC}}))=0$, since they are obtained from equation (106) by setting s = k and $s=k+1$, respectively. This finishes the proof that ${{\mathcal{O}}}_{\delta }\otimes {{\mathcal{S}}}_{\delta }$ and ${{\mathcal{O}}}_{\delta }^{{TC}}$ are isomorphic.

Footnotes

  • Note that due to the valence condition, this coloring is unique up to permutation of colors for any connected component of the lattice ${\mathcal{L}}$.

  • Note that since the number of vertices of f is equal to the number of edges of f, then ${{\mathcal{H}}}_{V}\simeq {{\mathcal{H}}}_{E}\simeq {({{\mathbb{C}}}^{2})}^{\otimes 2n}$. Moreover, to perform such a transformation, one does not need any ancilla qubits.

  • Up to multiplication by X-face stabilizers on certain neighboring faces of color C.

  • Up to multiplication by elements of the center $Z({{\mathcal{O}}}_{c}\otimes {{\mathcal{S}}}_{c})$ for any neighboring volume c of color D.

  • We can think of ${\mathcal{L}}$ as a tiling of a two-manifold ${\mathcal{M}}$ with boundary, and then the Euler characteristic is $\chi =2-2g-b$, where g is the genus of ${\mathcal{M}}$ and b is the number of connected components of $\partial {\mathcal{M}}$.

  • We would like to point out similarities between the attaching procedure we describe and welding defined in [37].

  • The Clifford hierarchy is defined recursively: ${{\mathcal{P}}}_{1}$ is the Pauli group and ${{\mathcal{P}}}_{j}=\{\mathrm{unitary}\ U| {{UPU}}^{\dagger }\in {{\mathcal{P}}}_{j-1}\forall P\in {{\mathcal{P}}}_{1}\}$ for $j\gt 1$.

  • For a rigorous definition of a CW complex, see [31].

  • If $A\lt 0$, then $U(\delta )$ is a map between ${\mathcal{H}}({\mathrm{St}}_{d}(\delta ))$ and ${\mathcal{H}}({\mathrm{St}}_{k+1}(\delta ))\otimes {{\mathcal{H}}}_{\mathrm{ancilla}}$.

  • 10 

    If $k=0,d-2$, then we set $I(d-1,d)=0$.

Please wait… references are loading.