Quantum Computation and Quantum Information: 10th Anniversary Edition

Last updated Aug 10, 2022

• Reading

Metadata

• CiteKey:: nielsenQuantumComputationQuantum2010
• Type:: book
• Author:: Michael Nielsen, Isaac Chuang
• Publisher:: Cambridge University Press
• Year:: 2010
• ISBN:: 978-1-139-49548-6
• Tags:: #Source/Zotero , #Source/Book
• Format:: PDF

Abstract

One of the most cited books in physics of all time, Quantum Computation and Quantum Information remains the best textbook in this exciting field of science. This 10th anniversary edition includes an introduction from the authors setting the work in context. This comprehensive textbook describes such remarkable effects as fast quantum algorithms, quantum teleportation, quantum cryptography and quantum error-correction. Quantum mechanics and computer science are introduced before moving on to describe what a quantum computer is, how it can be used to solve problems faster than ‘classical’ computers and its real-world implementation. It concludes with an in-depth treatment of quantum information. Containing a wealth of figures and exercises, this well-known textbook is ideal for courses on the subject, and will interest beginning graduate students and researchers in physics, computer science, mathematics, and electrical engineering.

Files and Links

• Uri:: http://zotero.org/users/5055703/items/P2J6UT3B
• File:: Google Books Link; nielsen_chuang_2010_quantum_computation_and_quantum_information.pdf
• Local Library:: Zotero

Tags and Collections

• Keywords:: Quantum Computing, Quantum Theory, Science / Physics / General, 📖, 📥

Table of contents

1. Introduction and overview
2. Global perspectives
3. History of quantum computation and quantum information
4. Future directions
5. Quantum bits
6. Multiple qubits
7. Quantum computation
8. Single qubit gates
9. Multiple qubit gates
10. Measurements in bases other than the computational basis
11. Quantum circuits
12. Qubit copying circuit?
13. Example: Bell states
14. Example: quantum teleportation
15. Quantum algorithms
16. Classical computations on a quantum computer
17. Quantum parallelism
18. Deutsch’s algorithm
19. The Deutsch-Jozsa algorithm
20. Quantum algorithms summarized
21. Experimental quantum information processing
22. The Stern-Gerlach experiment
23. Prospects for practical quantum information processing
24. Quantum information
25. Quantum information theory: example problems
26. Quantum information in a wider context
27. Introduction to quantum mechanics
28. Linear algebra
    1. Bases and linear independence
    2. Linear operators and matrices
    3. The Pauli matrices
    4. Inner products
    5. Eigenvectors and eigenvalues
    6. Adjoints and Hermitian operators
    7. Tensor products
    8. Operator functions
    9. The commutator and anti-commutator
    10. The polar and singular value decompositions
29. The postulates of quantum mechanics
    1. State space
    2. Evolution
    3. Quantum measurement
    4. Distinguishing quantum states
    5. Projective measurements
    6. POVM measurements
    7. Phase
    8. Composite systems
    9. Quantum mechanics: a global view
30. Application: superdense coding
31. The density operator
    1. Ensembles of quantum states
    2. General properties of the density operator
    3. The reduced density operator
32. The Schmidt decomposition and purifications
33. EPR and the Bell inequality
34. Introduction to computer science
35. Models for computation
    1. Turing machines
    2. Circuits
36. The analysis of computational problems
    1. How to quantify computational resources
    2. Computational complexity
    3. Decision problems and the complexity classes P and NP
    4. A plethora of complexity classes
    5. Energy and computation
37. Perspectives on computer science
38. Quantum circuits
39. Quantum algorithms
40. Single qubit operations
41. Controlled operations
42. Measurement
43. Universal quantum gates
    1. Two-level unitary gates are universal
    2. Single qubit and CNOT gates are universal
    3. A discrete set of universal operations
    4. Approximating arbitrary unitary gates is generically hard
    5. Quantum computational complexity
44. Summary of the quantum circuit model of computation
45. Simulation of quantum systems
    1. Simulation in action
    2. The quantum simulation algorithm
    3. An illustrative example
    4. Perspectives on quantum simulation
46. The quantum Fourier transform and its applications
47. The quantum Fourier transform
48. Phase estimation
    1. Performance and requirements
49. Applications: order-finding and factoring
    1. Application: order-finding
    2. Application: factoring
50. General applications of the quantum Fourier transform
    1. Period-finding
    2. Discrete logarithms
    3. The hidden subgroup problem
    4. Other quantum algorithms?
