For a problem whose existing best algorithm is in the order of [math]O(f(n))[/math], would quantum computer reduce the complexity from [math]f(n)[/math] to another function? Or only the coefficient hidden in the big-O
![The prospects of quantum computing in computational molecular biology - Outeiral - 2021 - WIREs Computational Molecular Science - Wiley Online Library The prospects of quantum computing in computational molecular biology - Outeiral - 2021 - WIREs Computational Molecular Science - Wiley Online Library](https://wires.onlinelibrary.wiley.com/cms/asset/c032eca1-f961-43b3-968b-fecc1514b651/wcms1481-toc-0001-m.jpg)
The prospects of quantum computing in computational molecular biology - Outeiral - 2021 - WIREs Computational Molecular Science - Wiley Online Library
![Currently Quantum computers might be where Rockets were at the time of Robert Goddard | NextBigFuture.com Currently Quantum computers might be where Rockets were at the time of Robert Goddard | NextBigFuture.com](http://3.bp.blogspot.com/-hSacRmqa_Cg/VbVLiNRXVPI/AAAAAAABAiY/Docj77-Wveo/s1600/quantum-computing-complexity.jpg)