An introduction to quantum computing algorithms (Q1963351)

This small 138-pages book tries to introduce the reader to the new theory of quantum computing (algorithm) which is a new area developing as rapidly as the size of micro-chips is decreasing. It is pointed out that this monograph is intended for ``mathematically literate readers''. The unrealistic challenge herein is to provide the reader with the basic of quantum mechanics (that nobody understand, I quote the Nobel winner Feynman) and with the basic of quantum computation, in only an extended paper. So, if you have a general (fuzzy) background on quantum physics and on computer science, I recommend you its reading. Chapter 1 (15 pages) displays the essentials of quantum physics. Chapter 2 (18 pages) displays the essentials of quantum computation. The difference with non-quantum hardware is exhibited, and mainly, since measurement affects the state of quantum systems, a unitary transformation is performed before reading the quantum bits. Chapter 3 (33 pages) describes some quantum algorithms, with related topics as quantum eigenvalues and quantum finite Fourier transform. Chapter 4 (41 pages) deals with quantum error-correcting codes. The author considers quantum systems driven by Schrödinger equation (of course) and shows that one result of a quantum system interacting with its environment is the loss of superposition referred to as decoherence. Therefore the need of quantum error-correcting codes. Three such codes are described (Shor's nine-qubit code, seven-qubit code, five-bit code) and then stabilizer codes are outlined. Once again, this book is interesting, very interesting provided that you have a background on the principles of quantum mechanics. It is well written, easy to read, with many illustrating examples, and many exercises. The book is a theoretical one, in the sense that the author does not address the issue of the physical feasibility of the quantum gates involved in the algorithms.