Verification of Distributed Quantum Programs


연구 분야: Cryptography



학회: ACM Transactions on Computational Logic (TOCL), Volume 23, Issue 3


초록

Distributed quantum systems and especially the Quantum Internet have the ever-increasing potential to fully demonstrate the power of quantum computation. This is particularly true given that developing a general-purpose quantum computer is much more difficult than connecting many small quantum devices. One major challenge of implementing distributed quantum systems is programming them and verifying their correctness. In this paper, we propose a CSP-like distributed programming language to facilitate the specification and verification of such systems. After presenting its operational and denotational semantics, we develop a Hoare-style logic for distributed quantum programs and establish its soundness and (relative) completeness with respect to both partial and total correctness. The effectiveness of the logic is demonstrated by its applications in the verification of quantum teleportation and local implementation of non-local CNOT gates, two important algorithms widely used in distributed quantum systems.


Author Profile
Yuan Feng

University of Technology Sydney Broadway Ultimo NSW Australia

Australia
Author Profile
Sanjiang Li

University of Technology Sydney Broadway Ultimo NSW Australia

Australia
Author Profile
Mingsheng Ying

Institute of Software Chinese Academy of Sciences China and Tsinghua University Haidian Beijing China

Andorra

📄 논문 정보

발행 연도 2022년
인용수 8
출판 국가 Australia, Andorra
사이트 ACM
좋아요 수 0

연관 논문 목록 (518건)