6 citations · 6 across the 1 of their papers we have counts for
5 papers
Solving workflow scheduling problems with QUBO modeling
A. I. Pakhomchik, S. Yudin, M. R. Perelshtein +2
In this paper we investigate the workflow scheduling problem, a known NP-hard class of scheduling problems. We derive problem instances from an industrial use case and compare agai…
Quantum Shuttle: Traffic Navigation with Quantum Computing
Sheir Yarkoni, Florian Neukart, Eliane Moreno Gomez Tagle +5
The Web Summit conference in Lisbon, Portugal, is one of the biggest technology conferences in Europe, attended by tens of thousands of people every year. The high influx of people…
Semi-supervised time series classification method for quantum computing
Sheir Yarkoni, Andrii Kleshchonok, Yury Dzerin +2
In this paper we develop methods to solve two problems related to time series (TS) analysis using quantum computing: reconstruction and classification. We formulate the task of rec…
Traffic flow optimization using a quantum annealer
Florian Neukart, Gabriele Compostella, Christian Seidel +3
Quantum annealing algorithms belong to the class of meta-heuristic tools, applicable for solving binary optimization problems. Hardware implementations of quantum annealing, such a…
Quantum Annealing amid Local Ruggedness and Global Frustration
James King, Sheir Yarkoni, Jack Raymond +5
A recent Google study [Phys. Rev. X, 6:031015 (2016)] compared a D-Wave 2X quantum processing unit (QPU) to two classical Monte Carlo algorithms: simulated annealing (SA) and quant…