Quantum annealing learning search for solving QUBO problems

DOI10.1007/s11128-019-2418-zOpenAlexW3099327692MaRDI QIDQ2105948

Davide Pastorello, E. Blanzieri

Publication date: 8 December 2022

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

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

zbMATH Keywords

tabu searchoptimization problemsquantum annealing

Mathematics Subject Classification ID

Artificial neural networks and deep learning (68T07) Combinatorial optimization (90C27) Quantum computation (81P68)

Related Items

Evaluating the convergence of tabu enhanced hybrid quantum optimization ⋮ Spiking neural network dynamic system modeling for computation of quantum annealing and its convergence analysis ⋮ Mapping a logical representation of TSP to quantum annealing

Cites Work

• Solving SAT and MaxSAT with a quantum annealer: foundations and a preliminary report
• Building an iterative heuristic solver for a quantum annealer
• Quantum annealing and related optimization methods
• Mathematical foundation of quantum annealing
• Simulated annealing methods with general acceptance probabilities
• Ergodicity in Parametric Nonstationary Markov Chains: An Application to Simulated Annealing Methods
• Note on the Convergence of Simulated Annealing Algorithms
• Some Convergence Results for Probabilistic Tabu Search
• Tabu Search—Part I
• Tabu Search—Part II
• Finite Markov Chains and Algorithmic Applications