11547 search results - page 49 / 2310 » Quantum computing and communication |
153
click to vote
FOCS
2000
IEEE
15 years 7 months ago
2000
IEEE
In this paper we consider a quantum computational variant of nondeterminism based on the notion of a quantum proof, which is a quantum state that plays a role similar to a certifi...
126
click to vote
STOC
2000
ACM
15 years 8 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,...
125
click to vote
ISCA
2006
IEEE
15 years 10 months ago
2006
IEEE
We evaluate the performance of quantum arithmetic algorithms run on a distributed quantum computer (a quantum multicomputer). We vary the node capacity and I/O capabilities, and t...
184
click to vote
TCS
2012
13 years 11 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...
161
click to vote
ICTCS
2005
Springer
15 years 9 months ago
2005
Springer
This work introduces two decision problems, StabilizerD and Orbit CosetD, and gives quantum reductions from them to the problem Orbit Superposition (Friedl et al., 2003), as well a...