Volume 55, Issue 3

November 2009

Special Issue: Quantum Computation; Guest Editors: Frédéric Magniez and Ashwin Nayak

Filter by

Volume:

Sort by

Date published:

New to old Old to new

8 articles in this issue

Foreword from the Guest Editors
Frédéric Magniez
Ashwin Nayak
OriginalPaper 15 October 2008 Pages: 393 - 394
A Polynomial Quantum Algorithm for Approximating the Jones Polynomial
Dorit Aharonov
Vaughan Jones
Zeph Landau
OriginalPaper 19 March 2008 Pages: 395 - 421
A New Quantum Lower Bound Method, with Applications to Direct Product Theorems and Time-Space Tradeoffs
Andris Ambainis
Robert Špalek
Ronald de Wolf
OriginalPaper 13 September 2007 Pages: 422 - 461
Quantum Information and the PCP Theorem
Ran Raz
OriginalPaper 18 September 2007 Pages: 462 - 489
Random Measurement Bases, Quantum State Distinction and Applications to the Hidden Subgroup Problem
Jaikumar Radhakrishnan
Martin Rötteler
Pranab Sen
OriginalPaper 18 October 2008 Pages: 490 - 516
Error-Detection-Based Quantum Fault-Tolerance Threshold
Ben W. Reichardt
OriginalPaper 17 October 2007 Pages: 517 - 556
Quantum and Classical Query Complexities of Local Search Are Polynomially Related
Miklos Santha
Mario Szegedy
OriginalPaper 26 January 2008 Pages: 557 - 575
On the Quantum Query Complexity of Local Search in Two and Three Dimensions
Xiaoming Sun
Andrew Chi-Chih Yao
OriginalPaper 29 January 2008 Pages: 576 - 600

Search