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

IET Quantum Communication

Beamforming optimization via quantum algorithms using Variational Quantum Eigensolver and Quantum Approximate Optimization Algorithm

Bidisha Dhara, Monika Agrawal, Sumantra Dutta Roy

Published Jan 1, 2025• 4 citations
Publisher

Abstract

Abstract This study investigates the application of quantum algorithms, specifically the Variational Quantum Eigensolver (VQE) and the Quantum Approximate Optimization Algorithm (QAOA), to design optimal sensor configurations for beamforming, enhancing signal quality and overall system performance. We propose two distinct optimization formulations: one aimed at maximising array gain while the other aimed at maximising signal‐to‐noise‐interference ratio (SINR). Our findings show that the outputs obtained from quantum algorithms are consistent with those derived from classical methods.

DOI
10.1049/qtc2.12120

Related papers

Exploring Optimal and Suboptimal Beamforming Solutions Using Weighted Subspace-Search-VQE

Bidisha Dhara, Monika Agrawal, Sumantra Dutta Roy

This work explores the application of a Quantum algorithm, namely Weighted Subspace-Search-Variational-Quantum-Eigensolver (SSVQE), a variant of the traditional VQE algorithm, to predict optimal as well as sub-optimal sparse array configurations for the problem of beamforming. The optimization formulation is designed to maximize the Signal-to-Interference-plus-Noise Ratio (SINR), which is then reformulated into Quadratic Unconstrained Binary Optimization (QUBO) representation to serve as the Hamiltonian for the weighted SSVQE algorithm. The results obtained are presented along with classically obtained SINR plots to facilitate a comparison of the sparse array configurations. Our findings indicate that the output from the quantum algorithm precisely match with the results obtained from the classical method.

•Jan 6, 2025•0 citations

Exploring Beamforming Solutions Using Recursive Quantum Approximate Optimization Algorithm

Bidisha Dhara, Monika Agrawal, Sumantra Dutta Roy

The Quantum Approximate Optimization Algorithm (QAOA) is a promising quantum algorithm for solving combinatorial optimization problems. In this work, we explore the Recursive QAOA (RQAOA) approach, which improves upon the standard QAOA by successively reducing the problem size, to optimize sensor configuration for beamforming with the objective of maximizing the Signal-to-Interference-plus-Noise Ratio (SINR). We present a series of experiments across various setups, including different numbers of sensors and a range of optimizers. Additionally, we compare the obtained SINR with the maximum achievable SINR to assess the efficiency of the algorithm.

IEEE International Conference on Quantum Computing and Engineering (QCE)•Aug 30, 2025•0 citations

Quantum Optimization with Variational Algorithms

Claudia Zendejas-Morales

The rapid evolution of quantum computing has introduced groundbreaking approaches to solving complex optimization problems, traditionally limited by classical methods. This talk explores the principles and applications of quantum optimization, with a focus on Variational Quantum Algorithms (VQAs). These algorithms, including the Variational Quantum Eigensolver (VQE) and Quantum Approximate Optimization Algorithm (QAOA), leverage hybrid quantum-classical systems to address challenges in diverse fields such as combinatorial optimization, quantum chemistry, and material design. Attendees will gain insights into the theoretical foundations of quantum computing, the operational mechanics of quantum circuits, and the integration of quantum programming tools like Qiskit. Practical examples and demonstrations will highlight how VQAs outperform classical methods in specific scenarios, offering a transformative perspective on optimization in the quantum era.

Journal of Physics & Optics Sciences•Apr 25, 2025•0 citations

Quantum Algorithms for Financial Optimization: Benchmarking QAOA, VQE, and Classical Portfolio Techniques

Subodh Nath Pushpak, Sonal Jain, Siddharth Kalra

Portfolio optimization is a fundamental problem in quantitative finance that seeks to maximize risk-adjusted returns while managing investment risk. With the advent of quantum computing, there is growing interest in applying quantum algorithms to solve complex optimization problems. This paper presents a comprehensive comparative study of quantum and classical approaches to portfolio optimization, specifically comparing the Quantum Approximate Optimization Algorithm (QAOA), Variational Quantum Eigensolver (VQE), and classical mean-variance optimization. We evaluate these methods on both real market data and synthetic datasets with varying correlation structures. Our experimental results show that while classical methods currently outperform quantum approaches on near-term quantum devices in terms of solution quality and computational efficiency, quantum algorithms demonstrate conceptual viability and promise for future applications as quantum hardware improves. The classical method achieves optimal Sharpe ratios of 1.2-1.8, while QAOA and VQE achieve 80-95% and 75-90% of classical performance respectively. This work provides insights into the current state and future potential of quantum computing for financial optimization.

International Conference on Innovative Practices in Technology and Management (ICIPTM)•Feb 19, 2026•0 citations

Quantum Variational Optimization and Adiabatic Methods

Santanu Pattanayak

In this chapter, we will take a look at the various optimization techniques that use quantum computing in their formulation. A couple of such algorithms that we are going to work through in great detail are the variational quantum eigensolver, popularly known as VQE, and the quantum approximate optimization algorithm, also known as QAOA. The central idea in both methods is to define cost objectives as an expectation of appropriate Hamiltonians pertaining to quantum systems. Based on the maximization or minimization problem, we look to derive the maximum or minimum eigenvalue state through these optimization techniques. Both of these methods are variational in that they combine both quantum and classical methods for the optimization. Since the topic is centered around Hamiltonians, we will study the popular Isling Hamiltonian model as well in this chapter. Similarly, the QAOA technique is based on the adiabatic evolution of a quantum system, and hence we will study its underlying math in great detail in this chapter.

Apress eBooks•Jan 1, 2021•0 citations

