Dynamic Quantum Logic for Quantum Programs

  title={Dynamic Quantum Logic for Quantum Programs},
  author={Olivier Brunet and Philippe Jorrand},
  journal={International Journal of Quantum Information},
  • O. Brunet, P. Jorrand
  • Published 20 November 2003
  • Philosophy, Physics, Computer Science
  • International Journal of Quantum Information
We present a way to apply quantum logic to the study of quantum programs. This is made possible by using an extension of the usual propositional language in order to make transformations performed on the system appear explicitly. This way, the evolution of the system becomes part of the logical study. We show how both unitary operations and two-valued measurements can be included in this formalism and can thus be handled logically. 

Figures from this paper

The Logic of Quantum Programs
A dynamic logic that is capable of dealing with quantum measurements, unitary evolutions and entanglements in compound quantum systems is introduced and a sound proof system for this logic is presented.
A Logic for Formal Verification of Quantum Programs
This paper provides a Hoare-style logic for quantum computation that proves properties of well-known algorithms and is an extension of the probabilistic Hoare -style logic defined by den Hartog.
Quantum programming: From theories to implementations
This paper surveys the new field of programming methodology and techniques for future quantum computers, including design of sequential and concurrent quantum programming languages, their semantics
Toward automatic verification of quantum programs
  • M. Ying
  • Computer Science
    Formal Aspects of Computing
  • 2018
This paper summarises the results obtained by the author and his collaborators in a program logic approach to the verification of quantum programs, including quantum Hoare logic, invariant generation
A Logic for Recursive Quantum Programs
This paper presents a logic for recursive quantum programs, an extension of quantum Hoare logic for quantum While-programs, and its effectiveness is shown by a running example: fixed-point Grover's search.
Quantum Temporal Logic
A model of quantum concurrent program is introduced, which can be used to model the behaviour of reactive quantum systems and to design quantum compilers, and a quantum Bohm-Jacopini theorem is proved which states that any such program is equivalent to a Q-While program.
A Quantum Interpretation of Bunched Logic & Quantum Separation Logic
A model of the substructural logic of Bunched Implications that is suitable for reasoning about quantum states and develops a program logic where pre- and post-conditions are BI formulas describing quantum states.
Hoare Logic for Quantum Programs
It is proved that this logic is (relatively) complete by exploiting the power of weakest preconditions and weakest liberal precondition for quantum programs.
Representation Systems, Orthoposets and Quantum Logic
A special form of these structures is used to define a method for decomposing orthoposets into boolean algebras, in such a way that it permits to consider more properties about a quantum system than using usual methods.
Quantum programming languages: survey and bibliography
  • S. Gay
  • Computer Science
    Mathematical Structures in Computer Science
  • 2006
The study of quantum Programming languages is justified, the basics of quantum computing are presented, the literature in quantum programming languages is surveyed, and directions for future research are indicated.


Quantum gates and circuits
  • D. DiVincenzo
  • Physics
    Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences
  • 1998
A historical review is given of the emergence of the idea of the quantum logic gate from the theory of reversible Boolean gates. I highlight the quantum XOR or controlled NOT as the fundamental
Can Quantum-Mechanical Description of Physical Reality be Considered Complete?
It is shown that a certain "criterion of physical reality" formulated in a recent article with the above title by A. Einstein, B. Podolsky and N. Rosen contains an essential ambiguity when it is
Quantum Logic
  • K. Svozil
  • Art
    Discrete mathematics and theoretical computer science
  • 1998
When reading the PDF, the author is very reliable in using the words to create sentences, and the ways how the author creates the diction to influence many people will be seen.
The Logic of Quantum Mechanics
One of the aspects of quantum theory which has attracted the most general attention, is the novelty of the logical notions which it presupposes. It asserts that even a complete mathematical
Teleportation as a quantum computation
On the Foundations of Quantum Physics
The interpretation of quantum theory has always been a source of difficulties, especially with regard to the theory of measurement. We do not intend to enter here into the details of the polemic
Elementary gates for quantum computation.
U(2) gates are derived, which derive upper and lower bounds on the exact number of elementary gates required to build up a variety of two- and three-bit quantum gates, the asymptotic number required for n-bit Deutsch-Toffoli gates, and make some observations about the number of unitary operations on arbitrarily many bits.
Quantum Computation and Quantum Information
This chapter discusses quantum information theory, public-key cryptography and the RSA cryptosystem, and the proof of Lieb's theorem.
The Structure and Interpretation of Quantum Mechanics
Preface Introduction. The Stern-Gerlach Experiment PART I THE STRUCTURE OF QUANTUM THEORY 1. Vector Spaces Vectors Operators Eigenvectors and Eigenvalues Inner Products of Vectors in R2 Complex
Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels.
An unknown quantum state \ensuremath{\Vert}\ensuremath{\varphi}〉 can be disassembled into, then later reconstructed from, purely classical information and purely nonclassical Einstein-Podolsky-Rosen