Skip to main content
Article thumbnail
Location of Repository

Model checking quantum protocols

By Nikolaos K. Papanikolaou

Abstract

This thesis describes model checking techniques for protocols arising in quantum information\ud theory and quantum cryptography. We discuss the theory and implementation of a practical\ud model checker, QMC, for quantum protocols. In our framework, we assume that the quantum\ud operations performed in a protocol are restricted to those within the stabilizer formalism; while\ud this particular set of operations is not universal for quantum computation, it allows us to develop\ud models of several useful protocols as well as of systems involving both classical and quantum\ud information processing. We detail the syntax, semantics and type system of QMC’s modelling\ud language, the logic QCTL which is used for verification, and the verification algorithms that have\ud been implemented in the tool. We demonstrate our techniques with applications to a number of\ud case studies

Topics: QA76
OAI identifier: oai:wrap.warwick.ac.uk:2236

Suggested articles

Citations

  1. A Categorical Semantics of Quantum Protocols”. In: doi
  2. A Short Introduction to Quantum Information and Quantum Computation. doi
  3. Abstract Physical Traces”. In: doi
  4. Communication Via One- and Two-Particle Operators on Einstein–Podolsky–Rosen States”. In: Physical Review Letters doi
  5. Design and Synthesis of Synchronization Skeletons Using Branching Time Temporal Logic”. doi
  6. e Complexity Zoo. URL: http :
  7. e Logic of Quantum Mechanics”. In: doi
  8. e temporal logic of branching time”. doi
  9. Entanglement on mixed stabiliser states: Normal Forms and Reduction Procedures”. In: doi
  10. Fast Simulation of Stabilizer Circuits Using A Graph State Representation”. In: Physical Review A . doi
  11. Formal Methods for Specification and Analysis of Communication Protocols”. In: doi
  12. Formal Methods Wiki. URL: http://formalmethods.wikia.com/. See p.
  13. Introduction to the ISO Specification Language LOTOS”. In: doi
  14. Logical reversibility of computation”. In: doi
  15. On Probabilistic Computation Tree Logic.” In: doi
  16. Physical Traces: Quantum vs. Classical Information Processing”. In:
  17. PrinciplesofQuantumComputationandInformation: Basic Concepts. doi
  18. PrinciplesofQuantumComputationandInformation: Basic Tools and Special Topics. doi
  19. Privacy amplification by public discussion”. In: doi
  20. Quantum Bit Commitment and Coin Tossing Protocols”. In: doi
  21. Quantum Complexity eory”. In: doi
  22. Quantum computation tree logic – model checking and complete calculus”. In: doi
  23. Quantum Computing and Communications”. In: doi
  24. Quantum Cryptography: Public Key Distribution and Coin Tossing”. In: doi
  25. Quantum eory.
  26. Quantum mechanical Hamiltonian models of Turing machines that dissipate no energy”. doi
  27. Reactive modules”. doi
  28. Secret-key reconciliation by public discussion”. doi
  29. StabilizerQuantum ErrorCorrectingCodes. Lecture Notes for course CSE d (Quantum Computing),
  30. Teleporting an Unknown Quantum State Via Dual Classical and Einstein–Podolsky–Rosen Channels”. doi
  31. Type Systems”. In: doi

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.