Quantum annealing learning search for solving QUBO problems
From MaRDI portal
Publication:2105948
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
Cites work
- Building an iterative heuristic solver for a quantum annealer
- Ergodicity in Parametric Nonstationary Markov Chains: An Application to Simulated Annealing Methods
- Finite Markov Chains and Algorithmic Applications
- Mathematical foundation of quantum annealing
- Note on the Convergence of Simulated Annealing Algorithms
- Quantum annealing and related optimization methods
- Simulated annealing methods with general acceptance probabilities
- Solving SAT and MaxSAT with a quantum annealer: foundations and a preliminary report
- Some Convergence Results for Probabilistic Tabu Search
- Tabu Search—Part I
- Tabu Search—Part II
Cited in
(23)- FEqa: Finite element computations on quantum annealers
- Embedding equality constraints of optimization problems into a quantum annealer
- Enhancing quantum annealing performance for the molecular similarity problem
- The potential of quantum annealing for rapid solution structure identification
- Deep learning optimal quantum annealing schedules for random Ising models
- A copositive framework for analysis of hybrid Ising-classical algorithms
- Penalty and partitioning techniques to improve performance of QUBO solvers
- Modeling the Costas array problem in QUBO for quantum annealing
- A hybrid quantum-classical paradigm to mitigate embedding costs in quantum annealing
- 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
- Efficiency of quantum vs. classical annealing in nonconvex learning problems
- A study of scalarisation techniques for multi-objective QUBO solving
- Building an iterative heuristic solver for a quantum annealer
- Evaluating the convergence of tabu enhanced hybrid quantum optimization
- Quantum approximate optimization algorithm for Bayesian network structure learning
- A quantum walk-assisted approximate algorithm for bounded NP optimisation problems
- A quantum annealing-sequential quadratic programming assisted finite element simulation for non-linear and history-dependent mechanical problems
- Boolean hierarchical Tucker networks on quantum annealers
- Mapping a logical representation of TSP to quantum annealing
- Least-squares solutions to polynomial systems of equations with quantum annealing
- Quantum Annealing with Anneal Path Control: Application to 2-SAT Problems with Known Energy Landscapes
- An improved annealing scheme for the QAP
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)
