Robert S. Jonsson | Searcharxiv

arXiv2024

Experimental Evaluation of Moving Target Compensation in High Time-Bandwidth Noise Radar

In this article, the effect a moving target has on the signal-to-interference-plus-noise-ratio (SINR) for high time-bandwidth noise radars is investigated. To compensate for cell migration we apply a computationally efficient stretch processing algorithm that is tailored for batched processing and suitable for implementation onto a real-time radar processor. The performance of the algorithm is studied using experimental data. In the experiment, pseudorandom noise, with a bandwidth of 100 MHz, is generated and transmitted in real-time. An unmanned aerial vehicle (UAV), flown at a speed of 11 m/s, is acting as a target. For an integration time of 1 s, the algorithm is shown to yield an increase in SINR of roughly 13 dB, compared to no compensation. It is also shown that coherent integration times of 2.5 s can be achieved.

eess.SP↗

arXiv2024

Optimizing Variational Quantum Algorithms with qBang: Efficiently Interweaving Metric and Momentum to Navigate Flat Energy Landscapes

Variational quantum algorithms (VQAs) represent a promising approach to utilizing current quantum computing infrastructures. VQAs are based on a parameterized quantum circuit optimized in a closed loop via a classical algorithm. This hybrid approach reduces the quantum processing unit load but comes at the cost of a classical optimization that can feature a flat energy landscape. Existing optimization techniques, including either imaginary time-propagation, natural gradient, or momentum-based approaches, are promising candidates but place either a significant burden on the quantum device or suffer frequently from slow convergence. In this work, we propose the quantum Broyden adaptive natural gradient (qBang) approach, a novel optimizer that aims to distill the best aspects of existing approaches. By employing the Broyden approach to approximate updates in the Fisher information matrix and combining it with a momentum-based algorithm, qBang reduces quantum-resource requirements while performing better than more resource-demanding alternatives. Benchmarks for the barren plateau, quantum chemistry, and the max-cut problem demonstrate an overall stable performance with a clear improvement over existing techniques in the case of flat (but not exponentially flat) optimization landscapes. qBang introduces a new development strategy for gradient-based VQAs with a plethora of possible improvements.

quant-ph↗