\
  The most prestigious law school admissions discussion board in the world.
BackRefresh Options Favorite

Can anyone hete explain quantum computing?

...
Bistre stirring set candlestick maker
  03/20/18
It doesn't necessarily mean faster. An important idea in com...
mildly autistic rose karate nibblets
  03/20/18
...
Bistre stirring set candlestick maker
  03/20/18
Faster computers and computers that are better suited for &q...
Pontificating spectacular antidepressant drug cumskin
  03/20/18
The use of quantum entanglement in secure communications is ...
mildly autistic rose karate nibblets
  03/20/18
It means a different way of computing that would be signific...
orchid alcoholic gas station
  03/20/18
(sellcuck)
Hot community account coffee pot
  03/20/18
...
Bistre stirring set candlestick maker
  03/20/18
The "try all possible solutions" description of qu...
mildly autistic rose karate nibblets
  03/20/18
tl;dr write your QC mining algos right now because the secon...
chrome library
  03/20/18


Poast new message in this thread



Reply Favorite

Date: March 20th, 2018 9:30 AM
Author: Bistre stirring set candlestick maker



(http://www.autoadmit.com/thread.php?thread_id=3923578&forum_id=2#35644018)



Reply Favorite

Date: March 20th, 2018 9:41 AM
Author: mildly autistic rose karate nibblets

It doesn't necessarily mean faster. An important idea in computer science is the idea of computational complexity. Certain classes of problems become significantly harder to solve as problem size grows. A classic example is integer factorization. It is trivial to find the prime factors of 15 simply by trial and error. How about for a number like 373839393993939393838726262902827181727277819? The solution is far less obvious, even for a computer running a state of the art factorization algorithm. A quantum computer would be able to efficiently solve this type of problem.

It isn't a general speedup, however. NP complete problems are a broad class of problems that show up a lot in CS and are widely believed not to experience a speed-up on quantum computers.

(http://www.autoadmit.com/thread.php?thread_id=3923578&forum_id=2#35644056)



Reply Favorite

Date: March 20th, 2018 9:47 AM
Author: Bistre stirring set candlestick maker



(http://www.autoadmit.com/thread.php?thread_id=3923578&forum_id=2#35644089)



Reply Favorite

Date: March 20th, 2018 9:34 AM
Author: Pontificating spectacular antidepressant drug cumskin

Faster computers and computers that are better suited for "fuzzy logic" (due to the innate indeterminism in quantum superposition). Also, further down the pipeline, applications in cryptography and communication due to entanglement.

(http://www.autoadmit.com/thread.php?thread_id=3923578&forum_id=2#35644030)



Reply Favorite

Date: March 20th, 2018 9:59 AM
Author: mildly autistic rose karate nibblets

The use of quantum entanglement in secure communications is different from quantum computing.

Quantum computing doesn't have any definite advantages for problems that require fuzzy logic. There is some hope they will be helpful for ML problems, but as far I am aware no one has shown a clear speed-up yet.

(http://www.autoadmit.com/thread.php?thread_id=3923578&forum_id=2#35644152)



Reply Favorite

Date: March 20th, 2018 9:42 AM
Author: orchid alcoholic gas station

It means a different way of computing that would be significant multiples faster than we have now at solving certain kinds of complex equations.

In a gross simplification that is not 100% technically accurate, you know how bitcoin is "mined" by computers solving an equation, and then trying to find the next answer to it? The thinking behind quantum computing is that you could try all possible solutions simultaneously. So instead of a try - fail - try - fail - repeat sequence of brute force, which is very time consuming, you would just try all the answers at once, and then see which one worked.

(http://www.autoadmit.com/thread.php?thread_id=3923578&forum_id=2#35644062)



Reply Favorite

Date: March 20th, 2018 9:44 AM
Author: Hot community account coffee pot

(sellcuck)

(http://www.autoadmit.com/thread.php?thread_id=3923578&forum_id=2#35644069)



Reply Favorite

Date: March 20th, 2018 9:47 AM
Author: Bistre stirring set candlestick maker



(http://www.autoadmit.com/thread.php?thread_id=3923578&forum_id=2#35644087)



Reply Favorite

Date: March 20th, 2018 9:56 AM
Author: mildly autistic rose karate nibblets

The "try all possible solutions" description of quantum computing (which often gets repeated) is very inaccurate. That isn't what it does, even for the problems that it performs well on.

(http://www.autoadmit.com/thread.php?thread_id=3923578&forum_id=2#35644136)



Reply Favorite

Date: March 20th, 2018 10:47 AM
Author: chrome library

tl;dr write your QC mining algos right now because the second google makes their new QC available for lambdas everyone's going to find all the remaining bitcoins in a matter of hours and the rest of the people are going to successfully hack every website that exists

(http://www.autoadmit.com/thread.php?thread_id=3923578&forum_id=2#35644426)