Reference · 2019
Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics
Gilyén, A., Su, Y., Low, G. H., & Wiebe, N. (2019). Quantum singular value transformation and beyond: Exponential improvements for quantum matrix arithmetics. In Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing (pp. 193–204).
- Authors
- András Gilyén; Yuan Su; Guang Hao Low; Nathan Wiebe
- Venue
- Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 193–204
The QSVT paper cited from the complexity table. The abstract presents a polynomial transformation of the singular values of a block of a unitary, generalizing the optimal Hamiltonian simulation of Low and Chuang, usually with a constant number of ancilla qubits. The title's exponential improvements are improvements for stated matrix-arithmetic tasks, not a single classical speedup this library will label exponential. Hamiltonian simulation and HHL are the pages that already use the block-encoding results this framework generalizes. There is no QSVT algorithm page yet.
Cited by
Updated 28 Oct 2026.