515 search results - page 38 / 103 » Classically-controlled Quantum Computation |
STOC
2000
ACM
15 years 2 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,...
ISCA
2006
IEEE
15 years 3 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...
103
click to vote
ICTCS
2005
Springer
15 years 3 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
15 years 1 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
14 years 9 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...