51. Quantum search algorithms
52. The quantum search algorithm
    1. The oracle
    2. The procedure
    3. Geometric visualization
    4. Performance
53. Quantum search as a quantum simulation
54. Quantum counting
55. Speeding up the solution of NP-complete problems
56. Quantum search of an unstructured database
57. Optimality of the search algorithm
58. Black box algorithm limits
59. Quantum computers: physical realization
60. Guiding principles
61. Conditions for quantum computation
    1. Representation of quantum information
    2. Performance of unitary transformations
    3. Preparation of fiducial initial states
    4. Measurement of output result
62. Harmonic oscillator quantum computer
    1. Physical apparatus
    2. The Hamiltonian
    3. Quantum computation
    4. Drawbacks
63. Optical photon quantum computer
    1. Physical apparatus
    2. Quantum computation
    3. Drawbacks
64. Optical cavity quantum electrodynamics
    1. Physical apparatus
    2. The Hamiltonian
    3. Single-photon single-atom absorption and refraction
    4. Quantum computation
65. Ion traps
    1. Physical apparatus
    2. The Hamiltonian
    3. Quantum computation
    4. Experiment
66. Nuclear magnetic resonance
    1. Physical apparatus
    2. The Hamiltonian
    3. Quantum computation
    4. Experiment
67. Other implementation schemes
68. Quantum noise and quantum operations
69. Classical noise and Markov processes
70. Quantum operations
    1. Overview
    2. Environments and quantum operations
    3. Operator-sum representation
    4. Axiomatic approach to quantum operations
71. Examples of quantum noise and quantum operations
    1. Trace and partial trace
    2. Geometric picture of single qubit quantum operations
    3. Bit flip and phase flip channels
    4. Depolarizing channel
    5. Amplitude damping
    6. Phase damping
72. Applications of quantum operations
    1. Master equations
    2. Quantum process tomography
73. Limitations of the quantum operations formalism
74. Distance measures for quantum information
75. Distance measures for classical information
76. How close are two quantum states?
    1. Trace distance
    2. Fidelity
    3. Relationships between distance measures
77. How well does a quantum channel preserve information?
78. Quantum error-correction
79. Introduction
    1. The three qubit bit flip code
    2. Three qubit phase flip code
80. The Shor code
81. Theory of quantum error-correction
    1. Discretization of the errors
    2. Independent error models
    3. Degenerate codes
    4. The quantum Hamming bound
82. Constructing quantum codes
    1. Classical linear codes
    2. Calderbank-Shor-Steane codes
83. Stabilizer codes
    1. The stabilizer formalism
    2. Unitary gates and the stabilizer formalism
    3. Measurement in the stabilizer formalism
    4. The Gottesman-Knill theorem
    5. Stabilizer code constructions
    6. Examples
    7. Standard form for a stabilizer code
    8. Quantum circuits for encoding, decoding, and correction
84. Fault-tolerant quantum computation
    1. Fault-tolerance: the big picture
    2. Fault-tolerant quantum logic
    3. Fault-tolerant measurement
    4. Elements of resilient quantum computation
85. Entropy and information
86. Shannon entropy
87. Basic properties of entropy
    1. The binary entropy
    2. The relative entropy
    3. Conditional cntropy and mutual information
    4. The data processing inequality
88. Von Neumann entropy
    1. Quantum relative entropy
    2. Basic properties of entropy
    3. Measurements and entropy
    4. Subadditivity
    5. Concavity of the entropy
    6. The entropy of a mixture of quantum states
89. Strong subadditivity
    1. Proof of strong subadditivity
    2. Strong subadditivity: elementary applications
90. Quantum information theory
91. Distinguishing quantum states and the accessible information
    1. The Holevo bound
    2. Example applications of the Holevo bound
92. Data compression
    1. Shannon’s noiseless channel coding theorem
    2. Schumacher’s quantum noiseless channel coding theorem
93. Classical information over noisy quantum channels
    1. Communication over noisy classical channels
    2. Communication over noisy quantum channels
94. Quantum information over noisy quantum channels
    1. Entropy exchange and the quantum Fano inequality
    2. The quantum data processing inequality
    3. Quantum Singleton bound
    4. Quantum error-correction, refrigeration and Maxwell’s demon
95. Entanglement as a physical resource
    1. Transforming bi-partite pure state entanglement
    2. Entanglement distillation and dilution
    3. Entanglement distillation and quantum error-correction
