Details

Preface. <p><b>1 Introduction and survey.</b></p> <p>1.1 Information, computers and quantum mechanics.</p> <p>1.1.1 Digital information.</p> <p>1.1.2 Moore’s law.</p> <p>1.1.3 Emergence of quantum behavior.</p> <p>1.1.4 Energy dissipation in computers.</p> <p>1.2 Quantum computer basics.</p> <p>1.2.1 Quantum information.</p> <p>1.2.2 Quantum communication.</p> <p>1.2.3 Basics of quantum information processing.</p> <p>1.2.4 Decoherence.</p> <p>1.2.5 Implementation.</p> <p>1.3 History of quantum information processing.</p> <p>1.3.1 Initial ideas.</p> <p>1.3.2 Quantum algorithms.</p> <p>1.3.3 Implementations.</p> <p><b>2 Physics of computation.</b></p> <p>2.1 Physical laws and information processing.</p> <p>2.1.1 Hardware representation.</p> <p>2.1.2 Quantum vs. classical information processing.</p> <p>2.2 Limitations on computer performance.</p> <p>2.2.1 Switching energy.</p> <p>2.2.2 Entropy generation and Maxwell’s demon.</p> <p>2.2.3 Reversible logic.</p> <p>2.2.4 Reversible gates for universal computers.</p> <p>2.2.5 Processing speed.</p> <p>2.2.6 Storage density.</p> <p>2.3 The ultimate laptop.</p> <p>2.3.1 Processing speed.</p> <p>2.3.2 Maximum storage density.</p> <p><b>3 Elements of classical computer science.</b></p> <p>3.1 Bits of history.</p> <p>3.2 Boolean algebra and logic gates.</p> <p>3.2.1 Bits and gates.</p> <p>3.2.2 2-bit logic gates.</p> <p>3.2.3 Minimum set of irreversible gates.</p> <p>3.2.4 Minimum set of reversible gates.</p> <p>3.2.5 The CNOT gate.</p> <p>3.2.6 The Toffoli gate.</p> <p>3.2.7 The Fredkin gate.</p> <p>3.3 Universal computers.</p> <p>3.3.1 The Turing machine.</p> <p>3.3.2 The Church–Turing hypothesis.</p> <p>3.4 Complexity and algorithms.</p> <p>3.4.1 Complexity classes.</p> <p>3.4.2 Hard and impossible problems.</p> <p><b>4 Quantum mechanics.</b></p> <p>4.1 General structure.</p> <p>4.1.1 Spectral lines and stationary states.</p> <p>4.1.2 Vectors in Hilbert space.</p> <p>4.1.3 Operators in Hilbert space.</p> <p>4.1.4 Dynamics and the Hamiltonian operator.</p> <p>4.1.5 Measurements.</p> <p>4.2 Quantum states.</p> <p>4.2.1 The two-dimensional Hilbert space: qubits, spins, and photons.</p> <p>4.2.2 Hamiltonian and evolution.</p> <p>4.2.3 Two or more qubits.</p> <p>4.2.4 Density operator.</p> <p>4.2.5 Entanglement and mixing.</p> <p>4.2.6 Quantification of entanglement.</p> <p>4.2.7 Bloch sphere.</p> <p>4.2.8 EPR correlations.</p> <p>4.2.9 Bell’s theorem.</p> <p>4.2.10 Violation of Bell’s inequality.</p> <p>4.2.11 The no-cloning theorem.</p> <p>4.3 Measurement revisited.</p> <p>4.3.1 Quantum mechanical projection postulate.</p> <p>4.3.2 The Copenhagen interpretation.</p> <p>4.3.3 Von Neumann’s model.</p> <p><b>5 Quantum bits and quantum gates.</b></p> <p>5.1 Single-qubit gates.</p> <p>5.1.1 Introduction.</p> <p>5.1.2 Rotations around coordinate axes.</p> <p>5.1.3 General rotations.</p> <p>5.1.4 Composite rotations.</p> <p>5.2 Two-qubit gates.</p> <p>5.2.1 Controlled gates.</p> <p>5.2.2 Composite gates.</p> <p>5.3 Universal sets of gates.</p> <p>5.3.1 Choice of set.</p> <p>5.3.2 Unitary operations.</p> <p>5.3.3 Two qubit operations.</p> <p>5.3.4 Approximating single-qubit gates.</p> <p><b>6 Feynman’s contribution.</b></p> <p>6.1 Simulating physics with computers.</p> <p>6.1.1 Discrete system representations.</p> <p>6.1.2 Probabilistic simulations.</p> <p>6.2 Quantum mechanical computers.</p> <p>6.2.1 Simple gates.</p> <p>6.2.2 Adder circuits.</p> <p>6.2.3 Qubit raising and lowering operators.</p> <p>6.2.4 Adder Hamiltonian.</p> <p><b>7 Errors and decoherence.</b></p> <p>7.1 Motivation.</p> <p>7.1.1 Sources of error.</p> <p>7.1.2 A counterstrategy.</p> <p>7.2 Decoherence.</p> <p>7.2.1 Phenomenology.</p> <p>7.2.2 Semiclassical description.</p> <p>7.2.3 Quantum mechanical model.</p> <p>7.2.4 Entanglement and mixing.</p> <p>7.3 Error correction.</p> <p>7.3.1 Basics.</p> <p>7.3.2 Classical error correction.</p> <p>7.3.3 Quantum error correction.</p> <p>7.3.4 Single spin-flip error.</p> <p>7.3.5 Continuous phase errors.</p> <p>7.3.6 General single qubit errors.</p> <p>7.3.7 The quantum Zeno effect.</p> <p>7.3.8 Stabilizer codes.</p> <p>7.3.9 Fault-tolerant computing.</p> <p>7.4 Avoiding errors.</p> <p>7.4.1 Basics.</p> <p>7.4.2 Decoherence-free subspaces.</p> <p>7.4.3 NMR in Liquids.</p> <p>7.4.4 Scaling considerations.</p> <p><b>8 Tasks for quantum computers.</b></p> <p>8.1 Quantum versus classical algorithms.</p> <p>8.1.1 Why Quantum?</p> <p>8.1.2 Classes of quantum algorithms.</p> <p>8.2 The Deutsch algorithm: Looking at both sides of a coin at the same time.</p> <p>8.2.1 Functions and their properties.</p> <p>8.2.2 Example: one-qubit functions.</p> <p>8.2.3 Evaluation.</p> <p>8.2.4 Many qubits.</p> <p>8.2.5 Extensions and generalizations.</p> <p>8.3 The Shor algorithm: It’s prime time.</p> <p>8.3.1 Some number theory.</p> <p>8.3.2 Factoring strategy.</p> <p>8.3.3 The core of Shor’s algorithm.</p> <p>8.3.4 The quantum Fourier transform.</p> <p>8.3.5 Gates for the QFT.</p> <p>8.4 The Grover algorithm: Looking for a needle in a haystack.</p> <p>8.4.1 Oracle functions.</p> <p>8.4.2 The search algorithm.</p> <p>8.4.3 Geometrical analysis.</p> <p>8.4.4 Quantum counting.</p> <p>8.4.5 Phase estimation.</p> <p>8.5 Quantum simulations.</p> <p>8.5.1 Potential and limitations.</p> <p>8.5.2 Motivation.</p> <p>8.5.3 Simulated evolution.</p> <p>8.5.4 Implementations.</p> <p><b>9 How to build a quantum computer.</b></p> <p>9.1 Components.</p> <p>9.1.1 The network model.</p> <p>9.1.2 Some existing and proposed implementations.</p> <p>9.2 Requirements for quantum information processing hardware.</p> <p>9.2.1 Qubits.</p> <p>9.2.2 Initialization.</p> <p>9.2.3 Decoherence time.</p> <p>9.2.4 Quantum gates.</p> <p>9.2.5 Readout.</p> <p>9.3 Converting quantum to classical information.</p> <p>9.3.1 Principle and strategies.</p> <p>9.3.2 Example: Deutsch–Jozsa algorithm.</p> <p>9.3.3 Effect of correlations.</p> <p>9.3.4 Repeated measurements.</p> <p>9.4 Alternatives to the network model.</p> <p>9.4.1 Linear optics and measurements.</p> <p>9.4.2 Quantum cellular automata.</p> <p>9.4.3 One-way quantum computer.</p> <p><b>10 Liquid state NMR quantum computer.</b></p> <p>10.1 Basics of NMR.</p> <p>10.1.1 System and interactions.</p> <p>10.1.2 Radio frequency field.</p> <p>10.1.3 Rotating frame.</p> <p>10.1.4 Equation of motion.</p> <p>10.1.5 Evolution.</p> <p>10.1.6 NMR signals.</p> <p>10.1.7 Refocusing.</p> <p>10.2 NMR as a molecular quantum computer.</p> <p>10.2.1 Spins as qubits.</p> <p>10.2.2 Coupled spin systems.</p> <p>10.2.3 Pseudo / effective pure states.</p> <p>10.2.4 Single-qubit gates.</p> <p>10.2.5 Two-qubit gates.</p> <p>10.2.6 Readout.</p> <p>10.2.7 Readout in multi-spin systems.</p> <p>10.2.8 Quantum state tomography.</p> <p>10.2.9 DiVincenzo’s criteria.</p> <p>10.3 NMR Implementation of Shor’s algorithm.</p> <p>10.3.1 Qubit implementation.</p> <p>10.3.2 Initialization.</p> <p>10.3.3 Computation.</p> <p>10.3.4 Readout.</p> <p>10.3.5 Decoherence.</p> <p><b>11 Ion trap quantum computers.</b></p> <p>11.1 Trapping ions.</p> <p>11.1.1 Ions, traps and light.</p> <p>11.1.2 Linear traps.</p> <p>11.2 Interaction with light.</p> <p>11.2.1 Optical transitions.</p> <p>11.2.2 Motional effects.</p> <p>11.2.3 Basics of laser cooling.</p> <p>11.3 Quantum information processing with trapped ions.</p> <p>11.3.1 Qubits.</p> <p>11.3.2 Single-qubit gates.</p> <p>11.3.3 Two-qubit gates.</p> <p>11.3.4 Readout.</p> <p>11.4 Experimental implementations.</p> <p>11.4.1 Systems.</p> <p>11.4.2 Some results.</p> <p>11.4.3 Problems.</p> <p><b>12 Solid state quantum computers.</b></p> <p>12.1 Solid state NMR/EPR.</p> <p>12.1.1 Scaling behavior of NMR quantum information processors.</p> <p>12.1.2 31P in silicon.</p> <p>12.1.3 Other proposals.</p> <p>12.1.4 Single-spin readout.</p> <p>12.2 Superconducting systems.</p> <p>12.2.1 Charge qubits.</p> <p>12.2.2 Flux qubits.</p> <p>12.2.3 Gate operations.</p> <p>12.2.4 Readout.</p> <p>12.3 Semiconductor qubits.</p> <p>12.3.1 Materials.</p> <p>12.3.2 Excitons in quantum dots.</p> <p>12.3.3 Electron spin qubits.</p> <p><b>13 Quantum communication.</b></p> <p>13.1 “Quantum only” tasks.</p> <p>13.1.1 Quantum teleportation.</p> <p>13.1.2 (Super-) Dense coding.</p> <p>13.1.3 Quantum key distribution.</p> <p>13.2 Information theory.</p> <p>13.2.1 A few bits of classical information theory.</p> <p>13.2.2 A few bits of quantum information theory.</p> <p><b>Appendix.</b></p> <p><b>A. Two spins-1/2: Singlet and triplet states.</b></p> <p><b>B. Symbols and abbreviations.</b></p> <p>Bibliography.</p> <p>Index.</p>

