All the Stabilizer Codes of Distance 3

Authors

Abstract: We give necessary and sufficient conditions for the existence of stabilizer codes

[[n, k, 3]]

of distance 3 for qubits:

n - k g e l c e i l l o g_{2} (3 n + 1) c e i l + e p s i l o n_{n}

where

e p s i l o n_{n} = 1

if

n = 8 f r a c 4^{m} - 1 3 + p m 1, 2

or

n = f r a c 4^{m + 2} - 1 3 - 1, 2, 3

for some integer

m g e 1

and

e p s i l o n_{n} = 0

otherwise. Or equivalently, a code

[[n, n - r, 3]]

exists if and only if

n l e q (4^{r} - 1) / 3, (4^{r} - 1) / 3 - n o t i n l b r a c e 1, 2, 3 b r a c e

for even

r

and

n l e q 8 (4^{r - 3} - 1) / 3, 8 (4^{r - 3} - 1) / 3 - n o t = 1

for odd

r

. Given an arbitrary length

n

we present an explicit construction for an optimal quantum stabilizer code of distance 3 that saturates the above bound.

Cited in

(14)

This page was built for publication: All the Stabilizer Codes of Distance 3