Articles under category:
Quantum Computing
Quantum Computing
ToC Library Graduate Surveys 7 (2016) 81 pages
A Survey of Quantum Property Testing by Ashley Montanaro and Ronald de Wolf 
ToC Library Graduate Surveys 2 (2011) 54 pages
Quantum Proofs for Classical Theorems by Andrew Drucker and Ronald de Wolf 
Vol 16, Article 11 (pp 18)
[NOTE]
On the Classical Hardness of Spoofing Linear CrossEntropy Benchmarking by Scott Aaronson and Sam Gunn 
Vol 16, Article 10 (pp 171)
The Polynomial Method Strikes Back: Tight Quantum Query Bounds via Dual Polynomials by Mark Bun, Robin Kothari, and Justin Thaler 
Vol 15, Article 5 (pp 142)
Classical Verification of Quantum Proofs by Zhengfeng Ji 
Vol 14, Article 15 (pp 124)
QuantumWalk Speedup of Backtracking Algorithms by Ashley Montanaro 
Vol 14, Article 11 (pp 137)
How to Verify a Quantum Computation by Anne Broadbent 
Vol 14, Article 7 (pp 145)
Quantum Homomorphic Encryption for PolynomialSize Circuits by Yfke Dulek, Christian Schaffner, and Florian Speelman 
Vol 14, Article 1 (pp 127)
LinearTime Algorithm for Quantum 2SAT by Itai Arad, Miklos Santha, Aarthi Sundaram, and Shengyu Zhang 
Vol 12, Article 18 (pp 135)
Upper Bounds on Quantum Query Complexity Inspired by the ElitzurVaidman Bomb Tester by Cedric YenYu Lin and HanHsuan Lin 
Vol 12, Article 16 (pp 134)
Dual Polynomials for Collision and Element Distinctness by Mark Bun and Justin Thaler 
Vol 12, Article 3 (pp 142)
Interactive Proofs for $\mathsf{BQP}$ via SelfTested Graph States by Matthew McKague 
Vol 11, Article 20 (pp 491603)
The BoseHubbard Model is QMAcomplete by Andrew M. Childs, David Gosset, and Zak Webb 
Vol 11, Article 16 (pp 403412)
[NOTE]
Quantum Algorithm for Monotonicity Testing on the Hypercube by Aleksandrs Belovs and Eric Blais 
Vol 11, Article 6 (pp 183219)
How Hard Is It to Approximate the Jones Polynomial? by Greg Kuperberg 
Vol 11, Article 3 (pp 59103)
Quantum Interactive Proofs and the Complexity of Separability Testing by Gus Gutoski, Patrick Hayden, Kevin Milner, and Mark M. Wilde 
Vol 10, Article 6 (pp 133166)
The Need for Structure in Quantum Speedups by Scott Aaronson and Andris Ambainis 
Vol 9, Article 26 (pp 809843)
On Beating the Hybrid Argument by Bill Fefferman, Ronen Shaltiel, Christopher Umans, and Emanuele Viola 
Vol 9, Article 9 (pp 349401)
Quantum Money from Hidden Subspaces by Scott Aaronson and Paul Christiano 
Vol 9, Article 4 (pp 143252)
The Computational Complexity of Linear Optics by Scott Aaronson and Alex Arkhipov 
Vol 9, Article 2 (pp 31116)
The Quantum and Classical Complexity of Translationally Invariant Tiling and Hamiltonian Problems by Daniel Gottesman and Sandy Irani 
Vol 8, Article 27 (pp 623645)
NearOptimal and Explicit Bell Inequality Violations by Harry Buhrman, Oded Regev, Giannicola Scarpa, and Ronald de Wolf 
Vol 8, Article 21 (pp 461486)
TwoSource Extractors Secure Against Quantum Adversaries by Roy Kasher and Julia Kempe 
Vol 8, Article 17 (pp 375400)
On the Power of a Unique Quantum Witness by Rahul Jain, Iordanis Kerenidis, Greg Kuperberg, Miklos Santha, Or Sattath, and Shengyu Zhang 
Vol 8, Article 16 (pp 369374)
[NOTE]
Quantum Private Information Retrieval with Sublinear Communication Complexity by François Le Gall 
Vol 8, Article 13 (pp 291319)
SpanProgramBased Quantum Algorithm for Evaluating Formulas by Ben Reichardt and Robert Špalek 
Vol 8, Article 1 (pp 151)
TimeSpace Efficient Simulations of Quantum Computations by Dieter van Melkebeek and Thomas Watson 
Vol 7, Article 7 (pp 101117)
Quantum Interactive Proofs with Short Messages by Salman Beigi, Peter Shor, and John Watrous 
Vol 7, Article 2 (pp 1925)
[NOTE]
Inverting a Permutation is as Hard as Unordered Search by Ashwin Nayak 
Vol 6, Article 3 (pp 4779)
Quantum Expanders: Motivation and Construction by Avraham BenAroya, Oded Schwartz, and Amnon TaShma 
Vol 6, Article 1 (pp 125)
A New Quantum Lower Bound Method, with an Application to a Strong Direct Product Theorem for Quantum Search by Andris Ambainis 
Vol 5, Article 11 (pp 217238)
Semidefinite Programs for Completely Bounded Norms by John Watrous 
Vol 5, Article 8 (pp 141172)
Parallel Repetition: Simplification and the NoSignaling Case by Thomas Holenstein 
Vol 5, Article 5 (pp 119123)
[NOTE]
DiscreteQuery Quantum Algorithm for NAND Trees by Andrew M. Childs, Richard Cleve, Stephen P. Jordan, and David YongeMallo 
Vol 5, Article 1 (pp 142)
The Power of Unentanglement by Scott Aaronson, Salman Beigi, Andrew Drucker, Bill Fefferman, and Peter Shor 
Vol 4, Article 8 (pp 169190)
A Quantum Algorithm for the Hamiltonian NAND Tree by Edward Farhi, Jeffrey Goldstone, and Sam Gutmann 
■

Vol 4, Article 3 (pp 5376)
Derandomizing the AhlswedeWinter matrixvalued Chernoff bound using pessimistic estimators, and applications by Avi Wigderson and David Xiao 
Vol 3, Article 7 (pp 129157)
Quantum Versus Classical Proofs and Advice by Scott Aaronson and Greg Kuperberg 
Vol 3, Article 4 (pp 6179)
A Simple PromiseBQPcomplete Matrix Problem by Dominik Janzing and Pawel Wocjan 
Vol 2, Article 1 (pp 118)
All Quantum Adversary Methods are Equivalent by Robert Špalek and Mario Szegedy 
Vol 1, Article 5 (pp 81103)
Quantum Fanout is Powerful by Peter Høyer and Robert Špalek 
Vol 1, Article 4 (pp 4779)
Quantum Search of Spatial Regions by Scott Aaronson and Andris Ambainis 
Vol 1, Article 3 (pp 3746)
Polynomial Degree and Lower Bounds in Quantum Complexity: Collision and Element Distinctness with Small Range by Andris Ambainis 
Vol 1, Article 2 (pp 2936)
Quantum Lower Bound for the Collision Problem with Small Range by Samuel Kutin 
Vol 1, Article 1 (pp 128)
Limitations of Quantum Advice and OneWay Communication by Scott Aaronson 