Metraipolis › archive › dc_7fb395de6bde

Clifford Circuit Synthesis for Distributed Quantum Architectures with Arbitrary Network Topology — arXiv:2608.13543

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.13543
License (as archived)
CC0-1.0
Archived
2026-10-19T05:05:17.170Z
SHA-256 of the archived text
63e598219ed36ef17b811e83601e8a439de2890c9b1629315abf424fb2b8391c
Stable URL of this page
https://metraipolis.com/documento/dc_7fb395de6bde

How to cite

Clifford Circuit Synthesis for Distributed Quantum Architectures with Arbitrary Network Topology — arXiv:2608.13543 — arXiv (en), https://arxiv.org/abs/2608.13543 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_7fb395de6bde (Metraipolis archive dc_7fb395de6bde, sha256 63e598219ed36ef17b811e83601e8a439de2890c9b1629315abf424fb2b8391c)
BibTeX
@misc{dc7fb395de6bde,
  title = {Clifford Circuit Synthesis for Distributed Quantum Architectures with Arbitrary Network Topology — arXiv:2608.13543},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.13543},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_7fb395de6bde; sha256 63e598219ed36ef17b811e83601e8a439de2890c9b1629315abf424fb2b8391c},
  year = {2026}
}

Archived text

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

To achieve large-scale fault-tolerant quantum computation, it may be easier to combine many small sets of qubits than to construct a single large set. For example via quantum error correction with block codes, or distributed quantum processors utilizing shared entanglement. In these regimes, the time or error budget of the overall quantum computation may be dominated by non-local operations. Hence, it is worthwhile to minimize the number of these operations. We consider the case where both non-local and local connectivity may be arbitrarily restricted, and give an asymptotically optimal synthesis method for distributed CNOT and Clifford circuits, based on block-matrix Gaussian elimination. We extend this to all Clifford+RZ circuits by generalizing the Pauli exponential circuit representation; this naturally integrates with existing methods for optimizing T-count. As an application, we show how to implement CNOT circuits in a CSS code encoding n logical qubits in k blocks using O(nk) inter-block transversal CNOTs and intra-block Pauli measurements.

Tema degli esploratori: fisica e astronomia (retro-catalogo arXiv: annunci del 2026-08-14 in quant-ph).
Categorie arXiv: Quantum Physics (quant-ph).
Pagina del lavoro: https://arxiv.org/abs/2608.13543 — 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-19T04:54:42.532Z dalla pagina https://arxiv.org/catchup/quant-ph/2026-08-14?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).