S. Abramsky, Computational interpretations of linear logic, Theoretical Computer Science, vol.111, issue.1-2, pp.3-57, 1993.
DOI : 10.1016/0304-3975(93)90181-R

S. Abramsky and B. Coecke, A categorical semantics of quantum protocols LICS, IEEE Computer Society, pp.415-425, 2004.

L. Adleman, J. Demarrais, and M. Huang, Quantum Computability, SIAM Journal on Computing, vol.26, issue.5, pp.1524-1540, 1997.
DOI : 10.1137/S0097539795293639

P. Arrighi and G. Dowek, A computational definition of the notion of vector space, ENTCS, vol.117, pp.249-261, 2005.

P. Arrighi and G. Dowek, Linear-algebraic lambda-calculus, International workshop on quantum programming languages, pp.21-38, 2004.
URL : https://hal.archives-ouvertes.fr/hal-00010131

P. Arrighi and G. Dowek, Linear-algebraic lambda-calculus: higher-order, encodings, confluence, arXiv:quant-ph, 612199.
DOI : 10.1007/978-3-540-70590-1_2
URL : http://arxiv.org/pdf/quant-ph/0612199v1.pdf

P. Arrighi and G. Dowek, On the critical pairs of a rewrite system for vector spaces, available on the web page of the authors, see www-roc.inria.fr, 2012.

P. Arrighi and A. Díaz-caro, Scalar System F for Linear-Algebraic ??-Calculus: Towards a Quantum Physical Logic, Proceedings of the 6th International Workshop on Quantum Physics and Logic, pp.206-215, 2009.
DOI : 10.1016/j.entcs.2011.01.033
URL : https://hal.archives-ouvertes.fr/hal-00924890

P. Arrighi and A. Díaz-caro, A System F accounting for scalars, Logical Methods in Computer Science, vol.8, issue.1, 2009.
DOI : 10.2168/LMCS-8(1:11)2012
URL : https://hal.archives-ouvertes.fr/hal-00924944

P. Arrighi and L. Vaux, Embedding Algebraic Lambda-calculus into Lineal, 2009.

E. Bernstein and U. Vazirani, Quantum Complexity Theory, Annual ACM symposium on Theory of Computing, 1993.

G. Birkhoff, On the Structure of Abstract Algebras, Proc. Cambridge Phil. Soc., 31, 1935.

G. Boudol, Lambda-calculi for (strict) parallel functions, Information and Computation, pp.51-127, 1994.

O. Bournez and M. Hoyrup, Rewriting Logic and Probabilities, Rewriting Techniques and Applications, LNCS 2706, 2003.

P. Boykin, T. Mor, M. Pulver, V. Roychowdhury, and F. Vatan, On universal and fault-taulerant quantum computing, p.9906054

D. Cohen and P. Watson, An efficient representation of arithmetic for term rewriting, Proc. of the 4th Conference on Rewrite Techniques and Applications
DOI : 10.1007/3-540-53904-2_100

N. Dershowitz and J. Jouannaud, Rewrite systems, Handbook of theoretical computer science: formal models and semantics, 1991.

D. Deutsch and R. Josza, Rapid Solution of Problems by Quantum Computation, Proc. of the Roy. Soc. of London A, pp.553-558, 1992.
DOI : 10.1098/rspa.1992.0167

A. Díaz-caro, S. Perdrix, C. Tasson, and B. , Valiron Equivalence of Algebraic ?calculi, 2010.

A. Díaz-caro and B. Petit, From Additive Logic to Linear Logic, 2010.

D. Dougherty, Adding algebraic rewriting to the untyped lambda calculus, Proc. of the Fourth International Conference on Rewriting Techniques and Applications, 1992.
DOI : 10.1016/0890-5401(92)90064-M

T. Ehrhard and L. Regnier, The differential lambda-calculus, Theoretical Computer Science, vol.309, issue.1-3, pp.1-41, 2003.
DOI : 10.1016/S0304-3975(03)00392-X
URL : https://hal.archives-ouvertes.fr/hal-00150572

T. Ehrhard, Finiteness spaces, Mathematical Structures in Computer Science, vol.15, issue.4, pp.615-646, 2005.
DOI : 10.1017/S0960129504004645
URL : https://hal.archives-ouvertes.fr/hal-00150276

T. Ehrhard, A Finiteness Structure on Resource Terms, 2010 25th Annual IEEE Symposium on Logic in Computer Science
DOI : 10.1109/LICS.2010.38
URL : https://hal.archives-ouvertes.fr/hal-00448431

M. Fernandez and I. Mackie, Closed Reductions in the ??-Calculus, Lecture Notes in Computer Science, 1683.
DOI : 10.1007/3-540-48168-0_16

