A family of [[6k, 2k, 2]] codes for practical, scalable adiabatic quantum computation
Quantum Physics
2015-06-17 v3
Abstract
In this work, we introduce a new family of [[6k, 2k, 2]] codes designed specifically to be compatible with adiabatic quantum computation. These codes support computationally universal sets of weight-two logical operators and are particularly well-suited for implementing dynamical decoupling error suppression. For Hamiltonians embeddable on a planar graph of fixed degree, our encoding maintains a planar connectivity graph and increase the graph degree by only two. These codes are the first known to possess these features.
Keywords
Cite
@article{arxiv.1309.1674,
title = {A family of [[6k, 2k, 2]] codes for practical, scalable adiabatic quantum computation},
author = {Anand Ganti and Uzoma Onunkwo and Kevin Young},
journal= {arXiv preprint arXiv:1309.1674},
year = {2015}
}
Comments
(Changes include clarifying fidelity analysis and adding a new subsection on limitations) 5 pages, 3 figures