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 Open Journal of the Industrial Electronics Society

A Hybrid Classical Quantum Framework for Electromagnetic Interference Analysis and Optimization in Network Cables

Abbas Seif, Hamid Reza Radmanesh, Amir Ahmarinejad, Ahmad Ali Ashrafian

Published Jan 1, 2026• 0 citations
Publisher

Abstract

This study introduces a hybrid quantum-classical framework designed to mitigate electromagnetic interference (EMI) in network cables, with a focus on optimizing signal integrity through advanced computational techniques. 1 By integrating the Quantum Approximate Optimization Algorithm (QAOA) with custom-engineered materials, we effectively reduce distortions arising from magnetic field coupling. The system is modeled using Maxwell's equations and rigorously validated through electromagnetic simulations and circuit-level analyses. Nonlinear phenomena, including permeability saturation and frequency-dependent losses, are quantified using both analytical and numerical models. Results demonstrate that QAOA achieves a significant reduction in bit error rate (BER), surpassing classical paper swarm optimization (PSO) by an order of magnitude and outperforming conventional methods by two orders. Notably, the QAOA framework converges in just 50 iterations—halving the computational effort required by PSO— while maintaining a probe power of 5 W. The implemented engineered materials contribute to a 30 50% reduction in signal distortion, showcasing substantial improvements in noise suppression. Although current quantum hardware limitations restrict immediate scalability, the inherent efficiency of QAOA in combinatorial optimization positions it as a transformative tool for critical applications demanding ultra-reliable communication, such as defense and medical systems. A comparative analysis highlights the limitations of classical methodologies in large-scale, high-interference environments. This research advocates for the integration of quantum-inspired strategies into industry standards and outlines pathways for developing robust communication infrastructures.

DOI
10.1109/ojies.2026.3663764

Related papers

Quantum-Enhanced Optimization: Bridging AI and Next-Generation Computing

Anil Kumar Jonnalagadda, Praveen Kumar Myakala

Quantum computing and artificial intelligence (AI) are positioned as groundbreaking tools capable of tackling complexities inherent to modern computation posed by high-dimensional optimization problems.This research presents a quantum-enhanced optimization framework that leverages the QAOA (Quantum Approximate Optimization Algorithm) and VQE (Variational Quantum Eigen solver) within a hybrid quantum-classical paradigm.Machine learning models, including reinforcement learning and NN (neural networks), are integrated to optimize the quantum circuit parameters, enhance convergence, and improve scalability for complex problem spaces.Experimental evaluations demonstrate that this approach outperforms traditional optimization techniques in terms of efficiency and solution accuracy, particularly for large-scale multi-objective tasks.The framework is applied to key domains such as smart energy systems, logistics, and scientific modeling, illustrating its versatility and alignment with sustainable development goals.This study also explores the limitations of current quantum hardware and discusses future pathways for advancing hybrid quantum AI systems, offering significant contributions to next generation computational methodologies and intelligent problem solving.

Advances in intelligent systems research/Advances in Intelligent Systems Research•Jan 1, 2025•4 citations

Hybrid Quantum–Classical Supercomputing Framework for Optimization Problems

Aditi Kuhar, Megha Shinde, Arti Giram +1 more

Optimization problems are widely encountered in real-world domains such as energy systems, financial markets, transportation networks, supply chain logistics, manufacturing processes, and e-commerce platforms. Traditional classical computing methods often struggle to solve large combinatorial optimization problems due to the exponential growth of the solution space. Quantum computing has emerged as a promising approach to address these challenges by leveraging quantum mechanical principles such as superposition and entanglement. However, current quantum hardware is limited by noise, restricted qubit availability, and scalability issues, making fully quantum solutions impractical for large-scale applications. To overcome these limitations, this research proposes a hybrid quantum–classical supercomputing framework for solving complex optimization problems across multiple domains. The framework integrates classical data processing and optimization techniques with quantum-inspired algorithms, specifically the Quantum Approximate Optimization Algorithm (QAOA), to efficiently explore large solution spaces. Real-world datasets from energy systems, supply chain logistics, financial markets, transportation networks, manufacturing processes, and e-commerce platforms are used for experimental evaluation. The results demonstrate that the hybrid optimization approach can generate higher-quality solutions and improved optimization accuracy compared to traditional classical methods. These findings highlight the potential of hybrid quantum–classical systems as an effective and scalable solution for solving complex optimization problems in modern computational applications.

