233 search results - page 7 / 47 » Interactive Proofs For Quantum Computations |
142
click to vote
FOCS
2007
IEEE
16 years 2 days ago
2007
IEEE
: We study the computational strength of quantum particles (each of finite dimensionality) arranged on a line. First, we prove that it is possible to perform universal adiabatic q...
145
click to vote
STOC
1997
ACM
15 years 10 months ago
1997
ACM
Shor has showed how to perform fault tolerant quantum computation when the probability for an error in a qubit or a gate, η, decays with the size of the computation polylogarithmi...
150
click to vote
IPL
2000
15 years 5 months ago
2000
We give a short and simple proof of Hales and Hallgren's Fourier Sampling Theorem ["Quantum Fourier Sampling Simplified", Proceedings of the Thirty-First Annual ACM...
153
click to vote
STOC
2000
ACM
15 years 10 months ago
2000
ACM
We propose a new method for proving lower bounds on quantum query algorithms. Instead of a classical adversary that runs the algorithm with one input and then modifies the input,...