6533b81ffe1ef96bd1278859

RESEARCH PRODUCT

Variable time amplitude amplification and quantum algorithms for linear algebra problems

Andris Ambainis

subject

000 Computer science knowledge general works010201 computation theory & mathematics0103 physical sciencesComputer Science[INFO.INFO-CC] Computer Science [cs]/Computational Complexity [cs.CC][INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS]0102 computer and information scienceslinear equations010306 general physicsquantum algorithmsamplitude amplification01 natural sciencesquantum computing

description

Quantum amplitude amplification is a method of increasing a success probability of an algorithm from a small epsilon>0 to Theta(1) with less repetitions than classically. In this paper, we generalize quantum amplitude amplification to the case when parts of the algorithm that is being amplified stop at different times. We then apply the new variable time amplitude amplification to give two new quantum algorithms for linear algebra problems. Our first algorithm is an improvement of Harrow et al. algorithm for solving systems of linear equations. We improve the running time of the algorithm from O(k^2 log N) to O(k log^3 k log N) where k is the condition number of the system of equations. Our second algorithm tests whether a matrix A is singular or far from singular, faster then the previously known algorithms.

https://dx.doi.org/10.4230/lipics.stacs.2012.636