Subsystem codes with spatially local generators

Details Subsystem codes with spatially local generators Subsystem codes with spatially local generators

2010-08-05

arxiv.org/abs/1008.1029v1

Phys. Rev. A 83, 012320 (2011)

Physics

Quantum Physics

11 pages, 4 figures

Scientific paper

We study subsystem codes whose gauge group has local generators in the 2D geometry. It is shown that there exists a family of such codes defined on lattices of size LxL with the number of logical qubits k and the minimum distance d both proportional to L. The gauge group of these codes involves only two-qubit generators of type XX and ZZ coupling nearest neighbor qubits (and some auxiliary one-qubit generators). Our proof is not constructive as it relies on a certain version of the Gilbert-Varshamov bound for classical codes. Along the way we introduce and study properties of generalized Bacon-Shor codes which might be of independent interest. Secondly, we prove that any 2D subsystem [n,k,d] code with spatially local generators obeys upper bounds kd=O(n) and d^2=O(n). The analogous upper bound proved recently for 2D stabilizer codes is kd^2=O(n). Our results thus demonstrate that subsystem codes can be more powerful than stabilizer codes under the spatial locality constraint.

Affiliated with

Also associated with

No associations

Rating

Subsystem codes with spatially local generators does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Subsystem codes with spatially local generators, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Subsystem codes with spatially local generators will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-438937