Efficient Quantum Algorithms For Some Instances Of The Non-Abelian Hidden Subgroup Problem.
Gábor IvanyosFrédéric MagniezMiklos SanthaPublished in: Int. J. Found. Comput. Sci. (2003)
Keyphrases
- computationally expensive
- algorithmic solutions
- orders of magnitude
- learning algorithm
- computationally intensive
- computationally efficient
- computational cost
- computational efficiency
- computationally complex
- highly scalable
- benchmark datasets
- theoretical analysis
- significant improvement
- highly efficient
- linear programming
- complexity analysis
- np hard
- stochastic local search
- computationally demanding
- reinforcement learning