# Quantum Logspace Algorithm for Powering Matrices with Bounded Norm

Girish Uma
Zhan Wei

Electronic Colloquium on Computational Complexity, pp. 872020.

Abstract:

We give a quantum logspace algorithm for powering contraction matrices, that is, matrices with spectral norm at most~1. The algorithm gets as an input an arbitrary $n\times n$ contraction matrix $A$, and a parameter $T \leq \mathrm{poly}(n)$ and outputs the entries of $A^T$, up to (arbitrary) polynomially small additive error. The algor...More

Code:

Data: