Deriving the correctness of quantum protocols in the probabilistic logic for quantum programs
From MaRDI portal
Publication:1701681
DOI10.1007/s00500-015-1802-6zbMath1387.81146OpenAlexW1853605859WikidataQ59612997 ScholiaQ59612997MaRDI QIDQ1701681
Joshua Sack, Jort Martinus Bergfeld
Publication date: 27 February 2018
Published in: Soft Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00500-015-1802-6
Quantum computation (81P68) Logical foundations of quantum mechanics; quantum logic (quantum-theoretic aspects) (81P10) Quantum logic (03G12)
Related Items
Holistic and compositional logics based on the Bertini gate, A logical analysis of quantum voting protocols
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Editors' introduction: The third life of quantum logic: Quantum logic inspired by quantum computing
- Model checking quantum Markov chains
- PLQP \& Company: decidable logics for quantum algorithms
- Quantum cryptography: public key distribution and coin tossing
- Duality for the logic of quantum actions
- Complete axiomatizations for quantum actions
- Propositional dynamic logic of regular programs
- Semantic analysis of orthologic
- A logic for reasoning about probabilities
- Reasoning in quantum theory. Sharp and unsharp quantum logics.
- Weakly complete axiomatization of exogenous quantum propositional logic
- The logic of quantum mechanics
- Finite Dimensional Hilbert Spaces are Complete for Dagger Compact Closed Categories (Extended Abstract)
- Quantum Probabilistic Dyadic Second-Order Logic
- Categorical quantum mechanics
- Dagger Compact Closed Categories and Completely Positive Maps
- Finite dimensional Hilbert spaces are complete for dagger compact closed categories
- Exact Quantum Algorithms for the Leader Election Problem
- Reasoning about knowledge and probability
- Quantum weakest preconditions
- LQP: the dynamic logic of quantum information
- An axiomatic basis for computer programming
