Review 5 of An Introduction to Quantum Computing Algorithms Author: A r t h u r O. Pittenger Hardcover: 152 pages Publisher: Birkh~iuser, 2000 , I S B N 0-8176-4127-0 Progress in Computer Science and Applied Logic, V. 19 Reviewer: Andrea Marchini (marchini@acm.org) Introduction Q u a n t u m computing is a relatively recent field of computing sciences focusing on the application of quantum mechanical laws to computer technology. At the beginning of the 80s, the work of Benioff, Feynman and Deutsch built the foundations of this rapidly evolving area of study. The main advantages of quantum computing are the exponential computing power that quantum systems provide, due to the superposition of the states, and the possibility to communicate over large distances in a secure way, thanks to the entanglement of particles. Large number factorisation should be feasible with the Shor's algorithm and public key algorithms like RSA would be vulnerable, new physics simulation and other heavy computational problems could be solved. One of the most amazing aspect of quantum computing is the ability to obtain a result from a process dominated by the probability and the uncertainty. The qubit, the counterpart of the bit in
/lp/association-for-computing-machinery/review-of-an-introduction-to-quantum-computing-algorithms-by-arthur-o-oR4Syf6b9P