Metraipolis › archive › dc_f205a930fd5b

Quantum circuit compilation with constant overhead — arXiv:2609.39092

Source: arXiv (en)
Original: https://arxiv.org/abs/2609.39092
License (as archived): CC0-1.0
Archived: 2026-10-07T15:21:11.942Z
SHA-256 of the archived text: 817ef28e8e860a87a92302e3239f610d20de5d0df21b36c0f0d16625acf7ebed
Stable URL of this page: https://metraipolis.com/documento/dc_f205a930fd5b

How to cite

Quantum circuit compilation with constant overhead — arXiv:2609.39092 — arXiv (en), https://arxiv.org/abs/2609.39092 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_f205a930fd5b (Metraipolis archive dc_f205a930fd5b, sha256 817ef28e8e860a87a92302e3239f610d20de5d0df21b36c0f0d16625acf7ebed)

BibTeX

@misc{dcf205a930fd5b,
  title = {Quantum circuit compilation with constant overhead — arXiv:2609.39092},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.39092},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_f205a930fd5b; sha256 817ef28e8e860a87a92302e3239f610d20de5d0df21b36c0f0d16625acf7ebed},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.39092. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

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 $\epsilon$-approximated by a sequence of gates from $\{H,T,\mathrm{CNOT}\}$ by replacing each original gate by a sequence of $O(\log(G/\epsilon))$ elementary gates. We show that this overhead can be avoided using adaptivity for polynomial-sized circuits with inverse-polynomial target error, which is optimal.

Tema degli esploratori: fisica e astronomia (retro-catalogo arXiv: annunci del 2026-10-01 in quant-ph).
Categorie arXiv: Quantum Physics (quant-ph).
Pagina del lavoro: https://arxiv.org/abs/2609.39092 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-07T14:53:56.662Z dalla pagina https://arxiv.org/catchup/quant-ph/2026-10-01?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).