Financial Portfolio Optimization: A QAOA and VQE Formulation for Sharpe Ratio Maximization

Naman Kaushik, Aryan Raj, Milind Srivastava +6 more

A quantum approach for portfolio optimization involves using quantum computing to solve complex optimization problems related to portfolio selection. The approach involves constructing a mathematical model of the portfolio optimization problem using various algorithms such as the Quantum Approximate Optimization Algorithm (QAOA) or the Variational Quantum Eigensolver (VQE). This approach has the potential to provide more accurate and efficient solutions than classical approaches, particularly for large and complex portfolio optimization problems. Moreover, this paper also dives into discussing and comparing the results obtained from both these approaches. Our work is under the assumptions required for the proposed formulation deriving meaningful considerations about the solution quality found, measured as the value of Sharpe Ratio.

International Conference on Recent Trends in Advance Computing (ICRTAC)•Dec 14, 2023•5 citations
Abstract This study investigates the application of quantum algorithms, specifically the Variational Quantum Eigensolver (VQE) and the Quantum Approximate Optimization Algorithm (QAOA), to design optimal sensor configurations for beamforming, enhancing signal quality and overall system performance. We propose two distinct optimization formulations: one aimed at maximising array gain while the other aimed at maximising signal‐to‐noise‐interference ratio (SINR). Our findings show that the outputs obtained from quantum algorithms are consistent with those derived from classical methods.
This work explores the application of a Quantum algorithm, namely Weighted Subspace-Search-Variational-Quantum-Eigensolver (SSVQE), a variant of the traditional VQE algorithm, to predict optimal as well as sub-optimal sparse array configurations for the problem of beamforming. The optimization formulation is designed to maximize the Signal-to-Interference-plus-Noise Ratio (SINR), which is then reformulated into Quadratic Unconstrained Binary Optimization (QUBO) representation to serve as the Hamiltonian for the weighted SSVQE algorithm. The results obtained are presented along with classically obtained SINR plots to facilitate a comparison of the sparse array configurations. Our findings indicate that the output from the quantum algorithm precisely match with the results obtained from the classical method.
The Quantum Approximate Optimization Algorithm (QAOA) is a promising quantum algorithm for solving combinatorial optimization problems. In this work, we explore the Recursive QAOA (RQAOA) approach, which improves upon the standard QAOA by successively reducing the problem size, to optimize sensor configuration for beamforming with the objective of maximizing the Signal-to-Interference-plus-Noise Ratio (SINR). We present a series of experiments across various setups, including different numbers of sensors and a range of optimizers. Additionally, we compare the obtained SINR with the maximum achievable SINR to assess the efficiency of the algorithm.
The rapid evolution of quantum computing has introduced groundbreaking approaches to solving complex optimization problems, traditionally limited by classical methods. This talk explores the principles and applications of quantum optimization, with a focus on Variational Quantum Algorithms (VQAs). These algorithms, including the Variational Quantum Eigensolver (VQE) and Quantum Approximate Optimization Algorithm (QAOA), leverage hybrid quantum-classical systems to address challenges in diverse fields such as combinatorial optimization, quantum chemistry, and material design. Attendees will gain insights into the theoretical foundations of quantum computing, the operational mechanics of quantum circuits, and the integration of quantum programming tools like Qiskit. Practical examples and demonstrations will highlight how VQAs outperform classical methods in specific scenarios, offering a transformative perspective on optimization in the quantum era.
Portfolio optimization is a fundamental problem in quantitative finance that seeks to maximize risk-adjusted returns while managing investment risk. With the advent of quantum computing, there is growing interest in applying quantum algorithms to solve complex optimization problems. This paper presents a comprehensive comparative study of quantum and classical approaches to portfolio optimization, specifically comparing the Quantum Approximate Optimization Algorithm (QAOA), Variational Quantum Eigensolver (VQE), and classical mean-variance optimization. We evaluate these methods on both real market data and synthetic datasets with varying correlation structures. Our experimental results show that while classical methods currently outperform quantum approaches on near-term quantum devices in terms of solution quality and computational efficiency, quantum algorithms demonstrate conceptual viability and promise for future applications as quantum hardware improves. The classical method achieves optimal Sharpe ratios of 1.2-1.8, while QAOA and VQE achieve 80-95% and 75-90% of classical performance respectively. This work provides insights into the current state and future potential of quantum computing for financial optimization.
In this chapter, we will take a look at the various optimization techniques that use quantum computing in their formulation. A couple of such algorithms that we are going to work through in great detail are the variational quantum eigensolver, popularly known as VQE, and the quantum approximate optimization algorithm, also known as QAOA. The central idea in both methods is to define cost objectives as an expectation of appropriate Hamiltonians pertaining to quantum systems. Based on the maximization or minimization problem, we look to derive the maximum or minimum eigenvalue state through these optimization techniques. Both of these methods are variational in that they combine both quantum and classical methods for the optimization. Since the topic is centered around Hamiltonians, we will study the popular Isling Hamiltonian model as well in this chapter. Similarly, the QAOA technique is based on the adiabatic evolution of a quantum system, and hence we will study its underlying math in great detail in this chapter.
A quantum approach for portfolio optimization involves using quantum computing to solve complex optimization problems related to portfolio selection. The approach involves constructing a mathematical model of the portfolio optimization problem using various algorithms such as the Quantum Approximate Optimization Algorithm (QAOA) or the Variational Quantum Eigensolver (VQE). This approach has the potential to provide more accurate and efficient solutions than classical approaches, particularly for large and complex portfolio optimization problems. Moreover, this paper also dives into discussing and comparing the results obtained from both these approaches. Our work is under the assumptions required for the proposed formulation deriving meaningful considerations about the solution quality found, measured as the value of Sharpe Ratio.