|
Volume 4, Article 8 (pages 169-190)
A Quantum Algorithm for the Hamiltonian NAND Tree by Edward Farhi, Jeffrey Goldstone, and Sam Gutmann |
|
Volume 4, Article 3 (pages 53-76)
Derandomizing the Ahlswede-Winter matrix-valued Chernoff bound using pessimistic estimators, and applications by Avi Wigderson and David Xiao |
|
Volume 3, Article 7 (pages 129-157)
Quantum Versus Classical Proofs and Advice by Scott Aaronson and Greg Kuperberg |
|
Volume 3, Article 4 (pages 61-79)
A Simple PromiseBQP-complete Matrix Problem by Dominik Janzing and Pavel Wocjan |
|
Volume 2, Article 1 (pages 1-18)
All Quantum Adversary Methods are Equivalent by Robert Špalek and Mario Szegedy |
|
Volume 1, Article 5 (pages 81-103)
Quantum Fan-out is Powerful by Peter Høyer and Robert Špalek |
|
Volume 1, Article 4 (pages 47-79)
Quantum Search of Spatial Regions by Scott Aaronson and Andris Ambainis |
|
Volume 1, Article 3 (pages 37-46)
Polynomial Degree and Lower Bounds in Quantum Complexity: Collision and Element Distinctness with Small Range by Andris Ambainis |
|
Volume 1, Article 2 (pages 29-36)
Quantum Lower Bound for the Collision Problem with Small Range by Samuel Kutin |
|
Volume 1, Article 1 (pages 1-28)
Limitations of Quantum Advice and One-Way Communication by Scott Aaronson |