By Topic

A further study on the encoding complexity of quantum stabilizer 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
$33 $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)
Kao-Yueh Kuo ; National Tsing Hua University, Hsinchu 30013, Taiwan ; Chung-Chin Lu

In this paper, we investigate the encoding complexity of binary quantum stabilizer codes. When doing the encoding through a “standard generator matrix”, a tight upper bound of the encoding complexity is derived in this paper to indicate that the encoding complexity decreases quadratically as the number r1 of primary generators of the stabilizer group decreases. A class of equivalent transformations on stabilizer codes is explored to reduce the number r1 of primary generators. The minimum possible r1 is determined for several classes of optimal stabilizer codes of distance two or three and for some codes of length n ≤ 12. It appears that a code with large minimum distance will have large r1, reflecting high encoding complexity.

Published in:

Information Theory and its Applications (ISITA), 2010 International Symposium on

Date of Conference:

17-20 Oct. 2010