Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

IEEE International Conference on Quantum Control, Computing and Learning (qCCL)

GPU-Based Hybrid Quantum Computing for EV Charging Station Decision Planning–A Case Study

Dylan Josh Domingo Lopez, Ying-Yi Hong, Mark Angelo Purio, Gerard Francesco DG. Apolinario, Yun-Yuan Wang, Eddie Huang, Simon See

Published Jun 1, 2026• 0 citations
Publisher

Abstract

Electric vehicle charging station (EVCS) planning increasingly relies on data analytics pipelines. Yet current approaches remain purely classical and do not exploit emerging hybrid quantum methods for coupled forecasting and optimization. This paper proposes a graphics processing unit (GPU)-based hybrid quantum computing pipeline that integrates quantum-enhanced forecasting and decision models into an end-to-end planning workflow. For forecasting, a hybrid quantum neural network augments a long short-term memory network forecaster with a quantum head, while GPU-parallelized parameter-shift gradients and batched inference reduce training time by up to 76.9% relative to a non-parallel baseline without sacrificing test-set accuracy. For decision optimization, a station decommissioning problem is formulated as a mixed quadratic integer program, converted to a scaled quadratic unconstrained binary optimization model, and then solved via both classical annealing and quantum approximate optimization algorithm using a toolchain spanning CVXPY, autoQUBO/OpenJij, Qamomile, Qiskit, and CUDA Q/X, with scaled model runs matching the classical optimal profit and configuration while benefiting from GPU-accelerated simulation. At the 15-qubit scale studied under noiseless simulation, hybrid quantum components match but do not exceed classical baselines; the evidence supports their use as weighted heads or optimization backends co-designed with GPU parallelization and classical solvers, with quantum advantage and noise robustness deferred to larger-scale and QPU-based future work.

DOI
10.1109/qccl70331.2026.11668572

Related papers

Solar Irradiance Forecasting Using a Hybrid Quantum Neural Network: A Comparison on GPU-Based Workflow Development Platforms

Ying‐Yi Hong, Dylan Josh Domingo Lopez, Yun-Yuan Wang

Modern renewable power operations can be enhanced by integrating deep neural networks, particularly for forecasting solar irradiance. Recent advancements in quantum computing have shown potential improvements in classical deep neural networks. However, current challenges with quantum hardware, such as susceptibility to noise and decoherence, pose risks to its practicality. Hybrid quantum neural networks (HQNNs) are found to mitigate these issues, especially when integrated with graphics processing unit (GPU)-based pipelines. This paper presents a comparative study of different software platforms for developing HQNNs, using multi-location very short-term solar irradiance forecasting as an example. A classical benchmark model is initially designed based on statistical analysis of a 10-minute resolution solar irradiance dataset, with its parameters further optimized using Bayesian Optimization. The experimental design of this paper includes a loss comparison between classical neural networks and HQNNs across different seasons and a performance comparison between Pennylane, Torchquantum, and CUDA Quantum (CUDA-Q) as HQNN development platforms. Experimental results show that HQNNs achieve up to a 92.30% improvement in testing loss compared to classical neural networks. Regarding HQNN development platforms, Pennylane shows an 81.54% testing loss reduction from classical models, Torchquantum shows a 90.34% improvement, and CUDA-Q shows a 92.30% improvement in testing loss. Implementing hardware acceleration libraries for GPU-based state vector simulation demonstrates an approximate 275% speedup in average latency per epoch, a 218% speedup in inference time, and a 10.20% improvement in testing loss compared to CPU-based simulations. CUDA-Q achieves a training time 2.7 times shorter and an inference time 2.9 times shorter compared to Pennylane, while it is 32.3 times faster in training and 31 times faster in inference compared to Torchquantum.

IEEE Access•Jan 1, 2024•27 citations

Quantum-Accelerated Electric Vehicle Charging Scheduling with Graph Coloring

Thinh Q. Dinh, Thinh Nguyen, Tam Nguyen +2 more