International Journal on Advanced Computer Theory and Engineering•May 19, 2026•0 citations

Quantum Approximate Optimization Algorithm (QAOA) for Solving NP-Hard Problems

Srikanth Kilaru, Thota Sravya Vardhani, Attluri Udaya Lakshmi +2 more

The Quantum Approximate Optimization Algorithm (QAOA) is a hybrid quantum-classical algorithm used to study NP-hard combinatorial optimization problems. In this work, we focused on optimization strategies for QAOA including circuit depth reduction, parameter parallelization, and hybrid classical feedback mechanisms. We will consider the application of QAOA to different types of NP-hard problems such as Max-Cut and Vehicle Routing Problem (VRP) and discuss the advantages and disadvantages of each in terms of approximation quality and cost of computation. The comparative simulation on the various qubit counts and depth layers points out the limits of scalability and the constraints of hardware on the current Noisy Intermediate-Scale Quantum (NISQ) devices. And also an improved divide-and-conquer strategy is presented in which parameter reusability and gradient-informed initialization are combined to boost convergence rates. The results of the experiment show that it is more efficient and scalable while maintaining the competitive approximation performance compared to the baseline QAOA. The experimental validation focuses on representative small-size instances, while the proposed framework provides extensions for scalable implementations. Ultimately, this work is a step towards the realization of efficient, hardware-aware, and scalable optimization strategies, thus opening up the practical deployment of QAOA on the quantum systems of the next few years.

IEEE Nexo-Tech International Conference on Advanced Technologies and Innovations (ICATI)•May 8, 2026•0 citations

Hybrid Quantum-Classical Computing for Physical Problems: Architectures, Algorithms, and Applications in the Networked Era

Baixin Pan

This report provides a comprehensive analysis of hybrid quantum-classical computing's role in addressing complex physical problems. It delineates the foundational principles of both classical and quantum paradigms, explores advanced architectural models and integration strategies, and details the application of cutting-edge quantum algorithms—including Variational Quantum Eigensolver (VQE), Quantum Phase Estimation (QPE), and Quantum Approximate Optimization Algorithm (QAOA)—alongside classical numerical methods such as Finite Element Method (FEM) and Finite Difference Method (FDM). Through a review of real-world case studies in materials science, chemistry, fluid dynamics, and high-energy physics, the report illustrates the transformative potential of this synergistic approach. Furthermore, it critically examines the prevailing challenges, encompassing hardware limitations, quantum error correction, software-hardware co-design, scalability, and data handling complexities, while forecasting the convergence with exascale computing. The aim is to elucidate the current state and future trajectory of hybrid quantum-classical computing as a pivotal tool for scientific discovery and engineering innovation in the networked era.

Journal of Network Computing and Applications•Jan 1, 2025•0 citations

Integration of Quantum Computing Techniques in MIMO System Optimization

Csl Vijaya Durga, R J Anandhi, Bashetty Suman +3 more

The rapid advancement of quantum computing provides unprecedented opportunities for the optimization of multiple-input, multiple-output (MIMO) systems. This paper investigates the efficacy of harnessing quantum algorithms, particularly the Quantum Approximate Optimization Algorithm (QAOA) and Grover's algorithm, for the optimization of MIMO systems. The paper establishes a theoretical framework that maps MIMO optimization problems onto quantum circuits, ensuring a reduction in computational complexity compared to classical algorithms. The proposed methodology is validated through a series of numerical simulations. Notable improvements are observed in both convergence speed and the quality of the optimized solutions. Furthermore, the synergy of quantum computing and MIMO presents new frontiers for reducing interference, enhancing throughput, and ensuring robustness against environmental uncertainties. These results affirm the potential of integrating quantum computing techniques in MIMO system optimization, heralding a transformative era for wireless communication paradigms.

International Conference on Power Energy, Environment and Intelligent Control (PEEIC)•Dec 19, 2023•5 citations

Quantum-Enhanced Network Flow Optimization: A Max-Flow Min-Cut Perspective

Gagan Guruprasad Phadke, Vandana M. Ladwani

