Lov K. Grover's recent papers
  • Rapid sampling through quantum computing. Proceedings of 32th Annual ACM Symposium on Theory of Computing (STOC), 2000, pages 618-626. quant-ph/9912001.
  • Synthesis of Quantum Superpositions by Quantum Computation. Physical Review Letters, Volume 85, Number 6, August 7, 2000.
  • From Schrödinger's Equation to the Quantum Search Algorithm. postscript.
  • Quantum computation. IEEE Potentials, pages 4-8, April/May 1999.
  • How fast can a quantum computer search? quant-ph/9809029, September 1998.
  • Nested quantum search and NP-complete problems (with N.J. Cerf and C.P. Williams). To appear in Physical Review Letters. quant-ph/9806078.
  • Beyond factorization and search. Science 281 (Perspectives article), pages 792-794, August 7, 1998.
  • The advantages of superposition. Science 280 (Perspectives article), page 228, April 10, 1998.
  • Quantum search on structured problems. In Proceedings of the First NASA QCQC Conference, Palm Springs, CA, February 1998. Latest version in Chaos, Solitons, and Fractals, Special Issue on Quantum Computing, Vol. 10, No 10., pp. 1695-1705, June 1999. quant-ph/9802035.
  • Quantum computers can search rapidly by using almost any transformation. Physical Review Letters 80(19), pages 4329-4332, 1998. quant-ph/9712011.
  • A framework for fast quantum mechanical algorithms. In Proceedings of 30th Annual ACM Symposium on Theory of Computing (STOC), pages 53-62, May 1998. quant-ph/9711043.
  • Quantum Mechanics helps in searching for a needle in a haystack. Physical Review Letters 79(2), pages 325-328, July 14, 1997. quant-ph/9706033.
  • Quantum computers can search arbitrarily large databases by a single query. Physical Review Letters 79(23), pages 4709-4712, 1997. quant-ph/9706005.
  • Quantum Telecomputation. quant-ph/9704012, April 1997.
  • A fast quantum mechanical algorithm for estimating the median. quant-ph/9607024, July 1996.
  • A fast quantum mechanical algorithm for database search. In Proceedings of 28th Annual ACM Symposium on Theory of Computing (STOC), pages 212-219, May 1996. quant-ph/9605043.
  • Local Search and the local structure of NP-complete problems; Operations Research Letters, 12 (1992), 235-243.
  • Fast interior point methods for bipartite matching, SIAM Journal of Optimization, vol. 5(4), 740-769.
Back to home page