Traffic flow optimization using a quantum annealer

August 04, 2017 Β· Declared Dead Β· πŸ› Frontiers in ICT

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Florian Neukart, Gabriele Compostella, Christian Seidel, David von Dollen, Sheir Yarkoni, Bob Parney arXiv ID 1708.01625 Category quant-ph: Quantum Computing Cross-listed cs.DS Citations 429 Venue Frontiers in ICT Last Checked 1 month ago
Abstract
Quantum annealing algorithms belong to the class of meta-heuristic tools, applicable for solving binary optimization problems. Hardware implementations of quantum annealing, such as the quantum processing units (QPUs) produced by D-Wave Systems, have been subject to multiple analyses in research, with the aim of characterizing the technology's usefulness for optimization and sampling tasks. In this paper, we present a real-world application that uses quantum technologies. Specifically, we show how to map certain parts of the real-world traffic flow optimization problem to be suitable for quantum annealing. We show that time-critical optimization tasks, such as continuous redistribution of position data for cars in dense road networks, are suitable candidates for quantum applications. Due to the limited size and connectivity of current-generation D-Wave QPUs, we use a hybrid quantum and classical approach to solve the traffic flow problem.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Quantum Computing

R.I.P. πŸ‘» Ghosted

Variational Quantum Algorithms

M. Cerezo, Andrew Arrasmith, ... (+9 more)

quant-ph πŸ› Nature Reviews Physics πŸ“š 3.3K cites 5 years ago

Died the same way β€” πŸ‘» Ghosted