Table of Contents
Journal of Computational Methods in Physics
Volume 2013, Article ID 235624, 5 pages
Research Article

Preparation of Approximate Eigenvector by Unitary Operations on Eigenstate in Abrams-Lloyd Quantum Algorithm

Homi Bhabha Centre for Science Education, TIFR, Mumbai 400088, India

Received 6 May 2013; Revised 8 July 2013; Accepted 7 August 2013

Academic Editor: Gian Marco Rignanese

Copyright © 2013 Latha S. Warrier. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. D. S. Abrams and S. Lloyd, “Quantum algorithm providing exponential speed increase for finding eigenvalues and eigenvectors,” Physical Review Letters, vol. 83, no. 24, pp. 5162–5165, 1999. View at Google Scholar · View at Scopus
  2. M. Dobsicek, Quantum computing, phase estimation and applications [Ph.D. thesis], Faculty of Electrical Engineering, Czech Technical University in Prague, 2008, Supervisor: Josef Kolar, Co-supervisor: Robert Lorencz.
  3. P. Jaksch and A. Papageorgiou, “Eigenvector approximation leading to exponential speedup of quantum eigenvalue calculation,” Physical Review Letters, vol. 91, no. 25, Article ID 257902, 4 pages, 2003. View at Publisher · View at Google Scholar · View at Scopus
  4. J. Datta and P. K. Bera, “Iterative approach for the eigenvalue problems,” Pramana, vol. 76, no. 1, pp. 47–66, 2011. View at Google Scholar · View at Scopus
  5. J. Bang, S.-W. Lee, C.-W. Lee, H.-S. Jeong, and J. Lee, “Recursive quantum algorithm to find the lowest eigenstate of a general hamiltonian,”
  6. P. Kaye, R. Laflamme, and M. Mosca, An Introduction to Quantum Computing, Oxford University Press, New York, NY, USA, 2007.