Articles under category:
Quantum Computing
Quantum Computing
|
ToC Library Graduate Surveys 2 (2011) 54 pages
Quantum Proofs for Classical Theorems by Andrew Drucker and Ronald de Wolf |
|
Volume 9, Article 9 (pages 349-401)
Quantum Money from Hidden Subspaces by Scott Aaronson and Paul Christiano |
|
Volume 9, Article 4 (pages 143-252)
The Computational Complexity of Linear Optics by Scott Aaronson and Alex Arkhipov |
|
Volume 9, Article 2 (pages 31-116)
The Quantum and Classical Complexity of Translationally Invariant Tiling and Hamiltonian Problems by Daniel Gottesman and Sandy Irani |
|
Volume 8, Article 27 (pages 623-645)
Near-Optimal and Explicit Bell Inequality Violations by Harry Buhrman, Oded Regev, Giannicola Scarpa, and Ronald de Wolf |
|
Volume 8, Article 21 (pages 461-486)
Two-Source Extractors Secure Against Quantum Adversaries by Roy Kasher and Julia Kempe |
|
Volume 8, Article 17 (pages 375-400)
On the Power of a Unique Quantum Witness by Rahul Jain, Iordanis Kerenidis, Greg Kuperberg, Miklos Santha, Or Sattath, and Shengyu Zhang |
|
Volume 8, Article 16 (pages 369-374)
[NOTE]
Quantum Private Information Retrieval with Sublinear Communication Complexity by François Le Gall |
|
Volume 8, Article 13 (pages 291-319)
Span-Program-Based Quantum Algorithm for Evaluating Formulas by Ben Reichardt and Robert Špalek |
|
Volume 8, Article 1 (pages 1-51)
Time-Space Efficient Simulations of Quantum Computations by Dieter van Melkebeek and Thomas Watson |
|
Volume 7, Article 7 (pages 101-117)
Quantum Interactive Proofs with Short Messages by Salman Beigi, Peter Shor, and John Watrous |
|
Volume 7, Article 2 (pages 19-25)
[NOTE]
Inverting a Permutation is as Hard as Unordered Search by Ashwin Nayak |
|
Volume 6, Article 3 (pages 47-79)
Quantum Expanders: Motivation and Construction by Avraham Ben-Aroya, Oded Schwartz, and Amnon Ta-Shma |
|
Volume 6, Article 1 (pages 1-25)
A New Quantum Lower Bound Method, with an Application to a Strong Direct Product Theorem for Quantum Search by Andris Ambainis |
|
Volume 5, Article 11 (pages 217-238)
Semidefinite Programs for Completely Bounded Norms by John Watrous |
|
Volume 5, Article 8 (pages 141-172)
Parallel Repetition: Simplification and the No-Signaling Case by Thomas Holenstein |
|
Volume 5, Article 5 (pages 119-123)
[NOTE]
Discrete-Query Quantum Algorithm for NAND Trees by Andrew M. Childs, Richard Cleve, Stephen P. Jordan, and David Yonge-Mallo |
|
Volume 5, Article 1 (pages 1-42)
The Power of Unentanglement by Scott Aaronson, Salman Beigi, Andrew Drucker, Bill Fefferman, and Peter Shor |
|
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 Pawel 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 |