Evaluating the convergence of tabu enhanced hybrid quantum optimization

DOI10.1007/s11128-023-03943-0arXiv2209.01799MaRDI QIDQ6159265

Mariia Maltseva, Aleksandr Rumyantsev, Valter Cavecchia, Davide Pastorello, E. Blanzieri

Publication date: 1 June 2023

Published in: Quantum Information Processing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2209.01799

zbMATH Keywords

tabu searchhybrid approachIsing modelquantum annealingalgorithm convergence

Mathematics Subject Classification ID

Quantum computation (81P68)

Cites Work

• Tabu search and finite convergence
• On the convergence of generalized hill climbing algorithms
• Quantum annealing with Markov chain Monte Carlo simulations and D-wave quantum computers
• Quantum annealing learning search for solving QUBO problems
• Integrating and accelerating tabu search, simulated annealing, and genetic algorithms
• On the hitting times of quantum versus random walks
• QUANTUM HITTING TIME ON THE COMPLETE GRAPH
• Quantum Computation and Quantum Information
• Convergence theorems for quantum annealing
• Bounds for the adiabatic approximation with applications to quantum computation
• Adiabatic Quantum Computation Is Equivalent to Standard Quantum Computation
• Some Convergence Results for Probabilistic Tabu Search
• The Theory and Practice of Simulated Annealing
• Probability distributions for Markov chain based quantum walks
• Applied Probability and Queues
• Quantum Computing for the Quantum Curious

This page was built for publication: Evaluating the convergence of tabu enhanced hybrid quantum optimization