{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,15]],"date-time":"2026-02-15T09:12:39Z","timestamp":1771146759575,"version":"3.50.1"},"reference-count":0,"publisher":"Cambridge University Press (CUP)","issue":"3","license":[{"start":{"date-parts":[[2006,7,4]],"date-time":"2006-07-04T00:00:00Z","timestamp":1151971200000},"content-version":"unspecified","delay-in-days":33,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Struct. Comp. Sci."],"published-print":{"date-parts":[[2006,6]]},"abstract":"<jats:p>The main contribution of this paper is the introduction of a <jats:italic>dynamic logic<\/jats:italic> formalism for reasoning about information flow in <jats:italic>composite<\/jats:italic> quantum systems. This builds on our previous work on a <jats:italic>complete<\/jats:italic> quantum dynamic logic for <jats:italic>single<\/jats:italic> systems. Here we extend that work to a <jats:italic>sound<\/jats:italic> (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 <jats:italic>Logic of Quantum Programs<\/jats:italic> (<jats:italic>LQP<\/jats:italic>) 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 <jats:italic>GHZ<\/jats:italic> 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.<\/jats:p>","DOI":"10.1017\/s0960129506005299","type":"journal-article","created":{"date-parts":[[2006,7,5]],"date-time":"2006-07-05T22:51:59Z","timestamp":1152139919000},"page":"491-525","source":"Crossref","is-referenced-by-count":66,"title":["LQP: the dynamic logic of quantum information"],"prefix":"10.1017","volume":"16","author":[{"given":"ALEXANDRU","family":"BALTAG","sequence":"first","affiliation":[]},{"given":"SONJA","family":"SMETS","sequence":"additional","affiliation":[]}],"member":"56","published-online":{"date-parts":[[2006,7,4]]},"container-title":["Mathematical Structures in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0960129506005299","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,3]],"date-time":"2019-04-03T19:15:48Z","timestamp":1554318948000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0960129506005299\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,6]]},"references-count":0,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2006,6]]}},"alternative-id":["S0960129506005299"],"URL":"https:\/\/doi.org\/10.1017\/s0960129506005299","relation":{},"ISSN":["0960-1295","1469-8072"],"issn-type":[{"value":"0960-1295","type":"print"},{"value":"1469-8072","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,6]]}}}