A Hamming-Like Bound for Degenerate Stabilizer Codes

05/31/2023
by   Andrew Nemec, et al.
0

The quantum Hamming bound was originally put forward as an upper bound on the parameters of nondegenerate quantum codes, but over the past few decades much work has been done to show that many degenerate quantum codes must also obey this bound. In this paper, we show that there is a Hamming-like bound stricter than the quantum Hamming bound that applies to degenerate t-error-correcting stabilizer codes of length greater than some positive integer N(t). We show that this bound holds for all single-error-correcting degenerate stabilizer codes, forcing all but a handful of optimal distance-3 stabilizer codes to be nondegenerate.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/08/2021

Quantum Synchronizable Codes on Sextic Cyclotomy

Quantum synchronizable codes are kinds of quantum error-correcting codes...
research
05/24/2022

On the number of error correcting codes

We show that for a fixed q, the number of q-ary t-error correcting codes...
research
08/06/2018

Error Correction Maximization for Deep Image Hashing

We propose to use the concept of the Hamming bound to derive the optimal...
research
02/03/2023

Quantum Data-Syndrome Codes: Subsystem and Impure Code Constructions

Quantum error correction requires the use of error syndromes derived fro...
research
08/13/2019

On Steane-Enlargement of Quantum Codes from Cartesian Product Point Sets

In this work, we study quantum error-correcting codes obtained by using ...
research
12/29/2021

Exact quantum query complexity of computing Hamming weight modulo powers of two and three

We study the problem of computing the Hamming weight of an n-bit string ...
research
04/26/2018

On the Arithmetic Complexities of Hamming Codes and Hadamard Codes

In this paper, we study the arithmetic complexities of Hamming codes and...

Please sign up or login with your details

Forgot password? Click here to reset