A Variant of the Bravyi-Terhal Bound for Arbitrary Boundary Conditions

February 07, 2025 Β· Declared Dead Β· πŸ› IEEE Transactions on Information Theory

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors FranΓ§ois Arnault, Philippe Gaborit, Wouter Rozendaal, Nicolas Saussay, Gilles ZΓ©mor arXiv ID 2502.04995 Category quant-ph: Quantum Computing Cross-listed cs.IT Citations 3 Venue IEEE Transactions on Information Theory Last Checked 5 months ago
Abstract
We present a modified version of the Bravyi-Terhal bound that applies to quantum codes defined by local parity-check constraints on a $D$-dimensional lattice quotient. Specifically, we consider a quotient $\mathbb{Z}^D/Ξ›$ of $\mathbb{Z}^D$ of cardinality $n$, where $Ξ›$ is some $D$-dimensional sublattice of $\mathbb{Z}^D$: we suppose that every vertex of this quotient indexes $m$ qubits of a stabilizer code $C$, which therefore has length $nm$. We prove that if all stabilizer generators act on qubits whose indices lie within a ball of radius $ρ$, then the minimum distance $d$ of the code satisfies $d \leq m\sqrt{Ξ³_D}(\sqrt{D} + 4ρ)n^\frac{D-1}{D}$ whenever $n^{1/D} \geq 8ρ\sqrt{Ξ³_D}$, where $Ξ³_D$ is the $D$-dimensional Hermite constant. We apply this bound to derive an upper bound on the minimum distance of Abelian Two-Block Group Algebra (2BGA) codes whose parity-check matrices have the form $[\mathbf{A} \, \vert \, \mathbf{B}]$ with each submatrix representing an element of a group algebra over a finite abelian group.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Quantum Computing

Died the same way β€” πŸ‘» Ghosted