Quantum weakest preconditions

DOI10.1017/S0960129506005251zbMath1122.68058arXivquant-ph/0501157OpenAlexW2121087903MaRDI QIDQ5482269

Ellie D'Hondt, Prakash Panangaden

Publication date: 28 August 2006

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/quant-ph/0501157

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum computation (81P68)

Related Items

Reachability analysis of quantum Markov decision processes ⋮ A Lambda Calculus for Density Matrices with Classical and Probabilistic Controls ⋮ Commutativity of quantum weakest preconditions ⋮ The expectation monad in quantum foundations ⋮ Natural Quantum Operational Semantics with Predicates ⋮ Semantics for a quantum programming language by operator algebras ⋮ Eigenlogic in the spirit of George Boole ⋮ Infinite-Dimensionality in Quantum Foundations: W*-algebras as Presheaves over Matrix Algebras ⋮ Dijkstra and Hoare monads in monadic computation ⋮ Abstract interpretation, Hoare logic, and incorrectness logic for quantum programs ⋮ Deriving the correctness of quantum protocols in the probabilistic logic for quantum programs ⋮ Unnamed Item ⋮ Healthiness conditions for predicate transformers ⋮ Termination of nondeterministic quantum programs ⋮ Toward automatic verification of quantum programs ⋮ The monoidal structure of Turing machines ⋮ Quantum loop programs ⋮ Generalised quantum weakest preconditions ⋮ Complete positivity and natural representation of quantum computations ⋮ A proof system for disjoint parallel quantum programs ⋮ Distributed Measurement-based Quantum Computation ⋮ Dagger Compact Closed Categories and Completely Positive Maps

This page was built for publication: Quantum weakest preconditions