This paper is a comparison between classical and quantum inspired methods for solving the max-flow problem, which is commonly a foundational challenge in optimization and graph theory. This study will investigate the feasibility and performance of applying the Quantum Approximate Optimization Algorithm (QAOA) and other hybrid quantum-classical approaches to address the max-flow problem. This paper starts with comparing quantum approaches with well-established classical methods such as the Ford-Fulkerson and Edmonds-Karp.The main aim of this work is to asses how close quantum-inspired formulations can get to classical approaches in terms of their flow value as well as their runtime. Implementations are developed using the Qiskit framework on simulated quantum backends and compared against classical baselines across synthetic graph instances of varying sizes and densities. Experimentally, it can be seen that quantum approaches implemented using the QAOA technique managed to attain flow solutions comparable to classical ones, demonstrating similar accuracy, and in certain very dense graph configurations, competitive runtime performance due to parallelization in state-vector computing.These findings suggest that although current quantum-inspired approaches may not yet surpass classical algorithms in efficiency, but they can replicate their outcomes with reasonable fidelity. This provides an important validation of their applicability to combinatorial optimization. This study also lays groundwork for future research to explore hardware-level implementations, scalability enhancements, and also hybrid integration strategies for quantum optimization in network flow problems.

International Conference on Next-Gen Quantum and Advanced Computing: Algorithms, Security, and Beyond (NQComp)•Mar 5, 2026•0 citations
This study introduces a hybrid quantum-classical framework designed to mitigate electromagnetic interference (EMI) in network cables, with a focus on optimizing signal integrity through advanced computational techniques. 1 By integrating the Quantum Approximate Optimization Algorithm (QAOA) with custom-engineered materials, we effectively reduce distortions arising from magnetic field coupling. The system is modeled using Maxwell's equations and rigorously validated through electromagnetic simulations and circuit-level analyses. Nonlinear phenomena, including permeability saturation and frequency-dependent losses, are quantified using both analytical and numerical models. Results demonstrate that QAOA achieves a significant reduction in bit error rate (BER), surpassing classical paper swarm optimization (PSO) by an order of magnitude and outperforming conventional methods by two orders. Notably, the QAOA framework converges in just 50 iterations—halving the computational effort required by PSO— while maintaining a probe power of 5 W. The implemented engineered materials contribute to a 30 50% reduction in signal distortion, showcasing substantial improvements in noise suppression. Although current quantum hardware limitations restrict immediate scalability, the inherent efficiency of QAOA in combinatorial optimization positions it as a transformative tool for critical applications demanding ultra-reliable communication, such as defense and medical systems. A comparative analysis highlights the limitations of classical methodologies in large-scale, high-interference environments. This research advocates for the integration of quantum-inspired strategies into industry standards and outlines pathways for developing robust communication infrastructures.
Quantum computing and artificial intelligence (AI) are positioned as groundbreaking tools capable of tackling complexities inherent to modern computation posed by high-dimensional optimization problems.This research presents a quantum-enhanced optimization framework that leverages the QAOA (Quantum Approximate Optimization Algorithm) and VQE (Variational Quantum Eigen solver) within a hybrid quantum-classical paradigm.Machine learning models, including reinforcement learning and NN (neural networks), are integrated to optimize the quantum circuit parameters, enhance convergence, and improve scalability for complex problem spaces.Experimental evaluations demonstrate that this approach outperforms traditional optimization techniques in terms of efficiency and solution accuracy, particularly for large-scale multi-objective tasks.The framework is applied to key domains such as smart energy systems, logistics, and scientific modeling, illustrating its versatility and alignment with sustainable development goals.This study also explores the limitations of current quantum hardware and discusses future pathways for advancing hybrid quantum AI systems, offering significant contributions to next generation computational methodologies and intelligent problem solving.
Optimization problems are widely encountered in real-world domains such as energy systems, financial markets, transportation networks, supply chain logistics, manufacturing processes, and e-commerce platforms. Traditional classical computing methods often struggle to solve large combinatorial optimization problems due to the exponential growth of the solution space. Quantum computing has emerged as a promising approach to address these challenges by leveraging quantum mechanical principles such as superposition and entanglement. However, current quantum hardware is limited by noise, restricted qubit availability, and scalability issues, making fully quantum solutions impractical for large-scale applications. To overcome these limitations, this research proposes a hybrid quantum–classical supercomputing framework for solving complex optimization problems across multiple domains. The framework integrates classical data processing and optimization techniques with quantum-inspired algorithms, specifically the Quantum Approximate Optimization Algorithm (QAOA), to efficiently explore large solution spaces. Real-world datasets from energy systems, supply chain logistics, financial markets, transportation networks, manufacturing processes, and e-commerce platforms are used for experimental evaluation. The results demonstrate that the hybrid optimization approach can generate higher-quality solutions and improved optimization accuracy compared to traditional classical methods. These findings highlight the potential of hybrid quantum–classical systems as an effective and scalable solution for solving complex optimization problems in modern computational applications.
The Quantum Approximate Optimization Algorithm (QAOA) is a hybrid quantum-classical algorithm used to study NP-hard combinatorial optimization problems. In this work, we focused on optimization strategies for QAOA including circuit depth reduction, parameter parallelization, and hybrid classical feedback mechanisms. We will consider the application of QAOA to different types of NP-hard problems such as Max-Cut and Vehicle Routing Problem (VRP) and discuss the advantages and disadvantages of each in terms of approximation quality and cost of computation. The comparative simulation on the various qubit counts and depth layers points out the limits of scalability and the constraints of hardware on the current Noisy Intermediate-Scale Quantum (NISQ) devices. And also an improved divide-and-conquer strategy is presented in which parameter reusability and gradient-informed initialization are combined to boost convergence rates. The results of the experiment show that it is more efficient and scalable while maintaining the competitive approximation performance compared to the baseline QAOA. The experimental validation focuses on representative small-size instances, while the proposed framework provides extensions for scalable implementations. Ultimately, this work is a step towards the realization of efficient, hardware-aware, and scalable optimization strategies, thus opening up the practical deployment of QAOA on the quantum systems of the next few years.
This report provides a comprehensive analysis of hybrid quantum-classical computing's role in addressing complex physical problems. It delineates the foundational principles of both classical and quantum paradigms, explores advanced architectural models and integration strategies, and details the application of cutting-edge quantum algorithms—including Variational Quantum Eigensolver (VQE), Quantum Phase Estimation (QPE), and Quantum Approximate Optimization Algorithm (QAOA)—alongside classical numerical methods such as Finite Element Method (FEM) and Finite Difference Method (FDM). Through a review of real-world case studies in materials science, chemistry, fluid dynamics, and high-energy physics, the report illustrates the transformative potential of this synergistic approach. Furthermore, it critically examines the prevailing challenges, encompassing hardware limitations, quantum error correction, software-hardware co-design, scalability, and data handling complexities, while forecasting the convergence with exascale computing. The aim is to elucidate the current state and future trajectory of hybrid quantum-classical computing as a pivotal tool for scientific discovery and engineering innovation in the networked era.
The rapid advancement of quantum computing provides unprecedented opportunities for the optimization of multiple-input, multiple-output (MIMO) systems. This paper investigates the efficacy of harnessing quantum algorithms, particularly the Quantum Approximate Optimization Algorithm (QAOA) and Grover's algorithm, for the optimization of MIMO systems. The paper establishes a theoretical framework that maps MIMO optimization problems onto quantum circuits, ensuring a reduction in computational complexity compared to classical algorithms. The proposed methodology is validated through a series of numerical simulations. Notable improvements are observed in both convergence speed and the quality of the optimized solutions. Furthermore, the synergy of quantum computing and MIMO presents new frontiers for reducing interference, enhancing throughput, and ensuring robustness against environmental uncertainties. These results affirm the potential of integrating quantum computing techniques in MIMO system optimization, heralding a transformative era for wireless communication paradigms.
This paper is a comparison between classical and quantum inspired methods for solving the max-flow problem, which is commonly a foundational challenge in optimization and graph theory. This study will investigate the feasibility and performance of applying the Quantum Approximate Optimization Algorithm (QAOA) and other hybrid quantum-classical approaches to address the max-flow problem. This paper starts with comparing quantum approaches with well-established classical methods such as the Ford-Fulkerson and Edmonds-Karp.The main aim of this work is to asses how close quantum-inspired formulations can get to classical approaches in terms of their flow value as well as their runtime. Implementations are developed using the Qiskit framework on simulated quantum backends and compared against classical baselines across synthetic graph instances of varying sizes and densities. Experimentally, it can be seen that quantum approaches implemented using the QAOA technique managed to attain flow solutions comparable to classical ones, demonstrating similar accuracy, and in certain very dense graph configurations, competitive runtime performance due to parallelization in state-vector computing.These findings suggest that although current quantum-inspired approaches may not yet surpass classical algorithms in efficiency, but they can replicate their outcomes with reasonable fidelity. This provides an important validation of their applicability to combinatorial optimization. This study also lays groundwork for future research to explore hardware-level implementations, scalability enhancements, and also hybrid integration strategies for quantum optimization in network flow problems.