Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2610.06775

Engineering logical gates with irrep surface codes

Yabo Li·Zijian Song·Vieri Mattei·Naren Manjunath·Apoorv Tiwari·Tyler D. Ellison
View original source ↗Read source document ↗Export metadata ↓

Abstract

Fault-tolerant quantum computation typically relies on a fixed set of logical primitives, while realizing other desired operations can require substantial resources. We introduce irrep surface codes (ISCs), two-dimensional topological quantum error-correcting codes engineered to transversally implement a prescribed set of logical gates. The engineered gates only need to satisfy two conditions: (i) they generate a finite group, which, up to global phases, is forced by the Eastin-Knill theorem, and (ii) they are irreducible, meaning that any operator commuting with the set of gates must be proportional to the identity. This accommodates arbitrary finite groups of diagonal gates and arbitrary reversible classical gates, since each can be embedded into a larger irreducible finite group of gates. It also enables logical gates outside every finite level of the Clifford hierarchy. To incorporate these operations into surface-code computations, we further develop lattice-surgery protocols to transfer the encoded information between surface codes and ISCs obeying either of two sufficient conditions. Together, these results establish a systematic method for tailoring topological codes to desired logical operations and integrating them into conventional computations.

Explore related subjects

quant-phcond-mat.str-el

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yabo Li, Zijian Song, Vieri Mattei, Naren Manjunath, Apoorv Tiwari, Tyler D. Ellison. 2026-10-05. Engineering logical gates with irrep surface codes. https://arxiv.org/abs/2610.06775

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

The Quantum Eraser Paradox

The Delayed-Choice Quantum Eraser experiment is commonly interpreted as implying that in quantum mechanics a choice made at one time can influence an earlier event. We here suggest an extension of the experiment that results in a paradox when analysed in a local realist interpretation combined with backward causation (``dynamical retrocausality''). We argue that resolving the paradox requires giving up the idea that, in quantum mechanics, a choice can influence the past in this way, and that it instead requires a violation of Statistical Independence without (what most people think of as) retrocausality. Finally, we propose an implementation of the experiment that we believe to be possible with existing technology. This new experiment can distinguish between different types of hidden-variables theories in a way that Bell-type tests cannot: unlike in a Bell test, the measurement setting here is set by an earlier outcome, which makes the consistency of the backwards influence itself testable. We classify the fixed-point (consistency-enforcing) hidden-variables models of the experiment, which can reproduce quantum mechanics only if the backwards influence has no observable effect.

quant-ph↗
arXiv2026

Quantum simulation of wave optics in weakly inhomogeneous media using block-encoding

We propose a quantum algorithm that simulates the propagation of a light field through a weakly inhomogeneous medium. In the paraxial approximation, the wave equation in an inhomogeneous material takes the form of the Schrödinger equation with a time-dependent Hamiltonian. This reduction is used to simulate wave optical dynamics on a quantum computer. Beam propagator operators for a short propagation distance are constructed using an efficient and flexible block-encoding that enables the simulation of various optical setups. The algorithm is showcased by simulating the propagation of a one-dimensional Gaussian beam through a lens of finite thickness, and the resulting spherical aberration is demonstrated.

quant-ph↗
arXiv2026

Clifford gates with logical transversality for self-dual CSS codes

Quantum error-correcting codes with high encoding rate are good candidates for large-scale quantum computers as they use physical qubits more efficiently than codes of the same distance that encode only a few logical qubits. Some logical gate of a high-rate code can be fault-tolerantly implemented using transversal physical gates, but its logical operation may depend on the choice of a symplectic basis that defines logical Pauli operators of the code. In this work, we focus on $[\![n,k,d]\!]$ self-dual Calderbank-Shor-Steane (CSS) codes with $k \geq 1$ and prove necessary and sufficient conditions for the code to have a symplectic basis such that (1) transversal logical Hadamard gates $\bigotimes_{j=1}^{k} \bar{H}_j$ can be implemented by transversal physical Hadamard gates $\bigotimes_{i=1}^{n} H_i$, and (2) for any $(a_1,\dots,a_k)\in\{-1,1\}^k$, transversal logical phase gates $\bigotimes_{j=1}^{k} \bar{S}_j^{a_j}$ can be implemented by transversal physical phase gates $\bigotimes_{i=1}^{n} S_i^{b_i}$ for some $(b_1,\dots,b_n)\in\{-1,1\}^n$. Self-dual CSS codes satisfying the conditions include any codes with odd $n$. We also generalize the idea to concatenated self-dual CSS codes and show that certain logical Clifford gates have multiple transversal implementations, each by logical gates at a different level of concatenation. Several applications of our results for fault-tolerant quantum computation with low overhead are also provided.

quant-ph↗