Complexity Theory for Classical and Quantum Algorithms
Was this section helpful?
Introduction to Algorithms, Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein, 2022 (MIT Press) - A standard textbook covering classical algorithm analysis, Big O notation, and fundamental complexity classes like P and NP.
Quantum Computation and Quantum Information, Michael A. Nielsen and Isaac L. Chuang, 2010 (Cambridge University Press)DOI: 10.1017/CBO9780511976667 - The comprehensive textbook on quantum computing, discussing quantum complexity classes like BQP and algorithms such as Shor's and Grover's.
Quantum algorithm for linear systems of equations, Aram W. Harrow, Avinatan Hassidim, and Seth Lloyd, 2009Physical Review Letters, Vol. 103 (American Physical Society)DOI: 10.1103/PhysRevLett.103.150502 - Introduces the HHL algorithm, a quantum algorithm for solving linear systems of equations with potential exponential speedup under specific conditions.
Barren plateaus in quantum neural networks, Jarrod R. McClean, Sergio Boixo, Vadim N. Smelyanskiy, Ryan Babbush, and Hartmut Neven, 2018Nature Communications, Vol. 9 (Springer Nature)DOI: 10.1038/s41467-018-07090-4 - Explores the problem of barren plateaus, where optimization landscapes of variational quantum algorithms become flat, hindering training.