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.

Paper Tools

Show Paper arXiv Publisher Compare Add to Reading List

References & Citation Signals

Local Citation Graph (Related-Paper Links)

Current Paper #32858 #35400 Building a spin quantum bit reg... #35396 Fault tolerance with noisy and ... #35393 Topological quantum hashing wit... #35390 Clustered error correction of c...

External citation index: OpenAlex citation signal

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.