Editing
Quantum Algorithms
(section)
Jump to navigation
Jump to search
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
=== Shor's Algorithm === Shor's Algorithm is a groundbreaking quantum algorithm, discovered by Peter Shor in 1994, that can efficiently factor large numbers. The ability to factor large numbers quickly has significant implications for the field of cryptography, as many encryption schemes rely on the difficulty of factoring large numbers. [[Shor's Algorithm]] is based on the principles of quantum Fourier transform and order finding. It efficiently solves the prime factorization problem, which has exponential complexity on classical computers. Shor's Algorithm has sparked widespread interest in the field of quantum computing due to its potential to break widely used encryption algorithms such as RSA.
Summary:
Please note that all contributions to Elixir Wiki may be edited, altered, or removed by other contributors. If you do not want your writing to be edited mercilessly, then do not submit it here.
You are also promising us that you wrote this yourself, or copied it from a public domain or similar free resource (see
Elixir Wiki:Copyrights
for details).
Do not submit copyrighted work without permission!
Cancel
Editing help
(opens in new window)
Navigation menu
Personal tools
Not logged in
Talk
Contributions
Create account
Log in
Namespaces
Page
Discussion
English
Views
Read
Edit
View history
More
Navigation
Main page
Recent changes
Random page
Help about MediaWiki
Tools
What links here
Related changes
Special pages
Page information