Efficient quantum algorithms for some instances of the non-Abelian hidden subgroup problem.
Gábor IvanyosFrédéric MagniezMiklos SanthaPublished in: SPAA (2001)
Keyphrases
- computationally efficient
- highly efficient
- efficient implementation
- times faster
- computational complexity
- significant improvement
- computationally expensive
- optimization problems
- computationally complex
- highly scalable
- theoretical analysis
- worst case
- computational cost
- stochastic local search
- efficient solutions
- complexity analysis
- randomly generated
- run times
- orders of magnitude
- combinatorial optimization
- computational efficiency
- neural network
- benchmark datasets
- np complete
- bayesian networks
- learning algorithm
- information retrieval