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

1

Posted 3mo ago

4D and 5D Layer Codes through Color Routing

External link
Andrew C. Yuan, Nouédyn Baspin (May 20 2026).
Abstract: We introduce and explicit Calderbank-Shor-Steane (CSS) code construction that generalizes the Layer codes to D=4,5D=4,5D=4,5 dimensions. Much like its predecessor, the present construction is based on embedding quantum low-density parity check (qLDPC) codes; from an [[n,k,d]][[n,k,d]][[n,k,d]] code with energy barrier Δ\DeltaΔ, we obtain a D=4,5D=4,5D=4,5 dimensional Layer code with parameters [[Θ(nD/(D−2)),k,Θ(dn1/(D−2))]][[\Theta(n^{D/(D-2)}), k, \Theta(dn^{1/(D-2)})]][[Θ(nD/(D−2)),k,Θ(dn1/(D−2))]] and energy barrier Ω(Δ)\Omega(\Delta)Ω(Δ). Using good qLDPC codes as input, our construction saturates the D=4,5D=4,5D=4,5 dimensional BPT bounds exactly. The higher dimensional Layer Codes are modular, and thus well suited to architectures composed of modular network patches, despite our physical limitation to three dimensions. We overcome the hurdles encountered by previous generalization attempts through the use of \textitcolor routing, allowing us to resolve the structure of the check layers and line defects.
Arxiv: https://arxiv.org/abs/2605.18961
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