Sign Up to like & get
recommendations!
0
Published in 2020 at "Quantum Information Processing"
DOI: 10.1007/s11128-020-02777-4
Abstract: In this paper, we propose a quantum algorithm for approximating the QR decomposition of any $$N\times N$$ N × N matrix with a running time $$O(\frac{1}{\epsilon ^2}$$ O ( 1 ϵ 2 $$N^{2.5}\text {polylog}(N))$$ N…
read more here.
Keywords:
quantum;
polylog;
quantum algorithm;
time ... See more keywords