pith. sign in

arxiv: quant-ph/0504007 · v2 · submitted 2005-04-01 · 🪐 quant-ph · cs.LO

Probabilistic Model--Checking of Quantum Protocols

classification 🪐 quant-ph cs.LO
keywords quantumprotocolssystemstechniquesanalysesapproachbasiccommunication
0
0 comments X
read the original abstract

We establish fundamental and general techniques for formal verification of quantum protocols. Quantum protocols are novel communication schemes involving the use of quantum-mechanical phenomena for representation, storage and transmission of data. As opposed to quantum computers, quantum communication systems can and have been implemented using present-day technology; therefore, the ability to model and analyse such systems rigorously is of primary importance. While current analyses of quantum protocols use a traditional mathematical approach and require considerable understanding of the underlying physics, we argue that automated verification techniques provide an elegant alternative. We demonstrate these techniques through the use of PRISM, a probabilistic model-checking tool. Our approach is conceptually simpler than existing proofs, and allows us to disambiguate protocol definitions and assess their properties. It also facilitates detailed analyses of actual implemented systems. We illustrate our techniques by modelling a selection of quantum protocols (namely superdense coding, quantum teleportation, and quantum error correction) and verifying their basic correctness properties. Our results provide a foundation for further work on modelling and analysing larger systems such as those used for quantum cryptography, in which basic protocols are used as components.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Verification of Quantum Protocols Adopting Physically Admissible Schedulers

    cs.LO 2026-04 unverdicted novelty 7.0

    lqCCS provides scheduled semantics for quantum processes using physically admissible schedulers, yielding a bisimilarity that is adequate for indistinguishable quantum mixtures and a congruence for parallel composition.