References

  1. Dorit Aharonov, Andris Ambainis, Julia Kempe & Umesh Vazirani (2001): Quantum walks on graphs. In: Proceedings of the thirty-third annual ACM symposium on Theory of computing. ACM, pp. 50–59, doi:10.1145/380752.380758.
  2. Andris Ambainis, Eric Bach, Ashwin Nayak, Ashvin Vishwanath & John Watrous (2001): One-dimensional quantum walks. In: Proceedings of the thirty-third annual ACM symposium on Theory of computing. ACM, pp. 37–49, doi:10.1145/380752.380757.
  3. Andris Ambainis, Martin Beaudry, Marats Golovkins, Arnolds Kikusts, Mark Mercer & Denis Therien (2006): Algebraic Results on Quantum Automata. Theory of Computing Systems 39(1), pp. 165–188, doi:10.1007/s00224-005-1263-x.
  4. K. Barr, T. Fleming & V. Kendon (2013): Simulation methods for quantum walks on graphs applied to perfect state transfer and formal language recognition. In: Susan Stepney & Paul S. Andrews: CoSMoS 2013. Proceedings of the 2013 Workshop on Complex Systems Modelling and Simulation. Luniver Press, pp. 1–19. Available at http://www.cs.york.ac.uk/nature/cosmos/docs/cosmos2013-proceedings.pdf. Presented at the CoSMoS Workshop of UCNC 2013 in Milan, July 2013; post-proceedings journal version forthcoming.
  5. Sougato Bose (2003): Quantum Communication through an Unmodulated Spin Chain. Phys. Rev. Lett. 91, pp. 207901, doi:10.1103/PhysRevLett.91.207901. Available at http://link.aps.org/doi/10.1103/PhysRevLett.91.207901.
  6. Anthony Chefles (2000): Quantum state discrimination. Contemporary Physics 41(6), pp. 401–424, doi:10.1080/00107510010002599. Available at http://www.tandfonline.com/doi/abs/10.1080/00107510010002599.
  7. Andrew M. Childs (2009): Universal Computation by Quantum Walk. Phys. Rev. Lett. 102, pp. 180501, doi:10.1103/PhysRevLett.102.180501. Available at http://link.aps.org/doi/10.1103/PhysRevLett.102.180501.
  8. Andrew M. Childs, David Gosset & Zak Webb (2013): Universal Computation by Multiparticle Quantum Walk. Science 339(6121), pp. 791–794, doi:10.1126/science.1229957. Available at http://www.sciencemag.org/content/339/6121/791.abstract.
  9. Matthias Christandl, Nilanjana Datta, Tony C. Dorlas, Artur Ekert, Alastair Kay & Andrew J. Landahl (2005): Perfect transfer of arbitrary states in quantum spin networks. Phys. Rev. A 71, pp. 032312, doi:10.1103/PhysRevA.71.032312. Available at http://link.aps.org/doi/10.1103/PhysRevA.71.032312.
  10. Viv Kendon (2006): Quantum walks on general graphs. International Journal of Quantum Information 04(05), pp. 791–805, doi:10.1142/S0219749906002195. Available at http://www.worldscientific.com/doi/abs/10.1142/S0219749906002195.
  11. Vivien M. Kendon & Christino Tamon (2011): Perfect State Transfer in Quantum Walks on Graphs. Journal of Computational and Theoretical Nanoscience 8(3), pp. 422–433. Available at http://www.ingentaconnect.com/content/asp/jctn/2011/00000008/00000003/art00015, doi:10.1166/jctn.2011.1706.
  12. Neil B. Lovett, Sally Cooper, Matthew Everitt, Matthew Trevers & Viv Kendon (2010): Universal quantum computation using the discrete-time quantum walk. Phys. Rev. A 81, pp. 042330, doi:10.1103/PhysRevA.81.042330. Available at http://link.aps.org/doi/10.1103/PhysRevA.81.042330.
  13. PawełKurzyński & Antoni Wójcik (2013): Quantum Walk as a Generalized Measuring Device. Phys. Rev. Lett. 110, pp. 200404, doi:10.1103/PhysRevLett.110.200404. Available at http://link.aps.org/doi/10.1103/PhysRevLett.110.200404.
  14. LMK Vandersypen, M Steffen, G Breyta, CS Yannoni, MH Sher wood & IL Chuang (2001): Experimental realization of Shor's quantum factoring algorithm using nu clear magnetic resonance. Nature 414(6866), pp. 883–887, doi:10.1038/414883a.
  15. Y. Aharonov, L. Davidovich & N. Zagury (1993): Quantum random walks. Physical Review A 48(2), pp. 1687–1690, doi:10.1103/PhysRevA.48.1687.
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org