THE QLS ALGORITHM FOR RADAR CROSS SECTION CALCULATION

Christopher Zachow

Published Jan 1, 2019• 0 citations

Abstract

Many problems cannot be solved analytically, thus numerical methods are required. It turns out that many problems are too complex and therefore beyond the reach of current algorithms and computers. Quantum computation might offer fundamental improvements in solving these problems. However, it is a difficult task to estimate the computational power of quantum algorithms. The aim of this thesis is to find applications related to aerospace especially well suited for quantum computation and estimate their possible quantum advantage. In particular we focus on the calculation of radar cross sections, which has been suggested as a promising candidate for quantum speedup. It turns out that the main problem lies in the input of classical data. Hence, the reimplementation of classical finite element method is needed, requiring a substantial amount of quantum resources. Asymptotically a quantum speedup is achievable but it is far beyond the reach of today’s capabilities to successfully implement the quantum algorithm for this application. Additionally, a serious prediction regarding the timeframe is not foreseeable yet. Substantial breakthroughs are necessary to make quantum computation compete against classical computation in calculating radar cross sections using the finite element method.

Related papers

Radar Cross Section Estimation using the Variational Quantum Linear Solver Algorithm

Thibaut Pellerin, Robin van Gaalen, Ronny I. A. Harmanny

Electromagnetic simulations are computationally intensive yet paramount in radar technologies. Finite Element Methods (FEM) require expensive linear algebra algorithms, with a polynomial complexity in the mesh size. Variational Quantum Linear Solver (VQLS) is a quantum algorithm that might be able to offer an exponential speed-up for such tasks. Despite this quantum algorithm not being relevant for every application, it might be a promising approach to tackle the problem of radar cross-section computation efficiently. In this paper, we explain how to apply such a quantum algorithm to this radar-related problem, with a focus on the statistical estimation part of VQLS.

European Radar Conference (EuRAD)Sep 25, 20240 citations

Assessing the Practical Feasibility of the Clader-Jacobs-Sprouse Quantum Algorithm for Calculating Radar Cross Sections

Edward Parker, Nicholas A. O'Donoughue, Alvin Moon +1 more

In 2013, Clader, Jacobs, and Sprouse developed a quantum computing algorithm that solves electromagnetic scattering problems exponentially faster than the best known classical algorithm for that problem. We examine this quantum algorithm's potential practical feasibility for modeling a target's radar cross section. Doing so could be important for modeling and predicting radar behavior against emerging targets.

quant-pharXiv:2602.20553RAND Corporation eBooksFeb 25, 20260 citations

Algorithmic analysis of quantum radar cross sections

Marco O. Lanzagorta, Salvador Elías Venegas-Andraca

Sidelobe structures on classical radar cross section graphs are a consequence of discontinuities in the surface currents. In contrast, quantum radar theory states that sidelobe structures on quantum radar cross section graphs are due to quantum interference. Moreover, it is conjectured that quantum sidelobe structures may be used to detect targets oriented off the specular direction. Because of the high data bandwidth expected from quantum radar, it may be necessary to use sophisticated quantum signal analysis algorithms to determine the presence of stealth targets through the sidelobe structures. In this paper we introduce three potential quantum algorithmic techniques to compute classical and quantum radar cross sections. It is our purpose to develop a computer science-oriented tool for further physical analysis of quantum radar models as well as applications of quantum radar technology in various fields.

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIEMay 21, 201516 citations

Applications and verification of quantum computers

Shih-Han Hung

Quantum computing devices can solve problems that are infeasible for classical computers. While rigorously proving speedups over existing classical algorithms demonstrates the usefulness of quantum computers, analyzing the limits on efficient processes for computational tasks allows us to better understand the power of quantum computation. Indeed, hard problems for quantum computers also enable useful cryptographic applications. In this dissertation, we aim to understand the limits on efficient quantum computation and base applications on hard problems for quantum computers. We consider models in which a classical machine can leverage the power of a quantum device, which may be affected by noise or behave adversarially. We present protocols and tools for detecting errors in a quantum machine and estimate how serious the deviation is. We construct a non-interactive protocol that enables a purely classical party to delegate any quantum computation to an untrusted quantum prover. In the setting of error-prone quantum hardware, we employ formal methods to construct a logical system for reasoning about the robustness of a quantum algorithm design. We also study the limits of ideal quantum computers for computational tasks and give asymptotically optimal algorithms. In particular, we give quantum algorithms which provide speedups for the polynomial interpolation problem and show their optimality. Finally, we study the performance of quantum algorithms that learn properties of a matrix using queries that return its action on an input vector. In particular, we show that for various linear algebra problems, there is no quantum speedup, while for some problems, exponential speedups can be achieved.