96. Quantum cryptography
    1. Private key cryptography
    2. Privacy amplification and information reconciliation
    3. Quantum key distribution
    4. Privacy and coherent information
    5. The security of quantum key distribution

• Appendices
  • Appendix 1: Notes on basic probability theory
  • Appendix 2: Group theory
    • A2.1 Basic definitions
      • A2.1.1 Generators
      • A2.1.2 Cyclic groups
      • A2.1.3 Cosets
    • A2.2 Representations
      • A2.2.1 Equivalence and reducibility
      • A2.2.2 Orthogonality
      • A2.2.3 The regular representation
    • A2.3 Fourier transforms
  • Appendix 3: The Solovay-Kitaev theorem
  • Appendix 4: Number theory
    • A4.1 Fundamentals
    • A4.2 Modular arithmetic and Euclid’s algorithm
    • A4.3 Reduction of factoring to order-finding
    • A4.4 Continued fractions
  • Appendix 5: Public key cryptography and the RSA cryptosystem
  • Appendix 6: Proof of Lieb’s theorem

• Chapter 1 - Introduction and overview
• Chapter 2 - Introduction to quantum mechanics
• Chapter 3 - Introduction to computer science

• Chapter 4 - Quantum circuits
• Chapter 5 - The quantum Fourier transform and its applications
• Chapter 6 - Quantum search algorithms
• Chapter 7 - Quantum computers - physical realization

• Chapter 8 - Quantum noise and quantum operations
• Chapter 9 - Distance measures for quantum information
• Chapter 10 - Quantum error-correction
• Chapter 11 - Entropy and information
• Chapter 12 - Quantum information theory

Annotations(3/25/2022, 5:35:12 PM)

1 Introduction and overview

1.1 Global perspectives

• “Quantum computation and quantum information is the study of the information processing tasks that can be accomplished using quantum mechanical systems.” (p. 1)

1.1.1 History of quantum computation and quantum information

• “Quantum mechanics is a mathematical framework or set of rules for the construction of physical theories.” (p. 2)
• “The relationship of quantum mechanics to specific physical theories like quantum electrodynamics is rather like the relationship of a computer’s operating system to specific applications software” (p. 2)
• “The rules of quantum mechanics are simple but even experts find them counterintuitive” (p. 2)
• “The best known critic of quantum mechanics, Albert Einstein, went to his grave unreconciled with the theory he helped invent.” (p. 2)
• “One of the goals of quantum computation and quantum information is to develop tools which sharpen our intuition about quantum mechanics, and make its predictions more transparent to human minds.” (p. 2)
• “If cloning were possible, then it would be possible to signal faster than light using quantum effects.” (p. 2)
• “This no-cloning theorem, discovered in the early 1980s, is one of the earliest results of quantum computation and quantum information.” (p. 3)
• “A related historical strand contributing to the development of quantum computation and quantum information is the interest, dating to the 1970s, of obtaining complete control over single quantum systems.” (p. 3)
• “Since the 1970s many techniques for controlling single quantum systems have been developed.” (p. 3)
• “Why all this effort to attain complete control over single quantum systems?” (p. 3)
• “Often the most profound insights in science come when we develop a method for probing a new regime of Nature.” (p. 3)
• “by obtaining complete control over single quantum systems, we are exploring untouched regimes of Nature in the hope of discovering new and unexpected phenomena.” (p. 3)
• “the ability to control single quantum systems is essential if we are to harness the power of quantum mechanics for applications to quantum computation and quantum information.” (p. 3)
• “The modern incarnation of computer science was announced by the great mathematician Alan Turing in a remarkable 1936 paper.” (p. 4)
• “Turing showed that there is a Universal Turing Machine that can be used to simulate any other Turing machine. Furthermore, he claimed that the Universal Turing Machine completely captures what it means to perform a task by algorithmic means.” (p. 4)
• “quantum computers offer an essential speed advantage over classical computers.” (p. 5)
• “What do we mean by ‘efficient’ versus ‘inefficient’ simulations of a quantum computer?” (p. 5)
• “an efficient algorithm is one which runs in time polynomial in the size of the problem solved. In contrast, an inefficient algorithm requires superpolynomial (typically exponential) time.” (p. 5) ^7e6a66

• Tags:: #on/Quantum-Computing, #on/Quantum-Computing/Theory
• Links:: 2010 Quantum Computation and Quantum Information 10th Anniversary Edition
• Created:: 2022-03-21 20:53:39
• Modified:: 2022-03-28 21:55:12