Quadratic and Higher-Order Unconstrained Binary Optimization of Railway Rescheduling for Quantum Computing

• URL: http://arxiv.org/abs/2107.03234v5
• Date: Wed, 20 Jul 2022 09:49:57 GMT
• Title: Quadratic and Higher-Order Unconstrained Binary Optimization of Railway Rescheduling for Quantum Computing
• Authors: Krzysztof Domino, Akash Kundu, \"Ozlem Salehi, Krzysztof Krawiec
• Abstract summary: This paper introduces QUBO and HOBO representations for rescheduling problems of railway traffic management. We consider the conditions of minimal headway between trains, minimal stay on stations, track occupation, and rolling stock circulation.
• Score: 0.5161531917413706
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: As consequences of disruptions in railway traffic affect passenger experience/satisfaction, appropriate rerouting and/or rescheduling is necessary. These problems are known to be NP-hard, given the numerous restrictions of traffic nature. With the recent advances in quantum technologies, quantum annealing has become an alternative method to solve such optimization problems. To use quantum annealing, the problem needs to be encoded in QUBO (quadratic unconstrained binary optimization) or HOBO (higher-order binary optimization) formulation that can be recast as a QUBO. This paper introduces QUBO and HOBO representations for rescheduling problems of railway traffic management; the latter is a new approach up to our knowledge. This new approach takes into account not only the single-track lines but also the double- and multi-track lines, as well as stations composed of tracks and switches. We consider the conditions of minimal headway between trains, minimal stay on stations, track occupation, and rolling stock circulation. Furthermore, a hybrid quantum-classical procedure is presented that includes rerouting. We demonstrate the proof of concept implementation on the D-Wave Quantum Processing Unit and D-Wave hybrid solver.

Related papers

• Quadratic versus Polynomial Unconstrained Binary Models for Quantum Optimization illustrated on Railway Timetabling [0.0]
  We present a generic method to reformulate any problem into a Polynomial Unconstrained Binary Optimization (PUBO) problem. We also provide a generic reformulation into a Quadratic Unconstrained Binary Optimization (QUBO) problem. Our results illustrate that the PUBO reformulation outperforms the QUBO one for the problem at hand.
  arXiv  Detail & Related papers  (2024-11-15T09:23:52Z)
• Beyond QUBO and HOBO formulations, solving the Travelling Salesman Problem on a quantum boson sampler [0.0]
  We present a novel formulation which needs fewer binary variables, and where, by design, there are no penalty terms because all outputs from the quantum device are mapped to valid routes. Although we worked with a boson sampler, we believe that this novel formulation is relevant to other quantum devices.
  arXiv  Detail & Related papers  (2024-06-20T12:25:00Z)
• QuantumSEA: In-Time Sparse Exploration for Noise Adaptive Quantum Circuits [82.50620782471485]
  QuantumSEA is an in-time sparse exploration for noise-adaptive quantum circuits. It aims to achieve two key objectives: (1) implicit circuits capacity during training and (2) noise robustness. Our method establishes state-of-the-art results with only half the number of quantum gates and 2x time saving of circuit executions.
  arXiv  Detail & Related papers  (2024-01-10T22:33:00Z)
• Near-Term Distributed Quantum Computation using Mean-Field Corrections and Auxiliary Qubits [77.04894470683776]
  We propose near-term distributed quantum computing that involve limited information transfer and conservative entanglement production. We build upon these concepts to produce an approximate circuit-cutting technique for the fragmented pre-training of variational quantum algorithms.
  arXiv  Detail & Related papers  (2023-09-11T18:00:00Z)
• Quantum-inspired optimization for wavelength assignment [51.55491037321065]
  We propose and develop a quantum-inspired algorithm for solving the wavelength assignment problem. Our results pave the way to the use of quantum-inspired algorithms for practical problems in telecommunications.
  arXiv  Detail & Related papers  (2022-11-01T07:52:47Z)
• Quantum Annealing for Vehicle Routing Problem with weighted Segment [0.0]
  The study presents a QUBO formulation to solve traffic congestion problems on certain roads. The resulting route selection by optimizing the distribution of the flow of alternative road vehicles based on the weighting of road segments. The simulations on the D-Wave quantum annealer show optimal results on the route deployment of several vehicles.
  arXiv  Detail & Related papers  (2022-03-25T06:38:18Z)
• Quantum annealing in the NISQ era: railway conflict management [0.44040106718326594]
  We consider a practical railway dispatching problem: delay and conflict management on single-track railway lines. We introduce a quadratic unconstrained binary optimization (QUBO) model of this problem, compatible with the emerging quantum annealing technology. As a proof-of-concept, we solve selected real-life problems from the Polish railway network using D-Wave quantum annealers.
  arXiv  Detail & Related papers  (2021-12-07T13:17:21Z)
• Q-Match: Iterative Shape Matching via Quantum Annealing [64.74942589569596]
  Finding shape correspondences can be formulated as an NP-hard quadratic assignment problem (QAP) This paper proposes Q-Match, a new iterative quantum method for QAPs inspired by the alpha-expansion algorithm. Q-Match can be applied for shape matching problems iteratively, on a subset of well-chosen correspondences, allowing us to scale to real-world problems.
  arXiv  Detail & Related papers  (2021-05-06T17:59:38Z)
• Direct Quantum Communications in the Presence of Realistic Noisy Entanglement [69.25543534545538]
  We propose a novel quantum communication scheme relying on realistic noisy pre-shared entanglement. Our performance analysis shows that the proposed scheme offers competitive QBER, yield, and goodput.
  arXiv  Detail & Related papers  (2020-12-22T13:06:12Z)
• Quantum computing approach to railway dispatching and conflict management optimization on single-track railway lines [0.4724825031148411]
  We consider a practical railway dispatching problem: delay and conflict management on a single-track railway line. We introduce a quadratic unconstrained binary optimization (QUBO) model of the problem in question, compatible with the emerging quantum annealing technology. As a proof-of-concept, we solve selected real-life problems from the Polish railway network using D-Wave quantum annealers.
  arXiv  Detail & Related papers  (2020-10-16T08:17:57Z)
• Space-efficient binary optimization for variational computing [68.8204255655161]
  We show that it is possible to greatly reduce the number of qubits needed for the Traveling Salesman Problem. We also propose encoding schemes which smoothly interpolate between the qubit-efficient and the circuit depth-efficient models.
  arXiv  Detail & Related papers  (2020-09-15T18:17:27Z)

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.