Reasoning About Imperative Quantum Programs

Authors:
R. Chadha;P. Mateus;A. Sernadas
Affiliations:
CLC, Department of Mathematics, Instituto Superior Técnico, Lisbon, Portugal;CLC, Department of Mathematics, Instituto Superior Técnico, Lisbon, Portugal;CLC, Department of Mathematics, Instituto Superior Técnico, Lisbon, Portugal
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2006

Citing 18
Cited 5

Probabilistic logic

Artificial Intelligence
A logic for reasoning about probabilities

Information and Computation - Selections from 1988 IEEE symposium on logic in computer science
Decidability and expressiveness for first-order logics of probability

Information and Computation
Probabilistic predicate transformers

ACM Transactions on Programming Languages and Systems (TOPLAS)
An axiomatic basis for computer programming

Communications of the ACM
Quantum computation and quantum information

Quantum computation and quantum information
Dynamic Logic

Dynamic Logic
Quantum Programming

MPC '00 Proceedings of the 5th International Conference on Mathematics of Program Construction
Quantitative Analysis and Model Checking

LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
Knowledge in quantum systems

Proceedings of the 9th conference on Theoretical aspects of rationality and knowledge
Formalizing the analysis of algorithms.

Formalizing the analysis of algorithms.
Toward a quantum process algebra

Proceedings of the 1st conference on Computing frontiers
A Categorical Semantics of Quantum Protocols

LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
Communicating quantum processes

Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A Functional Quantum Programming Language

LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
LQP: the dynamic logic of quantum information

Mathematical Structures in Computer Science
Weakly complete axiomatization of exogenous quantum propositional logic

Information and Computation
A lambda calculus for quantum computation with classical control

TLCA'05 Proceedings of the 7th international conference on Typed Lambda Calculi and Applications

Reasoning about Entanglement and Separability in Quantum Higher-Order Functions

UC '09 Proceedings of the 8th International Conference on Unconventional Computation
Foundations of quantum programming

APLAS'10 Proceedings of the 8th Asian conference on Programming languages and systems
Floyd--hoare logic for quantum programs

ACM Transactions on Programming Languages and Systems (TOPLAS)
Reasoning about states of probabilistic sequential programs

CSL'06 Proceedings of the 20th international conference on Computer Science Logic
A logic for formal verification of quantum programs

ASIAN'09 Proceedings of the 13th Asian conference on Advances in Computer Science: information Security and Privacy

Quantified Score

Hi-index	0.00

Visualization

Abstract

A logic for reasoning about states of basic quantum imperative programs is presented. The models of the logic are ensembles obtained by attaching probabilities to pairs of quantum states and classical states. The state logic is used to provide a sound Hoare-style calculus for quantum imperative programs. The calculus is illustrated by proving the correctness of the Deutsch algorithm.