Compare Papers
Paper 1
A family of [[6k, 2k, 2]] codes for practical, scalable adiabatic quantum computation
Anand Ganti, Uzoma Onunkwo, Kevin Young
- Year
- 2013
- Journal
- arXiv preprint
- DOI
- arXiv:1309.1674
- arXiv
- 1309.1674
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.
Open paperPaper 2
Not found.