Implementing termination analysis on quantum programming
- Publication Type:
- Journal Article
- Citation:
- Science China Information Sciences, 2019, 62 (12)
- Issue Date:
- 2019-12-01
Closed Access
| Filename | Description | Size | |||
|---|---|---|---|---|---|
| Liu2019_Article_ImplementingTerminationAnalysi.pdf | Published Version | 202.67 kB |
Copyright Clearance Process
- Recently Added
- In Progress
- Closed Access
This item is closed access and not available.
© 2019, Science China Press and Springer-Verlag GmbH Germany, part of Springer Nature. Termination analysis is an essential part in programming. Especially quantum programming concerning measurement, entanglement and even superposition are the foundations of bizarre behaviours in quantum programs. In this paper, we analyse and extend the theoretical theorems on termination analysis proposed by Ying et al. into computational theorems and algorithms. The new algorithm without the Jordan decomposition process has a significant acceleration with polynomial complexity both on terminating and almost-surely terminating programs. Moreover, the least upper bound of termination programs steps is studied and utilized to output the substituted matrix representation of quantum programs. We also implement four groups of experiments to illustrate the advantages of the new algorithm in case of processing a simplified quantum walk example comparing with the original counterpart.
Please use this identifier to cite or link to this item: