Modelling and Simulation of Quantum Teleportation and Dense Coding Using Predicate/Transition-Nets

Authors:
Kimmo Varpaaniemi;Leo Ojala
Affiliations:
(Correspd.) Space Systems Finland Ltd., Kappelitie 6, FI-02200 Espoo, Finland. kimmo.varpaaniemi@kolumbus.fi;Laboratory for Theoretical Computer Science, Helsinki University of Technology, P.O. Box 5400, FI-02015 TKK, Finland. leo.ojala@tkk.fi
Venue:
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Year:
2008

Citing 5
Cited 0

Predicate/transition nets

Advances in Petri nets 1986, part I on Petri nets: central models and their properties
Quantum computation and quantum information

Quantum computation and quantum information
prod 3.2: An Advanced Tool for Efficient Reachability Analysis

CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Reasoning about quantum knowledge

FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Optimal synthesis of multiple output Boolean functions using a set of quantum gates by symbolic reachability analysis

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Reachability analysis is one of the most successful methods used in design and validation of protocols for classical communication, whereas the predicate/transition-net formalism is one of the most appropriate formalisms for reachability analysis oriented modelling. Quantum teleportation and dense coding are non-classical communication protocols that have been widely researched in the field of quantum computing. In this article, we present predicate/transitionnet models of these two protocols and use the PROD reachability analysis tool for analysing the models.