Abstract
We have unified quantum and classical computing in open quantum systems called qACP which is a quantum generalization of process algebra ACP. But, an axiomatization of quantum and classical processes with an assumption of closed quantum systems is still missing. For closed quantum systems, unitary operator, quantum measurement and quantum entanglement are three basic components of quantum computing. This leads to probability unavoidable. Along the solution of qACP to unify quantum and classical computing in open quantum systems, we unify quantum and classical computing with an assumption of closed systems under the framework of ACP-like probabilistic process algebra. This unification make it can be used widely in verification of quantum and classical computing mixed systems, such as most quantum communication protocols.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.References
Baeten, J.C.M.: A brief history of process algebra. Theor. Comput. Sci. Process Algebra 335(2–3), 131–146 (2005)
Milner, R.: Communication and Concurrency. Prentice Hall, Englewood Cliffs (1989)
Hoare, C.A.R.: Communicating sequential processes. http://www.usingcsp.com/ (1985)
Fokkink, W.: Introduction to Process Algebra, 2nd edn. Springer, Berlin (2007)
Andova, S.: Probabilistic process algebra. Ann. Oper. Res. 128, 204–219 (2002)
Feng, Y., Duan, R.Y., Ji, Z.F., Ying, M.S.: Probabilistic bisimulations for quantum processes. Inf. Comput. 2007(205), 1608–1639 (2007)
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)
Gay, S.J., Nagarajan, R.: Typechecking communicating quantum processes. Math. Struct. Comput. Sci. 2006(16), 375–406 (2006)
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)
Jorrand, P., Lalire, M.: From quantum physics to programming languages: a process algebraic approach. Lect. Notes Comput. Sci 2005(3566), 1–16 (2005)
Lalire, M.: Relations among quantum processes: bisimilarity and congruence. Math. Struct. Comput. Sci. 2006(16), 407–428 (2006)
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. TUCS General Publications (2004)
Ying, M., Feng, Y., Duan, R., Ji, Z.: An algebra of quantum processes. ACM Trans. Comput. Logic (TOCL) 10(3), 1–36 (2009)
Hennessy, M., Lin, H.: Symbolic bisimulations. Theor. Comput. Sci. 138(2), 353–389 (1995)
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)
Deng, Y., Feng, Y.: Open bisimulation for quantum processes. Manuscript, arXiv:1201.0416 (2012)
Feng, Y., Deng, Y., Ying, M.: Symbolic bisimulation for quantum processes. Manuscript, arXiv:1202.3484 (2012)
Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information. Cambridge University Press, Cambridge (2000)
Wang, Y.: An axiomatization for quantum processes to unifying quantum and classical computing. Submitted to ACM TOCL, arXiv:1311.2960 (2016)
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)
Ekert, A.K.: Quantum cryptography based on Bell’s theorem. Phys. Rev. Lett. 67(6), 661–663 (1991)
Plotkin, G.D.: A structural approach to operational semantics. Aarhus University, Tech Report DAIMIFN-19 (1981)
Wang, Y.: Entanglement in quantum process algebra. Submitted to FAOC, arXiv:1404.0665 (2016)
Bennett, C.H., Brassard, G., Crepeau, C., Jozsa, R., Peres, A., Wootters, W.: Teleporting an unknown quantum state via dual classical and epr channels. Phys. Rev. Lett. 70, 1895–1899 (1993)
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher’s Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Wang, Y. Probabilistic Process Algebra to Unifying Quantum and Classical Computing in Closed Systems. Int J Theor Phys 58, 3436–3509 (2019). https://doi.org/10.1007/s10773-019-04216-2
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10773-019-04216-2