Electric vehicles (EVs) have emerged as the transportation of the future due to their environmental benefits and fuel efficiency. However, as EVs adoption grows, efficiently managing charging schedules has become a critical challenge due to limited charging infrastructures. EV charging scheduling (EVCS) is a well-known problem within EV charging systems and is generally modeled as an NP-hard graph coloring problem. Recently, quantum computing has emerged as a novel technology that revolutionizes the conventional approach in solving complex optimization problems. However, current noisy intermediate-scale quantum (NISQ) computers lack sufficient hardware capacity to tackle large problem spaces. To address this insufficiency, we propose a hybrid quantum-classical (HQC) optimization pipeline mainly consisting of Hamiltonian reduction, quantum computation, and solution recovery. Theoretically, we demonstrate that optimal graph coloring and EVCS solutions can be recovered if the ground state is found for the reduced Hamiltonian. Numerically, using the Caltech ACN dataset (2018-2019 observations), our approach increases the number of executable EVCS instances on quantum simulators (IonQ, QASM, and Rigetti) from 1.30%- 2.28% to 54.23%-54.72%, thereby outperforming Roof Duality and FastHare (2.28%-6.68%). On the D-Wave Advantage, executable instances increase from 11.89% to 80.46%, compared to 13.52% and 19.87% with Roof Duality and FastHare. These results present promising opportunities for advancing quantum computing research on EVCS within intelligent transportation systems.

IEEE Transactions on Intelligent Vehicles•Jan 1, 2026•0 citations

A Hybrid Quantum-Classical Approach to the Electric Mobility Problem

Margarita Veshchezerova, Mikhail Somov, D. Bertsche +4 more

We suggest a hybrid quantum-classical routine for the NP-hard Electric Vehicle Fleet Charging and Allocation Problem. The original formulation is a Mixed Integer Linear Program with continuous variables and inequality constraints. To separate inequality constraints that are difficult for quantum routines we use a decomposition in master and pricing problems: the former targets the assignment of vehicles to reservations and the latter suggests vehicle exploitation plans that respect the battery state-of-charge constraints. The master problem is equivalent to the search for an optimal set partition. In our hybrid scheme, the master problem is reformulated in a quadratic unconstrained binary optimization problem which can be solved with quantum annealing on the DWave Advantage system. On large instances, we benchmark the performance of the decomposition technique with classical and quantum-inspired metaheuristics: simulated annealing, tabu search, and vector annealing by NEC. The numerical results with purely classical solvers are comparable to the solutions from the traditional mixed integer linear programming approaches in terms of solution quality while being faster. In addition, it scales better to larger instances. The major advantage of the proposed approach is that it enables quantum-based methods for this realistic problem with many inequality constraints. We show this by initial studies on DWave hardware where optimal solutions can be found for small instances.

arXiv:2310.02760•IEEE International Conference on Quantum Computing and Engineering (QCE)•Sep 17, 2023•9 citations

Implementing a Hybrid Quantum Neural Network for Wind Speed Forecasting: Insights from Quantum Simulator Experiences

Ying‐Yi Hong, Jay Bhie D. Santos

The intermittent nature of wind speed poses challenges for its widespread utilization as an electrical power generation source. As the integration of wind energy into the power system increases, accurate wind speed forecasting becomes crucial. The reliable scheduling of wind power generation heavily relies on precise wind speed forecasts. This paper presents an extended work that focuses on a hybrid model for 24 h ahead wind speed forecasting. The proposed model combines residual Long Short-Term Memory (LSTM) and a quantum neural network that is studied by a quantum simulator, leveraging the support of NVIDIA Compute Unified Device Architecture (CUDA). To ensure the desired accuracy, a comparative analysis is conducted, examining the qubit count and quantum circuit depth of the proposed model. The execution time required for the model is significantly reduced when the GPU incorporates CUDA, accounting for only 8.29% of the time required by a classical CPU. In addition, different quantum embedding layers with various entangler layers in the quantum neural network are explored. The simulation results utilizing an offshore wind farm dataset demonstrate that the proper number of qubits and embedding layer can achieve favorable 24 h ahead wind speed forecasts.

Energies•Apr 1, 2025•2 citations

Quantum-Powered Optimization for Electric Vehicle Charging Infrastructure Deployment

Nazmush Sakib, Xin Chen

The infrastructure development of electric vehicle charging stations (EVCS) is critical to the integration of electrical vehicles (EVs) into transportation systems, which requires significant investment and has long-term impact on the adoption of EVs. In this paper, a mathematical model is developed to identify the optimal placement of EVCS by utilizing a novel quantum annealing (QA) algorithm and quantum computation (QC). The objective of the optimization model is to determine the locations of EVCS that maximize their service quality for EV users. The model is validated using a real-world case study and solved using commercially available quantum computers from D-Wave. The case study shows that the QA algorithm can find the optimal placement of EVCS within seconds. The quality of the solutions obtained using QC is not sensitive to the shape or size of the area where EVCS are to be deployed.

arXiv:2411.06684•Nov 11, 2024•2 citations

Solving optimal electric vehicle charging station placement problem using digital quantum annealing

