-
Notifications
You must be signed in to change notification settings - Fork 91
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
Showing
3 changed files
with
48 additions
and
1 deletion.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,41 @@ | ||
####################################################### | ||
## This is a code entry in the error correction zoo. ## | ||
## https://github.com/errorcorrectionzoo ## | ||
####################################################### | ||
|
||
code_id: kls | ||
physical: qubits | ||
logical: qubits | ||
|
||
name: '\([[m 2^m / (m+1), 2^m / (m+1)]]\) Khesin-Lu-Shor code' | ||
short_name: '\([[m 2^m / (m+1), 2^m / (m+1)]]\)' | ||
introduced: '\cite{arxiv:2411.14448}' | ||
|
||
description: | | ||
A family of \([[m 2^m / (m+1), 2^m / (m+1)]]\) qubit CSS codes derived from the Hamming code. | ||
Their \hyperref[topic:encoder-respecting]{encoder-respecting form} is the graph of a hypercube in \(m = 2^r - 1\) dimensions, and input nodes in the graph are codewords of the \([2^r-1,2^r-r-1,3]\) Hamming code \cite{arxiv:2411.14448}. | ||
protection: 'The code distance is bounded above and conjectured to be \(m\) \cite{arxiv:2411.14448}.' | ||
|
||
|
||
relations: | ||
parents: | ||
- code_id: qubit_css | ||
cousins: | ||
- code_id: hamming | ||
detail: 'The \hyperref[topic:encoder-respecting]{encoder-respecting form} of the \([[m 2^m / (m+1), 2^m / (m+1)]]\) Khesin-Lu-Shor code is the graph of a hypercube in \(m = 2^r - 1\) dimensions, and input nodes in the graph are codewords of the \([2^r-1,2^r-r-1,3]\) Hamming code \cite{arxiv:2411.14448}.' | ||
- code_id: hypercube | ||
detail: 'The \hyperref[topic:encoder-respecting]{encoder-respecting form} of the \([[m 2^m / (m+1), 2^m / (m+1)]]\) Khesin-Lu-Shor code is the graph of a hypercube in \(m = 2^r - 1\) dimensions, and input nodes in the graph are codewords of the \([2^r-1,2^r-r-1,3]\) Hamming code \cite{arxiv:2411.14448}.' | ||
- code_id: steane | ||
detail: 'The \hyperref[topic:encoder-respecting]{encoder-respecting form} of both the Steane and Khesin-Lu-Shor codes is the graph of a hypercube \cite{arxiv:2411.14448}.' | ||
|
||
|
||
|
||
# Begin Entry Meta Information | ||
_meta: | ||
# Change log - most recent first | ||
changelog: | ||
- user_id: VictorVAlbert | ||
date: '2024-12-11' | ||
- user_id: AndreyBorisKhesin | ||
date: '2024-12-11' |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters