An Improved Method for Quantum Matrix Multiplication
arXiv:2311.14044 · doi:10.1007/s11128-023-04054-6
Abstract
Following the celebrated quantum algorithm for solving linear equations (so-called HHL algorithm), Childs, Kothari and Somma [SIAM Journal on Computing, {\bf 46}: 1920, (2017)] provided an approach to solve a linear system of equations with exponentially improved dependence on precision. In this note, we aim to complement such a result for applying a matrix to some quantum state, based upon their Chebyshev polynomial approach. A few examples that motivate this application are included and we further discuss an application of this improved matrix application algorithm explicitly with an efficient quantum procedure.
References in corpus (9)
- Quantum algorithm for solving linear systems of equations
- Quantum support vector machine for big data classification
- Quantum Amplitude Amplification and Estimation
- On the Power of One Bit of Quantum Information
- Efficient quantum algorithms for simulating sparse Hamiltonians
- Quantum algorithm for systems of linear equations with exponentially improved dependence on precision
- Quantum Data Fitting
- Hamiltonian simulation with nearly optimal dependence on all parameters
- Preconditioned quantum linear system algorithm