Discrete-time quantum walk algorithm for ranking nodes on a network.
Prateek ChawlaRoopesh MangalC. M. ChandrashekarPublished in: Quantum Inf. Process. (2020)
Keyphrases
- dynamic programming
- learning algorithm
- optimal solution
- computational complexity
- segmentation algorithm
- worst case
- fully connected
- detection algorithm
- optimization algorithm
- expectation maximization
- np hard
- artificial neural networks
- preprocessing
- simulated annealing
- k means
- search space
- learning to rank
- graph structure
- objective function