Bibliography

1

Andris Ambainis.
Quantum lower bounds by quantum arguments.
In ACM Symposium on Theory of Computing, pages 636-643, 2000.

2

Robert Beals, Harry Buhrman, Richard Cleve, Michele Mosca, and Ronald de Wolf.
Quantum lower bounds by polynomials.
In IEEE Symposium on Foundations of Computer Science, pages 352-361, 1998.

3

A. Berthiaume and Gilles Brassard.
Oracle quantum computing.
In Proceedings of the Workshop on Physics of Computation: PhysComp '92, pages 195-199, Los Alamitos, CA, 1992. Institute of Electrical and Electronic Engineers Computer Society Press.

4

André Berthiaume.
Quantum computation.
In Alan L. Selman, Editor, Complexity Theory Retrospective, In Honor of Juris Hartmanis on the Occasion of His Sixtieth Birthday, July 5, 1988, volume 2. 1997.
http://citeseer.nj.nec.com/berthiaume97quantum.html.

5

Gilles Brassard and Peter Hoyer.
An exact quantum polynomial-time algorithm for simon's problem.
In Israel Symposium on Theory of Computing Systems, pages 12-23, 1997.

6

David Deutsch.
Quantum theory, the Church-Turing principle and the universal quantum computer.
Proceedings of the Royal Society of London Ser. A, A400:97-117, 1985.

7

Stefan Felsner and Dorothea Wagner.
On the complexity of partial order properties.
In Workshop on Graph-Theoretic Concepts in Computer Science, pages 225-235, 1992.

8

Neil Gershenfeld and Isaac L. Chuang.
Quantum computing with molecules.
Scientific American, June 1998.

9

D. Griffiths.
Introduction to Quantum Mechanics.
Prentice Hall, 1995.

10

Lov K. Grover.
A fast quantum mechanical algorithm for database search.
In ACM Symposium on Theory of Computing, pages 212-219, 1996.

11

Lov K. Grover.
Searching with quantum computers.
Technical report, Bell Labs, 700 Mountain Avenue, Murray Hill NJ 07974, 2000.

12

George Johnson.
Efforts to transform computers reach milestone.
New York Times Newspaper.
December 20, 2001.

13

László Lovász and Péter Gács.
Computational complexity.
Technical report, Princeton University, 1994.
http://www.uni-paderborn.de/fachbereich/AG/agmadh/Scripts/GENERAL/Evasivness.ps.gz.

14

László Lovász and Neal Young.
Lecture notes on evasiveness of graph properties.
Technical report, Princeton University, 1994.
http://ncstrl.cs.princeton.edu/expand.php?id=TR-317-91.

15

C. Papadimitriou.
Computational Complexity, page 36.
Addison-Welsey, 1994.

16

David A. Patterson and John L. Hennessy.
Computer Organization and Design, page 30.
Morgan Kaufmann Publishers, Inc., 1998.

17

Peter W. Shor.
Algorithms for quantum computation: Discrete logarithms and factoring.
In IEEE Symposium on Foundations of Computer Science, pages 124-134, 1994.

18

Colin P. Williams and Scott H. Clearwater.
Explorations in Quantum Computing.
Springer-Verlag, 1998.