Items in the Los Alamos National Laboratory e-print quantum physics archives are available from

http://xxx.lanl.gov/archive/quant-ph

- [Abrams98]
D. Abrams,
*Nonlinear quantum mechanics implies polynomial-time solution for NP-complete and P problems*, lanl e-print quant-pt/9801041 - [BBBV96]
C.H Bennett, E. Bernstein, G. Brassard and U. Vazirani,
*Strengths and Weaknesses of Quantum Computing*, to be published in the SIAM Journal of Computing. - [BBHT96]
M. Boyer, G. Brassard, P. Hoyer and A. Tapp,
*Tight Bounds on Quantum Searching*, Proceedings, PhysComp 1996 (lanl e-print quant-ph/9701001) - [EID,00]
Eppstein D., Irani S., and Dillencourt M.
*ICS 260-Fall, 2000-Class Notes 11: Turning Machines, Non-determinism, P and NP*http://www1.ics.uci.edu/~eppstein/260/notes/notes11.ps

- [Greenwood00]
G. Greenwood,
*Finding Solutions to NP Problems: Philosophical Differences Between Quantum and Evolutionary Search Algorithms*lanl e-print quant-ph/0010021 - [Griffiths95]
D. Griffiths,
*Introduction to Quantum Mechanics*, Prentice Hall, Inc. Upper Saddle River, NJ 07458 - [Grover96]
L. Grover,
*A fast quantum mechanical algorithm for database search*, Proceedings of the 28th Annual ACM Symposium on Theory of Computing 1996, pp. 212-219 - [Grover97]
L. Grover,
*Quantum computers can search arbitrarily large databases by a single query*, lanl e-print quant-ph/9706005 - [Grover99]
L. Grover,
*How fast can a quantum computer search?*, lanl e-print quant-ph/9809029 - [Grover00]
L. Grover,
*Searching with Quantum Computers*, lanl e-print quant-ph/0011118 - [Papadimitriou94]
Papadimitriou, C.
*Computational Complexity*Addison-Wesley Publishing Company, 1994 - [Shor94]
P. Shor,
*Algorithms for quantum computation: Discrete logarithms and factoring*, Proceedings of the 35th Annual IEEE Symposium on Foundations of Computer Science 1994, pp. 124-134 - [WC98]
C. Williams, S. Clearwater,
*Explorations in Quantum Computing*, Springer-Verlag, New York, Inc.