Editing Quantum Algorithms (section)

== <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;">