Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
184 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Qubit efficient quantum algorithms for the vehicle routing problem on NISQ processors (2306.08507v2)

Published 14 Jun 2023 in quant-ph and cs.DS

Abstract: The vehicle routing problem with time windows (VRPTW) is a common optimization problem faced within the logistics industry. In this work, we explore the use of a previously-introduced qubit encoding scheme to reduce the number of binary variables, to evaluate the effectiveness of NISQ devices when applied to industry relevant optimization problems. We apply a quantum variational approach to a testbed of multiple VRPTW instances ranging from 11 to 3964 routes. These intances were formulated as quadratic unconstrained binary optimization (QUBO) problems based on realistic shipping scenarios. We compare our results with standard binary-to-qubit mappings after executing on simulators as well as various quantum hardware platforms, including IBMQ, AWS (Rigetti), and IonQ. These results are benchmarked against the classical solver, Gurobi. Our approach can find approximate solutions to the VRPTW comparable to those obtained from quantum algorithms using the full encoding, despite the reduction in qubits required. These results suggest that using the encoding scheme to fit larger problem sizes into fewer qubits is a promising step in using NISQ devices to find approximate solutions for industry-based optimization problems, although additional resources are still required to eke out the performance from larger problem sizes.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (126)
  1. Applying the quantum approximate optimization algorithm to the tail-assignment problem. Physical Review Applied, 14(3):034009, 2020.
  2. Formulating and solving routing problems on quantum computers. IEEE Transactions on Quantum Engineering, 2:1–17, 2021.
  3. The unconstrained binary quadratic programming problem: a survey. Journal of Combinatorial Optimization, 28(1):58–81, 2014.
  4. A tutorial on formulating and using qubo models. arXiv preprint arXiv:1811.11538, 2018.
  5. Unconstrained binary models of the travelling salesman problem variants for quantum optimization. Quantum Information Processing, 21(2):67, 2022.
  6. Encoding-independent optimization problem formulation for quantum computing. arXiv preprint arXiv:2302.03711, 2023.
  7. Financial portfolio optimization: a qubo formulation for sharpe ratio maximization, 2023.
  8. Quantum bridge analytics i: a tutorial on formulating and using qubo models. Annals of Operations Research, 314(1):141–183, Jul 2022.
  9. Beating classical heuristics for the binary paint shop problem with the quantum approximate optimization algorithm. Phys. Rev. A, 104:012403, Jul 2021.
  10. Quantum annealing implementation of job-shop scheduling. arXiv preprint arXiv:1506.08479, 2015.
  11. Using the parameterized quantum circuit combined with variational-quantum-eigensolver (vqe) to create an intelligent social workers’ schedule problem solver, 2020.
  12. The truck dispatching problem. Management science, 6(1):80–91, 1959.
  13. The vehicle routing problem: State of the art classification and review. Computers & industrial engineering, 99:300–313, 2016.
  14. The vehicle routing problem. SIAM, 2002.
  15. Survey of green vehicle routing problem: past and future trends. Expert systems with applications, 41(4):1118–1138, 2014.
  16. The green vehicle routing problem: A systematic literature review. Journal of Cleaner Production, 279:123691, 2021.
  17. Energy minimizing vehicle routing problem. In Combinatorial Optimization and Applications: First International Conference, COCOA 2007, Xi’an, China, August 14-16, 2007. Proceedings 1, pages 62–71. Springer, 2007.
  18. F Barahona. On the computational complexity of ising spin glass models. Journal of Physics A: Mathematical and General, 15(10):3241, oct 1982.
  19. Noisy intermediate-scale quantum algorithms. Rev. Mod. Phys., 94:015004, Feb 2022.
  20. Encoding trade-offs and design toolkits in quantum algorithms for discrete optimization: coloring, routing, scheduling, and other problems. arXiv preprint arXiv:2203.14432, 2022.
  21. Quantum annealing: A new method for minimizing multidimensional functions. Chemical Physics Letters, 219(5):343–348, 1994.
  22. Quantum annealing in the transverse ising model. Phys. Rev. E, 58:5355–5363, Nov 1998.
  23. A quantum approximate optimization algorithm. arXiv preprint arXiv:1411.4028, 2014.
  24. A quantum approximate optimization algorithm applied to a bounded occurrence constraint problem. arXiv preprint arXiv:1412.6062, 2014.
  25. The quantum approximate optimization algorithm and the sherrington-kirkpatrick model at infinite size. arXiv preprint arXiv:1910.08187, 2019.
  26. A review on quantum approximate optimization algorithm and its variants, 2023.
  27. From the quantum approximate optimization algorithm to a quantum alternating operator ansatz. Algorithms, 12(2):34, 2019.
  28. Quantum approximate optimization algorithm: Performance, mechanism, and implementation on near-term devices. arXiv preprint arXiv:1812.01041, 2018.
  29. Exploring airline gate-scheduling optimization using quantum computers, 2021.
  30. On the variational perspectives to the graph isomorphism problem, 2021.
  31. Quantum variational optimization: The role of entanglement and problem hardness. Phys. Rev. A, 104:062426, Dec 2021.
  32. Quantum computing for finance: State-of-the-art and future prospects. IEEE Transactions on Quantum Engineering, 1:1–24, 2020.
  33. Filtering variational quantum algorithms for combinatorial optimization. Quantum Science and Technology, 7(1):015021, 2022.
  34. John Preskill. Quantum Computing in the NISQ era and beyond. Quantum, 2:79, August 2018.
  35. The bitter truth about gate-based quantum algorithms in the nisq era. Quantum Science and Technology, 5(4):044007, 2020.
  36. Nisq computing: where are we and where do we go? AAPPS Bulletin, 32(1):27, 2022.
  37. Logical and inequality implications for reducing the size and difficulty of quadratic unconstrained binary optimization problems. European Journal of Operational Research, 265(3):829–842, 2018.
  38. Quadratic unconstrained binary optimization problem preprocessing: Theory and empirical analysis. Netw., 70(2):79–97, September 2017.
  39. Preprocessing of unconstrained quadratic binary optimization. RUTCOR Research Report, 01 2006.
  40. Combinatorial persistency criteria for multicut and max-cut. In 2019 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), pages 6086–6095, 2019.
  41. Engineering Kernelization for Maximum Cut, pages 27–41. 2020 Proceedings of the Symposium on Algorithm Engineering and Experiments (ALENEX), 2020.
  42. Minimization of Nonlinear Pseudo-Boolean Functions, pages 113–134. Springer Berlin Heidelberg, Berlin, Heidelberg, 1968.
  43. QAOA with n⋅p≥200⋅𝑛𝑝200n\cdot p\geq 200italic_n ⋅ italic_p ≥ 200, 2023.
  44. Quantum annealing vs. QAOA: 127 qubit higher-order Ising problems on NISQ computers. In Lecture Notes in Computer Science, pages 240–258. Springer Nature Switzerland, 2023.
  45. Fast quantum circuit cutting with randomized measurements. Quantum, 7:934, March 2023.
  46. Divide and conquer for combinatorial optimization and distributed quantum computation, 2022.
  47. Investigating the effect of circuit cutting in QAOA for the Maxcut problem on NISQ devices, 2023.
  48. Simulating large quantum circuits on a small quantum computer. Physical Review Letters, 125(15), October 2020.
  49. Deep variational quantum eigensolver: A divide-and-conquer method for solving a larger problem with smaller size quantum computers. PRX Quantum, 3:010346, March 2022.
  50. Constructing a virtual two-qubit gate by sampling single-qubit operations. New Journal of Physics, 23(2):023021, February 2021.
  51. Trading classical and quantum computational resources. Physical Review X, 6(2), June 2016.
  52. Variational quantum eigensolver with reduced circuit complexity. npj Quantum Information, 8(1):96, August 2022.
  53. Hybrid gate-based and annealing quantum computing for large-size Ising problems, 2022.
  54. Partitioning optimization problems for hybrid classical/quantum execution. Technical report, Technical Report, http://www. dwavesys. com, 2017.
  55. Scaleqc: A scalable framework for hybrid computation on quantum and classical processors, 2022.
  56. Circuit knitting with classical communication, 2023.
  57. Space-efficient binary optimization for variational quantum computing. npj Quantum Information, 8(1):39, Apr 2022.
  58. Jose I. Latorre. Image compression and entanglement, 2005.
  59. Variational algorithms for workflow scheduling problem in gate-based quantum devices. COMPUTING AND INFORMATICS, 40(4):897–929, December 2021.
  60. Qubit-efficient encoding schemes for binary optimisation problems. Quantum, 5:454, may 2021.
  61. Approximate solutions of combinatorial problems via quantum relaxations, 2021.
  62. Quantum-relaxation based optimization algorithms: Theoretical extensions, 2023.
  63. Marko J. Rančić. Noisy intermediate-scale quantum computing algorithm for solving an n𝑛nitalic_n-vertex Maxcut problem with log(n𝑛nitalic_n) qubits. Phys. Rev. Res., 5:L012021, February 2023.
  64. A comparative study on solving optimization problems with exponentially fewer qubits, 2022.
  65. Variational quantum eigensolver with fewer qubits. Physical Review Research, 1(2), September 2019.
  66. Qubit-reuse compilation with mid-circuit measurement and reset, 2022.
  67. Exploiting qubit reuse through mid-circuit measurement and reset, 2023.
  68. Some simple applications of the travelling salesman problem. Journal of the Operational Research Society, 26(4):717–733, 1975.
  69. The travelling salesman problem and related problems, 1978.
  70. Survey paper—time window constrained routing and scheduling problems. Transportation science, 22(1):1–13, 1988.
  71. Marius M Solomon. Algorithms for the vehicle routing and scheduling problems with time window constraints. Operations research, 35(2):254–265, 1987.
  72. Vehicle routing problem with time windows, part i: Route construction and local search algorithms. Transportation science, 39(1):104–118, 2005.
  73. Optimization by simulated annealing. science, 220(4598):671–680, 1983.
  74. R.A. Rutenbar. Simulated annealing algorithms: an overview. IEEE Circuits and Devices Magazine, 5(1):19–26, 1989.
  75. Simulated Annealing. Statistical Science, 8(1):10 – 15, 1993.
  76. Simulated annealing: a review and a new scheme. In 2021 IEEE Statistical Signal Processing Workshop (SSP), pages 101–105, 2021.
  77. A theoretical framework for simulated annealing. Algorithmica, 6(1):302–345, Jun 1991.
  78. R.W. Eglese. Simulated annealing: A tool for operational research. European Journal of Operational Research, 46(3):271–281, 1990.
  79. Fred Glover. Tabu search: A tutorial. Interfaces, 20(4):74–94, 1990.
  80. Tabu search. In Ding-Zhu Du and Panos M. Pardalos, editors, Handbook of Combinatorial Optimization: Volume1–3, pages 2093–2229. Springer US, Boston, MA, 1998.
  81. A multilevel algorithm for large unconstrained binary quadratic optimization. In Integration of AI and OR Techniques in Contraint Programming for Combinatorial Optimzation Problems: 9th International Conference, CPAIOR 2012, Nantes, France, May 28–June1, 2012. Proceedings 9, pages 395–408. Springer, 2012.
  82. Stochastic optimization: a review. International Statistical Review, 70(3):315–349, 2002.
  83. A hybrid framework using a qubo solver for permutation-based combinatorial optimization. arXiv preprint arXiv:2009.12767, 2020.
  84. Continuous metaheuristics for binary optimization problems: An updated systematic literature review. Mathematics, 11(1), 2023.
  85. A survey on recent progress in the theory of evolutionary algorithms for discrete optimization. ACM Trans. Evol. Learn. Optim., 1(4), oct 2021.
  86. Ant algorithms for discrete optimization. Artificial Life, 5(2):137–172, 1999.
  87. A. Grama and V. Kumar. State of the art in parallel search techniques for discrete optimization problems. IEEE Transactions on Knowledge and Data Engineering, 11(1):28–35, 1999.
  88. Parallel best-first branch- and-bound in discrete optimization: A framework. In Afonso Ferreira and Panos Pardalos, editors, Solving Combinatorial Optimization Problems in Parallel: Methods and Techniques, pages 171–200. Springer Berlin Heidelberg, Berlin, Heidelberg, 1996.
  89. Christian Blum. Ant colony optimization: Introduction and recent trends. Physics of Life Reviews, 2(4):353–373, 2005.
  90. A comprehensive survey: Whale optimization algorithm and its applications. Swarm and Evolutionary Computation, 48:1–24, 2019.
  91. Particle swarm optimization algorithm: an overview. Soft Computing, 22(2):387–408, Jan 2018.
  92. A comprehensive survey on the sine–cosine optimization algorithm. Artificial Intelligence Review, 56(6):4801–4858, Jun 2023.
  93. A survey of simulated annealing applications to operations research problems. Omega, 22(1):41–56, 1994.
  94. Nasser A. El-Sherbeny. Vehicle routing with time windows: An overview of exact, heuristic and metaheuristic methods. Journal of King Saud University - Science, 22(3):123–131, 2010.
  95. City vehicle routing problem (city vrp): A review. IEEE Transactions on Intelligent Transportation Systems, 16(4):1654–1666, 2015.
  96. Survey: Matheuristics for rich vehicle routing problems. In María J. Blesa, Christian Blum, Günther Raidl, Andrea Roli, and Michael Sampels, editors, Hybrid Metaheuristics, pages 206–221, Berlin, Heidelberg, 2010. Springer Berlin Heidelberg.
  97. A literature review on the vehicle routing problem with multiple depots. Computers & Industrial Engineering, 79:115–129, 2015.
  98. Vehicle routing problem and related algorithms for logistics distribution: a literature review and classification. Operational Research, 22(3):2033–2062, Jul 2022.
  99. A comprehensive survey of the grasshopper optimization algorithm: results, variants, and applications. Neural Computing and Applications, 32(19):15533–15556, Oct 2020.
  100. Tabu search heuristics for the vehicle routing problem. In Ramesh Sharda, Stefan Voß, César Rego, and Bahram Alidaee, editors, Metaheuristic Optimization via Memory and Evolution: Tabu Search and Scatter Search, pages 145–163. Springer US, Boston, MA, 2005.
  101. Sumanta Basu. Tabu search implementation on traveling salesman problem and its variations: a literature survey. American Journal of Operations Research, 2012.
  102. A systematic literature review of quantum computing for routing problems. IEEE Access, 10:55805–55817, 2022.
  103. Adiabatic quantum computation. Rev. Mod. Phys., 90:015002, Jan 2018.
  104. Quantum annealing for industry applications: introduction and review. Reports on Progress in Physics, 85(10):104001, sep 2022.
  105. Quantum annealing of vehicle routing problem with time, state and capacity. In Sebastian Feld and Claudia Linnhoff-Popien, editors, Quantum Technology and Optimization Problems, pages 145–156, Cham, 2019. Springer International Publishing.
  106. A quantum annealing approach for dynamic multi-depot capacitated vehicle routing problem, 2020.
  107. New hybrid quantum annealing algorithms for solving vehicle routing problem. In Valeria V. Krzhizhanovskaya, Gábor Závodszky, Michael H. Lees, Jack J. Dongarra, Peter M. A. Sloot, Sérgio Brissos, and João Teixeira, editors, Computational Science – ICCS 2020, pages 546–561, Cham, 2020. Springer International Publishing.
  108. Solving the shipment rerouting problem with quantum optimization techniques. In Martijn Mes, Eduardo Lalla-Ruiz, and Stefan Voß, editors, Computational Logistics, pages 502–517, Cham, 2021. Springer International Publishing.
  109. Solving vehicle routing problem using quantum approximate optimization algorithm. IEEE Transactions on Intelligent Transportation Systems, 24(7):7564–7573, 2023.
  110. Applying quantum approximate optimization to the heterogeneous vehicle routing problem, 2021.
  111. A feasibility-preserved quantum approximate solver for the capacitated vehicle routing problem, 2023.
  112. Analysis of the vehicle routing problem solved via hybrid quantum algorithms in the presence of noisy channels. IEEE Transactions on Quantum Engineering, pages 1–16, 2023.
  113. Variational quantum algorithms for solving vehicle routing problem. In 2023 International Conference on Smart Computing and Application (ICSCA), pages 1–4, 2023.
  114. Deep-circuit qaoa. arXiv preprint arXiv:2210.12406, 2022.
  115. Barren plateaus in quantum neural network training landscapes. Nature Communications, 9(1):4812, 2018.
  116. Cost function dependent barren plateaus in shallow parametrized quantum circuits. Nature communications, 12(1):1–12, 2021.
  117. Noise-induced barren plateaus in variational quantum algorithms. Nature communications, 12(1):6961, 2021.
  118. Kishor Bharti. Quantum assisted eigensolver. arXiv preprint arXiv:2009.11001, 2020.
  119. Iterative quantum-assisted eigensolver. Physical Review A, 104(5):L050401, 2021.
  120. Zijun Zhang. Improved adam optimizer for deep neural networks. In 2018 IEEE/ACM 26th International Symposium on Quality of Service (IWQoS), pages 1–2. Ieee, 2018.
  121. Gavin E Crooks. Gradients of parameterized quantum gates using the parameter-shift rule and gate decomposition. arXiv preprint arXiv:1905.13311, 2019.
  122. Pennylane: Automatic differentiation of hybrid quantum-classical computations, 2022.
  123. IBM Quantum team. Retrieved from https://quantum computing.ibm.com. Ibmq, 2020.
  124. Amazon Braket. https://aws.amazon.com/braket/.
  125. IonQ Trapped Ion Quantum Computing https://ionq.com/.
  126. LLC Gurobi Optimization. Gurobi optimizer reference manual, 2020.
Citations (8)
View on Semantic Scholar

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now