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.
True quant-computation is religious dogma at best, otright nonsense at worst.
This paper is written for mathematicians that have no clue about computers or programming.
Either show me code (preferably in assembly language) that does something that real software might actually want to do (e.g. something simple, like waiting for user to type in 2 numbers and displaying the result of adding them, or a silly bubble sort, or a function to do matrix multiplication, or code to send a query to an SQL server, or even just an industry standard “Hello World”); or admit that “quantum computing” (if it ever exists) is a worthless joke (completely unusable for all practical purposes).