Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1201.0891 · Acta Informatica

Termination of nondeterministic quantum programs

Yangjia Li, Nengkun Yu, Mingsheng Ying

Published Oct 29, 2013• 30 citations
arXivHTMLPDF
DOI
10.1007/s00236-013-0185-3

Related papers

Implementing termination analysis on quantum programming

Shusen Liu, Kan He, Runyao Duan

Science China Information Sciences•Nov 11, 2019•1 citation

Reachability and Termination Analysis of Concurrent Quantum Programs

Nengkun Yu, Mingsheng Ying

arXiv:1206.1935•Lecture notes in computer science•Jan 1, 2012•32 citations

Quantum Nondeterministic Computation

Giuseppe Castagnoli, Dalida Monti

International Journal of Theoretical Physics•Mar 1, 2000•3 citations

Verification of Nondeterministic Quantum Programs

Yuan Feng, Yingte Xu

Nondeterministic choice is a useful program construct that provides a way to describe the behaviour of a program without specifying the details of possible implementations. It supports the stepwise refinement of programs, a method that has proven useful in software development. Nondeterminism has also been introduced in quantum programming, and termination of nondeterministic quantum programs has been extensively analysed. In this paper, we go beyond termination analysis to investigate the verification of nondeterministic quantum programs where properties are given by sets of hermitian operators on the associated Hilbert space. Hoare-type logic systems for partial and total correctness are proposed which turn out to be both sound and relatively complete with respect to their corresponding semantic correctness. To show the utility of these proof systems, we analyse some quantum algorithms such as quantum error correction scheme, Deutsch algorithm, and a nondeterministic quantum walk. Finally, a proof assistant prototype is implemented to aid in the automated reasoning of nondeterministic quantum programs.

arXiv:2302.07973•International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS)•Mar 20, 2023•17 citations

两类量子游走组成的非确定型量子程序的终止验证 (Verification of Termination for Nondeterministic Quantum Programs Constituted by Two Kinds of Quantum Walks).

Lei Hong-xuan

计算机科学•Jan 1, 2015•0 citations

Analysis of quantum programs

Mingsheng Ying

Elsevier eBooks•Jan 1, 2024•4 citations
Nondeterministic choice is a useful program construct that provides a way to describe the behaviour of a program without specifying the details of possible implementations. It supports the stepwise refinement of programs, a method that has proven useful in software development. Nondeterminism has also been introduced in quantum programming, and termination of nondeterministic quantum programs has been extensively analysed. In this paper, we go beyond termination analysis to investigate the verification of nondeterministic quantum programs where properties are given by sets of hermitian operators on the associated Hilbert space. Hoare-type logic systems for partial and total correctness are proposed which turn out to be both sound and relatively complete with respect to their corresponding semantic correctness. To show the utility of these proof systems, we analyse some quantum algorithms such as quantum error correction scheme, Deutsch algorithm, and a nondeterministic quantum walk. Finally, a proof assistant prototype is implemented to aid in the automated reasoning of nondeterministic quantum programs.