Inverting well conditioned matrices in quantum logspace

DOI10.1145/2488608.2488720MaRDI QIDQ5495860zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Amnon Ta-Shma

Publication date 7 August 2014

Published in Proceedings of the forty-eighth 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

approximating matrix spectrummatrix inversionquantum computationquantum phase estimationquantum space complexityquantum state tomography

Mathematics Subject Classification ID

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

Recommendations

• Quantum algorithm for matrix logarithm by integral formula
• Factorizations of invertible density matrices
• Characterizations of the invertibility of quantale matrices
• Inverse problems, constraint satisfaction, reversible logic, invertible logic and Grover quantum oracles for practical problems
• scientific article; zbMATH DE number 7765405
• Antosik-Mikusinski matrix convergence theorem in quantum logics
• EXACT QUANTUM FOURIER TRANSFORMS AND DISCRETE LOGARITHM ALGORITHMS
• Qualitatively invertible matrices
• Sur les matrices quantiques
• Computation of quantum factorials and their inverses

Cited in

(16)

• A survey on HHL algorithm: from theory to application in quantum machine learning
• On the de-randomization of space-bounded approximate counting problems
• On approximating the eigenvalues of stochastic matrices in probabilistic logspace
• On the problem of approximating the eigenvalues of undirected graphs in probabilistic logspace
• Fast quantum algorithms for least squares regression and statistic leverage scores
• A complete characterization of unitary quantum space
• A quasi-random approach to matrix spectral analysis
• Probabilistic logarithmic-space algorithms for Laplacian solvers
• Fast quantum algorithms for least squares regression and statistic leverage scores
• Derandomization beyond connectivity: undirected Laplacian systems in nearly logarithmic space
• Space Hardness of Solving Structured Linear Systems.
• Approximating iterated multiplication of stochastic matrices in small space
• Quantum algorithms for matrix operations and linear systems of equations
• The space-time cost of purifying quantum computations
• Lower bounds on the running time of two-way quantum finite automata and sublogarithmic-space quantum Turing machines
• Quantum logspace algorithm for powering matrices with bounded norm

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5495860)