PreprintarXiv licencearXiv
Quantum circuit compilation with constant overhead
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,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.
Related
- QROB: Quantifying Realization Overhead in Quantum Compilation via Reverse Construction
- Purely-logarithmic-time- and constant-space-overhead fault-tolerant quantum computation
- Reducing the Entanglement Cost of Distributed Bipartite Quantum Computation with Constant Qubit Overhead
- Constant-Overhead Injection into Quantum Codes
- One-dimensional quantum Gibbs states in constant circuit depth
BibTeX
@misc{zhang2026quantum,
title = {{Quantum circuit compilation with constant overhead}},
author = {Chenyi Zhang and Xinyu Tan and Robin Kothari and David Gosset and Craig Gidney},
howpublished = {arXiv},
year = {2026},
month = sep,
doi = {10.48550/arxiv.2609.39092},
eprint = {2609.39092},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2609.39092},
}
RIS
TY - UNPB
TI - Quantum circuit compilation with constant overhead
AU - Chenyi Zhang
AU - Xinyu Tan
AU - Robin Kothari
AU - David Gosset
AU - Craig Gidney
PY - 2026
DA - 2026/09/30
PB - arXiv
DO - 10.48550/arxiv.2609.39092
UR - https://arxiv.org/abs/2609.39092
AB - 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,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.
ER -