°üÓÊ Á¿×Ó¼ÆËãÓëÁ¿×ÓÐÅÏ¢(10ÖÜÄê°æ)

Introduction to the Tenth Anniversary Edition
Afterword to the Tenth Anniversary Edition
Preface
Acknowledgements
Nomenclature and notation

Part ¢ñ Fundamental concepts
I Introduction and overview
1£®1 Globalperspectives
1£®1£®1 History ofquantum computation and quantum information
1£®1£®2 Future directions
1£®2 Quantum bits
1£®2£®1 Multiplequbits
1£®3 Quantumcomputation
1£®3£®1 Single qubit gates
1£®3£®2 Multiple qubit gates
1£®3£®3 Measurements in bases other than the computational basis
1£®3£®4 Quantum circuits
1£®3£®5 Qubit copying circuit?
1£®3£®6 Example£º Bell states
1£®3£®7 Example£º quantum teleportation
1£®4 Quantum algorithms
1£®4£®1 Classical computations on a quantum computer
1£®4£®2 Quantum parallelism
1£®4£®3 Deutsch's algorithm
1£®4£®4 The Deutsch-Jozsa algorithm
1£®4£®5 Quantum algorithms summarized
1£®5 Experimental quantum information processing
1£®5£®1 The Stern-Gerlach experiment
1£®5£®2 Prospects for practical quantum information processing
1£®6 Quantuminformation
1£®6£®1 Quantum information theory£º example problems
1£®6£®2 Quantum information in a wider context
2 Introduction to quantum mechanics
2£®1 Linear algebra
2£®1£®1 Bases and linear independence
2£®1£®2 Linear operators and matrices
2£®1£®3 The Pauli matrices
2£®1£®4 Inner products
2£®1£®5 Eigenvectors and eigenvalues
2£®1£®6 Adjoints and Hermitian operators
2£®1£®7 Tensor products
2£®1£®8 Operator functions
2£®1£®9 The commutator and anti-commutator
2£®1£®10 The polar and singular value decompositions
2£®2 The postulates ofquantum mechanics
2£®2£®1 State space
2£®2£®2 Evolution
2£®2£®3 Quantum measurement
2£®2£®4 Distinguishing quantum states
2£®2£®5 Projectivemeasurements
2£®2£®6 POVM measurements
2£®2£®7 Phase
2£®2£®8 Composite systems
2£®2£®9 Quantum mechanics£º a global view
2£®3 Application£º superdense coding
2£®4 The density operator
2£®4£®1 Ensembles ofquantum states
2£®4£®2 General properties ofthe density operator
2£®4£®3 The reduced density operator
2£®5 The Schmidt decomposition and purifications
2£®6 EPR and the Bellinequality
3 Introduction to computer science
3£®1 Models for computation
3£®1£®1 Turingmachines
3£®1£®2 Circuits
3£®2 The analysis ofcomputational problems
3£®2£®1 How to quantify computational resources
3£®2£®2 Computationalcomplexity
3£®2£®3 Decision problems and the complexity classes P and NP
3£®2£®4 A plethora ofcomplexity classes
3£®2£®5 Energy and computation
3£®3 Perspectives on computer science
¡­¡­
Part ¢ò Quantum computation
Part ¢ó Quantum information