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!
== <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;">
Summary:
Please note that all contributions to BloomWiki 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
BloomWiki: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
Search
Navigation
Main page
Recent changes
Random page
Help about MediaWiki
Tools
What links here
Related changes
Special pages
Page information