Quick Navigation

Topics

Quantum Error Correction Fault Tolerance

Sparse Quantum Codes from Quantum Circuits

arXiv
Authors: Dave Bacon, Steven T. Flammia, Aram W. Harrow, Jonathan Shi

Year

2014

Paper ID

46479

Status

Preprint

Abstract Read

~2 min

Abstract Words

174

Citations

N/A

Abstract

We describe a general method for turning quantum circuits into sparse quantum subsystem codes. The idea is to turn each circuit element into a set of low-weight gauge generators that enforce the input-output relations of that circuit element. Using this prescription, we can map an arbitrary stabilizer code into a new subsystem code with the same distance and number of encoded qubits but where all the generators have constant weight, at the cost of adding some ancilla qubits. With an additional overhead of ancilla qubits, the new code can also be made spatially local. Applying our construction to certain concatenated stabilizer codes yields families of subsystem codes with constant-weight generators and with minimum distance $d = n^{1-ε}$, where $ε= O\(1/\sqrt{\log n}\)$. For spatially local codes in $D$ dimensions we nearly saturate a bound due to Bravyi and Terhal and achieve $d = n^{1-ε-1/D}$. Previously the best code distance achievable with constant-weight generators in any dimension, due to Freedman, Meyer and Luo, was $O\(\sqrt{n\log n}\)$ for a stabilizer code.

Paper Tools

Show Paper arXiv Publisher Compare Add to Reading List

References & Citation Signals

Local Citation Graph (Related-Paper Links)

Current Paper #46479 #48374 Proceedings 9th Workshop on Qua...

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.