K. De-leeuw and E. F. Moore, Computability by Probabilistic Machines, Automata Studies, 1955.
DOI : 10.1515/9781400882618-010

M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information: 10th Anniversary Edition, 2011.
DOI : 10.1017/CBO9780511976667

G. L. Miller, Riemann's hypothesis and tests for primality, STOC, pp.234-239, 1975.
DOI : 10.1145/800116.803773

M. O. Rabin, Probabilistic algorithm for testing primality, Journal of Number Theory, vol.12, issue.1, pp.128-138, 1980.
DOI : 10.1016/0022-314X(80)90084-0
URL : https://doi.org/10.1016/0022-314x(80)90084-0

P. W. Shor, Algorithms for quantum computation: discrete logarithms and factoring, Proceedings 35th Annual Symposium on Foundations of Computer Science, pp.124-134, 1994.
DOI : 10.1109/SFCS.1994.365700
URL : http://csdl.computer.org/comp/proceedings/sfcs/1994/6580/00/0365700.pdf

J. D. Whitfield, J. Biamonte, and A. Aspuru-guzik, Simulation of electronic structure Hamiltonians using quantum computers, Molecular Physics, vol.8, issue.5, pp.735-750, 2011.
DOI : 10.1063/1.3115177
URL : http://arxiv.org/pdf/1001.3855

A. W. Harrow, A. Hassidim, and S. Lloyd, Quantum Algorithm for Linear Systems of Equations, Physical Review Letters, vol.42, issue.15, p.150502, 2009.
DOI : 10.1137/S0895479803436202

D. Kozen, Semantics of probabilistic programs, Journal of Computer and System Sciences, vol.22, issue.3, pp.328-350, 1981.
DOI : 10.1016/0022-0000(81)90036-2
URL : https://doi.org/10.1016/0022-0000(81)90036-2

G. Plotkin, Probabilistic powerdomains, CAAP, 1982.

S. J. Gay, Quantum programming languages: survey and bibliography, Mathematical Structures in Computer Science, vol.16, issue.04, pp.581-600, 2006.
DOI : 10.1017/S0960129506005378

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

A. S. Green and P. Lefanu-lumsdaine, Quipper: A scalable quantum programming language, PLDI, pp.333-342, 2013.

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
URL : http://www.monoidal.net/papers/qcpm-draft.pdf

J. Girard, Linear logic, Theoretical Computer Science, vol.50, issue.1, pp.1-102, 1987.
DOI : 10.1016/0304-3975(87)90045-4
URL : https://hal.archives-ouvertes.fr/inria-00075966

S. Abramsky, R. Jagadeesan, and P. Malacaria, Full Abstraction for PCF, Information and Computation, vol.163, issue.2, pp.409-470, 2000.
DOI : 10.1006/inco.2000.2930
URL : https://doi.org/10.1006/inco.2000.2930

J. M. Hyland and C. Ong, On Full Abstraction for PCF: I, II, and III, Information and Computation, vol.163, issue.2, pp.285-408, 2000.
DOI : 10.1006/inco.2000.2917
URL : https://doi.org/10.1006/inco.2000.2917

J. Girard, Geometry of interaction I: Interpretation of system F. Logic Colloquium 88, 1989.

Y. Lafont, Logiques, catégories et machines, 1988.

P. Mellì-es, Categorical semantics of linear logic. Panoramas et Synthèses, 2009.

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

I. Hasuo and N. Hoshino, Semantics of higher-order quantum computation via geometry of interaction, LICS, pp.237-246, 2011.

Y. Delbecque, Quantum games as quantum types, 2009.

Y. Delbecque and P. Panangaden, Game Semantics for Quantum Stores, Electronic Notes in Theoretical Computer Science, vol.218, pp.153-170, 2008.
DOI : 10.1016/j.entcs.2008.10.010
URL : http://doi.org/10.1016/j.entcs.2008.10.010

U. , D. Lago, and M. Zorzi, Wave-style token machines and quantum lambda calculi, LINEARITY, pp.64-78, 2014.

U. Dal-lago, C. Faggian, I. Hasuo, and A. Yoshimizu, The geometry of synchronization, Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), CSL-LICS '14, pp.1-3510, 2014.
DOI : 10.1145/2603088.2603154
URL : https://hal.archives-ouvertes.fr/hal-01091560

V. Danos and L. Regnier, Reversible, irreversible and optimal ??-machines, Theoretical Computer Science, vol.227, issue.1-2, pp.79-97, 1999.
DOI : 10.1016/S0304-3975(99)00049-3
URL : https://doi.org/10.1016/s0304-3975(99)00049-3

I. Mackie, The geometry of interaction machine, Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '95, pp.198-208, 1995.
DOI : 10.1145/199448.199483

U. Dal-lago, C. Faggian, B. Valiron, and A. Yoshimizu, Parallelism and synchronization in an infinitary context, LICS, pp.559-572, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01231813

U. Dal-lago, C. Faggian, B. Valiron, and A. Yoshimizu, The geometry of parallelism: Classical, probabilistic, and quantum effects, POPL, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01474620

I. Mackie, Applications of the Geometry of Interaction to language implementation, 1994.

D. R. Ghica, A. Smith, and S. Singh, Geometry of synthesis IV, ICFP, pp.221-233, 2011.
DOI : 10.1145/2034574.2034805

S. Abramsky, E. Haghverdi, and P. J. Scott, Geometry of Interaction and linear combinatory algebras, Mathematical Structures in Computer Science, vol.12, issue.05, pp.625-665, 2002.
DOI : 10.1017/S0960129502003730

T. Ehrhard, C. Tasson, and M. Pagani, Probabilistic coherence spaces are fully abstract for probabilistic PCF, Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL '14, pp.309-320, 2014.
DOI : 10.1145/2535838.2535865

V. Danos, R. Harmer-muroya, and I. Hasuo, Probabilistic game semantics, CSL-LICS, pp.359-382, 2002.
DOI : 10.1145/507382.507385

S. Staton, Algebraic effects, linearity, and quantum programming languages, POPL, pp.395-406, 2015.
DOI : 10.1145/2676726.2676999

B. Coecke, R. Duncan, A. Kissinger, and Q. Wang, Strong Complementarity and Non-locality in Categorical Quantum Mechanics, 2012 27th Annual IEEE Symposium on Logic in Computer Science, pp.245-254, 2012.
DOI : 10.1109/LICS.2012.35
URL : http://arxiv.org/pdf/1203.4988

D. R. Ghica, Geometry of synthesis: a structured approach to VLSI design, POPL, pp.363-375, 2007.

K. Muroya, N. Hoshino, and I. Hasuo, Memoryful geometry of interaction II: recursion and adequacy, POPL, pp.748-760, 2016.
DOI : 10.1145/2914770.2837672

M. Bezem and J. W. Klop, Term Rewriting Systems, volume 55 of Cambridge Tracts in Theoretical Computer Science, chapter Abstract Reduction Systems, 2003.

A. Pitts, Nominal Sets: Names and Symmetry in Computer Science, 2013.
DOI : 10.1017/CBO9781139084673

U. Dal-lago, C. Faggian, B. Valiron, and A. Yoshimizu, The geometry of parallelism: Classical, probabilistic, and quantum effects (long version ) Available at https://arxiv.org/abs, 1610.