Inverting well conditioned matrices in quantum logspace

DOI10.1145/2488608.2488720zbMath1293.68129OpenAlexW1993661890WikidataQ62398448 ScholiaQ62398448MaRDI QIDQ5495860

Amnon Ta-Shma

Publication date: 7 August 2014

Published in: Proceedings of the forty-fifth annual ACM symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2488608.2488720

zbMATH Keywords

quantum computationmatrix inversionquantum state tomographyquantum phase estimationquantum space complexityapproximating matrix spectrum

Mathematics Subject Classification ID

Quantum computation (81P68) Iterative numerical methods for linear systems (65F10) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items (10)

On the Problem of Approximating the Eigenvalues of Undirected Graphs in Probabilistic Logspace ⋮ On approximating the eigenvalues of stochastic matrices in probabilistic logspace ⋮ Derandomization beyond Connectivity: Undirected Laplacian Systems in Nearly Logarithmic Space ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A survey on HHL algorithm: from theory to application in quantum machine learning ⋮ A Complete Characterization of Unitary Quantum Space ⋮ Space Hardness of Solving Structured Linear Systems. ⋮ Nonuniform families of polynomial-size quantum finite automata and quantum logarithmic-space computation with polynomial-size advice ⋮ On the de-randomization of space-bounded approximate counting problems

This page was built for publication: Inverting well conditioned matrices in quantum logspace