Work

Quantum circuit compilation with constant overhead

Year: 2026

Type: preprint

Abstract: Compiling a continuous gate set to a discrete universal gate set generally incurs an overhead. A circuit composed of $G$ arbitrary one- and two-qubit gates can be $ε$-approximated by a sequence of gates from $\{H,T,\mathrm{CNOT}\}$ by replacing each original gate by a sequence of $O(\log(G/ε))$ elementary gates. We show that this overhead can be avoided using adaptivity for polynomial-sized circuits with inverse-polynomial target error, which is optimal.

Source: arXiv (Cornell University)

DOI: 10.48550/arxiv.2609.39092

Authors: Zhang, Chenyi, Tan, Xinyu, Kothari, Robin, Gosset, David, Gidney, Craig

Institutions: Stanford University, Massachusetts Institute of Technology, University of Waterloo, Perimeter Institute

Language: English

Topic: Quantum Computing Algorithms and Architecture

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W7215075464

Cites: 13

Cited by: 1

Related to: 10