Skip to main content
SpringerLink
Log in

Implementing termination analysis on quantum programming

  • Research Paper
  • Published:
Science China Information Sciences Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Bourdoncle F. Abstract debugging of higher-order imperative languages. SIGPLAN Not, 1993, 28: 46–55

    Article  Google Scholar 

  2. Cook B, Podelski A, Rybalchenko A. Termination proofs for systems code. In: Proceedings of the 27th ACM SIGPLAN Conference on Programming Language Design and Implementation, 2006. 415–426

  3. Brockschmidt M, Cook B, Ishtiaq S, et al. T2: temporal property verification. In: Proceedings of International Conference on Tools and Algorithms for the Construction and Analysis of Systems, 2016. 387–393

  4. Ying M S. Foundations of quantum programming. In: Proceedings of the 8th Asian Conference on Programming Languages and Systems, 2010

  5. Ying M S, Feng Y. Quantum loop programs. Acta Inform, 2010, 47: 221–250

    Article  MathSciNet  MATH  Google Scholar 

  6. Ying M S, Yu N K, Feng Y, et al. Verification of quantum programs. Sci Comput Program, 2013, 78: 1679–1700

    Article  Google Scholar 

  7. Li Y J, Yu N K, Ying M S. Termination of nondeterministic quantum programs. Acta Inform, 2014, 51: 1–24

    Article  MathSciNet  MATH  Google Scholar 

  8. Yu N K, Ying M S. Reachability and termination analysis of concurrent quantum programs. In: Proceedings of International Conference on Concurrency Theory, 2012. 69–83

  9. Li Y J, Ying M S. Algorithmic analysis of termination problems for quantum programs. In: Proceedings of ACM on Programming Languages, 2017

  10. Horn A R, Johnson R C. Matrix Analysis. Cambridge: Cambridge University Press, 1990

    MATH  Google Scholar 

  11. Paulsen V. Completely Bounded Maps and Operator Algebras. Cambridge: Cambridge University Press, 2002

    MATH  Google Scholar 

  12. Beelen T, van Dooren P M. Computational aspects of the Jordan canonical form. In: Reliable Numerical Computation. Oxford: Clarendon Press, 1990. 57–72

    Google Scholar 

  13. Liu S S, Zhou L, Guan J, et al. Q|SI〉: a quantum programming environment (in Chinese). Sci Sin Inform, 2017, 47: 1300–1315

    Article  Google Scholar 

Download references

Acknowledgements

This work was supported by National Natural Science Foundation of China (Grant Nos. 61672007, 11771011, 11647140). We were grateful to Ying DONG for his helpful dicussions.

Author information

Authors and Affiliations

  1. School of Data and Computer Science, Sun Yat-sen University, Guangzhou, 510006, China

    Shusen Liu

  2. Institute for Quantum Computing, Baidu, Beijing, 100193, China

    Shusen Liu & Runyao Duan

  3. Institute for Advanced Study, Tsinghua University, Beijing, 100084, China

    Shusen Liu

  4. College of Mathematics & College of Information and Computer Science, Taiyuan University of Technology, Taiyuan, 030024, China

    Kan He

Authors
  1. Shusen Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kan He
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Runyao Duan
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to Shusen Liu or Kan He.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Liu, S., He, K. & Duan, R. Implementing termination analysis on quantum programming. Sci. China Inf. Sci. 62, 222501 (2019). https://doi.org/10.1007/s11432-018-9847-0

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s11432-018-9847-0

Keywords

Search

Navigation