English

LQP: The Dynamic Logic of Quantum Information

Quantum Physics 2021-10-05 v1 Logic in Computer Science

Abstract

The main contribution of this paper is the introduction of a dynamic logic formalism for reasoning about information flow in composite quantum systems. This builds on our previous work on a complete quantum dynamic logic for single systems. Here we extend that work to a sound (but not necessarily complete) logic for composite systems, which brings together ideas from the quantum logic tradition with concepts from (dynamic) modal logic and from quantum computation. This Logic of Quantum Programs (LQP) is capable of expressing important features of quantum measurements and unitary evolutions of multi-partite states, as well as giving logical characterisations to various forms of entanglement (for example, the Bell states, the GHZ states etc.). We present a finitary syntax, a relational semantics and a sound proof system for this logic. As applications, we use our system to give formal correctness proofs for the Teleportation protocol and for a standard Quantum Secret Sharing protocol; a whole range of other quantum circuits and programs, including other well-known protocols (for example, superdense coding, entanglement swapping, logic-gate teleportation etc.), can be similarly verified using our logic.

Keywords

Cite

@article{arxiv.2110.01361,
  title  = {LQP: The Dynamic Logic of Quantum Information},
  author = {Alexandru Baltag and Sonja Smets},
  journal= {arXiv preprint arXiv:2110.01361},
  year   = {2021}
}

Comments

45 pages, this paper is a revision and extension of Baltag and Smets' paper on 'The Logic of Quantum Programs'. The paper on 'The Logic of Quantum Programs' appeared in the proceedings of QPL2004, the 2nd International Workshop on Quantum Programming Languages (TUCS General Publication No 33, Turku Center for Computer Science, 2004). arXiv admin note: text overlap with arXiv:2109.06792