# How do quantum bits increase computational power?

I'm new to quantum computing, I'm learning how to use Qiskit. I'm trying to understand better how exactly the quantum characteristics of quantum computer help to increase its computational power. I thought about the following example: If I'm writing a backtracking algorithm, writing this algorithm using quantum algorithms on a quantum computer allows me to check many paths in parallel, instead of checking all the possibilities in a row as would happen on classical computer. Is it correct to say that?

I should mention that performing Fourier Transform more efficiently on a quantum computer does not mean you can just use it like you do classically. That is, you can't just use QFT on any classical algorithms that require a Fourier Transform and expect a speed-up. This is because we can't access the quantum state directly. $$QFT |\psi \rangle = |\phi \rangle$$ You can't read-out what $$|\phi\rangle$$ is directly as postulate by quantum mechanics. That is part of the private world of the quantum state. Also, preparing an arbitrary state $$|\psi\rangle$$ on a quantum computer is hard. All qubit state initialize at $$|0\rangle^{\otimes n}$$. So you must do some operation to get it to $$|\psi \rangle$$. There is not a way to do this very efficient yet.