Editing Quantum Algorithms

<div style="background-color: #4B0082; color: #FFFFFF; padding: 20px; border-radius: 8px; margin-bottom: 15px;">
{{BloomIntro}}
Quantum Algorithms are the specialized "Recipes" that allow quantum computers to outperform classical supercomputers. While most things are handled just as well by a normal computer, two specific algorithms—'''Shor's''' and '''Grover's'''—proved that quantum computers have a "Superpower" for certain types of puzzles. Shor's algorithm can crack nearly all modern encryption, while Grover's can find a "Needle in a Haystack" with incredible speed. These discoveries transformed quantum computing from a theoretical curiosity into a national security priority and the next great frontier of computer science.
</div>

__TOC__

<div style="background-color: #000080; color: #FFFFFF; padding: 20px; border-radius: 8px; margin-bottom: 15px;">
== <span style="color: #FFFFFF;">Remembering</span> ==
* '''Quantum Algorithm''' — A set of steps designed to be run on a quantum computer to solve a specific problem.
* '''Peter Shor''' — The mathematician who discovered the algorithm for factoring large numbers in 1994.
* '''Lov Grover''' — The computer scientist who discovered the algorithm for searching unsorted databases in 1996.
* '''RSA Encryption''' — The standard security used for the internet, which relies on the fact that "Factoring" large numbers is nearly impossible for classical computers.
* '''Factoring''' — Finding the prime numbers that multiply together to make a larger number (e.g., 3 and 5 are the factors of 15).
* '''Speedup''' — The measure of how much faster a quantum algorithm is compared to a classical one.
* '''Exponential Speedup''' — A massive jump in speed where a problem that takes a billion years could be solved in seconds.
* '''Quadratic Speedup''' — A significant but smaller jump (e.g., reducing 1,000,000 steps to 1,000 steps).
* '''Oracle''' — A "Black Box" part of an algorithm that can check if an answer is correct.
</div>

<div style="background-color: #006400; color: #FFFFFF; padding: 20px; border-radius: 8px; margin-bottom: 15px;">
== <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;">
== <span style="color: #FFFFFF;">Applying</span> ==
'''Modeling 'The Grover Speedup' (Comparing Classical vs. Quantum search):'''
<syntaxhighlight lang="python">
import math

def compare_search_speeds(items_count):
    """
    Classical search = N/2 tries.
    Grover search = sqrt(N) tries.
    """
    classical_avg = items_count / 2
    quantum_avg = math.sqrt(items_count)
    
    return {
        "Database Size": f"{items_count:,}",
        "Classical Tries": f"{int(classical_avg):,}",
        "Quantum Tries": f"{int(quantum_avg):,}",
        "Speedup Factor": round(classical_avg / quantum_avg)
    }

# Search through 1 Billion items:
print(compare_search_speeds(1000000000))
# Quantum reduces 500 million steps to just ~31,000 steps!
</syntaxhighlight>

; Algorithm Landmarks
: '''The '15' Factorization (2001)''' → IBM used a 7-qubit computer to successfully run Shor's algorithm and prove that 15 = 3 x 5. It was a small step that proved the theory was real.
: '''Post-Quantum Cryptography''' → The current global race to invent new codes (like Lattice-based crypto) that even Shor's algorithm can't crack.
: '''Grover's Oracle''' → The realization that Grover's algorithm could be used to speed up "Anything"—from playing chess to scheduling flights.
: '''Simon's Algorithm''' → A precursor to Shor's that was the first to show an exponential speedup, convincing scientists that quantum computing was worth the investment.
</div>

<div style="background-color: #8B4500; color: #FFFFFF; padding: 20px; border-radius: 8px; margin-bottom: 15px;">
== <span style="color: #FFFFFF;">Analyzing</span> ==
{| class="wikitable"
|+ Shor's vs. Grover's
! Feature !! Shor's Algorithm !! Grover's Algorithm
|-
| Primary Use || Factoring / Cryptography || Searching Unsorted Data
|-
| Speedup || Exponential (Massive) || Quadratic (Significant)
|-
| Impact || Destroys RSA security || Speeds up all database work
|-
| Difficulty || Very Hard (Needs 'Logic') || Easier (Needs 'Interference')
|}

'''The Concept of "Quantum Parallelism"''': Analyzing why "Trying everything at once" isn't enough. If you try everything at once but get a random answer, you've gained nothing. The brilliance of these algorithms is that they use "Interference" to make the **wrong** answers delete themselves before you look at the result.
</div>

<div style="background-color: #483D8B; color: #FFFFFF; padding: 20px; border-radius: 8px; margin-bottom: 15px;">
== <span style="color: #FFFFFF;">Evaluating</span> ==
Evaluating quantum algorithms:
# '''Security Risk''': Is it "Ethical" to build a machine that can read everyone's secrets?
# '''Narrow vs. Broad''': Why are there so few "Great" quantum algorithms? (It's very hard to design a problem where the wrong answers perfectly cancel each other out).
# '''Hardware Gap''': Will we ever build a computer big enough to run Shor's on a 2048-bit key? (Some think it's 10 years away; some think it's 50).
# '''Utility''': For searching a real database, is Grover's actually faster if you have to "Load" the data into the quantum computer first?
</div>

<div style="background-color: #2F4F4F; color: #FFFFFF; padding: 20px; border-radius: 8px; margin-bottom: 15px;">
== <span style="color: #FFFFFF;">Creating</span> ==
Future Frontiers:
# '''HHL Algorithm''': A quantum algorithm that can solve massive systems of linear equations, which could revolutionize AI and weather forecasting.
# '''Quantum Simulation''': Algorithms that can simulate "Chemistry" to find new superconductors or plastic-eating bacteria.
# '''Variational Quantum Eigensolver (VQE)''': A hybrid algorithm that uses a small quantum computer and a normal computer together to solve chemistry problems.
# '''Quantum Finance''': Using Grover-like algorithms to find the perfect "Portfolio" of stocks in a fraction of the time.

[[Category:Computer Science]]
[[Category:Mathematics]]
[[Category:Quantum Computing]]
</div>