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 648037
To read all comments associated with this story, please click here.
RE[5]: Worthless.
by sj87 on Wed 16th Aug 2017 16:55 UTC in reply to "RE[4]: Worthless."
Member since:

Nowhere. I've said no such thing, and you made this up yourself. I've only assumed that "quantum computing" means that its suitable for computing (as opposed to a special purpose "fixed function" device, like an old analogue FM radio circuit).

You see term "quantum computing" and because it includes the word "computing", you then equate it to any form of computing? LOL!

The use-cases you initially described have nothing to do with quantum computing. Waiting for user input or reading from a block device isn't bottlenecked by computational power.

Bubble sort is an algorithm that likely won't be meaningful with quantum processors just like it isn't meaningful with GPUs of modern day. At best it can be optimized to be run partially in a CPU and partially in a GPU... Now try replacing 'GPU' with 'Quantum Processing Unit' in the previous sentence and take a moment to think about it.

Edited 2017-08-16 16:56 UTC

Reply Parent Score: 2