Efficient quantum circuits for Toeplitz and Hankel matrices
arXiv:1605.07710 · doi:10.1088/1751-8113/49/27/275301
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.
References in corpus (10)
- Quantum algorithm for solving linear systems of equations
- Quantum random access memory
- Efficient quantum algorithms for simulating sparse Hamiltonians
- Exponential improvement in precision for simulating sparse Hamiltonians
- Experimental Quantum Computing to Solve Systems of Linear Equations
- Efficient Quantum Circuits for Diagonal Unitaries Without Ancillas
- Experimental realization of quantum algorithm for solving linear systems of equations
- Solving systems of linear equations on a quantum computer
- Efficient quantum circuits for arbitrary sparse unitaries
- Calculation of the Density of States Using Discrete Variable Representation and Toeplitz Matrices
Cited by in corpus (6)
- Asymptotic Quantum Algorithm for the Toeplitz Systems
- Quantum walk-based portfolio optimisation
- Block-encoding structured matrices for data input in quantum computing
- On efficient quantum block encoding of pseudo-differential operators
- Block-encoding dense and full-rank kernels using hierarchical matrices: applications in quantum numerical linear algebra
- Quantum algorithms for group convolution, cross-correlation, and equivariant transformations