An algebra of quantum processes

ACM Transactions on Computational Logic

Volumn 10, Issue 3, 2009, Pages

  Ying, Mingsheng ^a,b   Feng, Yuan ^a,b   Duan, Runyao ^a,b   Ji, Zhengfeng ^c,d  

^a TSINGHUA UNIVERSITY   (China)

^b UNIVERSITY OF TECHNOLOGY SYDNEY   (Australia)

^c INSTITUTE OF GEOLOGY AND GEOPHYSICS   (China)

^d INSTITUTE OF SOFTWARE   (China)

Author keywords

Bisimulation; Process algebra; Quantum communication; Quantum computation; Super operator

Indexed keywords

BISIMULATION; PROCESS ALGEBRA; QUANTUM COMMUNICATION; QUANTUM COMPUTATION; SUPER-OPERATOR;

COMMUNICATION; COMPUTATIONAL LINGUISTICS; QUANTUM COMPUTERS; QUANTUM ELECTRONICS; QUANTUM OPTICS;

ALGEBRA;

EID: 67249141506     PISSN: 15293785     EISSN: 1557945X     Source Type: Journal    
DOI: 10.1145/1507244.1507249     Document Type: Article

References (21)

1. BUZEK,V. AND HILLERY, M. 1996. Quantum copying: Beyond the no-cloning theorem. Phys. Rev. A54,1844-1852.
2. D'HONDT, E. 2005. Distributed quantum computation: A measurement-based approach. Ph.D. thesis, Vrije Universiteit Brussel.
3. DIEKS, D. 1982. Communication by EPR devices. Phys. Lett. A 92,271-272.
4. FENG, Y., DUAN, R. Y., JI,Z.F., AND YING, M. S. 2007. Probabilistic bisimulations for quantum processes. Inf. Comput. 205,1608-1639.
5. GAY,S.J. AND NAGARAJAN, R. 2005. Communicating quantum processes. In Proceedings of the 32nd ACM Symposium on Principles of Programming Languages.ACM Press, 145-157.
6. GAY,S. J. AND NAGARAJAN, R. 2006. Typechecking communicating quantum processes. Math. Structures Comput. Sci. 16,375-406.
7. JORRAND,P. AND LALIRE, M. 2004. From quantum physics to programming languages: A process algebraic approach. In Proceedings of the International Workshop on Unconventional Programming Paradigms. J. P. Banatre et al. Eds., Revised Selected and Invited Papers, Lecture Notes in Computer Science, vol. 3566, Springer, 2005, 1-16.
8. JORRAND,P. AND LALIRE, M. 2005. Toward a quantum process algebra. In Proceedings of the 1st ACM Conference on Computing Frontiers. ACM Press, 111-119.
9. JOSZA,R. AND LINDEN, N. 2003. On the role of entanglement in quantum computational speed-up. Proc. Roy. Soc. Lond. A 459,2011-2032.
10. KITAEV, A. 1997. Quantum computations: Algorithms and error-correction. Russian Math. Surv. 52,1191-1249.
11. LALIRE, M. 2006. Relations among quantum processes: Bisimilarity and congruence. Math. Structures Comput. Sci. 16,407-428.
12. LALIRE,M. AND JORRAND, P. 2004. A process algebraic approach to concurrent and distributed quantum computation: Operational semantics. In Proceedings of the 2nd International Workshop on Quantum Programming Languages,P. Selinger, Ed. TUCS General Publications 33, 109-126.
13. MILNER, R. 1989. Communication and Concurrency.Prentice Hall, New York.
14. MILNER, R., PARROW,J., AND WALKER, D. 1992. A calculus of mobile processes, Parts i and ii. Inf. Comput. 100,1-77.
15. NIELSEN,M.A. AND CHUANG, I. L. 2000. Quantum Computation and Quantum Information.Cambridge University Press, Cambridge.
16. SELINGER, P. 2004. Towards a quantum programming language. Math. Structures Comput. Sci. 14,527-586.
17. WOOTTERS,W. K. AND ZUREK, W. H. 1982. A single quantum cannot be cloned. Nature 299,802-803.
18. YING, M. S. 2001. Topology in Process Calculus: Approximate Correctness and Infinite Evolution of Concurrent Programs. Springer, New York.
19. YING, M. S. 2002. Bisimulation indexes and their applications. Theor. Comput. Sci. 275,1-68.
20. YING,M.S. AND WIRSING, M. 2000. Approximate bisimilarity. In Proceedings of the 8th International Conference on Algebraic Methodology and Software Technology (AMAST'00).T. Rus, Ed. Lecture Notes in Computer Science, vol. 1816, Springer, 309-322.
21. BREUGEL, F. V. 2005. A behavioural pseudometric for metric labelled transition systems. In Proceedings of the International Conference on Concurrency Theory.Lecture Notes in Computer Science, vol. 3653. Springer, 141-155.