Proceedings of the International Workshop "Quantum Entanglement in Physical and Information Sciences" Centro di Ricerca Matematica Ennio DeGiorgi, Scuola Normale Superiore; December 14—18, 2004, Pisa, Italy – Eds. C. Macchiavello, R. Fazio and G. M. PalmaNo Access

DISCRETE TIME QUANTUM WALK ON A LINE WITH TWO PARTICLES

L. SHERIDAN

Institute for Quantum Computing, University of Waterloo, 200 University Avenue West, Waterloo, Ontario N2L 3G5, Canada

Search for more papers by this author

N. PAUNKOVIĆ

SQIG, Instituto de Telecommunicações and Instituto Superior Técnico, P-1049-001 Lisbon, Portugal

Search for more papers by this author

Y. OMAR

CEMAPRE ISEG, Universidade Técnica de Lisboa, P-1200-781 Lisbon, Portugal

Search for more papers by this author

, and

S. BOSE

Department of Physics and Astronomy, University College London, Gower Street, London WC1E 6BT, UK

Search for more papers by this author

https://doi.org/10.1142/S0219749906002006Cited by:5 (Source: Crossref)

Abstract

We introduce the idea of a quantum walk with two particles and study it for the case of a discrete time walk on a line. We consider both separable and maximally entangled initial conditions, and show how the entanglement and the relative phase between the states describing the coin degree of freedom of each particle will influence the evolution of the quantum walk. In particular, these factors will have consequences for the distance between the particles and the probability of finding them at a given point, yielding results that cannot be obtained from a separable initial state, be it pure or mixed. Finally, we review briefly proposals for implementations.

Keywords:

References

Y. Aharonov, L. Davidovich and N. Zagury, Phys. Rev. A 48, 1687 (1993). Web of Science, Google Scholar
J. Kempe, Contemp. Phys. 44, 307 (2003). Web of Science, Google Scholar
N. Shenvi, J. Kempe and K. B. Whaley, Phys. Rev. A 67, 052307 (2003). Web of Science, Google Scholar
A. Ambainis, (2003) , quant-ph/0311001 . Google Scholar
A. M. Childset al., Proc. 35th ACM Symp. Theory of Computing (STOC) (ACM, 2003) p. 59. Google Scholar
Y. Omar, N. Paunković, L. Sheridan and S. Bose, (2004) , quant-ph/0411065 . Google Scholar
D. Aharonov et al. , Proc. 33rd ACM Symp. on Theory of Computation (STOC) ( ACM , 2001 ) . Google Scholar
T. D. Mackayet al., J. Phys. A. Math. Gen. 35, 2745 (2002). Google Scholar
B. Tregennaet al., New J. Phys. 5, 83 (2003). Web of Science, Google Scholar
M. Hillery, J. Bergou and E. Feldman, Phys. Rev. A 68, 032314 (2003). Web of Science, Google Scholar
O. Buerschaper and K. Burnett, (2004) , quant-ph/0406039 . Google Scholar
M. Dyer, A. Frieze and R. Kannan, J. ACM 38, 1 (1991). Web of Science, Google Scholar
Q. Lvet al., Proc. 16th ACM Int. Conf. Supercomputing (ICS) (2002) pp. 84–95. Google Scholar
B. C. Sanderset al., Phys. Rev. A 67, 042305 (2003). Web of Science, Google Scholar
W. Düret al., Phys. Rev. A 66, 052319 (2002). Web of Science, Google Scholar
B. C. Travaglione and G. J. Milburn, Phys. Rev. A 65, 032310 (2002). Web of Science, Google Scholar
H. Jeong, M. Paternostro and M. S. Kim, Phys. Rev. A 69, 012310 (2004). Web of Science, Google Scholar
R. C. Liuet al., Nature 391, 263 (1998). Web of Science, Google Scholar
Y. Omaret al., Phys. Rev. A 65, 062305 (2002). Web of Science, Google Scholar
N. Paunkovićet al., Phys. Rev. Lett. 88, 187903 (2002). Web of Science, Google Scholar