J. C. Baeten and W. P. Weijland, Process Algebra, 1990.

C. H. Bennett and G. Brassard, Quantum cryptography: Public key distribution and coin tossing, Proceedings of the IEEE International Conference on Computer , Systems and Signal Processing, pp.175-179, 1984.
DOI : 10.1016/j.tcs.2014.05.025
URL : http://doi.org/10.1016/j.tcs.2014.05.025

T. A. Davidson, Formal Verification Techniques using Quantum Process Calculus, 2011.

Y. Deng and W. Du, Logical, metric, and algorithmic characterisations of probabilistic bisimulation, 2011.

Y. Deng and Y. Feng, Open bisimulation for quantum processes. Full Version of the current paper
DOI : 10.1007/978-3-642-33475-7_9
URL : https://hal.archives-ouvertes.fr/hal-01556225

Y. Deng and M. Hennessy, On the semantics of Markov automata, Proc. ICALP'11, pp.307-318, 2011.

Y. Deng, R. Van-glabbeek, M. Hennessy, and C. Morgan, Testing finitary probabilistic processes (extended abstract), Proc. CONCUR'09, pp.274-288, 2009.
DOI : 10.4204/eptcs.57.5
URL : http://arxiv.org/abs/1107.1201

Y. Feng, R. Duan, and M. Ying, Bisimulation for quantum processes, Proc. POPL'11, pp.523-534, 2011.
DOI : 10.1145/1926385.1926446
URL : https://hal.archives-ouvertes.fr/hal-01556225

C. Fournet and G. Gonthier, A hierarchy of equivalences for asynchronous calculi, The Journal of Logic and Algebraic Programming, vol.63, issue.1, pp.131-173, 2005.
DOI : 10.1016/j.jlap.2004.01.006

S. Gay and R. Nagarajan, Types and typechecking for Communicating Quantum Processes, Mathematical Structures in Computer Science, vol.16, issue.03, pp.375-406, 2006.
DOI : 10.1017/S0960129506005263

S. J. Gay and R. Nagarajan, Communicating quantum processes, Proc. POPL'05, pp.145-157, 2005.
DOI : 10.1145/1040305.1040318
URL : http://arxiv.org/abs/quant-ph/0409052

L. K. Grover, A fast quantum mechanical algorithm for database search, Proceedings of the twenty-eighth annual ACM symposium on Theory of computing , STOC '96, pp.212-219, 1996.
DOI : 10.1145/237814.237866
URL : http://arxiv.org/abs/quant-ph/9605043

L. K. Grover, Quantum Mechanics Helps in Searching for a Needle in a Haystack, Physical Review Letters, vol.54, issue.2, p.325, 1997.
DOI : 10.1103/PhysRevA.54.1034

M. Hennessy, A proof system for communicating processes with value-passing, Formal Aspects of Computing, vol.21, issue.8, pp.346-366, 1991.
DOI : 10.1007/BF01642508

M. Hennessy and A. Ingólfsdóttir, A Theory of Communicating Processes with Value Passing, Information and Computation, vol.107, issue.2, pp.202-236, 1993.
DOI : 10.1006/inco.1993.1067

M. Hennessy and R. Milner, Algebraic laws for nondeterminism and concurrency, Journal of the ACM, vol.32, issue.1, pp.137-161, 1985.
DOI : 10.1145/2455.2460
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.409.1770

C. A. Hoare, Communicating Sequential Processes, 1985.

K. Honda and M. Tokoro, On reduction-based process semantics, Theoretical Computer Science, vol.151, issue.2, pp.437-486, 1995.
DOI : 10.1016/0304-3975(95)00074-7
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.30.9756

A. Jeffrey and J. Rathke, Contextual equivalence for higher-order pi-calculus revisited, Logical Methods in Computer Science, vol.1, issue.1, 2005.
DOI : 10.2168/LMCS-1(1:4)2005
URL : http://arxiv.org/pdf/cs.PL/0503067

P. Jorrand and M. Lalire, Toward a quantum process algebra, Proceedings of the first conference on computing frontiers on Computing frontiers , CF'04, pp.111-119, 2004.
DOI : 10.1145/977091.977108
URL : http://arxiv.org/abs/quant-ph/0312067

M. Lalire, Relations among quantum processes: bisimilarity and congruence, Mathematical Structures in Computer Science, vol.16, issue.03, pp.407-428, 2006.
DOI : 10.1017/S096012950600524X

R. Milner, Communication and Concurrency, 1989.

R. Milner, J. Parrow, and D. Walker, A calculus of mobile processes, Parts I and II. Information and Computation, pp.1-77, 1992.

M. Nielsen and I. Chuang, Quantum computation and quantum information, 2000.

J. Rathke and P. Sobocinski, Deriving structural labelled transitions for mobile ambients, CONCUR'08, pp.462-476, 2008.
DOI : 10.1016/j.ic.2010.06.001
URL : http://doi.org/10.1016/j.ic.2010.06.001

D. Sangiorgi, A theory of bisimulation for the ?-calculus, Acta Informatica, vol.XVI, issue.2, pp.69-97, 1996.
DOI : 10.1016/0304-3975(83)90114-7

D. Sangiorgi, N. Kobayashi, and E. Sumii, Environmental bisimulations for higherorder languages, Proc. LICS'07, pp.293-302, 2007.
DOI : 10.1145/1889997.1890002
URL : https://hal.archives-ouvertes.fr/hal-01337665

D. Sangiorgi and D. Walker, The ?-calculus: a Theory of Mobile Processes, 2001.

P. W. Shor, Algorithms for quantum computation: discrete log and factoring, Proc. FOCS'94, pp.124-134, 1994.
DOI : 10.1109/sfcs.1994.365700
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.47.3862

M. Ying, Y. Feng, R. Duan, and Z. Ji, An algebra of quantum processes, ACM Transactions on Computational Logic, vol.10, issue.3, pp.1-36, 2009.
DOI : 10.1145/1507244.1507249