|
|
|
|
|
Aaron Barbosa, Elijah Pelofske, Georg Hahn and Hristo N. Djidjev
Quantum annealers, such as the device built by D-Wave Systems, Inc., offer a way to compute solutions of NP-hard problems that can be expressed in Ising or quadratic unconstrained binary optimization (QUBO) form. Although such solutions are typically of ...
ver más
|
|
|
|
|
|
|
|
|
|
|
Tomas Vyskocil and Hristo Djidjev
Quantum annealers such as D-Wave machines are designed to propose solutions for quadratic unconstrained binary optimization (QUBO) problems by mapping them onto the quantum processing unit, which tries to find a solution by measuring the parameters of a ...
ver más
|
|
|
|
|
|
|
|
|
|
|
Christos Papalitsas, Theodore Andronikos, Konstantinos Giannakis, Georgia Theocharopoulou and Sofia Fanarioti
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 time constraints that a feasible solution must satisfy. These take the form of inequality...
ver más
|
|
|
|
|
|
|
|
|
|
|
Parfait Atchade-Adelomou, Guillermo Alonso-Linaje, Jordi Albo-Canals and Daniel Casado-Fauli
This article aims to bring quantum computing to robotics. A quantum algorithm is developed to minimize the distance traveled in warehouses and distribution centers where order picking is applied. For this, a proof of concept is proposed through a Raspber...
ver más
|
|
|
|
|
|
|
|
|
|
|
Massimiliano Cutugno, Annarita Giani, Paul M. Alsing, Laura Wessing and Austar Schnore
Quantum computing has the potential to revolutionize the way hard computational problems are solved in terms of speed and accuracy. Quantum hardware is an active area of research and different hardware platforms are being developed. Quantum algorithms ta...
ver más
|
|
|
|
|
|
|
|
|
|
|
Aleksey I. Pakhomchik, Vladimir V. Voloshinov, Valerii M. Vinokur and Gordey B. Lesovik
There exists a wide range of constraint programming (CP) problems defined on Boolean functions depending on binary variables. One of the approaches to solving CP problems is using specific appropriate solvers, e.g., SAT solvers. An alternative is using t...
ver más
|
|
|
|
|
|