8 search results - page 2 / 2 » Exponential algorithmic speedup by a quantum walk |
STOC
2006
ACM
13 years 11 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...
CRYPTO
2011
Springer
12 years 5 months ago
2011
Springer
Very few public-key cryptosystems are known that can encrypt and decrypt in time b2+o(1) with conjectured security level 2b against conventional computers and quantum computers. Th...
INFOCOM
2010
IEEE
13 years 3 months ago
2010
IEEE
—More fundamental than IP lookups and packet classification in routers is the extraction of fields such as IP Dest and TCP Ports that determine packet forwarding. While parsing...