Skip to content
DraconiticResearch
Search Sources API
190,869 studies31 sourcesUpdated 44 min ago
PreprintarXiv licencearXiv

Reasoning about Shared-Qubit Concurrency in Quantum Computing

  • Mingsheng Ying
Open at sourcePDFDOICite

Abstract

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.

Related

  1. Reasoning about Continuous-Variable Quantum Systems
    Tianshi Yu, Gilles Barthe, Minbo Gao +2
    arXivPreprintCC BY 4.0Full textAnalysis & PDEsQuantum physics & quantum informationarXiv
  2. The convergent laboratory: when AI reasoning, autonomous experiments, high performance and quantum computing reshape chemistry
    Eliu Huerta, Xiaoyun Wang, Geetika Gupta +7
    arXivPreprintarXiv licenceFull textCondensed matterarXiv
  3. Shared and structured inputs undermine collective random choice by reasoning AI agents
    Takahiro Ezaki, Naoto Imura, Katsuhiro Nishinari
    arXivPreprintarXiv licenceFull textStatistical & nonlinear physicsarXiv
  4. Quantum computing and quantum optics with recoiled free electrons
    Maxim Sirotin, Andrei Rasputnyi, Tomáš Chlouba +2
    Physical Review ResearchPeer-reviewedCC BY 4.0Atomic, molecular & optical physicsCrossrefAPS
  5. Lowering the implementation barrier of neutral-atom quantum computing with agentic workflows
    Constantin Dalyac, Alexandre Dauphin, Loïc Henriet +1
    HALPreprintLicence not statedQuantum physics & quantum informationHAL

Cite

BibTeXRIS
BibTeX
@misc{ying2026reasoning,
  title = {{Reasoning about Shared-Qubit Concurrency in Quantum Computing}},
  author = {Mingsheng Ying},
  howpublished = {arXiv},
  year = {2026},
  month = nov,
  doi = {10.48550/arxiv.2611.04274},
  eprint = {2611.04274},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2611.04274},
}
RIS
TY  - UNPB
TI  - Reasoning about Shared-Qubit Concurrency in Quantum Computing
AU  - Mingsheng Ying
PY  - 2026
DA  - 2026/11/03
PB  - arXiv
DO  - 10.48550/arxiv.2611.04274
UR  - https://arxiv.org/abs/2611.04274
AB  - 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.
ER  -