: Can Grover’s algorithm speed up search of a physical region—for example a 2-D grid of size √ n × √ n? The problem is that √ n time seems to be needed for each query, j...
We study the problem of local search on a graph. Given a real-valued black-box function f on the graph's vertices, this is the problem of determining a local minimum of f--a v...
This paper presents a variant of Quantum behaved Particle Swarm Optimization (QPSO) named Q-QPSO for solving global optimization problems. The Q-QPSO algorithm is based on the cha...
This paper extends the analogies employed in the development of quantum-inspired evolutionary algorithms by proposing quantum-inspired Hadamard walks, called QHW. A novel quantum-...
Traditional boosting algorithms for the ranking problems usually employ the pairwise approach and convert the document rating preference into a binary-value label, like RankBoost....
Chenguang Zhu, Weizhu Chen, Zeyuan Allen Zhu, Gang...