Efficient quantum circuits for Toeplitz and Hankel matrices
Abstract
Toeplitz and Hankel matrices have been a subject of intense interest in a wide range of science and engineering related applications. In this paper, we show that quantum circuits can efficiently implement sparse or Fourier-sparse Toeplitz and Hankel matrices. This provides an essential ingredient for solving many physical problems with Toeplitz or Hankel symmetry in the quantum setting with deterministic queries.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.