Metraipolis › archive › dc_af0ec6bddaf0

Scalable Circuit Cutting: A Framework for Combined Gate and Wire Cuts Using Gate Groups — arXiv:2608.05287

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.05287
License (as archived)
CC0-1.0
Archived
2026-10-31T10:51:16.687Z
SHA-256 of the archived text
0ee63c454a9194bedb14755077b12aee73cd0c7d0d6a36f9b14596b04c918633
Stable URL of this page
https://metraipolis.com/documento/dc_af0ec6bddaf0

How to cite

Scalable Circuit Cutting: A Framework for Combined Gate and Wire Cuts Using Gate Groups — arXiv:2608.05287 — arXiv (en), https://arxiv.org/abs/2608.05287 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_af0ec6bddaf0 (Metraipolis archive dc_af0ec6bddaf0, sha256 0ee63c454a9194bedb14755077b12aee73cd0c7d0d6a36f9b14596b04c918633)
BibTeX
@misc{dcaf0ec6bddaf0,
  title = {Scalable Circuit Cutting: A Framework for Combined Gate and Wire Cuts Using Gate Groups — arXiv:2608.05287},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.05287},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_af0ec6bddaf0; sha256 0ee63c454a9194bedb14755077b12aee73cd0c7d0d6a36f9b14596b04c918633},
  year = {2026}
}

Archived text

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

Quantum circuit cutting enables the execution of large circuits on devices with a limited number of qubits by partitioning circuits into independent subcircuits. However, this introduces a sampling overhead, which grows exponentially with the number of cuts, rendering the choice of cut placements critical for practical circuit cutting. Determining optimal cut placements remains computationally challenging, particularly as circuits grow in size. Additionally, existing circuit cutting approaches typically treat gate and wire cuts independently. Those combining both cutting approaches, however, do not take advantage of joint cutting, i.e., identifying common gate groups and cutting them jointly for a reduced overhead. This work presents a unified framework that combines gate and wire cutting within a single partitioning strategy, enabling more efficient circuit decompositions. Moreover, our approach incorporates joint cutting via a novel gate grouping technique, further reducing sampling overhead. By formulating the cut placement problem as a scalable graph partitioning task, our method efficiently identifies near-optimal cut placements for large circuits, also providing diagnostic feedback on whether circuits are suitable for cutting.

Tema degli esploratori: calcolo e infrastrutture (retro-catalogo arXiv: annunci del 2026-08-07 in cs.ET).
Categorie arXiv: Quantum Physics (quant-ph) ; Emerging Technologies (cs.ET).
Pagina del lavoro: https://arxiv.org/abs/2608.05287 — 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-31T10:39:57.555Z dalla pagina https://arxiv.org/catchup/cs.ET/2026-08-07?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).