Optimizing Reconfigurable Intelligent Surfaces (RIS) is a high-dimensional combinatorial challenge. Current quantum algorithms often simplify this problem by ignoring physical constraints like mutual coupling, which significantly degrades real-world performance. Rather than targeting a fully realistic RIS description, we embed progressively more physics-informed models of mutual coupling into Quadratic Unconstrained Binary Optimization (QUBO) formulations. We evaluate four Ising interaction models (Jij) for the Quantum Approximate Optimization Algorithm (QAOA), ranging from idealized phase-only to fully dense physical models. Analyzing a 5 × 5 grid, our results expose a critical trade-off between spatial pointing accuracy and quantum hardware feasibility. While complete global coupling maximizes beamforming precision, dense Hamiltonians introduce prohibitive routing overhead and complicate convergence on near-term processors. Ultimately, we demonstrate that while physics-informed quantum optimization is mathematically viable, sparse, distance-penalized models remain a necessary compromise for execution on current noisy intermediate-scale quantum (NISQ) devices.
Optimizing Reconfigurable Intelligent Surfaces (RIS) is a high-dimensional combinatorial challenge. Current quantum algorithms often simplify this problem by ignoring physical constraints like mutual coupling, which significantly degrades real-world performance. Rather than targeting a fully realistic RIS description, we embed progressively more physics-informed models of mutual coupling into Quadratic Unconstrained Binary Optimization (QUBO) formulations. We evaluate four Ising interaction models (Jij) for the Quantum Approximate Optimization Algorithm (QAOA), ranging from idealized phase-only to fully dense physical models. Analyzing a 5 × 5 grid, our results expose a critical trade-off between spatial pointing accuracy and quantum hardware feasibility. While complete global coupling maximizes beamforming precision, dense Hamiltonians introduce prohibitive routing overhead and complicate convergence on near-term processors. Ultimately, we demonstrate that while physics-informed quantum optimization is mathematically viable, sparse, distance-penalized models remain a necessary compromise for execution on current noisy intermediate-scale quantum (NISQ) devices.
The Quantum Approximate Optimization Algorithm (QAOA) has emerged as one of the most prominent hybrid quantum–classical algorithms for combinatorial optimization on noisy intermediate-scale quantum (NISQ) hardware. QAOA maps real-world problems into Ising or quadratic unconstrained binary optimization (QUBO) forms and alternates cost and mixer operators in a shallow parameterized circuit whose angles are tuned by a classical optimizer. This article introduces QAOA from fundamentals to practice, emphasizing why it aligns with industrial optimization through binary decision modeling and the presence of severe scaling challenges in classical optimization. We review research trends that improve expressivity and trainability, including ansatz engineering, parameter initialization, and hybrid training strategies, drawing parallels to developments in artificial intelligence. After that, we survey representative applications in emerging domains such as drug discovery, materials design, semiconductor design, logistics, and finance highlighting practical encodings and constraint-preserving formulations that keep quantum evolution within feasible subspaces beyond penalty-based methods. Finally, we present QAOA as a rapidly maturing framework with credible pathways toward near-term utility in real industrial workflows.
Solving optimization problems is critical across many research domains, but the high dimensionality of parameter spaces often poses significant challenges. The Quantum Approximate Optimization Algorithm (QAOA) has emerged as a promising approach for accelerating optimization in the Noisy Intermediate-Scale Quantum (NISQ) era by leveraging both classical and quantum computational resources. However, its performance can vary depending on the underlying quantum hardware architecture. In this work, we evaluate the performance of QAOA on different quantum hardware platforms, specifically, superconducting transmon qubits and trapped-ion qubits, targetting real-world optimization problems formulated as fully connected Quadratic Unconstrained Binary Optimization (QUBO) instances. We evaluate both the solution quality and time-to-solution using dense QUBO matrices. Furthermore, we show that large-scale problems, such as a 100-bit QUBO instance, can be effectively tackled by integrating quantum computing with high-performance computing (HPC) resources. This study provides practical insights into the strengths and limitations of different qubit technologies and advances the application of quantum computing in solving real-world optimization problems.
The objective of this paper is to introduce the application of quantum annealing (QA) to electromagnetic (EM) engineering. We demonstrate that numerous EM design and inverse problems naturally admit a mathematical formulation in terms of binary quadratic interactions. By utilizing didactic, simplified examples, we illustrate how this underlying physical structure allows for a direct mapping of EM problems onto Quadratic Unconstrained Binary Optimization (QUBO) models and equivalent Ising Hamiltonians. All numerical experiments are conducted using Simulated Annealing as a classical proxy, since the primary contribution of this work is the QUBO formulation itself rather than its execution on quantum hardware. Our results suggest that a broad class of EM problems—including array thinning, reconfigurable intelligent surface optimization, subarray partitioning, and electromagnetic inverse scattering—are suitable candidates for optimization using near-future quantum annealing architectures, once hardware connectivity and noise floors reach the required specifications.
Simultaneously transmitting and reflecting reconfigurable intelligent surface (STAR-RIS) enables 360-degree full-space coverage by controlling both transmitted and reflected signals through each element. However, the coupled phase-shift model, where the transmission and reflection coefficients are physically interdependent, transforms the phase optimization into an extremely complex non-convex combinatorial problem that classical algorithms struggle to solve efficiently. In this paper, we propose a hybrid quantum-classical framework that employs the Quantum Approximate Optimization Algorithm (QAOA) to optimize the coupled phase-shift configuration of STAR-RIS. Each discrete phase configuration is mapped to a qubit-based Ising Hamiltonian, enabling QAOA to explore the exponentially large solution space through quantum superposition and entanglement. To address the scalability challenge of simulating large antenna arrays (e.g., 8 × 8 = 64 elements), we introduce a variable grouping (tiling) strategy that partitions the RIS into manageable sub-arrays of 2 × 2 elements, each requiring only 8 qubits for 2-bit phase quantization. Our comprehensive simulations demonstrate that the proposed QAOA-based optimizer achieves an approximation ratio exceeding 0.94 with 10 QAOA layers, maintains over 86% fidelity under 2% gate error rates in noisy intermediate-scale quantum (NISQ) environments, and exhibits robust performance under imperfect channel state information with less than 5% degradation at 30% CSI error variance. The energy efficiency analysis confirms that the QAOA-optimized STAR-RIS achieves approximately 1.7× higher spectral efficiency per unit energy compared to conventional reflect-only RIS. Furthermore, the proposed tiling framework scales linearly with array size, enabling deployment on arrays up to 16 × 16 elements while maintaining constant per-group quantum resource requirements.
Wireless communication technology has become important in modern life. Real-world radio environments present significant challenges, particularly concerning latency and multipath fading. A promising solution is represented by reconfigurable intelligent surfaces (RIS), which can manipulate electromagnetic waves to enhance transmission quality. In this study, we introduce a novel approach that employs the quantum approximate optimization algorithm (QAOA) to efficiently configure RIS in multipath environments. Applying the spin glass (SG) theoretical framework to describe chaotic systems, along with a variable noise model, we propose a quantum-based minimization algorithm to optimize RIS in various electromagnetic scenarios affected by multipath fading. The method involves training a parameterized quantum circuit using a mathematical model that scales with the size of the RIS. When applied to different EM scenarios, it directly identifies the optimal RIS configuration. This approach eliminates the need for large datasets for training, validation, and testing, streamlines, and accelerates the training process. Furthermore, the algorithm will not need to be rerun for each individual scenario. In particular, our analysis considers a system with one transmitting antenna, multiple receiving antennas, and varying noise levels. The results show that QAOA enhances the performance of RIS in both noise-free and noisy environments, highlighting the potential of quantum computing to address the complexities of RIS optimization and improve the performance of the wireless network.
The Quantum Approximate Optimization Algorithm (QAOA) is a leading candidate for solving combinatorial optimization problems on near-term quantum hardware. However, its practical deployment remains severely limited by hardware-induced noise and decoherence. In the absence of full fault tolerance, Quantum Error Mitigation (QEM) techniques offer a viable approach to enhance QAOA performance on noisy intermediate-scale quantum (NISQ) devices. In this work, we present a unified classification of QEM strategies specifically tailored for QAOA, systematically categorized into preprocessing, during execution, and post-processing phases. We further classify QAOA deployment settings—such as hardware-constrained devices, stochastic noise-dominated environments, and dense graphs problem—and recommend appropriate QEM techniques for each. A comparative analysis highlights the trade-offs among mitigation accuracy, resource overhead, and robustness to different noise types. By synthesizing recent advances and identifying open challenges, our paper provides both a comprehensive survey and a practical framework for designing robust, noise-resilient QAOA pipelines on near-term quantum platforms.