Entropy

Quantum Computing for Transport Network Optimization

Jiangwei Ju, Zhihang Liu, Yuelin Bai, Yong Wang, Qi Gao, Yin Ma, Chao Zheng, Kai Wen

Published Sep 13, 2025• 5 citations

Abstract

Public transport systems play a crucial role in the development of large cities. Bus network design to optimize passenger flow coverage in a global metropolis is a challenging task. As an essential part of bus travel planning, considering the bus transfer factor in the existing extremely complex and extensive public bus network usually leads to a optimization problem characterized by high-dimensionality and non-linearity. While classical computers struggle to deal with this kind of problems, quantum computers shed new light into this field. The coherent Ising machine (CIM), a specialized optical quantum computer using a photonic dissipative architecture, has shown its remarkable computational power in combinatorial optimization problems. We construct the classical model and the quadratic unconstrained binary optimization (QUBO) model of the bus route optimization problem, and solve it using a classical computer and CIM, respectively. Our experimental results demonstrate the significant acceleration capability of CIM over classical computers in finding the optimal or near-optimal solutions, albeit subject to the hardware limitations of the 100-qubit CIM.

DOI: 10.3390/e27090953

Related papers

Multi-Objective Routing Optimization Using Coherent Ising Machine in Wireless Multihop Networks

Yuxuan Lin, Chunxue Xu, Chuan Xi Wang

Multi-objective combinatorial optimization in wireless communication networks is a challenging task, particularly for large-scale and diverse topologies. Recent advances in quantum computing offer promising solutions for such problems. Coherent Ising Machines (CIM), a quantum-inspired algorithm, leverages quantum properties of coherent light, enabling faster convergence to the ground state. This paper applies CIM to multiobjective routing optimization in wireless multi-hop networks. We formulate the routing problem as a Quadratic Unconstrained Binary Optimization (QUBO) problem, and map it onto an Ising model, allowing CIM to solve it. CIM demonstrates strong scalability across diverse network topologies without requiring topology-specific adjustments, overcoming the limitations of traditional quantum algorithms like Quantum Approximate Optimization Algorithm (QAOA) and Variational Quantum Eigensolver (VQE). Our results show that CIM provides feasible and near-optimal solutions for networks containing hundreds of nodes and thousands of edges. Additionally, a complexity analysis highlights CIM's increasing efficiency as network size grows.

arXiv:2503.07924International Conference on CommunicationsJun 8, 20255 citations

Quantum computing for loan portfolio pricing optimization

Yanbo J. Wang, Xuan Yang, Chao Ju +8 more

For complex optimization problems in the financial services industry, specialized quantum computer can server as a transformative tool. Focusing on loan portfolio pricing optimization, we demonstrate the application potentials and advantages of quantum computing in financial optimization problems. For the first time, the loan portfolio pricing problem is modeled as a Quadratic Unconstrained Binary Optimization (QUBO) problem, and then solved by a specialized quantum computer, Coherent Ising Machine (CIM) based on optical dissipative systems. By introducing an auxiliary qubit and conducting a two-stage search for the appropriate penalty coefficients, we demonstrate the applicability and advantages of CIM in the loan portfolio pricing optimization problem. The experimental results demonstrate that compared to state-of-the-art classical solvers, CIM achieves significant acceleration capability and energy efficiency beyond classical methods. Furthermore, by conducting numerical and analytical evaluations of CIM’s scalability in the loan portfolio pricing optimization, we demonstrate the convergence guarantees of CIM and its ability to achieve a better solution quality than the state-of-the-art classical solver in large-scale problems.

Frontiers in PhysicsJun 4, 20260 citations

Physics-Inspired Optimization in the QUBO Framework: Key Concepts and Approaches

Lien-Po Yu, Chin-Fu Nien

