Quick Navigation
Topics
Quantum Error Correction Fault Tolerance
A family of [[6k, 2k, 2]] codes for practical, scalable adiabatic quantum computation
arXiv
Authors: Anand Ganti, Uzoma Onunkwo, Kevin Young
Year
2013
Paper ID
32858
Status
Preprint
Abstract Read
~2 min
Abstract Words
76
Citations
N/A
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.
Why This Paper Matters
- This paper contributes to the Quantum Error Correction & Fault Tolerance research area in the Quantum Articles archive.
- It adds a 2013 reference point for readers tracking recent quantum research.
- In this work, we introduce a new family of [[6k, 2k, 2]] codes designed specifically to be compatible with adiabatic quantum computation.
Paper Tools
Become a member to use research tools
Sign in to open papers, visit source links, share, cite, compare, copy DOI links, request category corrections, and build your reading list.
Show Paper arXiv Publisher Share
Cite This Paper
Copy URL
Compare
Copy DOI Add to Reading List
Category Correction Request
Category Correction Request
Help us improve classification quality by proposing a better category. Every request is reviewed by an admin.
Sign in to submit a category correction request for this paper.
Log In to SubmitReferences & Citation Signals
Community Reactions
Quick sentiment from readers on this paper.
Score:
0
Likes: 0
Dislikes: 0
Sign in to react to this paper.
Discussion & Reviews (Moderated)
Average Rating: 0.0 / 5 (0 ratings)
No written reviews yet.