{
  "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.",
  "abstract_shown": true,
  "affiliations": [],
  "article_type": null,
  "arxiv": "2609.39092",
  "author_total": 5,
  "authors": [
    {
      "name": "Chenyi Zhang"
    },
    {
      "name": "Xinyu Tan"
    },
    {
      "name": "Robin Kothari"
    },
    {
      "name": "David Gosset"
    },
    {
      "name": "Craig Gidney"
    }
  ],
  "bibtex": "https://research.draconitic.com/paper/07hjk3v176rcg.bib",
  "cited_by": 0,
  "doi": "10.48550/arxiv.2609.39092",
  "fulltext_url": null,
  "id": "07hjk3v176rcg",
  "issns": [],
  "landing_url": "https://arxiv.org/abs/2609.39092",
  "language": null,
  "licence": "LicenseRef-arXiv-nonexclusive-1.0",
  "licence_label": "arXiv licence",
  "licence_source": "article",
  "licence_url": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
  "metadata_licence": "CC0-1.0",
  "native_subjects": [
    [
      "arxiv",
      "quant-ph"
    ],
    [
      "openalex",
      "1702|Quantum Computing Algorithms and Architecture"
    ]
  ],
  "openalex": "W7215075464",
  "pdf_url": "https://arxiv.org/pdf/2609.39092",
  "pmcid": null,
  "pmid": null,
  "published": "2026-09-30",
  "publisher": null,
  "ris": "https://research.draconitic.com/paper/07hjk3v176rcg.ris",
  "sources": [
    {
      "first_seen": "2026-10-30T12:25:49Z",
      "native_id": "2609.39092",
      "source": "arxiv",
      "url": "https://arxiv.org/abs/2609.39092"
    }
  ],
  "subjects": [
    {
      "field": "physics",
      "origin": "arxiv:quant-ph",
      "subfield": "quantum"
    }
  ],
  "title": "Quantum circuit compilation with constant overhead",
  "title_text": "Quantum circuit compilation with constant overhead",
  "type": "preprint",
  "updated_at": "2026-10-30T12:25:49Z",
  "url": "https://research.draconitic.com/paper/07hjk3v176rcg",
  "venue": "arXiv",
  "versions": []
}