By Topic

Beyond stabilizer codes II: Clifford codes

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Klappenecker, A. ; Dept. of Comput. Sci., Texas A&M Univ., College Station, TX, USA ; Rotteler, M.

For pt. I see ibid., vol.48, no.8, p.2392-95 (2002). Knill (1996) introduced a generalization of stabilizer codes, called Clifford codes. It remained unclear whether or not Clifford codes can be superior to stabilizer codes. We show that Clifford codes are stabilizer codes provided that the abstract error group has an Abelian index group. In particular, if the errors are modeled by tensor products of Pauli matrices, then the associated Clifford codes are necessarily stabilizer codes.

Published in:

Information Theory, IEEE Transactions on  (Volume:48 ,  Issue: 8 )