Optimal Resources for Topological 2D Stabilizer Codes: Comparative Study

We study the resources needed to construct topological 2D stabilizer codes as a way to estimate in part their efficiency and this leads us to perform a comparative study of surface codes and color codes. This study clarifies the similarities and differences between these two types of stabilizer codes. We compute the error correcting rate $C:=n/d^2$ for surface codes $C_s$ and color codes $C_c$ in several instances. On the torus, typical values are $C_s=2$ and $C_c=3/2$, but we find that the optimal values are $C_s=1$ and $C_c=9/8$. For planar codes, a typical value is $C_s=2$, while we find that the optimal values are $C_s=1$ and $C_c=3/4$. In general, a color code encodes twice as much logical qubits as a surface code does.Comment: revtex, 6 pages, 7 figure

Topological Computation without Braiding

We show that universal quantum computation can be performed within the ground state of a topologically ordered quantum system, which is a naturally protected quantum memory. In particular, we show how this can be achieved using brane-net condensates in 3-colexes. The universal set of gates is implemented without selective addressing of physical qubits and, being fully topologically protected, it does not rely on quasiparticle excitations or their braiding.Comment: revtex4, 4 pages, 4 figure

Interacting Anyonic Fermions in a Two-Body Color Code Model

We introduce a two-body quantum Hamiltonian model of spin-1/2 on a 2D spatial lattice with exact topological degeneracy in all coupling regimes. There exists a gapped phase in which the low-energy sector reproduces an effective color code model. High energy excitations fall into three families of anyonic fermions that turn out to be strongly interacting. The model exhibits a Z_2xZ_2 gauge group symmetry and string-net integrals of motion, which are related to the existence of topological charges that are invisible to moving high-energy fermions.Comment: RevTeX 4, 2 figures, longer versio

Entanglement Distillation Protocols and Number Theory

We show that the analysis of entanglement distillation protocols for qudits of arbitrary dimension $D$ benefits from applying basic concepts from number theory, since the set \zdn associated to Bell diagonal states is a module rather than a vector space. We find that a partition of \zdn into divisor classes characterizes the invariant properties of mixed Bell diagonal states under local permutations. We construct a very general class of recursion protocols by means of unitary operations implementing these local permutations. We study these distillation protocols depending on whether we use twirling operations in the intermediate steps or not, and we study them both analitically and numerically with Monte Carlo methods. In the absence of twirling operations, we construct extensions of the quantum privacy algorithms valid for secure communications with qudits of any dimension $D$. When $D$ is a prime number, we show that distillation protocols are optimal both qualitatively and quantitatively.Comment: REVTEX4 file, 7 color figures, 2 table

Nested Topological Order

We introduce the concept of nested topological order in a class of exact quantum lattice Hamiltonian models with non-abelian discrete gauge symmetry. The topological order present in the models can be partially destroyed by introducing a gauge symmetry reduction mechanism. When symmetry is reduced in several islands only, this imposes boundary conditions to the rest of the system giving rise to topological ground state degeneracy. This degeneracy is related to the existence of topological fluxes in between islands or, alternatively, hidden charges at islands. Additionally, island deformations give rise to an extension of topological quantum computation beyond quasiparticles.Comment: revtex4, 4 page

Topological Quantum Error Correction with Optimal Encoding Rate

We prove the existence of topological quantum error correcting codes with encoding rates $k/n$ asymptotically approaching the maximum possible value. Explicit constructions of these topological codes are presented using surfaces of arbitrary genus. We find a class of regular toric codes that are optimal. For physical implementations, we present planar topological codes.Comment: REVTEX4 file, 5 figure

Topological color codes on Union Jack lattices: A stable implementation of the whole Clifford group

We study the error threshold of topological color codes on Union Jack lattices that allow for the full implementation of the whole Clifford group of quantum gates. After mapping the error-correction process onto a statistical mechanical random 3-body Ising model on a Union Jack lattice, we compute its phase diagram in the temperature-disorder plane using Monte Carlo simulations. Surprisingly, topological color codes on Union Jack lattices have similar error stability than color codes on triangular lattices, as well as the Kitaev toric code. The enhanced computational capabilities of the topological color codes on Union Jack lattices with respect to triangular lattices and the toric code demonstrate the inherent robustness of this implementation.Comment: 8 pages, 4 figures, 1 tabl

Exact Topological Quantum Order in D=3 and Beyond: Branyons and Brane-Net Condensates

We construct an exactly solvable Hamiltonian acting on a 3-dimensional lattice of spin-$\frac 1 2$ systems that exhibits topological quantum order. The ground state is a string-net and a membrane-net condensate. Excitations appear in the form of quasiparticles and fluxes, as the boundaries of strings and membranes, respectively. The degeneracy of the ground state depends upon the homology of the 3-manifold. We generalize the system to $D\geq 4$, were different topological phases may occur. The whole construction is based on certain special complexes that we call colexes.Comment: Revtex4 file, color figures, minor correction