Implementation of a Hybrid Classical-Quantum Annealing Algorithm for Logistic Network Design
arXiv:1906.10074 · doi:10.1007/s42979-021-00466-2
Abstract
The logistic network design is an abstract optimization problem that, under the assumption of minimal cost, seeks the optimal configuration of the supply chain's infrastructures and facilities based on customer demand. Key economic decisions are taken about the location, number, and size of manufacturing facilities and warehouses based on the optimal solution. Therefore, improvements in the methods to address this question, which is known to be in the NP-hard complexity class, would have relevant financial consequences. Here, we implement in the D-Wave quantum annealer a hybrid classical-quantum annealing algorithm. The cost function with constraints is translated to a spin Hamiltonian, whose ground state encodes the searched result. As a benchmark, we measure the accuracy of results for a set of paradigmatic problems against the optimal published solutions (the error is on average below ), and the performance is compared against the classical algorithm, showing a remarkable reduction in the number of iterations. This work shows that state-of-the-art quantum annealers may codify and solve relevant supply-chain problems even still far from useful quantum supremacy.
arXiv comment9 pages and 2 figures
References in corpus (18)
- Quantum Annealing in the Transverse Ising Model
- Theory of Quantum Annealing of an Ising Spin Glass
- Quantum Annealing and Analog Quantum Computation
- Quantum computing for finance: overview and prospects
- Quantum Annealing: A New Method for Minimizing Multidimensional Functions
- Quantum Computation by Adiabatic Evolution
- Perspectives of quantum annealing: Methods and implementations
- Adiabatic Theorem without a Gap Condition
- Solving the Optimal Trading Trajectory Problem Using a Quantum Annealer
- Improving solutions by embedding larger subproblems in a D-Wave quantum annealer
- Demonstration of nonstoquastic Hamiltonian in coupled superconducting flux qubits
- Shortcuts to adiabaticity for quantum annealing
- Fast and robust control of two interacting spins
- Quantum computing cryptography: Finding cryptographic Boolean functions with quantum annealing by a 2000 qubit D-wave quantum computer
- Shortcuts to Adiabatic Classical Spin Dynamics Mimicking Quantum Annealing
- Reverse engineering protocols for controlling spin dynamics
- A Hybrid Quantum-Classical Paradigm to Mitigate Embedding Costs in Quantum Annealing
- Quantum Advantage in Cryptography with a Low-Connectivity Quantum Annealer
Cited by in corpus (13)
- Quantum simulation and computing with Rydberg-interacting qubits
- Travel time optimization on multi-AGV routing by reverse annealing
- Understanding domain-wall encoding theoretically and experimentally
- Hybrid Quantum-Classical Heuristic for the Bin Packing Problem
- Efficient Algorithm for Binary Quadratic Problem by Column Generation and Quantum Annealing
- Virtual Screening of Chemical Space based on Quantum Annealing
- Test Case Minimization with Quantum Annealers
- Integrating quantum and classical computing for multi-energy system optimization using Benders decomposition
- Individual subject evaluated difficulty of adjustable mazes generated using quantum annealing
- Hybrid Algorithm of Linear Programming Relaxation and Quantum Annealing
- Online calibration scheme for training restricted Boltzmann machines with quantum annealing
- Quantum annealing in the NISQ era: railway conflict management
- Digital representation of continuous observables in Quantum Mechanics