Termination of nondeterministic quantum programs

DOI10.1007/s00236-013-0185-3zbMath1359.68092arXiv1201.0891OpenAlexW2016769804MaRDI QIDQ2453979

Yangjia Li, Nengkun Yu, Ming Sheng Ying

Publication date: 12 June 2014

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1201.0891

Mathematics Subject Classification ID

Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items (2)

Semantic Analysis of a Linear Temporal Extension of Quantum Logic and Its Dynamic Aspect ⋮ Toward automatic verification of quantum programs

Uses Software

• QPL
• qGCL
• QML

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Quantum loop programs
• Proof rules for the correctness of quantum programs
• Compiling quantum programs
• Counterfactual computation
• Simulating and Compiling Code for the Sequential Quantum Random Access Machine
• DYNAMIC QUANTUM LOGIC FOR QUANTUM PROGRAMS
• Termination of Probabilistic Concurrent Program
• Towards a quantum programming language
• Quantum walks on graphs
• Communicating quantum processes
• Functional and Logic Programming
• Bisimulation for quantum processes
• Quantum programming languages: survey and bibliography
• Quantum weakest preconditions
• LQP: the dynamic logic of quantum information

This page was built for publication: Termination of nondeterministic quantum programs