Chia‐Ho Ou, Chung-Chieh Cheng, Chih‐Yu Chen +2 more

It is imperative to reduce carbon dioxide emissions and fossil fuel consumption to ensure the Earth's sustainable future and mitigate negative impacts like extreme climate changes caused by greenhouse gases. Electric vehicles (EVs) play a pivotal role in this context, where the convenience of charging stations is crucial in influencing consumer choices. This paper formulates the placement of charging stations as an optimization problem, considering factors like station density, accessibility, coverage, and regional cost variations, to minimize total construction costs. The problem is mapped onto a quadratic unconstrained binary optimization (QUBO) model. The QUBO can efficiently represent and solve complex combinatorial optimization problems, making it suitable for quantum and advanced classical algorithms. Utilizing digital quantum annealing, the optimal or near-optimal solutions are efficiently identified. The performance of the proposed approach is compared with classical algorithms, including mixed linear programming and simulated annealing, demonstrating significant advancements of digital annealing.

Journal of Communications and Networks•Aug 1, 2025•8 citations
Electric vehicle charging station (EVCS) planning increasingly relies on data analytics pipelines. Yet current approaches remain purely classical and do not exploit emerging hybrid quantum methods for coupled forecasting and optimization. This paper proposes a graphics processing unit (GPU)-based hybrid quantum computing pipeline that integrates quantum-enhanced forecasting and decision models into an end-to-end planning workflow. For forecasting, a hybrid quantum neural network augments a long short-term memory network forecaster with a quantum head, while GPU-parallelized parameter-shift gradients and batched inference reduce training time by up to 76.9% relative to a non-parallel baseline without sacrificing test-set accuracy. For decision optimization, a station decommissioning problem is formulated as a mixed quadratic integer program, converted to a scaled quadratic unconstrained binary optimization model, and then solved via both classical annealing and quantum approximate optimization algorithm using a toolchain spanning CVXPY, autoQUBO/OpenJij, Qamomile, Qiskit, and CUDA Q/X, with scaled model runs matching the classical optimal profit and configuration while benefiting from GPU-accelerated simulation. At the 15-qubit scale studied under noiseless simulation, hybrid quantum components match but do not exceed classical baselines; the evidence supports their use as weighted heads or optimization backends co-designed with GPU parallelization and classical solvers, with quantum advantage and noise robustness deferred to larger-scale and QPU-based future work.
Modern renewable power operations can be enhanced by integrating deep neural networks, particularly for forecasting solar irradiance. Recent advancements in quantum computing have shown potential improvements in classical deep neural networks. However, current challenges with quantum hardware, such as susceptibility to noise and decoherence, pose risks to its practicality. Hybrid quantum neural networks (HQNNs) are found to mitigate these issues, especially when integrated with graphics processing unit (GPU)-based pipelines. This paper presents a comparative study of different software platforms for developing HQNNs, using multi-location very short-term solar irradiance forecasting as an example. A classical benchmark model is initially designed based on statistical analysis of a 10-minute resolution solar irradiance dataset, with its parameters further optimized using Bayesian Optimization. The experimental design of this paper includes a loss comparison between classical neural networks and HQNNs across different seasons and a performance comparison between Pennylane, Torchquantum, and CUDA Quantum (CUDA-Q) as HQNN development platforms. Experimental results show that HQNNs achieve up to a 92.30% improvement in testing loss compared to classical neural networks. Regarding HQNN development platforms, Pennylane shows an 81.54% testing loss reduction from classical models, Torchquantum shows a 90.34% improvement, and CUDA-Q shows a 92.30% improvement in testing loss. Implementing hardware acceleration libraries for GPU-based state vector simulation demonstrates an approximate 275% speedup in average latency per epoch, a 218% speedup in inference time, and a 10.20% improvement in testing loss compared to CPU-based simulations. CUDA-Q achieves a training time 2.7 times shorter and an inference time 2.9 times shorter compared to Pennylane, while it is 32.3 times faster in training and 31 times faster in inference compared to Torchquantum.
Electric vehicles (EVs) have emerged as the transportation of the future due to their environmental benefits and fuel efficiency. However, as EVs adoption grows, efficiently managing charging schedules has become a critical challenge due to limited charging infrastructures. EV charging scheduling (EVCS) is a well-known problem within EV charging systems and is generally modeled as an NP-hard graph coloring problem. Recently, quantum computing has emerged as a novel technology that revolutionizes the conventional approach in solving complex optimization problems. However, current noisy intermediate-scale quantum (NISQ) computers lack sufficient hardware capacity to tackle large problem spaces. To address this insufficiency, we propose a hybrid quantum-classical (HQC) optimization pipeline mainly consisting of Hamiltonian reduction, quantum computation, and solution recovery. Theoretically, we demonstrate that optimal graph coloring and EVCS solutions can be recovered if the ground state is found for the reduced Hamiltonian. Numerically, using the Caltech ACN dataset (2018-2019 observations), our approach increases the number of executable EVCS instances on quantum simulators (IonQ, QASM, and Rigetti) from 1.30%- 2.28% to 54.23%-54.72%, thereby outperforming Roof Duality and FastHare (2.28%-6.68%). On the D-Wave Advantage, executable instances increase from 11.89% to 80.46%, compared to 13.52% and 19.87% with Roof Duality and FastHare. These results present promising opportunities for advancing quantum computing research on EVCS within intelligent transportation systems.
We suggest a hybrid quantum-classical routine for the NP-hard Electric Vehicle Fleet Charging and Allocation Problem. The original formulation is a Mixed Integer Linear Program with continuous variables and inequality constraints. To separate inequality constraints that are difficult for quantum routines we use a decomposition in master and pricing problems: the former targets the assignment of vehicles to reservations and the latter suggests vehicle exploitation plans that respect the battery state-of-charge constraints. The master problem is equivalent to the search for an optimal set partition. In our hybrid scheme, the master problem is reformulated in a quadratic unconstrained binary optimization problem which can be solved with quantum annealing on the DWave Advantage system. On large instances, we benchmark the performance of the decomposition technique with classical and quantum-inspired metaheuristics: simulated annealing, tabu search, and vector annealing by NEC. The numerical results with purely classical solvers are comparable to the solutions from the traditional mixed integer linear programming approaches in terms of solution quality while being faster. In addition, it scales better to larger instances. The major advantage of the proposed approach is that it enables quantum-based methods for this realistic problem with many inequality constraints. We show this by initial studies on DWave hardware where optimal solutions can be found for small instances.
The intermittent nature of wind speed poses challenges for its widespread utilization as an electrical power generation source. As the integration of wind energy into the power system increases, accurate wind speed forecasting becomes crucial. The reliable scheduling of wind power generation heavily relies on precise wind speed forecasts. This paper presents an extended work that focuses on a hybrid model for 24 h ahead wind speed forecasting. The proposed model combines residual Long Short-Term Memory (LSTM) and a quantum neural network that is studied by a quantum simulator, leveraging the support of NVIDIA Compute Unified Device Architecture (CUDA). To ensure the desired accuracy, a comparative analysis is conducted, examining the qubit count and quantum circuit depth of the proposed model. The execution time required for the model is significantly reduced when the GPU incorporates CUDA, accounting for only 8.29% of the time required by a classical CPU. In addition, different quantum embedding layers with various entangler layers in the quantum neural network are explored. The simulation results utilizing an offshore wind farm dataset demonstrate that the proper number of qubits and embedding layer can achieve favorable 24 h ahead wind speed forecasts.
The infrastructure development of electric vehicle charging stations (EVCS) is critical to the integration of electrical vehicles (EVs) into transportation systems, which requires significant investment and has long-term impact on the adoption of EVs. In this paper, a mathematical model is developed to identify the optimal placement of EVCS by utilizing a novel quantum annealing (QA) algorithm and quantum computation (QC). The objective of the optimization model is to determine the locations of EVCS that maximize their service quality for EV users. The model is validated using a real-world case study and solved using commercially available quantum computers from D-Wave. The case study shows that the QA algorithm can find the optimal placement of EVCS within seconds. The quality of the solutions obtained using QC is not sensitive to the shape or size of the area where EVCS are to be deployed.
It is imperative to reduce carbon dioxide emissions and fossil fuel consumption to ensure the Earth's sustainable future and mitigate negative impacts like extreme climate changes caused by greenhouse gases. Electric vehicles (EVs) play a pivotal role in this context, where the convenience of charging stations is crucial in influencing consumer choices. This paper formulates the placement of charging stations as an optimization problem, considering factors like station density, accessibility, coverage, and regional cost variations, to minimize total construction costs. The problem is mapped onto a quadratic unconstrained binary optimization (QUBO) model. The QUBO can efficiently represent and solve complex combinatorial optimization problems, making it suitable for quantum and advanced classical algorithms. Utilizing digital quantum annealing, the optimal or near-optimal solutions are efficiently identified. The performance of the proposed approach is compared with classical algorithms, including mixed linear programming and simulated annealing, demonstrating significant advancements of digital annealing.