S. Abramsky, The lazy lambda calculus, Research Topics in Functional Programming, pp.65-116, 1999.

R. Crubillé and U. D. Lago, On probabilistic applicative bisimulation and callby-value ?-calculi, ESOP'14, pp.209-228, 2014.

D. Lago and A. Rioli, Applicative bisimulation and quantum ?-calculi (long version). CoRR, abs/1506, p.6661, 2015.

D. Lago, D. Sangiorgi, and M. Alberti, On coinductive equivalences for higher-order probabilistic functional programs, POPL'14, pp.297-308, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01091573

A. S. Timothy and . Davidson, Formal verification techniques using quantum process calculus, 2011.

. Deng, Semantics of Probabilistic Processes: An Operational Approach, 2014.
DOI : 10.1007/978-3-662-45198-4

R. Deng, M. Van-glabbeek, C. Hennessy, and . Morgan, Testing finitary probabilistic processes (extended abstract), CONCUR'09, pp.274-288, 2009.

Y. Deng and Y. Zhang, Program equivalence in linear contexts, Theoretical Computer Science, vol.585, pp.71-90, 2015.
DOI : 10.1016/j.tcs.2015.03.006

J. Desharnais, Labelled Markov Processes, 1999.

Y. Feng, M. Deng, and . Ying, Symbolic Bisimulation for Quantum Processes, ACM Transactions on Computational Logic, vol.15, issue.2, pp.1-32, 2014.
DOI : 10.1145/2579818

Y. Feng, R. Duan, Z. Ji, and M. Ying, Probabilistic bisimulations for quantum processes, Information and Computation, vol.205, issue.11, pp.1608-1639, 2007.
DOI : 10.1016/j.ic.2007.08.001

R. Feng, M. Duan, and . Ying, Bisimulation for quantum processes, ACM Transactions on Programming Languages and Systems, vol.34, issue.4, p.17, 2012.

Y. Feng and L. Zhang, When Equivalence and Bisimulation Join Forces in Probabilistic Automata, FM'14, pp.247-262, 2014.
DOI : 10.1007/978-3-319-06410-9_18

A. M. Gordon, A Tutorial on Co-induction and Functional Programming, Glasgow Workshop on Functional Programming, pp.78-95, 1995.
DOI : 10.1007/978-1-4471-3573-9_6

A. S. Green, P. L. Lumsdaine, N. J. Ross, P. Selinger, and B. Valiron, Quipper: a scalable quantum programming language, PLDI'13, pp.333-342, 2013.

K. Lov and . Grover, A fast quantum mechanical algorithm for database search, STOC'96, pp.212-219, 1996.

K. Lov and . Grover, Quantum mechanics helps in searching for a needle in a haystack, Physical Review Letters, vol.79, pp.325-328, 1997.

H. Hermanns, J. Krcál, and J. Kretínský, Probabilistic Bisimulation: Naturally on Distributions, CONCUR'14, pp.249-265, 2014.
DOI : 10.1007/978-3-662-44584-6_18

D. J. Howe, Proving Congruence of Bisimulation in Functional Programming Languages, Information and Computation, vol.124, issue.2, pp.103-112, 1996.
DOI : 10.1006/inco.1996.0008

E. Knill, Conventions for quantum pseudocode, 1996.
DOI : 10.2172/366453

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

G. Kim, A. Larsen, and . Skou, Bisimulation through probabilistic testing, Information and Computation, vol.94, issue.1, pp.1-28, 1991.

J. H. Morris, Lambda Calculus Models of Programming Languages, 1969.

M. Pagani, P. Selinger, and B. Valiron, Applying quantitative semantics to higher-order quantum computing, Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL '14, pp.647-658, 2014.
DOI : 10.1145/2535838.2535879

A. M. Pitts, Operationally-Based Theories of Program Equivalence, Semantics and Logics of Computation, pp.241-298, 1997.
DOI : 10.1017/CBO9780511526619.007

A. M. Pitts, Howe's method for higher-order languages, Advanced Topics in Bisimulation and Coinduction, pp.197-232, 2011.
DOI : 10.1017/CBO9780511792588.006

J. Sack and L. Zhang, A General Framework for Probabilistic Characterizing Formulae, VMCAI'12, pp.396-411, 2012.
DOI : 10.2140/pjm.1955.5.285

P. Selinger, Towards a quantum programming language, Mathematical Structures in Computer Science, vol.14, issue.4, pp.527-586, 2004.
DOI : 10.1017/S0960129504004256

P. Selinger and B. Valiron, A lambda calculus for quantum computation with classical control, Mathematical Structures in Computer Science, vol.16, issue.03, pp.527-552, 2006.
DOI : 10.1017/S0960129506005238

URL : https://hal.archives-ouvertes.fr/hal-00483924

P. Selinger and B. Valiron, A linear-non-linear model for a computational call-byvalue lambda calculus (extended abstract), FOSSACS'08, pp.81-96, 2008.

P. Selinger and B. Valiron, On a fully abstract model for a quantum linear functional language (extended abstract) Electronic Notes in Theoretical Computer Science, pp.123-137, 2008.

W. Peter and . Shor, Algorithms for quantum computation: Discrete logarithms and factoring Domain theory, testing and simulation for labelled markov processes, FOCS'94 33 Franck van Breugel, Michael W. Mislove, Joël Ouaknine, and James Worrell, pp.124-134171, 1994.

D. Wecker and K. M. Svore, LIQUi|>: A software design architecture and domainspecific language for quantum computing. CoRR, abs/1402, 2014.

M. Ying, Quantum recursion and second quantisation: Basic ideas and examples. CoRR, abs/1405, 2014.