Metraipolis › archive › dc_75f1d9c4eaaa

Reasoning about Shared-Qubit Concurrency in Quantum Computing — arXiv:2611.04274

Source: arXiv (en)
Original: https://arxiv.org/abs/2611.04274
License (as archived): CC0-1.0
Archived: 2026-11-04T21:45:49.744Z
SHA-256 of the archived text: 0f6f16bcd549e451d27eeda7d373a4b9c08a047cc0f701e57aa124cecb86e957
Stable URL of this page: https://metraipolis.com/documento/dc_75f1d9c4eaaa

How to cite

Reasoning about Shared-Qubit Concurrency in Quantum Computing — arXiv:2611.04274 — arXiv (en), https://arxiv.org/abs/2611.04274 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_75f1d9c4eaaa (Metraipolis archive dc_75f1d9c4eaaa, sha256 0f6f16bcd549e451d27eeda7d373a4b9c08a047cc0f701e57aa124cecb86e957)

BibTeX

@misc{dc75f1d9c4eaaa,
  title = {Reasoning about Shared-Qubit Concurrency in Quantum Computing — arXiv:2611.04274},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.04274},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_75f1d9c4eaaa; sha256 0f6f16bcd549e451d27eeda7d373a4b9c08a047cc0f701e57aa124cecb86e957},
  year = {2026}
}

Archived text

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

In this paper, we develop a semantic model for the parallel execution of quantum circuits, providing a formal foundation for studying shared-qubit concurrency in quantum computing. As in classical shared-memory concurrency, parallel quantum circuits may interfere with one another through operations on shared qubits. However, quantum entanglement and the noncommutativity of quantum operations introduce additional challenges for reasoning about their correctness. To address these challenges, we generalise the classical Owicki-Gries method to quantum computing at the level of quantum circuits. Our approach enables compositional reasoning about parallel quantum circuits by separating the verification of individual components from the analysis of interference between them. We formulate proof rules for establishing the correctness of parallel quantum circuits and prove their soundness with respect to the proposed semantic model.

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); Logic in Computer Science (cs.LO); Programming Languages (cs.PL).
Pagina del lavoro: https://arxiv.org/abs/2611.04274 — 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-11-04T21:36:19.403Z dalla pagina https://arxiv.org/list/cs.DC/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).