arXiv Analytics

Sign in

arXiv:2203.11137 [quant-ph]AbstractReferencesReviewsResources

Adiabatic paths of Hamiltonians, symmetries of topological order, and automorphism codes

David Aasen, Zhenghan Wang, Matthew B. Hastings

Published 2022-03-21Version 1

The recent "honeycomb code" is a fault-tolerant quantum memory defined by a sequence of checks which implements a nontrivial automorphism of the toric code. We argue that a general framework to understand this code is to consider continuous adiabatic paths of gapped Hamiltonians and we give a conjectured description of the fundamental group and second and third homotopy groups of this space in two spatial dimensions. A single cycle of such a path can implement some automorphism of the topological order of that Hamiltonian. We construct such paths for arbitrary automorphisms of two-dimensional doubled topological order. Then, realizing this in the case of the toric code, we turn this path back into a sequence of checks, constructing an automorphism code closely related to the honeycomb code.

Related articles: Most relevant | Search more
arXiv:1003.2172 [quant-ph] (Published 2010-03-10, updated 2010-05-18)
Optimal parametrizations of adiabatic paths
arXiv:1506.08432 [quant-ph] (Published 2015-06-28)
Advancing the case for $PT$ Symmetry -- the Hamiltonian is always $PT$ Symmetric
arXiv:1310.3562 [quant-ph] (Published 2013-10-14, updated 2013-12-06)
Adiabatic computing using 2-local Hamiltonians on a line