Linked by Thom Holwerda on Tue 15th Aug 2017 23:21 UTC
Hardware, Embedded Systems

This paper is a gentle but rigorous introduction to quantum computing intended for computer scientists. Starting from a small set of assumptions on the behavior of quantum computing devices, we analyze their main characteristics, stressing the differences with classical computers, and finally describe two well-known algorithms (Simon's algorithm and Grover's algorithm) using the formalism developed in previous sections. This paper does not touch on the physics of the devices, and therefore does not require any notion of quantum mechanics.

Some light reading before bedtime.

Permalink for comment 648028
To read all comments associated with this story, please click here.
RE[5]: Worthless.
by project_2501 on Wed 16th Aug 2017 10:50 UTC in reply to "RE[4]: Worthless."
Member since:

a good example is this:

Task - brute force test a password

Normal computing - try each test password, one after another, will take a long time for strong passwords/crypto

Quantum computing - a waveform superposition of all possible passwords will collapse to the correct answer. in one step. no need to try each and every password one after another.

This is why quantum computing scares security people ..

The core of quantum computation is the collapsing of many possible answers into the right set of anwers - instantaneously.

Proper parellism.

Reply Parent Score: 4