2015
DOI: 10.1007/s00500-015-1802-6
|View full text |Cite
|
Sign up to set email alerts
|

Deriving the correctness of quantum protocols in the probabilistic logic for quantum programs

Abstract: This paper presents a sound axiomatization for a probabilistic modal dynamic logic of quantum programs. The logic can express whether a state is separable or entangled, information that is local to a subsystem of the whole quantum system, and the probability of positive answers to quantum tests of certain properties. The power of this axiomatization is demonstrated with proofs of properties concerning bases of a finite-dimensional Hilbert space, composite systems, entangled and separable states, and with proof… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
7
0

Year Published

2017
2017
2024
2024

Publication Types

Select...
4
3
2

Relationship

1
8

Authors

Journals

citations
Cited by 10 publications
(7 citation statements)
references
References 30 publications
0
7
0
Order By: Relevance
“…In complexity theory, Hilbert quantum logic provides an example of an N P R -complete (Blum-Shub-Smale complete) problem; see [55]. While the classical quantum logics express relationships among static testable properties of a quantum system, the Logic of Quantum Programs (LQP) provides a more dynamic approach capable of describing non-probabilistic properties of quantum programs (see [56] and [57]). Putting logic into a different context, one could introduce Logical Bell Inequalities (see [58], especially sections IA and IB).…”
Section: Qist In Mathematics Coursesmentioning
confidence: 99%
“…In complexity theory, Hilbert quantum logic provides an example of an N P R -complete (Blum-Shub-Smale complete) problem; see [55]. While the classical quantum logics express relationships among static testable properties of a quantum system, the Logic of Quantum Programs (LQP) provides a more dynamic approach capable of describing non-probabilistic properties of quantum programs (see [56] and [57]). Putting logic into a different context, one could introduce Logical Bell Inequalities (see [58], especially sections IA and IB).…”
Section: Qist In Mathematics Coursesmentioning
confidence: 99%
“…In particular, they make use of the probabilistic logic of quantum programs to provide a formal specification of the quantum voting protocol for anonymous surveying with its correctness. Applications to quantum key distribution protocol and to quantum leader election protocol, that aims to randomly select a leader in a group of agents, are shown in [17].…”
Section: Inputmentioning
confidence: 99%
“…Axioms of epistemic logic are valid because is an equivalence relation. The validity of axioms of probability can be found in [ 21 ]. The rules MP and US are valid in all logical systems.…”
Section: Categorical Logic For Quantum Programsmentioning
confidence: 99%
“…The logic for quantum programs (LQP) [ 17 , 18 , 19 , 20 , 21 ] is an extension of traditional quantum logic and quantum Hoare logic. It has been used to verify quantum search algorithms [ 20 ], quantum leader election [ 20 ], quantum key distribution [ 21 ] and quantum voting [ 22 ]. The expressive power of LQP is largely determined by the constant symbols it incorporates.…”
Section: Introductionmentioning
confidence: 99%