Quantum Computing: From Linear Algebra to Physical Realizations

Download Quantum Computing: From Linear Algebra to Physical Realizations PDF EPUB

Topics partly I

• Linear algebra
• Concepts of quantum mechanics
• Qubit and the initial application of quantum info processing―quantum essential distribution
• Quantum gates
• Simple yet elucidating types of quantum algorithms
• Quantum circuits that implement essential transforms
• Useful quantum algorithms, which includes Grover’s data source search algorithm and Shor’s factorization algorithm
• The disturbing problem of decoherence
• Important types of quantum error-correcting codes (QECC)

Topics partly II

• DiVincenzo requirements, which are the specifications a physical program must satisfy to become a candidate as an operating quantum pc
• Liquid condition NMR, among the well-comprehended physical systems
• Ionic and atomic qubits
• Various kinds Josephson junction qubits
• The quantum dots realization of qubits

Searching at the ways that quantum computing may become reality, this publication delves into plenty of theoretical history and experimental study to aid a thorough knowledge of this promising field. This self-contained, classroom-tested publication is split into two sections, with the initial specialized in the theoretical areas of quantum processing and the second centered on several applicants of an operating quantum pc, evaluating them based on the DiVincenzo requirements.

See also

• Linear Algebra: Challenging Problems for Students (Johns Hopkins Studies in the Mathematical Sciences)