Bacon–Shor code

From testwiki
Jump to navigation Jump to search

The Bacon–Shor code is a subsystem error correcting code.[1] In a subsystem code, information is encoded in a subsystem of a Hilbert space. Subsystem codes lend to simplified error correcting procedures unlike codes which encode information in the subspace of a Hilbert space.[2] This simplicity led to the first claim of fault tolerant circuit demonstration on a quantum computer.[3] It is named after Dave Bacon and Peter Shor.

Given the stabilizer generators of Shor's code: X0X1X2X3X4X5,X0X1X2X6X7X8,Z0Z1,Z1Z2,Z3Z4,Z4Z5,Z6Z7,Z7Z8, 4 stabilizers can be removed from this generator by recognizing gauge symmetries in the code to get: X0X1X2X3X4X5,X0X1X2X6X7X8,Z0Z1Z3Z4Z6Z7,Z1Z2Z4Z5Z7Z8.[4] Error correction is now simplified because 4 stabilizers are needed to measure errors instead of 8. A gauge group can be created from the stabilizer generators:Z1Z2,X2X8,Z4Z5,X5X8,Z0Z1,X0X6,Z3Z4,X3X6,X1X7,X4X7,Z6Z7,Z7Z8.[4] Given that the Bacon–Shor code is defined on a square lattice where the qubits are placed on the vertices; laying the qubits on a grid in a way that corresponds to the gauge group shows how only 2 qubit nearest-neighbor measurements are needed to infer the error syndromes. The simplicity of deducing the syndromes reduces the overhead for fault tolerant error correction.[5]

Geometry
q0 ZZ q1 ZZ q2
XX XX XX
q6 ZZ q7 ZZ q8
XX XX XX
q3 ZZ q4 ZZ q5


See also

References

Template:Reflist Template:Quantum computing