Editing Quantum Algorithms (section)

== <span style="color: #FFFFFF;">Understanding</span> ==
Quantum algorithms are understood through '''Period Finding''' and '''Amplitude Amplification'''.

'''1. Shor's Algorithm (Cracking the Code)''':
The secret to internet security is that it's easy to multiply two large numbers, but it's "Impossible" to take the result and find the original two numbers.
* Shor realized that factoring numbers is actually a "Pattern Finding" problem (a "Period").
* A quantum computer can use the **Quantum Fourier Transform** to see the "Waves" of a number and find its patterns instantly.
* This provides an **Exponential Speedup**, making today's uncrackable codes obsolete.

'''2. Grover's Algorithm (The Master Search)''':
Imagine you have 1 million locked boxes and only one contains a prize.
* A classical computer has to check them one by one (averaging 500,000 tries).
* Grover's algorithm uses "Quantum Interference" to make the prize box "Louder" and the empty boxes "Quieter."
* It only needs to look about 1,000 times (the square root of the total).
* This provides a **Quadratic Speedup** for almost any "Search" problem.

'''3. Why can't we use them yet?''':
Both algorithms require a "Perfect" quantum computer with thousands of qubits. Currently, our computers are too "Noisy" and small to run the full versions of these algorithms on real-world problems.

'''Complexity Classes''': Problems that a quantum computer can solve quickly are in a group called **BQP** (Bounded-error Quantum Polynomial time).
</div>

<div style="background-color: #8B0000; color: #FFFFFF; padding: 20px; border-radius: 8px; margin-bottom: 15px;">