Models in quantum computing: a systematic review

P Nimbe, BA Weyori, AF Adekoya - Quantum Information Processing, 2021 - Springer
Quantum computing is computing beyond classical computing based on quantum
phenomena such as superposition and entanglement. While quantum computing is still …

Physics-inspired optimization for quadratic unconstrained problems using a digital annealer

M Aramon, G Rosenberg, E Valiante, T Miyazawa… - Frontiers in …, 2019 - frontiersin.org
The Fujitsu Digital Annealer is designed to solve fully connected quadratic unconstrained
binary optimization (QUBO) problems. It is implemented on application-specific CMOS …

[PDF][PDF] A history of metaheuristics

K Sorensen, M Sevaux, F Glover - arxiv preprint arxiv:1704.00853, 2017 - arxiv.org
A History of Metaheuristics arxiv:1704.00853v1 [cs.AI] 4 Apr 2017 Page 1 A History of
Metaheuristics ∗ Kenneth Sörensen Marc Sevaux Fred Glover Abstract This chapter …

Efficient partition of integer optimization problems with one-hot encoding

S Okada, M Ohzeki, S Taguchi - Scientific reports, 2019 - nature.com
Quantum annealing is a heuristic algorithm for solving combinatorial optimization problems,
and hardware for implementing this algorithm has been developed by D-Wave Systems Inc …

A QUBO model for the traveling salesman problem with time windows

C Papalitsas, T Andronikos, K Giannakis… - Algorithms, 2019 - mdpi.com
This work focuses on expressing the TSP with Time Windows (TSPTW for short) as a
quadratic unconstrained binary optimization (QUBO) problem. The time windows impose …

Improving solutions by embedding larger subproblems in a D-Wave quantum annealer

S Okada, M Ohzeki, M Terabe, S Taguchi - Scientific reports, 2019 - nature.com
Quantum annealing is a heuristic algorithm that solves combinatorial optimization problems,
and D-Wave Systems Inc. has developed hardware implementation of this algorithm …

Practical annealing-based quantum computing

CC McGeoch, R Harris, SP Reinhardt, PI Bunyk - Computer, 2019 - ieeexplore.ieee.org
An overview of quantum computers based on the annealing paradigm and manufactured by
D-Wave is given. An introductory survey of this approach to quantum computing (QC) …

A hybrid approach for solving optimization problems on small quantum computers

R Shaydulin, H Ushijima-Mwesigwa, CFA Negre… - Computer, 2019 - ieeexplore.ieee.org
Solving larger-sized problems is an important area of research in quantum computing.
Designing hybrid quantumclassical algorithms is a promising approach to solving this. We …

A hybrid quantum-classical approach to solving scheduling problems

T Tran, M Do, E Rieffel, J Frank, Z Wang… - Proceedings of the …, 2016 - ojs.aaai.org
An effective approach to solving complex problems is to decompose them and integrate
dedicated solvers for those subproblems. We introduce a hybrid decomposition that …

Quadratic unconstrained binary optimization problem preprocessing: Theory and empirical analysis

M Lewis, F Glover - Networks, 2017 - Wiley Online Library
The Quadratic Unconstrained Binary Optimization problem (QUBO) has become a unifying
model for representing a wide range of combinatorial optimization problems, and for linking …