Sari la conținut

Română · beta. Traducerea a fost făcută automat și este încă în curs de revizuire. Citește pagina în engleză

perspectiva aiqbenchCalcul cuantic

analiza aiqbench

This research presents a theoretical generalization of quantum error-correcting Layer codes to four and five dimensions using CSS constructions and color routing techniques. By saturating the BPT bounds with modular architectures, the work addresses scalability challenges inherent in physical three-dimensional systems through logical higher-dimensional modeling. The primary contribution lies in advancing qLDPC code theory and topological fault tolerance rather than immediate hardware implementation or consumer applications.
Surse care acoperăarXiv, LessWrong, SiliconANGLE, Latent Space
Ce este aceastaLectura unui model asupra articolului și a acoperirii conexe, scrisă pentru aiqbench. Nu sunt cuvintele publicației.

4D and 5D Layer Codes through Color Routing

arXiv2 min de cititArticolul și perspectiva sunt în engleză.

arXiv:2605.18961v2 Announce Type: replace Abstract: We introduce and explicit Calderbank-Shor-Steane (CSS) code construction that generalizes the Layer codes to $D=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]]$ code with energy barrier $\Delta$, we obtain a $D=4,5$ dimensional Layer code with parameters $[[\Theta(n^{D/(D-2)}), k, \Theta(dn^{1/(D-2)})]]$ and energy barrier $\Omega(\Delta)$. Using good qLDPC codes as input, our construction saturates the $D=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 \textit{color routing}, allowing us to resolve the structure of the check layers and line defects.

Abstract:We introduce and explicit Calderbank-Shor-Steane (CSS) code construction that generalizes the Layer codes to $D=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]]$ code with energy barrier $\Delta$, we obtain a $D=4,5$ dimensional Layer code with parameters $[[\Theta(n^{D/(D-2)}), k, \Theta(dn^{1/(D-2)})]]$ and energy barrier $\Omega(\Delta)$. Using good qLDPC codes as input, our construction saturates the $D=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 \textit{color routing}, allowing us to resolve the structure of the check layers and line defects.

Quantum Physics (quant-ph); Information Theory (cs.IT); Mathematical Physics (math-ph)

arXiv:2605.18961 [quant-ph]

(or arXiv:2605.18961v2 [quant-ph] for this version)

https://doi.org/10.48550/arXiv.2605.18961 Focus to learn more arXiv-issued DOI via DataCite

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Text integral sub licența deschisă a publicației · 223 cuvinte

Subiecte conexe