Skip to content
aiqbench takeQuantum Computing

aiqbench analysis

This paper proposes group surface codes as a generalization of the standard $\mathbb{Z}_2$ surface code, demonstrating their capability to perform non-Clifford gates and achieve universal quantum computation without relying on anyon braiding. By leveraging transversal logical operations and tensor network methods, the authors provide a unified framework that bypasses limitations imposed by the Bravyi-König theorem within topological Pauli stabilizer models. The work offers significant theoretical advances for fault-tolerant architectures aiming to integrate classical reversible gates directly into quantum error correction schemes.
Sources coveringarXiv, AI Alignment Forum, Quantum Frontiers, pronedra.ru
What this isA model's reading of the article and related coverage, written for aiqbench. Not the publisher's words.

Universal quantum computation with group surface codes

arXiv3 min read

arXiv:2603.05502v2 Announce Type: replace Abstract: We introduce group surface codes, which are a natural generalization of the $\mathbb{Z}_2$ surface code, and equivalent to quantum double models of finite groups with specific boundary conditions. We show that group surface codes can be leveraged to perform non-Clifford gates in $\mathbb{Z}_2$ surface codes, thus enabling universal computation along with established means of performing logical Clifford gates. Moreover, for suitably chosen groups, we demonstrate that arbitrary reversible classical gates can be implemented transversally in the group surface code. We present the logical operations in terms of a set of elementary logical operations, which include transversal logical gates, a means of transferring encoded information into and out of group surface codes, and preparation and readout. By composing these elementary operations, we implement a wide variety of logical gates and provide a unified perspective on recent constructions in the literature for sliding group surface codes and preparing magic states. We furthermore use tensor networks inspired by ZX-calculus to construct spacetime implementations of the elementary operations. This spacetime perspective also allows us to establish explicit correspondences with topological gauge theories. Our work extends recent efforts in performing universal quantum computation in topological orders without the braiding of anyons, and shows how certain group surface codes allow us to bypass the restrictions set by the Bravyi-K\"onig theorem, which limits the computational power of topological Pauli stabilizer models.

Abstract:We introduce group surface codes, which are a natural generalization of the $\mathbb{Z}_2$ surface code, and equivalent to quantum double models of finite groups with specific boundary conditions. We show that group surface codes can be leveraged to perform non-Clifford gates in $\mathbb{Z}_2$ surface codes, thus enabling universal computation along with established means of performing logical Clifford gates. Moreover, for suitably chosen groups, we demonstrate that arbitrary reversible classical gates can be implemented transversally in the group surface code. We present the logical operations in terms of a set of elementary logical operations, which include transversal logical gates, a means of transferring encoded information into and out of group surface codes, and preparation and readout. By composing these elementary operations, we implement a wide variety of logical gates and provide a unified perspective on recent constructions in the literature for sliding group surface codes and preparing magic states. We furthermore use tensor networks inspired by ZX-calculus to construct spacetime implementations of the elementary operations. This spacetime perspective also allows us to establish explicit correspondences with topological gauge theories. Our work extends recent efforts in performing universal quantum computation in topological orders without the braiding of anyons, and shows how certain group surface codes allow us to bypass the restrictions set by the Bravyi-König theorem, which limits the computational power of topological Pauli stabilizer models.

35+21 pages, many figures. v2 updates appendices and fixes typos

Quantum Physics (quant-ph); Strongly Correlated Electrons (cond-mat.str-el)

arXiv:2603.05502 [quant-ph]

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

https://doi.org/10.48550/arXiv.2603.05502 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.

Full text under the publisher's open licence · 330 words

Related coverage