Estimating QSVT angles for matrix inversion with large condition numbers
arXiv:2408.15453 · doi:10.1016/j.jcp.2025.113767
Abstract
Quantum Singular Value Transformation (QSVT) is a state-of-the-art, near-optimal quantum algorithm that can be used for matrix inversion. The QSVT circuit is parameterized by a sequence of angles that must be pre-calculated classically, with the number of angles increasing as the matrix condition number grows. Computing QSVT angles for ill-conditioned problems is a numerically challenging task. We propose a numerical technique for estimating QSVT angles for large condition numbers. This technique allows one to avoid expensive numerical computations of QSVT angles and to emulate QSVT circuits for solving ill-conditioned problems.
References in corpus (10)
- Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics
- Efficient quantum algorithm for dissipative nonlinear differential equations
- Efficient phase-factor evaluation in quantum signal processing
- Koopman-von Neumann Approach to Quantum Simulation of Nonlinear Classical Dynamics
- Improved quantum algorithms for linear and nonlinear differential equations
- Quantum algorithm for time-dependent differential equations using Dyson series
- Quantum Computing and Preconditioners for Hydrological Linear Systems
- Simulation of linear non-Hermitian boundary-value problems with quantum singular value transformation
- Quantum Algorithms for Geologic Fracture Networks
- Encoding of linear kinetic plasma problems in quantum circuits via data compression