.png){kind=icon}
.png){kind=icon}
Return
Quantum Data-Syndrome Codes
.png){kind=icon}
OA
AI
DOI：10.1109/JSAC.2020.2968997.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Performing active quantum error correction to protect fragile quantum states highly depends on the correctness of measured error syndromes. To obtain reliable error syndromes using imperfect physical circuits, we propose syndrome measurement (SM) and quantum data-syndrome (DS) codes. SM codes protect syndrome with linearly dependent redundant stabilizer measurements. DS codes generalize this idea for simultaneous correction of both data qubits and syndrome bits errors. We study fundamental properties of quantum DS codes, including split weight enumerators, generalized MacWilliams identities, and linear programming bounds. In particular, we derive Singleton and Hamming-type upper bounds on the minimum distance of degenerate quantum DS codes. Then we study random DS codes and show that random DS codes with a relatively small additional syndrome measurements achieve the Gilbert-Varshamov bound of stabilizer codes. Finally, we propose a family of CSS-type quantum DS codes based on classical cyclic codes, which include the Steane code and the quantum Golay code.
Keywords:
Data-syndrome (DS) codes
quantum codes
stabilizer codes
macWilliams identities
linear programming bounds
quantum syndrome errors
Journal
IF:
17.2
Papers:
6.4K
Citations:
3.1W
View more organizations