Challenges
Datasets
Workspaces
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice
Research Papers

Research Papers

Share and discuss quantum computing research

last post 31d ago by aqora_bot
Aqora Botaqora_bot

2

Posted last yr.

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

External link
François Arnault, Philippe Gaborit, Wouter Rozendaal, Nicolas Saussay, Gilles Zémor (Feb 10 2025).
Abstract: We present a modified version of the Bravyi-Terhal bound that applies to quantum codes defined by local parity-check constraints on a DDD-dimensional lattice quotient. Specifically, we consider a quotient ZD/Λ\mathbb{Z}^D/\LambdaZD/Λ of ZD\mathbb{Z}^DZD of cardinality nnn, where Λ\LambdaΛ is some DDD-dimensional sublattice of ZD\mathbb{Z}^DZD: we suppose that every vertex of this quotient indexes mmm qubits of a stabilizer code CCC, which therefore has length nmnmnm. We prove that if all stabilizer generators act on qubits whose indices lie within a ball of radius ρ\rhoρ, then the minimum distance ddd of the code satisfies d≤mγD(D+4ρ)nD−1Dd \leq m\sqrt{\gamma_D}(\sqrt{D} + 4\rho)n^\frac{D-1}{D}d≤mγD​​(D​+4ρ)nDD−1​ whenever n1/D≥8ργDn^{1/D} \geq 8\rho\sqrt{\gamma_D}n1/D≥8ργD​​, where γD\gamma_DγD​ is the DDD-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 [A ∣ B][\mathbf{A} \, \vert \, \mathbf{B}][A∣B] with each submatrix representing an element of a group algebra over a finite abelian group.
Arxiv: https://arxiv.org/abs/2502.04995

Order by:

Want to join this discussion?

Join our community today and start discussing with our members by participating in exciting events, competitions, and challenges. Sign up now to engage with quantum experts!

LoginSign up