Jan 1, 20210 citations

Formulation and Analysis of the Quantum Radar Cross Section

Matthew J. Brandsema

In radar, the amount of returns that an object sends back to the receiver after being struck by an electromagnetic wave is characterized by what is known as the radar cross section, denoted by � typically. There are many mechanisms that affect how much radiation is reflected back in the receiver direction, such as reflectivity, physical contours and dimensions, attenuation properties of the materials, projected cross sectional area and so on. All of these characteristics are lumped together in a single value of �, which has units of m2. Stealth aircrafts for example are designed to minimize its radar cross section and return the smallest amount of radiation possible in the receiver direction. A new concept has been introduced called quantum radar, that uses correlated quantum states of photons as well as the unique properties of quantum mechanics to ascertain information on a target at a distance. At the time of writing this dissertation, quantum radar is very much in its infancy. There still exist fundamental questions about the feasibility of its implementation, especially in the microwave spectrum. However, what has been theoretically determined, is that quantum radar has a fundamental advantage over classical radar in terms of resolution and returns in certain regimes. Analogous to the classical radar cross section (CRCS), the concept of the quantum radar cross section (QRCS) has been introduced. This quantity measures how “large” an object looks to a quantum radar be describing how a single photon, or small cluster of photons scatter off of a macroscopic target. Preliminary simulations of the basic quantum radar cross section equation have yielded promising results showing an advantage in sidelobe response in comparison to the classical RCS. This document expands upon this idea by providing insight as to where this advantage expanding upon the theory. The expanded theory presented in this document includes re-deriving the QRCS formula to be a general bistatic formula, as the current equation is only valid for monostatic radar geometries. This re-derivation process also leads to the addition of terms that capture the effect of photon polarization, something that is not properly taken into account in the current literature. Most importantly, a new formulation of the QRCS formula will be derived that includes writing the equation in terms of Fourier transforms. This has a profound impact on the analysis of the theory of the QRCS as it allows for the derivation of closed form solutions of certain geometries, something that has never been possible due to the form of the current QRCS equation. All together, this document will provide a complete and general theory of the QRCS. After deriving the necessary equations, there will be extensive work in the utilization of these equations in deriving geometry dependent responses and comparing the closed form solutions to the classical solutions as well as comparing the solutions to the numerical simulations. The current literature relies exclusively on numerical simulations…

Jan 1, 201727 citations

A Cost-Efficient Approach towards Computational Fluid Dynamics Simulations on Quantum Devices

Szabolcs Jóczik, Zoltán Zimborás, Tamás Majoros +1 more

Numerical simulations of physical systems are found in many industries, as they currently play a crucial role in product development. There are many numerical methods for solving differential equations that describe the underlying physics behind the mathematical models in the simulation, among which, the finite element method (FEM) is one of the most commonly used. Although in many applications the FEM seems to provide an acceptable solution to the problem, there are still many complex real-life processes that can be challenging to simulate numerically due to their complexity and large size. Recently, there has been a shift in research towards efficiently applying quantum algorithms in finite element analysis (FEA), as the potential and speedup that they could offer have been shown, but little to no effort has been made towards the applicability and cost efficiency of these algorithms in real-world quantum devices. In this paper, we propose a cost-efficient method for applying quantum algorithms in FEA for industrial problems post-processed by classical algorithms in order to address the limitations of available quantum hardware and their cost when accessing them through different cloud-based services. We carry this out by approximating the solution of the initially large system with a suitable quantum algorithm and using the obtained solutions to generate a set of reduced-order models (ROMs) that are much smaller in complexity and size than the original model. This allows the simulation of the original model with different parameter sets and excitations to be run efficiently on classical computers without having the need to access quantum subroutines again. This way, we have reduced the usage of quantum hardware (and thus the development cost) while still taking advantage of its quantum speedup.

Applied SciencesMar 10, 202212 citations