MARC Record from marc_nuls

LEADER: 06174cam 2200421 a 4500
001 9922028890001661
005 20150423142007.0
008 060605s2007 nyua b 001 0 eng
010 $a 2006928325
015 $aGBA677330$2bnb
016 7 $a013548074$2Uk
020 $a9780387357256 (cased)
020 $a0387357254 (cased)
020 $a0387369449 (e-book)
020 $a9780387369440 (e-book)
029 1 $aYDXCP$b2469441
035 $a(CSdNU)u294158-01national_inst
035 $a(OCoLC)77793646
035 $a(OCoLC)77793646
035 $a(OCoLC)77793646
040 $aUKM$cUKM$dDLC$dYDXCP$dBAKER$dOrLoB-B
042 $aukblsr
049 $aCNUM
050 00 $aQA76.889$b.J34 2007
082 04 $a004$222
100 1 $aJaeger, Gregg.
245 10 $aQuantum information :$ban overview /$cGregg Jaeger.
260 $aNew York ;$a[London] :$bSpringer,$cc2007.
300 $axviii, 284 p. :$bill. ;$c24 cm.
504 $aIncludes bibliographical references and index.
505 0 $a1. Qubits -- 1.1. Quantum state purity -- 1.2. The representation of qubits -- 1.3. Stokes parameters -- 1.4. Single-qubit gates -- 1.5. The double-slit experiment -- 1.6. The Mach-Zehnder interferometer -- 1.7. Quantum coherence and information processing -- 2. Measurements and quantum operations -- 2.1. The von Neumann classification of processes -- 2.2. The Pauli classification of measurements -- 2.3. Expectation values and the von Neumann projection -- 2.4. The Luders rule -- 2.5. Reduced statistical operators -- 2.6. General quantum operations -- 2.7. Positive-operator-valued measures -- 3. Quantum nonlocality and interferometry -- 3.1. Hidden variables and state completeness -- 3.2. Von Neumann's "no-go" theorem -- 3.3. The Einstein-Podolsky-Rosen argument -- 3.4. Gleason's theorem -- 3.5. Bell inequalities -- 3.6. Interferometric complementarity -- 3.7. The Franson interferometer -- 3.8. Two-qubit quantum gates -- 4. Classical information and communication -- 4.1. Communication channels -- 4.2. Shannon entropy -- 4.3. Renyi entropy -- 4.4. Coding -- 4.5. Error correction -- 4.6. Data compression -- 4.7. Communication complexity -- 5. Quantum information -- 5.1. Quantum entropy -- 5.2. Quantum relative and conditional entropies -- 5.3. Quantum mutual information -- 5.4. Fidelity and coherent information -- 5.5. Quantum Renyi and Tsallis entropies -- 6. Quantum entanglement -- 6.1. Basic definitions -- 6.2. The Schmidt decomposition -- 6.3. Special bases and decompositions -- 6.4. Stokes parameters and entanglement -- 6.5. Partial transpose and reduction criteria -- 6.6. The "fundamental postulate" -- 6.7. Entanglement monotones -- 6.8. Distillation and bound entanglement -- 6.9. Entanglement and majorization -- 6.10. Concurrence -- 6.11. Entanglement witnesses -- 6.12. Entanglement as a resource -- 6.13. The thermodynamic analogy -- 6.14. Information and the foundations of physics -- 6.15. The geometry of entanglement -- 6.16. Creating entangled photons -- 7. Entangled multipartite systems -- 7.1. Stokes and correlation tensors -- 7.2. N-tangle -- 7.3. Generalized Schmidt decomposition -- 7.4. Lorentz-group isometries -- 7.5. Entanglement classes -- 7.6. Algebraic invariants of multipartite systems -- 7.7. Three-qubit states and residual tangle -- 7.8. Three-qubit quantum logic gates -- 7.9. States of higher qubit number -- 8. Quantum state and process estimation -- 8.1. Quantum state tomography -- 8.2. Quantum process tomography -- 8.3. Direct estimation methods -- 9. Quantum communication -- 9.1. Quantum channels -- 9.2. Quantum channel capacities -- 9.3. Holevo's theorem -- 9.4. Discrimination of quantum states -- 9.5. The no-cloning theorem -- 9.6. Basic quantum channels -- 9.7. The GHJW theorem -- 9.8. Quantum dense coding -- 9.9. Quantum teleportation -- 9.10. Entanglement "swapping" -- 9.11. Entanglement "purification" -- 9.12. Quantum data compression -- 9.13. Quantum communication complexity -- 10. Quantum decoherence and its mitigation -- 10.1. Quantum decoherence -- 10.2. Decoherence and mixtures -- 10.3. Decoherence-free subspaces -- 10.4. Quantum coding, error detection, and correction -- 10.5. The nine-qubit Shor code -- 10.6. Stabilizer codes -- 10.7. Concatenation of quantum codes -- 11. Quantum broadcasting, copying, and deleting -- 11.1. Quantum broadcasting -- 11.2. Quantum copying -- 11.3. Quantum deleting -- 11.4. Landauer's principle -- 12. Quantum key distribution -- 12.1. Cryptography and cryptosystems -- 12.2. QKD systems -- 12.3. The BB84 (four-state) protocol -- 12.4. The E91 (Ekert) protocol -- 12.5. The B92 (two-state) protocol -- 12.6. The six-state protocol -- 12.7. Eavesdropping -- 12.8. Security proofs -- 13. Classical and quantum computing -- 13.1. Classical computing and computational complexity -- 13.2. Deterministic Turing machines -- 13.3. Probabilistic Turing machines -- 13.4. Multi-tape Turing machines -- 13.5. Quantum Turing machines -- 13.6. Quantum computational complexity -- 13.7. Fault-tolerant quantum computing -- 13.8. Linear optical quantum computation -- 14. Quantum algorithms -- 14.1. The Deutsch-Jozsa algorithm -- 14.2. The Grover search algorithm -- 14.3. The Shor factoring algorithm -- 14.4. The Simon algorithm -- A. Mathematical elements -- A.1. Boolean algebra and Galois fields -- A.2. Random variables -- A.3. Vector Spaces and Hilbert space -- A.4. The standard quantum formalism -- A.5. The Dirac notation -- A.6. Groups of transformations -- A.7. Probability, lattices, and posets -- A.8. Projectors, correlations, and the Kochen-Specker theorem -- A.9. Traditional quantum logic -- B. The quantum postulates -- B.1. The standard postulates -- B.2. The Heisenberg-Robertson uncertainty relation -- B.3. Liouville space and open quantum systems.
650 0 $aQuantum computers.
938 $aYBP Library Services$bYANK$n2469441
938 $aBaker & Taylor$bBKTY$c49.95$d49.95$i0387357254$n0006930392$sactive
947 $fSOET-EGR$hCIRCSTACKS$p$42.96$q1
949 $aQA 76.889 .J34 2007$i31786102104145
994 $a92$bCNU
999 $aQA 76.889 .J34 2007$wLC$c1$i31786102104145$lCIRCSTACKS$mNULS$rY$sY $tBOOK$u3/27/2007