arXiv subjects

H. Bombin

Publications and source records attributed to H. Bombin.

33 records · Page 2Linked to original sources

arXiv2009

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.

cond-mat.str-el↗

arXiv2009

Error Threshold for Color Codes and Random 3-Body Ising Models

We study the error threshold of color codes, a class of topological quantum codes that allow a direct implementation of quantum Clifford gates suitable for entanglement distillation, teleportation and fault-tolerant quantum computation. We map the error-correction process onto a statistical mechanical random 3-body Ising model and study its phase diagram via Monte Carlo simulations. The obtained error threshold of p_c = 0.109(2) is very close to that of Kitaev's toric code, showing that enhanced computational capabilities does not necessarily imply lower resistance to noise.

cond-mat.dis-nn↗

arXiv2009

Quantum 2-Body Hamiltonian for Topological Color Codes

We introduce a two-body quantum Hamiltonian model with spins-$\half$ located on the vertices of a 2D spatial lattice. The model exhibits an exact topological degeneracy in all coupling regimes. This is a remarkable non-perturbative effect. The model has a $\Z_2\times \Z_2$ gauge group symmetry and string-net integrals of motion. There exists a gapped phase in which the low-energy sector reproduces an effective topological color code model. High energy excitations fall into three families of anyonic fermions that turn out to be strongly interacting. All these, and more, are new features not present in honeycomb lattice models like Kitaev model.

quant-ph↗

arXiv2009

Quantum Measurements and Gates by Code Deformation

The usual scenario in fault tolerant quantum computation involves certain amount of qubits encoded in each code block, transversal operations between them and destructive measurements of ancillary code blocks. We introduce a new approach in which a single code layer is used for the entire computation, in particular a surface code. Qubits can be created, manipulated and non-destructively measured by code deformations that amount to `cut and paste' operations in the surface. All the interactions between qubits remain purely local in a two-dimensional setting.

quant-ph↗

arXiv2008

An Interferometry-Free Protocol for Demonstrating Topological Order

We propose a protocol to demonstrate the topological order of a spin-1/2 lattice model with four-body interactions. Unlike other proposals, it does not rely on the controlled movement of quasiparticles, thus eliminating the addressing, decoherence and dynamical phase problems related to them. Rather, the protocol profits from the degeneracy of the ground state. It involves the addition of Zeeman terms to the original Hamiltonian that are used to create holes and move them around in the system.

cond-mat.str-el↗

arXiv2008

A Family of Non-Abelian Kitaev Models on a Lattice: Topological Confinement and Condensation

We study a family of non-Abelian topological models in a lattice that arise by modifying the Kitaev model through the introduction of single-qudit terms. The effect of these terms amounts to a reduction of the discrete gauge symmetry with respect to the original systems, which corresponds to a generalized mechanism of explicit symmetry breaking. The topological order is either partially lost or completely destroyed throughout the various models. The new systems display condensation and confinement of the topological charges present in the standard non-Abelian Kitaev models, which we study in terms of ribbon operator algebras.

cond-mat.str-el↗

arXiv2008

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.

cond-mat.str-el↗

arXiv2007

Statistical Mechanical Models and Topological Color Codes

We find that the overlapping of a topological quantum color code state, representing a quantum memory, with a factorized state of qubits can be written as the partition function of a 3-body classical Ising model on triangular or Union Jack lattices. This mapping allows us to test that different computational capabilities of color codes correspond to qualitatively different universality classes of their associated classical spin models. By generalizing these statistical mechanical models for arbitrary inhomogeneous and complex couplings, it is possible to study a measurement-based quantum computation with a color code state and we find that their classical simulatability remains an open problem. We complement the meaurement-based computation with the construction of a cluster state that yields the topological color code and this also gives the possibility to represent statistical models with external magnetic fields.

quant-ph↗

arXiv2007

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.

quant-ph↗

arXiv2007

Topological Quantum Distillation

We construct a class of topological quantum codes to perform quantum entanglement distillation. These codes implement the whole Clifford group of unitary operations in a fully topological manner and without selective addressing of qubits. This allows us to extend their application also to quantum teleportation, dense coding and computation with magic states.

quant-ph↗

arXiv2007

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.

quant-ph↗

arXiv2006

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.

cond-mat.str-el↗

arXiv2006

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.

quant-ph↗

arXiv2006

Homological Error Correction: Classical and Quantum Codes

We prove several theorems characterizing the existence of homological error correction codes both classically and quantumly. Not every classical code is homological, but we find a family of classical homological codes saturating the Hamming bound. In the quantum case, we show that for non-orientable surfaces it is impossible to construct homological codes based on qudits of dimension $D>2$, while for orientable surfaces with boundaries it is possible to construct them for arbitrary dimension $D$. We give a method to obtain planar homological codes based on the construction of quantum codes on compact surfaces without boundaries. We show how the original Shor's 9-qubit code can be visualized as a homological quantum code. We study the problem of constructing quantum codes with optimal encoding rate. In the particular case of toric codes we construct an optimal family and give an explicit proof of its optimality. For homological quantum codes on surfaces of arbitrary genus we also construct a family of codes asymptotically attaining the maximum possible encoding rate. We provide the tools of homology group theory for graphs embedded on surfaces in a self-contained manner.

quant-ph↗

arXiv2005

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.

quant-ph↗