700 search results - page 53 / 140 » An Introduction to Quantum Computing |
STOC
2006
ACM
14 years 8 months ago
2006
ACM
Local Search problem, which finds a local minimum of a black-box function on a given graph, is of both practical and theoretical importance to combinatorial optimization, complexi...
ICQNM
2008
IEEE
14 years 2 months ago
2008
IEEE
Coin flipping is a cryptographic primitive in which two spatially separated players, who in principle do not trust each other, wish to establish a common random bit. If we limit ...
STOC
2006
ACM
14 years 1 months ago
2006
ACM
It has been known for some time that graph isomorphism reduces to the hidden subgroup problem (HSP). What is more, most exponential speedups in quantum computation are obtained by...
COMPUTER
2006
13 years 7 months ago
2006
FOCS
1996
IEEE
13 years 12 months ago
1996
IEEE