arXiv subjects

Sigurd Huber

Publications and source records attributed to Sigurd Huber.

3 recordsLinked to original sources

arXiv2026

Quantum-Inspired Robust and Scalable SAR Object Classification

SAR image classification naturally has to deal with huge noise and a high dynamic range particularly requiring robust classification models. Additionally, the deployment of these models on edge devices, such as drones and military aircraft, requires a careful balance between model size and classification accuracy. This study explores the potential of tensor networks to meet these robustness requirements, specifically evaluating their resilience to data poisoning. Unlike previous works that concentrated on conventional neural networks for SAR object detection, this research focuses on the robustness and model reduction capabilities of tensor networks in object classification. Our findings indicate that tensor networks are adept at addressing both the challenges of robustness and the need for model efficiency, thereby contributing valuable insights to the ongoing discourse in radar applications and deep learning methodologies in general.

quant-ph↗

arXiv2025

A Quantum Range-Doppler Algorithm for Synthetic Aperture Radar Image Formation

Synthetic aperture radar (SAR) is a well established technology in the field of Earth remote sensing. Over the years, the resolution of SAR images has been steadily improving and the pixel count increasing as a result of advances in the sensor technology, and so have the computational resources required to process the raw data to a focused image. Because they are a necessary step in the study of the retrieved data, new high-resolution and low-complexity focusing algorithms are constantly explored in the SAR literature. The theory of quantum computing proposes a new computational framework that might allow to process a vast amount of data in a more efficient way. Relevant to our case is the advantage proven for the quantum Fourier transform (QFT), the quantum counterpart of a fundamental element of many SAR focusing algorithms. Motivated by this, in this work we propose a quantum version of the range-Doppler algorithm. We show how in general reference functions, a key element in many SAR focusing algorithms, can be mapped to quantum gates; we present the quantum circuit performing the SAR raw data focusing and we discuss in detail its computational complexity. We find that the core of the quantum range-Doppler algorithm has a computational complexity, namely the number of single- and two-qubit gates, of $O(N)$, less than its classical counterpart with computational complexity $O(N \log N)$.

quant-ph↗

arXiv2025

Fast Quantum Amplitude Encoding of Typical Classical Data

We present an improved version of a quantum amplitude encoding scheme that encodes the $N$ entries of a unit classical vector $\vec{v}=(v_1,..,v_N)$ into the amplitudes of a quantum state. Our approach has a quadratic speed-up with respect to the original one. We also describe several generalizations, including to complex entries of the input vector and a parameter $M$ that determines the parallelization. The number of qubits required for the state preparation scales as $\mathcal{O}(M\log N)$. The runtime, which depends on the data density $\rho$ and on the parallelization paramater $M$, scales as $\mathcal{O}(\frac{1}{\sqrt{\rho}}\frac{N}{M}\log (M+1))$, which in the most parallel version ($M=N$) is always less than $\mathcal{O}(\sqrt{N}\log N)$. By analysing the data density, we prove that the average runtime is $\mathcal{O}(\log^{1.5} N)$ for uniformly random inputs. We present numerical evidence that this favourable runtime behaviour also holds for real-world data, such as radar satellite images. This is promising as it allows for an input-to-output advantage of the quantum Fourier transform.

quant-ph↗