A. D. Pierro, C. Hankin, and H. Wiklicky, Probabilistic ??-calculus and Quantitative Program Analysis, Journal of Logic and Computation, vol.15, issue.2, pp.159-179, 2005.
DOI : 10.1093/logcom/exi008

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

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

L. K. Grover, Quantum Mechanics Helps in Searching for a Needle in a Haystack, Physical Review Letters, vol.79, issue.2, pp.325-328, 1997.
DOI : 10.1103/PhysRevLett.79.325

O. M. Herescu and C. Palamidessi, Probabilistic asynchronous pi-calculus, ETAPS, LNCS, vol.1784, pp.146-160, 2000.

G. Huet, A complete proof of correctness of the Knuth-Bendix completion algorithm, Journal of Computer and System Sciences, vol.23, issue.1, pp.11-21, 1981.
DOI : 10.1016/0022-0000(81)90002-7
URL : https://hal.archives-ouvertes.fr/inria-00076536

J. Jouannaud and H. Kirchner, Completion of a Set of Rules Modulo a Set of Equations, SIAM Journal on Computing, vol.15, issue.4, pp.1155-1194, 1986.
DOI : 10.1137/0215084

A. Kitaev, Quantum computations: algorithms and error correction, Russian Mathematical Surveys, vol.52, issue.6, pp.1191-1249, 1997.
DOI : 10.1070/RM1997v052n06ABEH002155

E. Moggi, Notions of computation and monads, Information and Computation, pp.55-92, 1991.

M. H. Newman, On Theories with a Combinatorial Definition of "Equivalence", The Annals of Mathematics, vol.43, issue.2, pp.223-243, 1942.
DOI : 10.2307/1968867

M. A. Nielsen, Universal quantum computation using only projective measurement , quantum memory, and preparation of the 0 state, Phys. Rev. A, vol.308, pp.96-100, 2003.

O. Oreshkov, F. Costa, and C. Brukner, Quantum correlations with no causal order, Arxiv preprint, 2011.

G. E. Peterson and M. E. Stickel, Complete Sets of Reductions for Some Equational Theories, Journal of the ACM, vol.28, issue.2, pp.233-264, 1981.
DOI : 10.1145/322248.322251

S. Perdrix, STATE TRANSFER INSTEAD OF TELEPORTATION IN MEASUREMENT-BASED QUANTUM COMPUTATION, International Journal of Quantum Information, vol.03, issue.01, pp.219-223, 2005.
DOI : 10.1142/S0219749905000785

S. Perdrix, Quantum Entanglement Analysis Based on Abstract Interpretation, SAS 2008, 2008.
DOI : 10.1007/978-3-540-69166-2_18

F. Prost and C. Zerrari, Reasoning about Entanglement and Separability in Quantum Higher-Order Functions, Proceedings of the 8th International Conference on Unconventional Computation, pp.219-235, 2008.
DOI : 10.1007/978-3-642-03745-0_25
URL : https://hal.archives-ouvertes.fr/hal-00940911

R. Raussendorf, D. E. Browne, and H. J. Briegel, The one-way quantum computer--a non-network model of quantum computation, Journal of Modern Optics, vol.49, issue.8, p.1299, 2002.
DOI : 10.1098/rspa.1989.0099

T. Rudolph and L. Grover, A two rebit gate universal for quantum computing, p.210187, 2002.

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

C. Tasson, Algebraic Totality, towards Completeness, Proceedings of the 9th International Conference on Typed Lambda Calculi and Applications, pp.325-340, 2009.
DOI : 10.1007/978-3-540-73449-9_28
URL : https://hal.archives-ouvertes.fr/hal-00440750

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

B. Valiron and . Typed, A typed, algebraic, computational lambda-calculus, Mathematical Structures in Computer Science, vol.270, issue.02
DOI : 10.4204/EPTCS.26.14

P. W. Shor, Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer, SIAM Journal on Computing, vol.26, issue.5, pp.1484-1509, 1997.
DOI : 10.1137/S0097539795293172

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

A. Van-tonder, Quantum Computation, Categorical Semantics and Linear Logic, 2003.

L. Vaux, On linear combinations of lambda-terms, Proceedings of RTA 2007, 2007.
URL : https://hal.archives-ouvertes.fr/hal-00383896

H. Walters and H. Zantema, Rewrite systems for integer arithmetic, Proc. of Rewriting Techniques and Applications 94, 6th Int. Conf, pp.324-338, 1995.
DOI : 10.1007/3-540-59200-8_67

W. K. Wooters and W. H. Zurek, A single quantum cannot be cloned, Nature, vol.15, issue.5886, pp.802-803, 1982.
DOI : 10.1038/299802a0