It's a very good book - it's by far the best textbook at this level, and will become the principal text for our new course.<br /> <br /> Jonathan Jones<br /> Oxford Centre for Quantum Computation<br /> <br /> "The authors, experimantalists, being themselves involved in the realization of quantum computers, present with this book a didactically well formed introduction to quantum information processing, including computer architecture, tested and proposed schemes. Clearly, in order to offer this extensive material in a space of only just over 200 pages, the authors had restricted themselves to basic of relevant ideas. The latter are well selected and guide readers attention engagingly in chosen directions. ... This textbook has the advantage that it contains both, theoretical as well as experimental, features of quantum computing, that the exposition is well organized, and for beginners that it omits more advanced mathematical tools. It gives ... a broad overview ... It is an introduction for beginners, a good one, and can be well recommended as such."<br /> Zentralblatt MATH <br />

<b>Prof. D. Suter</b> is an experimentalist and well known for his NMR-work and currently working on quantum computation projects. He worked with Nobel laureate Ernst RR in Zurich. <p>Also <b>Prof. J. Stolze</b> is known to be a good teacher. As a theorist, his topic research area is quantum spin chains.</p>

First textbook on the topic which discusses theoretical foundations as well as experimental realizations in detail. The authors, both experienced teachers, didactically prepare the basics of quantum communication and quantum information processing, leading readers to modern technical implementations. They also discuss errors and decoherence as well as methods of avoiding and correcting them.

DE