Quantum walk-based vehicle routing optimisation
- URL: http://arxiv.org/abs/2109.14907v1
- Date: Thu, 30 Sep 2021 08:04:58 GMT
- Title: Quantum walk-based vehicle routing optimisation
- Authors: Tavis Bennett, Edric Matwiejew, Sam Marsh and Jingbo B. Wang
- Abstract summary: This paper demonstrates the applicability of the Quantum Walk-based optimisation algorithm to the Capacitated Vehicle Routing Problem (CVRP)
Efficient algorithms are developedfor the indexing and unindexing of the solution space and for implementing the required alternatingphase-walk unitaries.
Results of numerical simulationdemonstrate that the QWOA is capable of producing convergence to near-optimal solutions for arandomly generated 8 location CVRP.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: This paper demonstrates the applicability of the Quantum Walk-based
Optimisation Algorithm(QWOA) to the Capacitated Vehicle Routing Problem (CVRP).
Efficient algorithms are developedfor the indexing and unindexing of the
solution space and for implementing the required alternatingphase-walk
unitaries, which are the core components of QWOA. Results of numerical
simulationdemonstrate that the QWOA is capable of producing convergence to
near-optimal solutions for arandomly generated 8 location CVRP. Preparation of
the amplified quantum state in this exampleproblem is demonstrated to produce
high-quality solutions, which are more optimal than expectedfrom classical
random sampling of equivalent computational effort.
Related papers
- Distributed Quantum Approximate Optimization Algorithm on Integrated High-Performance Computing and Quantum Computing Systems for Large-Scale Optimization [1.7099366779394252]
Quantum approximated optimization algorithm (QAOA) has shown promise for solving optimization problems by providing quantum speedup on gate-based quantum computing systems.
We propose a distributed QAOA (DQAOA), which leverages a high-performance computing-quantum computing integrated system.
We successfully optimize photonic structures using AL-DQAOA, indicating that solving real-world optimization problems using gate-based quantum computing is feasible with our strategies.
arXiv Detail & Related papers (2024-07-29T17:42:25Z) - Bayesian Parameterized Quantum Circuit Optimization (BPQCO): A task and hardware-dependent approach [49.89480853499917]
Variational quantum algorithms (VQA) have emerged as a promising quantum alternative for solving optimization and machine learning problems.
In this paper, we experimentally demonstrate the influence of the circuit design on the performance obtained for two classification problems.
We also study the degradation of the obtained circuits in the presence of noise when simulating real quantum computers.
arXiv Detail & Related papers (2024-04-17T11:00:12Z) - Compressed sensing enhanced by quantum approximate optimization algorithm [0.0]
We present a framework to deal with a range of large scale compressive sensing problems using a quantum subroutine.
Our results explore a promising path of applying quantum computers in the compressive sensing field.
arXiv Detail & Related papers (2024-03-26T05:26:51Z) - Federated Conditional Stochastic Optimization [110.513884892319]
Conditional optimization has found in a wide range of machine learning tasks, such as in-variant learning tasks, AUPRC, andAML.
This paper proposes algorithms for distributed federated learning.
arXiv Detail & Related papers (2023-10-04T01:47:37Z) - A Feasibility-Preserved Quantum Approximate Solver for the Capacitated Vehicle Routing Problem [3.0567007573383678]
The Capacitated Vehicle Routing Problem (CVRP) is an NP-optimization problem (NPO) that arises in various fields including transportation and logistics.
We present a new binary encoding for the CVRP, with an objective function of minimizing the shortest path that bypasses the vehicle capacity constraint of the CVRP.
We discuss the effectiveness of the proposed encoding under the framework of the variant of the Quantum Alternating Operator Ansatz.
arXiv Detail & Related papers (2023-08-17T05:14:43Z) - Quantum Annealing for Single Image Super-Resolution [86.69338893753886]
We propose a quantum computing-based algorithm to solve the single image super-resolution (SISR) problem.
The proposed AQC-based algorithm is demonstrated to achieve improved speed-up over a classical analog while maintaining comparable SISR accuracy.
arXiv Detail & Related papers (2023-04-18T11:57:15Z) - Exploring the Algorithm-Dependent Generalization of AUPRC Optimization
with List Stability [107.65337427333064]
optimization of the Area Under the Precision-Recall Curve (AUPRC) is a crucial problem for machine learning.
In this work, we present the first trial in the single-dependent generalization of AUPRC optimization.
Experiments on three image retrieval datasets on speak to the effectiveness and soundness of our framework.
arXiv Detail & Related papers (2022-09-27T09:06:37Z) - A Dynamical Systems Approach for Convergence of the Bayesian EM
Algorithm [59.99439951055238]
We show how (discrete-time) Lyapunov stability theory can serve as a powerful tool to aid, or even lead, in the analysis (and potential design) of optimization algorithms that are not necessarily gradient-based.
The particular ML problem that this paper focuses on is that of parameter estimation in an incomplete-data Bayesian framework via the popular optimization algorithm known as maximum a posteriori expectation-maximization (MAP-EM)
We show that fast convergence (linear or quadratic) is achieved, which could have been difficult to unveil without our adopted S&C approach.
arXiv Detail & Related papers (2020-06-23T01:34:18Z) - Cross Entropy Hyperparameter Optimization for Constrained Problem
Hamiltonians Applied to QAOA [68.11912614360878]
Hybrid quantum-classical algorithms such as Quantum Approximate Optimization Algorithm (QAOA) are considered as one of the most encouraging approaches for taking advantage of near-term quantum computers in practical applications.
Such algorithms are usually implemented in a variational form, combining a classical optimization method with a quantum machine to find good solutions to an optimization problem.
In this study we apply a Cross-Entropy method to shape this landscape, which allows the classical parameter to find better parameters more easily and hence results in an improved performance.
arXiv Detail & Related papers (2020-03-11T13:52:41Z) - Solving Vehicle Routing Problem Using Quantum Approximate Optimization
Algorithm [0.0]
We describe the Quantum Approximate Optimization Algorithm (QAOA) to solve the integer programming task known as Vehicle Routing Problem (VRP)
We outline the Ising formulation for VRP and present a detailed procedure to solve VRP by minimizing its simulated Ising Hamiltonian using the IBM Qiskit platform.
arXiv Detail & Related papers (2020-02-02T18:12:19Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.