SearcharxivSearch

arXiv · 2404.04554

A quantum algorithm for the Kalman filter using block encoding

Abstract

Quantum algorithms offer significant speed-ups over their classical counterparts in various applications. In this paper, we develop quantum algorithms for the Kalman filter widely used in classical control engineering using the block encoding method. The entire calculation process is achieved by performing matrix operations on Hamiltonians based on the block encoding framework, including addition, multiplication, and inversion, which can be completed in a unified framework compared to previous quantum algorithms for solving control problems. We demonstrate that the quantum algorithm exponentially accelerates the computation of the Kalman filter compared to traditional methods. The time complexity can be reduced from $O(n^3)$ to $O(\kappa poly\log(n/\epsilon)\log(1/\epsilon'))$, where $n$ represents the matrix dimension, $\kappa$ denotes the condition number for the matrix to be inverted, $\epsilon$ indicates desired precision in block encoding, $\epsilon'$ signifies desired precision in matrix inversion. This paper provides a comprehensive quantum solution for implementing the Kalman filter and serves as an attempt to broaden the scope of quantum computation applications. Finally, we present an illustrative example implemented in Qiskit (a Python-based open-source toolkit) as a proof-of-concept.

Explore related subjects

Keep this discovery

BibTeXRIS

Hao Shi, Guofeng Zhang, Ming Zhang. 2024-04-06. A quantum algorithm for the Kalman filter using block encoding. https://arxiv.org/abs/2404.04554

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

On Diagrammatic Categorification of Verma Modules I: Braiding

In this paper, we study the extensions of KLRW algebras to tensor products of Verma module representations of $\mathfrak{sl}_2$. Our motivation is to construct a theory of Khovanov homology for knot complements in $S^3$ (and which also categorifies the Gukov-Manolescu two-variable series for knot complements), which will be done in the second part of this work. We construct the categorification of R-matrices for Verma modules as functors given by derived tensor products with diagrammatic bimodules and explicitly compute their projective resolutions. We also prove these braiding functors induce an action of the braid group on the relevant categories. Then, we describe how to incorporate strands in finite-dimensional representations of $\mathfrak{sl}_2$, thereby establishing functors that serve as the Khovanov homology on a braid complement. In the case of the unknot, this gives knot homologies in $S^1\times D^2$, which we compare to Annular Khovanov Homology through several examples and show they are very closely related, conjecturing they are of the same dimension. We conclude with a proposal for the categorification of the cups and caps of Verma module colored strands, which we build upon in the next paper.

math.QA

Some finite dimensional representations of shifted quantum affine algebras of type A

In this paper, we study finite dimensional representations of shifted quantum affine algebras of type A. We give an explicit description of the tensor product of simple evaluation modules of the quantum loop algebra and a one-dimensional representation of the shifted quantum affine algebra under the separation condition. As a consequence, we give the q-characters of some finite dimensional simple modules of the shifted quantum affine algebra.

math.QA