508 search results - page 36 / 102 » Quantum Computers |
FOCS
2008
IEEE
14 years 1 days ago
2008
IEEE
We introduce another variant of Quantum MIP, where the provers do not share entanglement, the communication between the verifier and the provers is quantum, but the provers are u...
TCS
2012
12 years 6 months ago
2012
We construct a strong extractor against quantum storage that works for every min-entropy k, has logarithmic seed length, and outputs Ω(k) bits, provided that the quantum adversa...
STOC
2000
ACM
14 years 3 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,...
CORR
2004
Springer
13 years 10 months ago
2004
Springer
The objective of this paper is to develop a functional programming language for quantum computers. We develop a lambda-calculus for the QRAM model, following the work of P. Seling...
CORR
1998
Springer
13 years 10 months ago
1998
Springer
We prove lower bounds on the error probability of a quantum algorithm for searching through an unordered list of N items, as a function of the number T of queries it makes. In par...