Quantum Computing, Quantum, Quantum Physics, Computer Science, AI.
equations with n unknowns typically scales as O(n³), where the O notation denotes the upper bound on the scaling. On the other hand, the number of operations required by the HHL algorithm to solve the same system of linear equations scales as O((log n)²), where log denotes the logarithm base 2.