Quantum Computing

<p>Covering both theory and progressive experiments Quantum Computing: From Linear Algebra to Physical Realizations explains how and why superposition and entanglement provide the enormous computational power in quantum computing. This self-contained classroom-tested book is divided into two sections with the first devoted to the theoretical aspects of quantum computing and the second focused on several candidates of a working quantum computer evaluating them according to the DiVincenzo criteria.</p><p>Topics in Part I </p><ul> <li>Linear algebra </li> <li>Principles of quantum mechanics </li> <li>Qubit and the first application of quantum information processing—quantum key distribution </li> <li>Quantum gates </li> <li>Simple yet elucidating examples of quantum algorithms </li> <li>Quantum circuits that implement integral transforms </li> <li>Practical quantum algorithms including Grover’s database search algorithm and Shor’s factorization algorithm </li> <li>The disturbing issue of decoherence </li> <li>Important examples of quantum error-correcting codes (QECC) </li> </ul><p>Topics in Part II </p><ul> <li>DiVincenzo criteria which are the standards a physical system must satisfy to be a candidate as a working quantum computer</li> <li>Liquid state NMR one of the well-understood physical systems</li> <li>Ionic and atomic qubits</li> <li>Several types of Josephson junction qubits</li> <li>The quantum dots realization of qubits</li> </ul><p>Looking at the ways in which quantum computing can become reality this book delves into enough theoretical background and experimental research to support a thorough understanding of this promising field.</p>