Equational reasoning about quantum protocols

Gay, S. J. and Puthoor, I. V. (2015) Equational reasoning about quantum protocols. Lecture Notes in Computer Science, 9138, pp. 155-170. (doi: 10.1007/978-3-319-20860-2_10)

[img]
Preview
Text
109016.pdf - Accepted Version

487kB

Abstract

Communicating Quantum Processes (CQP) is a quantum process calculus that applies formal techniques from classical computer science to concurrent and communicating systems that combine quantum and classical computation. By employing the theory of behavioural equivalence between processes, it is possible to verify the correctness of a system in CQP. The equational theory of CQP helps us to analyse quantum systems by reducing the need to explicitly construct bisimulation relations. We add three new equational axioms to the existing equational theory of CQP, which helps us to analyse various quantum protocols by proving that the implementation and specification are equivalent. We summarise the necessary theory and demonstrate its application in the analysis of quantum secret sharing. Also, we illustrate the approach by verifying other interesting and important practical quantum protocols such as superdense coding, quantum error correction and remote CNOT.

Item Type:Articles
Additional Information:ISBN: 9783319208596
Status:Published
Refereed:Yes
Glasgow Author(s) Enlighten ID:Gay, Professor Simon
Authors: Gay, S. J., and Puthoor, I. V.
College/School:College of Science and Engineering > School of Computing Science
Journal Name:Lecture Notes in Computer Science
Publisher:Springer International Publishing
ISSN:0302-9743
Copyright Holders:Copyright © 2015 Springer International Publishing
First Published:First published in Lecture Notes in Computer Science 9138:155-170
Publisher Policy:Reproduced in accordance with the copyright policy of the publisher

University Staff: Request a correction | Enlighten Editors: Update this record