This may not be explainable in simple terms. I’m going to have to assume that you know about the double slit experiment, superposition, and wave function collapse from quantum mechanics. Otherwise this won’t make sense. And even then, this is a very watered down explanation.
Quantum computing is all about solving certain problems that would otherwise only work with guessing and checking, such as factoring a number into 2 prime numbers.
The core idea of such a quantum algorithm is:
1. Guess: Make the qubits interact in a way such that they do the math required to (in the example of prime numbers) generate guesses for answers. As the qubits interact, they become entangled. The resulting qubits essentially represent an analog superposition of all possible guesses.
2. Interference: make the qubits interact in such a way that guesses that are more likely to be correct constructively interfere, and ones that are less likely to be correct destructively interfere.
3. Collapse: perform a measurement of the qubits, collapsing them back into binary. They are now in a state that represents a single guess, which is more likely to be correct than a random guess.
4. Check. Use a normal computer to check if the answer is in fact correct, and if not, start over.
Latest Answers