Enlargement of calderbank-shor-steane quantum codes
IEEE Transactions on Information Theory 45:7 (1999) 2492-2495
Abstract:
It is shown that a classical error correcting code C = [n, k, d] which contains its dual, C⊥ ⊆ C, and which can be enlarged to C′ = [n, k′ > k + 1, d′], can be converted into a quantum code of parameters [[n, k+k′ -n, min (d, [3d′/2])]]. This is a generalization of a previous construction, it enables many new codes of good efficiency to be discovered. Examples based on classical Bose-Chaudhuri-Hocquenghem (BCH) codes are discussed. © 1999 IEEE.Quantum Reed-Muller codes
IEEE Transactions on Information Theory 45:5 (1999) 1701-1703
Abstract:
In a previous study, Gottesman found an infinite set of optimal single-error-correcting quantum codes. This report presents a set of quantum codes of which Gottesman's is a subset. The codes are obtained by combining classical Reed-Muller codes.QUANTUM ERROR CORRECTION
Chapter in Introduction to Quantum Computation and Information, World Scientific Publishing (1998) 184-212
Efficient fault-tolerant quantum computing
(1998)
Enlargement of Calderbank Shor Steane quantum codes
(1998)