Quantum computing promises to have a tremendous advantage over its classical counterpart for solving computationally hard problems, yet remains in a relatively early stage for practical applications owing to the limited capabilities of today’s quantum computers. The approach to the special purposes of quantum computers by exploiting the special-purpose physics-inspired or quantum-inspired computers is emerging as a novel alternative to its quantum counterpart in tackling hard problems in high-performance computing. Inspired by physics, the Ising machine — a type of special-purpose computer that implements or emulates physics or quantum effects of the Ising model to speed up finding solutions to optimization problems — has recently become an active research area in the field of combinatorial optimization. This paper is to address the key enabling software and hardware technology underlying physics-inspired optimization using Ising machines in the unified quadratic unconstrained binary optimization (QUBO) framework for modeling and solving computationally hard combinatorial optimization problems, and with an aim to shed some light on the challenges and opportunities associated with the ever-growing landscape of this novel high-performance computing.

SPINAug 30, 20231 citation

High-speed train timetable optimization based on space–time network model and quantum simulator

Hui-Zhang Xu, Junhua Chen, Xingchen Zhang +4 more

Abstract Timetable scheduling is a combinatorial optimization problem that presents formidable challenges for classical computers. This paper introduces a pioneering methodology for addressing the high-speed train timetabling problem through quantum computing. Initially, a comprehensive binary integer programming model, grounded in the space–time network, is proposed (M1). To manage the intricacy of model M1, a knapsack problem reformulation is employed to establish a simplified binary integer programming model (M2). Both M1 and M2 are subsequently converted into quadratic unconstrained binary optimization (QUBO) models to harness the potential of quantum computing. Several techniques, including the Gurobi solver, simulated annealing, and the coherent Ising machine (CIM) quantum simulator, are deployed to solve the model across four distinct scenarios of varying complexity. The findings indicate that CIM quantum simulator outperforms the simulated annealing method in terms of solution quality for medium-scale problems.

Quantum Information ProcessingNov 22, 20239 citations

Quantum-Driven UAV Path Planning Using QUBO Model and Coherent Ising Machines

Guozhan Qiu, Riqi Lin, Jingxin Zhu +1 more

UAV path planning in multi-target mission scenarios presents complex optimization challenges, particularly when considering constraints such as energy consumption and time efficiency. This paper proposes a quantum computing-driven approach using the QUBO model, integrated with a coherent Ising machine (CIM) on an optical quantum platform, to optimize UAV path planning. By modeling the path planning problem as a QUBO formulation and utilizing quantum heuristic algorithms for optimization, the proposed method overcomes the bottlenecks of traditional heuristic algorithms in terms of computational efficiency and convergence speed. Experimental results demonstrate that the proposed approach significantly outperforms traditional algorithms such as Tabu Search and Simulated Annealing, particularly as the number of target points increases. This method provides a new approach for applying quantum computing to UAV path planning, promoting the practical use of quantum technology in industrial applications.

International Conference on Advanced Algorithms and Control Engineering (ICAACE)Mar 21, 20250 citations

Quantum Computing for MIMO Beam Selection Problem: Model and Optical Experimental Solution

Yühong Huang, Wenxin Li, Chengkang Pan +9 more

Massive multiple-input multiple-output (MIMO) has gained widespread popularity in recent years due to its ability to increase data rates, improve signal quality, and provide better coverage in challenging environments. In this paper, we investigate the MIMO beam selection (MBS) problem, which is proven to be NP-hard and computationally intractable. To deal with this problem, quantum computing that can provide faster and more efficient solutions to large-scale combinatorial optimization is considered. MBS is formulated in a quadratic unbounded binary optimization form and solved with Coherent Ising Machine (CIM) physical machine. We compare the performance of our solution with two classic heuristics, simulated annealing and Tabu search. The results demonstrate an average performance improvement by a factor of 261.23 and 20.6, respectively, which shows that CIM-based solution performs significantly better in terms of selecting the optimal subset of beams. This work shows great promise for practical 5G operation and promotes the application of quantum computing in solving computationally hard problems in communication.

arXiv:2310.12389GlobecomDec 4, 202314 citations