-
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
5 changed files
with
56 additions
and
4 deletions.
There are no files selected for viewing
48 changes: 48 additions & 0 deletions
48
...tum/qubits/nonstabilizer/permutation_invariant/binary_dihedral_permutation_invariant0.yml
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,48 @@ | ||
####################################################### | ||
## This is a code entry in the error correction zoo. ## | ||
## https://github.com/errorcorrectionzoo ## | ||
####################################################### | ||
|
||
code_id: binary_dihedral_permutation_invariant | ||
physical: qubits | ||
logical: qubits | ||
|
||
name: 'Binary dihedral permutation-invariant code' | ||
introduced: '\cite{arxiv:2310.17652}' | ||
|
||
description: | | ||
Multi-qubit code designed to realize gates from the binary dihedral group transversally. | ||
Can also be interpreted as a single-spin code. | ||
The codespace projection is a projection onto an irrep of the \textit{binary dihedral group} \( \mathsf{BD}_{2N} = \{\omega I, X, P\} \) of order \(8N\), where \( \omega \) is a \( 2N \) root of unity, and \( P = \text{diag} ( 1, \omega^2) \). | ||
The construction includes three families. | ||
The first family has parameters \(((2m+3,2,3))\) for \(m\) not a power of two, realizing binary dihedral transversal gates that are not possible to realize in any qubit stabilizer code \cite[Prop. 1]{arxiv:2310.17652}. | ||
The second family is the case of \(m\) being a power of two, corresponding to \(((2^{r-1}+3,2,3))\) codes, each realizing a member of the Clifford hierarchy transversally. | ||
The third family consists of \(((n,2,d))\) codes with \(n = \frac{1}{4}(3d^2+6d-7+2(d\text{ mod }8))\), realizing \(S\) and \(T\) gates transversally. | ||
features: | ||
transversal_gates: 'Binary dihedral group gates can be realized transversally, which include subsgroups of any level of the Clifford hierarchy.' | ||
|
||
|
||
relations: | ||
parents: | ||
- code_id: qubits_into_qubits | ||
- code_id: j_gross | ||
detail: 'Binary dihedral permutation-invariant codes can be interpreted as Clifford single-spin codes.' | ||
cousins: | ||
- code_id: small_distance | ||
detail: 'The first and second families of binary dihedral permutation-invariant codes have distance three.' | ||
- code_id: xp_stabilizer | ||
detail: 'Binary dihedral permutation invariant codewords form error spaces of XP stabilizer codes.' | ||
- code_id: diagonal_clifford | ||
detail: 'The \(((2^{r-1}+3,2,3))\) family of binary dihedral permutation-invariant codes realizes the same transversal gates as the \([[2^r-1, 1, 3]]\) quantum Reed-Muller codes, but require fewer qubits in almost all cases.' | ||
- code_id: quantum_triorthogonal | ||
detail: 'The \(((27,2,5))\) binary dihedral permutation-invariant code realizes the \(T\) gate transversally, but requires fewer qubits than the \([[49,1,5]]\) triorthogonal code.' | ||
|
||
|
||
# Begin Entry Meta Information | ||
_meta: | ||
# Change log - most recent first | ||
changelog: | ||
- user_id: VictorVAlbert | ||
date: '2023-11-20' |
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
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