3328 search results - page 37 / 666 » Topological Quantum Computation |
STOC
2000
ACM
13 years 12 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,...
TCS
2012
12 years 3 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...
ICTCS
2005
Springer
14 years 1 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...
WDAG
1998
Springer
13 years 11 months ago
1998
Springer
d Abstract) James H. Anderson, Rohit Jain, and David Ott Department of Computer Science University of North Carolina at Chapel Hill We consider wait-free synchronization in multipr...
TEC
2008
13 years 7 months ago
2008
Abstract--The complexity of the selection procedure of a genetic algorithm that requires reordering, if we restrict the class of the possible fitness functions to varying fitness f...