Quantum annealing learning search for solving QUBO problems
From MaRDI portal
Publication:2105948
DOI10.1007/S11128-019-2418-ZOpenAlexW3099327692MaRDI QIDQ2105948FDOQ2105948
Authors: Davide Pastorello, Enrico 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
Recommendations
- Embedding equality constraints of optimization problems into a quantum annealer
- Building an iterative heuristic solver for a quantum annealer
- An improved quantum annealing algorithm
- Study on Quantum Annealing Using the Density Matrix Renormalization Group
- Efficiency of quantum vs. classical annealing in nonconvex learning problems
Artificial neural networks and deep learning (68T07) Combinatorial optimization (90C27) Quantum computation (81P68)
Cites Work
- Tabu Search—Part I
- Tabu Search—Part II
- Finite Markov Chains and Algorithmic Applications
- Note on the Convergence of Simulated Annealing Algorithms
- Some Convergence Results for Probabilistic Tabu Search
- Mathematical foundation of quantum annealing
- Simulated annealing methods with general acceptance probabilities
- Solving SAT and MaxSAT with a quantum annealer: foundations and a preliminary report
- Quantum annealing and related optimization methods
- Ergodicity in Parametric Nonstationary Markov Chains: An Application to Simulated Annealing Methods
- Building an iterative heuristic solver for a quantum annealer
Cited In (19)
- Mapping a logical representation of TSP to quantum annealing
- Efficiency of quantum vs. classical annealing in nonconvex learning problems
- Quantum approximate optimization algorithm for Bayesian network structure learning
- Embedding equality constraints of optimization problems into a quantum annealer
- Penalty and partitioning techniques to improve performance of QUBO solvers
- Evaluating the convergence of tabu enhanced hybrid quantum optimization
- Boolean hierarchical Tucker networks on quantum annealers
- A hybrid quantum-classical paradigm to mitigate embedding costs in quantum annealing
- FEqa: Finite element computations on quantum annealers
- Modeling the Costas array problem in QUBO for quantum annealing
- Quantum Annealing with Anneal Path Control: Application to 2-SAT Problems with Known Energy Landscapes
- Least-squares solutions to polynomial systems of equations with quantum annealing
- An improved annealing scheme for the QAP
- Enhancing quantum annealing performance for the molecular similarity problem
- Spiking neural network dynamic system modeling for computation of quantum annealing and its convergence analysis
- Quantum reinforcement learning. Comparing quantum annealing and gate-based quantum computing with classical deep reinforcement learning
- Building an iterative heuristic solver for a quantum annealer
- The potential of quantum annealing for rapid solution structure identification
- A quantum walk-assisted approximate algorithm for bounded NP optimisation problems
This page was built for publication: Quantum annealing learning search for solving QUBO problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2105948)
