Probabilistic Model--Checking of Quantum Protocols
arXiv:quant-ph/0504007
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.
15 pages + 2 page appendix
References in corpus (3)
Cited by in corpus (12)
- Analysis of the Security of BB84 by Model Checking
- A Theorem Prover for Quantum Hoare Logic and Its Applications
- Model Checking Quantum Systems --- A Survey
- An Algebraic Method to Fidelity-based Model Checking over Quantum Markov Chains
- Symbolic bisimulation for quantum processes
- Model-Checking Linear-Time Properties of Quantum Systems
- QMC: A Model Checker for Quantum Systems
- Logic Column 13: Reasoning Formally about Quantum Systems: An Overview
- Quantum Büchi Automata
- From Information Theory Puzzles in Deletion Channels to Deniability in Quantum Cryptography
- Model Checking Quantum Continuous-Time Markov Chains
- Formal Verification using Second-Quantized Horn Clauses