Block-encoding based quantum algorithm for linear systems with displacement structures
Lin-Chun Wan, Chao-Hua Yu, Shi-Jie Pan, Su-Juan Qin, Fei Gao, Qiao-Yan, Wen

TL;DR
This paper introduces efficient quantum algorithms for solving linear systems with structured matrices like circulant, Toeplitz, and Hankel, achieving significant speedups over classical methods by leveraging block-encodings and displacement structures.
Contribution
It develops a new approach to implement block-encodings of structured matrices, enabling quadratic and exponential quantum speedups in different data access models.
Findings
Quadratic speedup in black-box model
Exponential speedup in QRAM model
Application to time series prediction
Abstract
Matrices with the displacement structures of circulant, Toeplitz, and Hankel types as well as matrices with structures generalizing these types are omnipresent in computations of sciences and engineering. In this paper, we present efficient and memory-reduced quantum algorithms for solving linear systems with such structures by devising a new approach to implement the block-encodings of these structured matrices. More specifically, by decomposing dense matrices into linear combinations of displacement matrices, we first deduce the parameterized representations of the matrices with displacement structures so that they can be treated similarly. With such representations, we then construct -approximate block-encodings of these structured matrices in two different data access models, i.e., the black-box model and the QRAM data structure model. It is shown the quantum…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Matrix Theory and Algorithms · Tensor decomposition and applications
