Limitations of Quantum Coset States for Graph Isomorphism
مقال من تأليف: Hallgren, Sean ; Moore, Cristopher ; Rotteler, Martin ; Russell, Alexander ; Sen, Pranab ;
ملخص: 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
لغة:
إنجليزية