Weight Reduction for Quantum Codes

preprint2016arXivOpen access

Abstract

We present an algorithm that takes a CSS stabilizer code as input, and outputs another CSS stabilizer code such that the stabilizer generators all have weights O(1)O(1) and such that O(1)O(1) generators act on any given qubit. The number of logical qubits is unchanged by the procedure, while we give bounds on the increase in number of physical qubits and in the effect on distance and other code parameters, such as soundness (as a locally testable code) and "cosoundness" (defined later). Applications are discussed, including to codes from high-dimensional manifolds which have logarithmic weight stabilizers. Assuming a conjecture in geometry\cite{hdm}, this allows the construction of CSS stabilizer codes with generator weight O(1)O(1) and almost linear distance. Another application of the construction is to increasing the distance to XX or ZZ errors, whichever is smaller, so that the two distances are equal.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.