D. S. Abrams and S. Lloyd, Problems, Physical Review Letters, vol.81, issue.18, pp.3992-3995, 1998.
DOI : 10.1103/PhysRevLett.81.3992

O. , L. Acevedo, and T. Gobron, Quantum walks on cayley graphs, J. Phys. A : Math. Gen, vol.39, 2006.
URL : https://hal.archives-ouvertes.fr/hal-00095800

D. Aharonov, A. Ambainis, J. Kempe, and U. Vazirani, Quantum walks on graphs, Proceedings of the thirty-third annual ACM symposium on Theory of computing , STOC '01, 2001.
DOI : 10.1145/380752.380758

D. Aharonov, W. Van-dam, J. Kempe, Z. Landau, S. Lloyd et al., Adiabatic quantum computation is equivalent to standard quantum computation

A. Ambainis, Quantum walk algorithm for element distinctness, Proc. FOCS, 2004.

A. Ambainis, E. Bach, A. Nayak, A. Vishwanath, and J. Watrous, Onedimensional quantum walks, Proc. Conf. Ann. Symp. Theo. Comp, pp.37-49, 2001.

M. C. Banuls, R. Orus, J. I. Latorre, A. Perez, and P. Ruiz-femenia, Simulation of many qubit quantum computation with matrix product states

E. Bernstein and U. Vazirani, Quantum Complexity Theory, SIAM Journal on Computing, vol.26, issue.5, pp.1411-1473, 1997.
DOI : 10.1137/S0097539796300921

I. Bialynicki-birula, Weyl, Dirac, and Maxwell equations on a lattice as unitary cellular automata, Physical Review D, vol.49, issue.12, p.6920, 1994.
DOI : 10.1103/PhysRevD.49.6920

G. Brassard, P. Hoyer, M. Mosca, and A. Tapp, Quantum amplitude amplification and estimation. LANL preprint
DOI : 10.1090/conm/305/05215
URL : http://arxiv.org/abs/quant-ph/0005055

T. A. Brun, H. A. Cartet, and A. Ambainis, Quantum walks driven by many coins, Physical Review A, vol.67, issue.5, p.52317, 2003.
DOI : 10.1103/PhysRevA.67.052317
URL : http://arxiv.org/abs/quant-ph/0210161

I. Carneiro, M. Loo, X. Xu, M. Girard, V. Kendon et al., Entanglement in coined quantum walks on regular graphs, New Journal of Physics, vol.7, p.156, 2005.
DOI : 10.1088/1367-2630/7/1/156

A. Chen and E. Renshaw, The general correlated random walk, Journal of Applied Probability, vol.4, issue.04, pp.869-884, 1994.
DOI : 10.2307/3212943

A. Y. Chen and E. Renshaw, The gillis-domb-fisher correlated random walk, J. Appl. Prob, vol.29, pp.792-813, 1992.

D. Deutsch, Quantum Theory, the Church-Turing Principle and the Universal Quantum Computer, Proc. R. Soc Lond. A, p.97, 1985.
DOI : 10.1098/rspa.1985.0070

E. Fahri, J. Goldstone, S. Gutmann, J. Lapan, A. Lundgren et al., A quantum adiabatic evolution algorithm applied to random instances of an np-complete problem. LANL preprint

G. Grimmet, S. Janson, and P. F. Scudo, Weak limits for quantum random walks, Physical Review E, vol.69, issue.2, p.261119, 2004.
DOI : 10.1103/PhysRevE.69.026119

N. Inui, N. Konno, and E. Segawa, One-dimensional three-state quantum walk. LANL preprint
DOI : 10.1103/physreve.72.056112
URL : http://arxiv.org/abs/quant-ph/0507207

M. Jerrum, A. Sinclair, and E. Vigoda, A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries, Proceedings of the thirty-third annual ACM symposium on Theory of computing , STOC '01, 2001.
DOI : 10.1145/380752.380877

J. Kempe, Discrete quantum walk hit exponentially faster, Random-Approx 2003 series Lecture notes in Computer Science, pp.354-369, 2003.
DOI : 10.1007/978-3-540-45198-3_30

J. Kempe, Quantum random walks -an introductory overview, Cont. Phys, vol.44, issue.4, pp.302-307, 2003.
DOI : 10.1080/00107510902734722
URL : http://arxiv.org/abs/quant-ph/0303081

P. L. Knight, E. Roldan, and J. E. Sipe, Propagating quantum walks : the origin of interference structures. LANL preprint. quant-ph, 312133.

N. Koblitz, A course in number theory and cryptography, 1994.

N. Konno, A new type of limit theorems for the one-dimensional quantum random walk. LANL preprint. quant-ph, 206103.

D. A. Meyer, On the absence of homogeneous scalar unitary cellular automata, Physics Letters A, vol.223, issue.5, pp.5-5261, 1996.
DOI : 10.1016/S0375-9601(96)00745-1

D. A. Meyer, Quantum mechanics of lattice gas automata: One-particle plane waves and potentials, Physical Review E, vol.55, issue.5, p.5261, 1997.
DOI : 10.1103/PhysRevE.55.5261

D. R. Mitchell, Geometric phase based quantum computation applied to an np-complete problem. LANL preprint

D. R. Mitchell, C. Adami, W. Lue, and C. P. Williams, A random matrix model of adiabatic quantum computing. LANL preprint

C. Moore and A. Russell, Quantum Walks on the Hypercube, Proc. Random, 2001.
DOI : 10.1007/3-540-45726-7_14

A. Nayak and A. Vishwanath, Quantum walk on the line (extended abstract). LANL preprint. quant-ph, 10117.

M. A. Nielsen and I. Chuang, Quantum computation and quantum information, 2004.

C. H. Papadimitriou, Computational complexity, 1994.

P. Ribeiro, P. Milman, and R. Mosseri, Aperiodic Quantum Random Walks, Physical Review Letters, vol.93, issue.19, p.190503, 2004.
DOI : 10.1103/PhysRevLett.93.190503
URL : https://hal.archives-ouvertes.fr/hal-00122977

N. Shenvi, J. Kempe, and K. Birgittawhaley, Quantum random-walk search algorithm, Physical Review A, vol.67, issue.5, p.52307, 2003.
DOI : 10.1103/PhysRevA.67.052307
URL : http://arxiv.org/abs/quant-ph/0210064

P. W. Shor, Polynomial-time algorithm for prime factorization and discrete logarithms on a quantum computer, SIAM J. Comp, pp.1484-1509, 1997.

P. W. Shor, Progress in quantum algorithms Quantum Information Processing, 2004.

A. M. Turing, On computable numbers with an application to the entscheidungsproblem, Proc. Lond. Math. Soc.2, p.442, 1936.

A. T. White, Graphs of groups on surfaces, 2001.

A. C. Yao, Quantum circuit complexity, Proc. of the 34th Ann. IEEE Symp. on Foundations of Computer Scicence, pp.352-361, 1993.