placeholder image

Optimizing antenna beamforming with quantum computing

We show how the maximization problem can be rigorously solved by reformulating it as a sequence of quadratic (but non-convex) minimization problems.

Information

We consider beamforming with largescale antenna arrays in which the elements can transmit only in one of a small number of phase-shifts. This creates an NP-hard optimization problem, namely the maximization of the ratio of two Hermitian quadratic forms, with the state vector constrained to the set of allowed phase-shifts. We show how the maximization problem can be rigorously solved by reformulating it as a sequence of quadratic (but non-convex) minimization problems.

https://ieeexplore.ieee.org/document/10133700

Author/Speaker/Contributor

Keith Briggs

Event/Publication

EuCAP 2023

Date

March 2023