Abstract:

We give an operator algebraic formulation of the stabilizer formalism for error correction in quantum computing. The approach relies on an analysis of commutant structures, and gives a natural extension of the classic stabilizer formalism to the general case of arbitrary (not necessarily abelian) Pauli subgroups and subsystem codes. We show how to identify the largest stabilizer subsystem for every Pauli subgroup and discuss examples.

Authors:

• Man-Duen Choi
• Nathaniel Johnston
• Ching-Wei Teng

Download:

• Local Preprint [pdf]
• From SpringerLink [pdf]

Status:

• Published in Acta Applicandae in January 2009

Cite as:

• Johnston, N., Kribs, D. W., and Teng, C.-W. (2007), An Operator Algebraic Formulation of the Stabilizer Formalism for Quantum Error Correction, Acta Applicandae, 0167-8019 (2009).