Pith. sign in

REVIEW

Self-correcting quantum memory with a boundary

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1206.0991 v3 pith:4S34HZFK submitted 2012-06-05 quant-ph cond-mat.mes-hall

Self-correcting quantum memory with a boundary

classification quant-ph cond-mat.mes-hall
keywords boundaryconditionshamiltonianquantumanyonsboundariescodeeffective
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

We study the two-dimensional toric code Hamiltonian with effective long-range interactions between its anyonic excitations induced by coupling the toric code to external fields. It has been shown that such interactions allow to increase the lifetime of the stored quantum information arbitrarily by making $L$, the linear size of the memory, larger [Phys. Rev. A 82 022305 (2010)]. We show that for these systems the choice of boundary conditions (open boundaries as opposed to periodic boundary conditions) is not a mere technicality; the influence of anyons produced at the boundaries becomes in fact dominant for large enough $L$. This influence can be both beneficial or detrimental. In particular, we study an effective Hamiltonian proposed in [Phys. Rev. B 83 115415 (2011)] that describes repulsion between anyons and anyon holes. For this system, we find a lifetime of the stored quantum information that grows exponentially in $L^2$ for both periodic and open boundary conditions, though the exponent in the latter case is found to be less favourable. However, $L$ is upper-bounded through the breakdown of the perturbative treatment of the underlying Hamiltonian.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.