Skip to main content
Springer Nature Link
Log in

An Axiomatization for Quantum Processes to Unifying Quantum and Classical Computing

  • Published:
International Journal of Theoretical Physics Aims and scope Submit manuscript

Abstract

We establish an axiomatization for quantum processes, which is a quantum generalization of process algebra ACP (Algebra of Communicating Processes). We use the framework of a quantum process configuration 〈p, ϱ〉, but we treat it as two relative independent part: the structural part p and the quantum part ϱ, because the establishment of a sound and complete theory is dependent on the structural properties of the structural part p. We let the quantum part ϱ be the outcomes of execution of p to examine and observe the function of the basic theory of quantum mechanics. We establish not only a strong bisimilarity for quantum processes, but also a weak bisimilarity to model the silent step and abstract internal computations in quantum processes. The relationship between quantum bisimilarity and classical bisimilarity is established, which makes an axiomatization of quantum processes possible. An axiomatization for quantum processes called qACP is designed, which involves not only quantum information, but also classical information and unifies quantum computing and classical computing. qACP can be used easily and widely for verification of most quantum communication protocols.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. Baeten, J.C.M.: A brief history of process algebra. Theor. Comput. Sci. In. Process. Algebra 335(2–3), 131–146 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  2. Milner, R.: Communication and Concurrency. Prentice Hall, Upper Saddle River (1989)

    MATH  Google Scholar 

  3. Milner, R., Parrow, J., Walker, D.: A calculus of mobile processes, Parts I and II. Inf. Comput. 1992(100), 1–77 (1992)

    Article  MATH  Google Scholar 

  4. Hoare, C.A.R.: Communicating sequential processes. http://www.usingcsp.com/ (1985)

  5. Fokkink, W.: Introduction to Process Algebra, 2nd edn. Springer, Berlin (2007)

    MATH  Google Scholar 

  6. Plotkin, G.D.: A structural approach to operational semantics. Aarhus University, Tech. Report DAIMIFN-19 (1981)

  7. Baeten, J.C.M., Bergstra, J.A., Klop, J.W.: On the consistency of Koomen’s fair abstraction rule. Theor. Comput. Sci. 51(1/2), 129–176 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  8. Feng, Y., Duan, R.Y., Ji, Z.F., Ying, M.: Probabilistic bisimulations for quantum processes. Inf. Comput. 205(2007), 1608–1639 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  9. Gay, S.J., Nagarajan, R.: Communicating quantum processes. In: Proceedings of the 32nd ACM Symposium on Principles of Programming Languages, Long Beach, California, USA, pp. 145–157. ACM Press (2005)

  10. Gay, S.J., Nagarajan, R.: Typechecking communicating quantum processes. Math. Struct. Comput. Sci. 2006(16), 375–406 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  11. Jorrand, P., Lalire, M.: Toward a quantum process algebra. In: Proceedings of the 1st ACM Conference on Computing Frontiers, Ischia, Italy, pp. 111–119. ACM Press (2005)

  12. Jorrand, P., Lalire, M.: From quantum physics to programming languages: a process algebraic approach. Lect. Notes Comput. Sci 2005(3566), 1–16 (2005)

    Google Scholar 

  13. Lalire, M.: Relations among quantum processes: bisimilarity and congruence. Math. Struct. Comput. Sci. 2006(16), 407–428 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  14. Lalire, M., Jorrand, P.: A process algebraic approach to concurrent and distributed quantum computation: operational semantics. In: Proceedings of the 2nd International Workshop on Quantum Programming Languages, pp. 109–126 (2004)

  15. Ying, M., Feng, Y., Duan, R., Ji, Z.: An algebra of quantum processes. ACM Trans. Comput. Log. (TOCL) 10(3), 1–36 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  16. Hennessy, M., Lin, H.: Symbolic bisimulations. Theor. Comput. Sci. 138(2), 353–389 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  17. Feng, Y., Duan, R., Ying, M.: Bisimulations for quantum processes. In: Proceedings of the 38th ACM Symposium on Principles of Programming Languages (POPL 11), pp. 523–534. ACM Press (2011)

  18. Bennett, C.H., Brassard, G.: Quantum cryptography: Public-key distribution and coin tossing. In: Proceedings of the IEEE International Conference on Computer, Systems and Signal Processing, pp. 175–179 (1984)

  19. Deng, Y., Feng, Y.: Open bisimulation for quantum processes. Manuscript, arXiv:1201.0416 (2012)

  20. Feng, Y., Deng, Y., Ying, M.: Symbolic bisimulation for quantum processes. Manuscript, arXiv:1202.3484 (2012)

  21. Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information. Cambridge University Press, Cambridge (2000)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. College of Computer Science and Technology, Faculty of Information Technology, Beijing University of Technology, Beijing, China

    Yong Wang

Authors
  1. Yong Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yong Wang.

Additional information

Publisher’s Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Wang, Y. An Axiomatization for Quantum Processes to Unifying Quantum and Classical Computing. Int J Theor Phys 58, 3295–3322 (2019). https://doi.org/10.1007/s10773-019-04204-6

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10773-019-04204-6

Keywords

Search

Navigation