Verification of Distributed Quantum Programs
arXiv:2104.14796 · doi:10.1145/3517145
Abstract
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.
arXiv commentarXiv admin note: text overlap with arXiv:2008.06812
References in corpus (11)
- The Quantum Internet
- Purification of Noisy Entanglement and Faithful Teleportation via Noisy Channels
- Quantum Teleportation is a Universal Computational Primitive
- Advances in Quantum Teleportation
- Realization of a multi-node quantum network of remote solid-state qubits
- Optimal local implementation of non-local quantum gates
- Towards a Distributed Quantum Computing Ecosystem
- Asymptotic teleportation scheme as a universal programmable quantum processor
- Towards Large-Scale Quantum Networks
- Quantum Hoare logic with classical variables
- Toward Automatic Verification of Quantum Programs