S. Abramsky and B. Coecke, A categorical semantics of quantum protocols, Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004., pp.415-425
DOI : 10.1109/LICS.2004.1319636

D. Lago, U. Faggian, and C. , On Multiplicative Linear Logic, Modality and Quantum Circuits, Electronic Proceedings in Theoretical Computer Science, vol.95, pp.55-66, 2011.
DOI : 10.4204/EPTCS.95.6
URL : https://hal.archives-ouvertes.fr/hal-00695352

D. Lago, U. Zorzi, and M. , Wave-style token machines and quantum lambda calculi, 2013.

V. Danos and L. Regnier, The structure of multiplicatives, Archive for Mathematical Logic, vol.28, issue.3, pp.181-203, 1989.
DOI : 10.1007/BF01622878

J. Y. 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

J. Y. Girard, Geometry of Interaction 1: Interpretation of System F, Logic Colloquium, vol.88, 1989.
DOI : 10.1016/S0049-237X(08)70271-4

J. Y. Girard, Proof-nets: The parallel syntax for proof-theory. In: Logic and Algebra, pp.97-124, 1996.

N. Gisin, A. A. Methot, and V. Scarani, PSEUDO-TELEPATHY: INPUT CARDINALITY AND BELL-TYPE INEQUALITIES, International Journal of Quantum Information, vol.05, issue.04, pp.525-534, 2007.
DOI : 10.1142/S021974990700289X

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

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

N. Hoshino, A Modified GoI Interpretation for a Linear Functional Programming Language and Its Adequacy, FOSSACS. Lecture Notes in Computer Science, vol.6604, pp.320-334, 2011.
DOI : 10.1007/978-3-642-19805-2_22

O. Laurent, A token machine for full geometry of interaction, pp.283-297, 2001.
URL : https://hal.archives-ouvertes.fr/hal-00009137

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

H. G. Mairson and K. Terui, On the Computational Complexity of Cut-Elimination in Linear Logic, ICTCS. Lecture Notes in Computer Science, vol.2841, pp.23-36, 2003.
DOI : 10.1007/978-3-540-45208-9_4

O. Malherbe, P. Scott, and P. Selinger, Presheaf Models of Quantum Computation: An Outline, Computation, Logic, Games, and Quantum Foundations, pp.178-194, 2013.
DOI : 10.1007/978-3-540-78499-9_7

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

M. A. Nielsen, I. L. Chuang, and B. Omer, Quantum Computation and Quantum Information Quantum programming in QCL, 2000.

J. S. Pinto, ImplantationParalì ele avec la Logique Linéaire (Applications des Réseaux d'Interaction et de la Géométrie de l'Interaction), Main text in English, 2001.

P. Selinger and B. Valiron, Quantum Lambda Calculus, Semantic Techniques in Quantum Computation, pp.135-172, 2009.
DOI : 10.1017/CBO9781139193313.005
URL : https://hal.archives-ouvertes.fr/hal-00483924

K. Terui, Proof nets and Boolean circuits, Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004., pp.182-191
DOI : 10.1109/LICS.2004.1319612

A. Van-tonder, A Lambda Calculus for Quantum Computation, SIAM Journal on Computing, vol.33, issue.5, pp.1109-1135, 2004.
DOI : 10.1137/S0097539703432165