Leaflet
Amazon
(online ordering)
Overview
Contents
Preface
About chapters
Figures
Corrections
About author
Related links
ISBN: 0077095030
Published: May 1999
Binding: Softcover
Pages: 439  246x189
Price: £34.99, DM73

Contents
 Contents
 Preface
 FUNDAMENTALS
 Why Quantum Computing
 Prehistory of Quantum Computing
 From Randomized to Quantum Computation
 Probabilistic Turing machines
 Quantum Turing machines
 Hilbert Space Basics
 Orthogonality, bases and subspaces
 Operators
 Observables and measurements
 Tensor products in Hilbert spaces
 Mixed states and density operators
 Experiments
 Classical experiments
 Quantum experimentssingle particle interference
 Quantum experimentsmeasurements
 Quantum Principles
 States and amplitudes
 Measurementsthe projection approach
 Evolution of quantum systems
 Compound quantum systems
 Quantum theory interpretations
 Classical Reversible Gates and Computing
 Reversible gates
 Reversible Turing machines
 Billiard ball model of (reversible) computing
 ELEMENTS
 Quantum Bits and Registers
 Qubits
 Twoqubit registers
 Nocloning theorem
 Quantum registers
 Quantum Entanglement
 Entanglement of pure states
 Quantifying entanglement
 Substituting entanglement for communication
 Quantum Circuits
 Quantum gates
 Measurement gates
 Universality of quantum gates
 Arithmetical circuits
 Quantum superoperator circuits
 ALGORITHMS
 Quantum Parallelism and Simple Algorithms
 Deutsch's problem
 The DeutschJozsa promise problem
 Simon's problems
 Shor's Algorithms
 Number theory basics
 Quantum Fourier Transform
 Shor's factorization algorithm
 Shor's discrete logarithm algorithm
 The hidden subgroup problems
 Quantum Searching and Counting
 Grover's search algorithm
 Reflections of Grover's iterate and search principles
 GBBHT search algorithm
 Minimumfinding algorithm
 Generalizations and modifications of search problems
 Methodologies to Design Quantum Algorithms
 Amplitude amplificationboosting search probabilities
 Amplitude amplificationspeeding of the states searching
 Case studies
 Limitations of Quantum Algorithms
 No quantum speedup for the parity function
 Framework for proving lower bounds
 Oracle calls limitation of quantum computing
 AUTOMATA
 Quantum Finite Automata
 Models of classical finite automata
 Oneway quantum finite automata
 Onemeasurement model of oneway QFA
 Equivalence of MO1QFA and their simulations by PFA
 1QFA versus 1FA
 Twoway quantum finite automata
 2QFA versus 1FA
 Quantum Turing Machines
 Onetape quantum Turing machines
 Variations on the basic model
 Are quantum Turing machines analogue or discrete?
 Programming techniques for quantum Turing machines
 Quantum Cellular Automata
 Classical cellular automata
 Onedimensional quantum cellular automata
 Partitioned quantum onedimensional cellular automata
 Quantum cellular automata versus quantum Turing machines
 COMPLEXITY
 Universal Quantum Turing Machines
 Efficient implementation of unitary transformations
 Design of a universal quantum Turing machine
 Quantum Computational Complexity
 Basic quantum versus classical complexity classes
 Relativized quantum complexity
 Quantum Communication Complexity
 Classical and quantum communication protocols and complexity
 Quantum communication versus computation complexity
 Computational Power of Quantum Nonlinear Mechanics
 CRYPTOGRAPHY
 Prologue
 Quantum Key Generation
 Basic ideas of two parties quantum key generation
 Security issues of QKG protocols
 Quantum key generation protocols BB84 and B92
 Multiparty key generation
 Entanglementbased QKG protocols
 Unconditional security of QKG^{*}
 Experimental quantum cryptography
 Quantum Cryptographic Protocols
 Quantum coinflipping and bit commitment protocols
 Quantum oblivious transfer protocols
 Security of the quantum protocols
 Security limitations of the quantum cryptographic protocols
 Insecurity of quantum onesided twoparty computation protocols
 Quantum Teleportation and Superdense Coding
 Basic principles
 Teleportation circuit
 Quantum secret sharing
 Superdense coding
 PROCESSORS
 Early Quantum Computers Ideas
 Benioff's quantum computer
 Feynman's quantum computer
 Peres' quantum computer
 Deutsch's quantum computer
 Impacts of Imperfections
 Internal imperfections
 Decoherence
 Quantum Computation and Memory Stabilization
 The symmetric space
 Stabilization by projection into the symmetric subspace
 Quantum ErrorCorrecting Codes
 Classical errordetecting and correcting codes
 Framework for quantum errorcorrecting codes
 Case studies
 Basic methods to design quantum errorcorrecting codes
 Stabilizer codes
 Faulttolerant Quantum Computation
 Faulttolerant quantum error correction
 Faulttolerant quantum gates
 Concatenated coding
 Experimental Quantum Processors 
 Main approaches
 Ion trap
 Cavity QED
 Nuclear magnetic resonance (NMR)
 Other potential technologies
 INFORMATION
 Quantum Entropy and Information
 Basic concepts of classical information theory
 Quantum entropy and information
 Quantum Channels and Data Compression
 Quantum sources, channels and transmissions
 Shannon's coding theorems
 Schumacher's noiseless coding theorem
 Dense quantum coding
 Quantum Noisy Channel Transmissions
 Capacities of erasure and depolarizing channels
 Quantum Entanglement
 Transformation and the partial order of entangled states.
 Entanglement purification/distillation
 Entanglement concentration and dilution
 Quantifying entanglement
 Bound entanglement
 Quantum Information Processing Principles and Primitives
 Search for quantum information principles
 Quantum information processing primitives
 APPENDIX
 Quantum Theory
 Prehistory of quantum theory
 Heisenberg's uncertainty principle
 Quantum theory versus physical reality
 Quantum measurements
 Quantum paradoxes
 The quantum paradox
 Interpretations of quantum theory
 Incompleteness of quantum mechanics
 Hilbert Space Framework for Quantum Computing
 Hilbert spaces
 Linear operators
 Mixed states and density matrices
 Probabilities and observables
 Evolution of quantum states
 Measurements
 Tensor products and Hilbert spaces
 Generalized measurementsPOV measurements
 Deterministic and Randomized Computing
 Computing models
 Randomized computations
 Complexity classes
 Computational theses
 Exercises
 Historical and Bibliographical References
 Bibliography
 Index
