On the relevance of avoided crossings away from quantum critical point to the complexity of quantum adiabatic algorithm
Sergey KnyshVadim N. SmelyanskiyPublished in: CoRR (2010)
Keyphrases
- worst case
- experimental evaluation
- computational complexity
- cost function
- dynamic programming
- space complexity
- detection algorithm
- computational cost
- objective function
- quantum inspired
- memory requirements
- optimization algorithm
- search space
- preprocessing
- learning algorithm
- np hard
- k means
- complexity analysis
- linear complexity
- probabilistic model
- relevance feedback
- significant improvement
- principal component analysis
- simulated annealing
- recognition algorithm
- optimal solution