Quantum Computing
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>Topics in Part I <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 <UL> <LI>DiVincenzo criteria, which are the standards a physical system must satisfy to be a candidate as a working quantum computer</LI></LI> <LI>Liquid state NMR, one of the well-understood physical systems</LI></LI> <LI>Ionic and atomic qubits</LI></LI> <LI>Several types of Josephson junction qubits</LI></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.</LI></P>