The Logic of Quantum Programs
- URL: http://arxiv.org/abs/2109.06792v1
- Date: Tue, 14 Sep 2021 16:08:37 GMT
- Title: The Logic of Quantum Programs
- Authors: Alexandru Baltag and Sonja Smets
- Abstract summary: We present a logical calculus for reasoning about information flow in quantum programs.
In particular we introduce a dynamic logic that is capable of dealing with quantum measurements, unitary evolutions and entanglements in compound quantum systems.
- Score: 77.34726150561087
- License: http://creativecommons.org/licenses/by-nc-nd/4.0/
- Abstract: We present a logical calculus for reasoning about information flow in quantum
programs. In particular we introduce a dynamic logic that is capable of dealing
with quantum measurements, unitary evolutions and entanglements in compound
quantum systems. We give a syntax and a relational semantics in which we
abstract away from phases and probabilities. We present a sound proof system
for this logic, and we show how to characterize by logical means various forms
of entanglement (e.g. the Bell states) and various linear operators. As an
example we sketch an analysis of the teleportation protocol.
Related papers
- A Quantum Algorithm for Computing All Diagnoses of a Switching Circuit [73.70667578066775]
Faults are by nature while most man-made systems, and especially computers, work deterministically.
This paper provides such a connecting via quantum information theory which is an intuitive approach as quantum physics obeys probability laws.
arXiv Detail & Related papers (2022-09-08T17:55:30Z) - Abstract interpretation, Hoare logic, and incorrectness logic for
quantum programs [6.2147758224415055]
Hoare logic, and incorrectness (or reverse Hoare) logic are powerful techniques for static analysis of computer programs.
We show that any complete quantum abstract interpretation induces a quantum Hoare logic and a quantum incorrectness logic.
arXiv Detail & Related papers (2022-06-28T05:49:55Z) - Birkhoff-von Neumann Quantum Logic as an Assertion Language for Quantum
Programs [1.1878820609988696]
A first-order logic with quantum variables is needed as an assertion language for specifying and reasoning about various properties of quantum programs.
In this paper, we introduce a first-order extension of Birkhoff-von Neumann quantum logic with universal and existential quantifiers over quantum variables.
arXiv Detail & Related papers (2022-05-04T08:57:44Z) - LQP: The Dynamic Logic of Quantum Information [77.34726150561087]
This paper introduces a dynamic logic formalism for reasoning about information flow in composite quantum systems.
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 for the Teleportation protocol and for a standard Quantum Secret Sharing protocol.
arXiv Detail & Related papers (2021-10-04T12:20:23Z) - Conjugate Logic [0.0]
We propose a conjugate logic that can capture the behavior of quantum and quantum-like systems.
The proposed logic will include propositions and their relations including connectives.
A key point is the addition of a transformation that allows to convert propositions about single systems into propositions about correlations between systems.
arXiv Detail & Related papers (2021-02-12T15:19:11Z) - A Quantum Interpretation of Bunched Logic for Quantum Separation Logic [22.507329566323982]
We develop a program logic where pre- and post-conditions are BI formulas describing quantum states.
We exercise the logic for proving the security of quantum one-time pad and secret sharing.
arXiv Detail & Related papers (2021-01-30T22:24:36Z) - Information Scrambling in Computationally Complex Quantum Circuits [56.22772134614514]
We experimentally investigate the dynamics of quantum scrambling on a 53-qubit quantum processor.
We show that while operator spreading is captured by an efficient classical model, operator entanglement requires exponentially scaled computational resources to simulate.
arXiv Detail & Related papers (2021-01-21T22:18:49Z) - Quantum walk processes in quantum devices [55.41644538483948]
We study how to represent quantum walk on a graph as a quantum circuit.
Our approach paves way for the efficient implementation of quantum walks algorithms on quantum computers.
arXiv Detail & Related papers (2020-12-28T18:04:16Z) - PBS-Calculus: A Graphical Language for Coherent Control of Quantum
Computations [77.34726150561087]
We introduce the PBS-calculus to represent and reason on quantum computations involving coherent control of quantum operations.
We equip the language with an equational theory, which is proved to be sound and complete.
We consider applications like the implementation of controlled permutations and the unrolling of loops.
arXiv Detail & Related papers (2020-02-21T16:15:58Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.