The Internet Archive has a preservation copy of this work in our general collections.
The file type is `application/pdf`

.

##
###
Limitations of Quantum Coset States for Graph Isomorphism
[article]

2005
*
arXiv
*
pre-print

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 solving instances of the HSP. A common feature of the resulting algorithms is the use of quantum coset states, which encode the hidden subgroup. An open question has been how hard it is to use these states to solve graph isomorphism. It was recently shown by Moore, Russell, and Schulman that only an exponentially

arXiv:quant-ph/0511148v1
fatcat:lofr5oudnbfkxo47niwccjojje