Sciweavers

233 search results - page 10 / 47
» Interactive Proofs For Quantum Computations
Sort
View
FOCS
1990
IEEE
15 years 3 months ago
Algebraic Methods for Interactive Proof Systems
A new algebraic technique for the construction of interactive proof systems is presented. Our technique is used to prove that every language in the polynomial-time hierarchy has an...
Carsten Lund, Lance Fortnow, Howard J. Karloff, No...
INTETAIN
2009
Springer
15 years 6 months ago
Entertainment Computing, Social Transformation and the Quantum Field
Abstract. Entertainment computing is on its way getting an established academic discipline. The scope of entertainment computing is quite broad (see the scope of the international ...
Matthias Rauterberg
CORR
2002
Springer
102views Education» more  CORR 2002»
14 years 11 months ago
Quantum Lower Bound for Recursive Fourier Sampling
One of the earliest quantum algorithms was discovered by Bernstein and Vazirani, for a problem called Recursive Fourier Sampling. This paper shows that the Bernstein-Vazirani algo...
Scott Aaronson
AAECC
2002
Springer
116views Algorithms» more  AAECC 2002»
14 years 11 months ago
A Computer Proof of a Series Evaluation in Terms of Harmonic Numbers
A fruitful interaction between a new randomized WZ procedure and other computer algebra programs is illustrated by the computer proof of a series evaluation that originates from a ...
Russell Lyons, Peter Paule, Axel Riese
FOCS
1990
IEEE
15 years 3 months ago
Randomness in Interactive Proofs
Mihir Bellare, Oded Goldreich, Shafi Goldwasser