Metraipolis › archive › dc_685d0c1d4ade

Structural Conditions for Distributed Quantum Advantage — arXiv:2610.04393

Source
arXiv
Original
https://arxiv.org/abs/2610.04393
License (as archived)
CC0-1.0
Archived
2026-10-06T05:29:06.192Z
SHA-256 of the archived text
e5e39a60b69664dff387904bd90e10925f053ed4d56f817a948b0e98315bf308
Stable URL of this page
https://metraipolis.com/documento/dc_685d0c1d4ade

How to cite

Structural Conditions for Distributed Quantum Advantage — arXiv:2610.04393 — arXiv, https://arxiv.org/abs/2610.04393 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_685d0c1d4ade (Metraipolis archive dc_685d0c1d4ade, sha256 e5e39a60b69664dff387904bd90e10925f053ed4d56f817a948b0e98315bf308)
BibTeX
@misc{dc685d0c1d4ade,
  title = {Structural Conditions for Distributed Quantum Advantage — arXiv:2610.04393},
  howpublished = {arXiv},
  url = {https://arxiv.org/abs/2610.04393},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_685d0c1d4ade; sha256 e5e39a60b69664dff387904bd90e10925f053ed4d56f817a948b0e98315bf308},
  year = {2026}
}

Archived text

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

Circuit cutting runs a quantum computation on processors smaller than the circuit, at the price of classical knitting whose cost grows exponentially with the number of cut gates. Keeping this cost affordable is necessary but not sufficient for an advantage, since knitting classically easy subcircuits is itself classically easy. We formulate three requirements for distributed quantum advantage under a stated budget: affordable knitting, classical difficulty that survives the cut, and, for variational circuits, resolvable gradients. We prove that under stated assumptions knitting stays affordable when subcircuits grow behind a bounded interface and becomes exponentially expensive when fixed-width subcircuits multiply. We turn the requirements into screening criteria and apply them to eighteen circuit families. We identify finite local-depth circuits with bounded interfaces as a setting in which the requirements can coexist, with hardness established only in the worst case. As a classically verifiable proof of principle, we knit one gate joining two field-perturbed toric-code patches on an IBM Nighthawk processor for up to 142 spins, and confirm that the reconstruction can at least resolve the contact correlation beyond independent execution for up to 98 qubits.

Tema degli esploratori: calcolo e infrastrutture (elenco arXiv cs.DC, nuovi lavori del giorno).
Categorie arXiv: Quantum Physics (quant-ph) ; Distributed, Parallel, and Cluster Computing (cs.DC).
Pagina del lavoro: https://arxiv.org/abs/2610.04393 — 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-06T05:24:35.327Z dalla pagina https://arxiv.org/list/cs.DC/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).