Evaluating the convergence of tabu enhanced hybrid quantum optimization
From MaRDI portal
Publication:6159265
Abstract: In this paper we introduce the Tabu Enhanced Hybrid Quantum Optimization metaheuristic approach useful for optimization problem solving on a quantum hardware. We address the theoretical convergence of the proposed scheme from the viewpoint of the collisions in the object which stores the tabu states, based on the Ising model. The results of numerical evaluation of the algorithm on quantum hardware as well as on a classical semiconductor hardware model are also demonstrated.
Recommendations
- Quantum annealing learning search for solving QUBO problems
- Quantum optimization
- A study of the performance of classical minimizers in the quantum approximate optimization algorithm
- An improved hybrid quantum optimization algorithm for solving nonlinear equations
- An improved quantum annealing algorithm
Cites work
- Applied Probability and Queues
- Bounds for the adiabatic approximation with applications to quantum computation
- Convergence theorems for quantum annealing
- Integrating and accelerating tabu search, simulated annealing, and genetic algorithms
- On the convergence of generalized hill climbing algorithms
- On the hitting times of quantum versus random walks
- Probability distributions for Markov chain based quantum walks
- Quantum annealing learning search for solving QUBO problems
- Quantum annealing with Markov chain Monte Carlo simulations and D-wave quantum computers
- Quantum computation and quantum information. 10th anniversary edition
- Quantum computing for the quantum curious
- QUANTUM HITTING TIME ON THE COMPLETE GRAPH
- Some Convergence Results for Probabilistic Tabu Search
- Tabu search and finite convergence
- The Theory and Practice of Simulated Annealing
This page was built for publication: Evaluating the convergence of tabu enhanced hybrid quantum optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6159265)