Ruimin Ke

Ruimin Ke

Auto-generated profile, based on publicly available information

Ruimin Ke

Rensselaer Polytechnic Institute, Troy, USA

Research Focus & Metrics

Academic Career Length

3Years (2024-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
8 January 2024 in Data Science for Transportation
Verified
Journal Article
Closed access
PDF file
TATalha Azfar
Talha Azfar
JLJinlong Li
Jinlong Li
HYHongkai Yu
Hongkai Yu
RCRuey L. Cheu
Ruey L. Cheu
YLYisheng Lv
Yisheng Lv
RKRuimin Ke
Ruimin Ke

25 January 2025 in arXiv
Verified
Preprint
Open access
PDF file
TATalha Azfar
Talha Azfar
KHKaicong Huang
Kaicong Huang
RKRuimin Ke
Ruimin Ke
Edge sensing and computing is rapidly becoming part of intelligent infrastructure architecture leading to operational reliance on such systems in disaster or emergency situations. In such scenarios there is a high chance of power supply failure due to power grid issues, and communication system issues due to base stations losing power or being damaged by the elements, e.g., flooding, wildfires etc. Mobile edge computing in the form of unmanned aerial vehicles (UAVs) has been proposed to provide computation offloading from these devices to conserve their battery, while the use of UAVs as relay network nodes has also been investigated previously. This paper considers the use of UAVs with further constraints on power and connectivity to prolong the life of the network while also ensuring that the data is received from the edge nodes in a timely manner. Reinforcement learning is used to investigate numerous scenarios of various levels of power and communication failure. This approach is able to identify the device most likely to fail in a given scenario, thus providing priority guidance for maintenance personnel. The evacuations of a rural town and urban downtown area are also simulated to demonstrate the effectiveness of the approach at extending the life of the most critical edge devices.

10 September 2026 in Scientific Reports
Verified
Journal Article
Open access
PDF file
TATalha Azfar
Talha Azfar
RKRuimin Ke
Ruimin Ke
The Quantum Approximate Optimization Algorithm (QAOA) is difficult to deploy on near-term hardware for constrained routing problems because feasibility constraints produce dense interaction graphs, deep transpiled circuits, and costly parameter search. We study this challenge for Vehicle Routing Problem (VRP) instances using a hardware-aware QAOA workflow that combines linear-ramp parameter initialization, Conditional Value-at-Risk (CVaR) optimization, and a Linear-Chain QAOA (LC-QAOA) surrogate that retains local ZZ interactions to reduce two-qubit depth. A matched full-QAOA versus LC-QAOA feasibility comparison is performed for 4-node instances, while the 5- and 6-node experiments characterize circuit executability and low-probability optimum recovery at the tested depths. In 4-node hardware runs, LC-QAOA increases mean feasible-sample probability from 0.182% to 0.917% and mean optimum-sample probability from 0.045% to 0.239%, giving approximately \(5\times\) improvement over full QAOA. At 6 nodes, a full-QAOA circuit at \(p=1\) already has large transpiled two-qubit depth, while LC-QAOA remains executable and samples CPLEX-certified optima in selected hardware runs at depths p=10–13, albeit with low optimum probability. Overall, the results identify LC-QAOA as a hardware-efficient surrogate heuristic that trades Hamiltonian completeness for lower depth and improved feasible-solution sampling on noisy quantum hardware.

5 January 2026 in Research Square
Verified
Preprint
Open access
PDF file
TATalha Azfar
Talha Azfar
RKRuimin Ke
Ruimin Ke
The Quantum Approximate Optimization Algorithm (QAOA) is known to struggle on near-term hardware due to constraint handling, parameter search overhead, and tight depth limits. We address this with a hardware-aware co-design: a linear-ramp parameter schedule paired with a Linear-Chain (LC) ansatz that restricts $ZZ$ interactions to nearest neighbors, lowering swaps and depth. We benchmark Linear-Ramp LC-QAOA against standard QAOA, Two-Step QAOA, and Grover-Mixer QAOA on small VRP instances across ideal simulation, Aer simulation, and IBM Eagle/Heron runs, measuring feasibility, solution quality, and hardware efficiency. Linear-ramp improves convergence and feasibility; LC reduces two-qubit gates and boosts noise robustness. Grover-Mixer and Two-Step can aid constraints in theory but are hampered in practice by deeper circuits. On hardware, overall feasibility remains $<1$\%, yet LC-QAOA with $XpXm$ dynamical decoupling more than doubles feasibility and recovers the optimum in several trials. We also show efficient scaling, including a larger case with ramp-initialized LC-QAOA plus CVaR. The results underscore hardware-aligned ansätze and structured schedules as a promising path.

20 January 2025 in arXiv
Verified
Preprint
Open access
PDF file
DUDaniel Udekwe
Daniel Udekwe
RKRuimin Ke
Ruimin Ke
JLJiaqing Lu
Jiaqing Lu
QGQian-Wen Guo
Qian-Wen Guo
Efficient and socially equitable restoration of transportation networks post disasters is crucial for community resilience and access to essential services. The ability to rapidly recover critical infrastructure can significantly mitigate the impacts of disasters, particularly in underserved communities where prolonged isolation exacerbates vulnerabilities. Traditional restoration methods prioritize functionality over computational efficiency and equity, leaving low-income communities at a disadvantage during recovery. To address this gap, this research introduces a novel framework that combines quantum computing technology with an equity-focused approach to network restoration. Optimization of road link recovery within budget constraints is achieved by leveraging D Wave's hybrid quantum solver, which targets the connectivity needs of low, average, and high income communities. This framework combines computational speed with equity, ensuring priority support for underserved populations. Findings demonstrate that this hybrid quantum solver achieves near instantaneous computation times of approximately 8.7 seconds across various budget scenarios, significantly outperforming the widely used genetic algorithm. It offers targeted restoration by first aiding low-income communities and expanding aid as budgets increase, aligning with equity goals. This work showcases quantum computing's potential in disaster recovery planning, providing a rapid and equitable solution that elevates urban resilience and social sustainability by aiding vulnerable populations in disasters.