LEADER 00000nam 2200505 i 4500
001 8654472
003 IEEE
005 20190405111955.0
006 m o d
007 cr |n|||||||||
008 190405s2019 mau ob 001 eng d
020 9780262350914|qelectronic bk
020 |z0262350912|qelectronic bk
020 |z9780262039253
035 (CaBNVSL)mat08654472
035 (IDAMS)0b00006488bac72e
040 CaBNVSL|beng|erda|cCaBNVSL|dCaBNVSL|dAS|dIIS
050 4 QA76.889|b.B47 2019eb
082 04 006.3/843|223
100 1 Bernhardt, Chris,|eauthor
245 10 Quantum computing for everyone /|cChris Bernhardt
264 1 Cambridge :|bThe MIT Press,|c2019
264 2 [Piscataqay, New Jersey] :|bIEEE Xplore,|c[2019]
300 1 online resource (216 pages)
336 text|2rdacontent
337 electronic|2isbdmedia
338 online resource|2rdacarrier
505 0 Intro; Contents; Acknowledgments; Introduction; 1 Spin;
The Quantum Clock; Measurements in the Same Direction;
Measurements in Different Directions; Measurements;
Randomness; Photons and Polarization; Conclusions; 2
Linear Algebra; Complex Numbers versus Real Numbers;
Vectors; Diagrams of Vectors; Lengths of Vectors; Scalar
Multiplication; Vector Addition; Orthogonal Vectors;
Multiplying a Bra by a Ket; Bra-kets and Lengths; Bra-kets
and Orthogonality; Orthonormal Bases; Vectors as Linear
Combinations of Basis Vectors; Ordered Bases; Length of
Vectors; Matrices; Matrix Computations
505 8 Orthogonal and Unitary MatricesLinear Algebra Toolbox; 3
Spin and Qubits; Probability; Mathematics of Quantum Spin;
Equivalent State Vectors; The Basis Associated with a
Given Spin Direction; Rotating the Apparatus through 60À;
The Mathematical Model for Photon Polarization; The Basis
Associated with a Given Polarization Direction; The
Polarized Filters Experiments; Qubits; Alice, Bob, and
Eve; Probability Amplitudes and Interference; Alice, Bob,
Eve, and the BB84 Protocol; 4 Entanglement; Alice and
Bob's Qubits Are Not Entangled; Unentangled Qubits
Calculation; Entangled Qubits Calculation
505 8 Superluminal CommunicationThe Standard Basis for Tensor
Products; How Do You Entangle Qubits?; Using the CNOT Gate
to Entangle Qubits; Entangled Quantum Clocks; 5 Bell's
Inequality; Entangled Qubits in Different Bases; Proof
That...; Einstein and Local Realism; Einstein and Hidden
Variables; A Classical Explanation of Entanglement; Bell's
Inequality; The Answer of Quantum Mechanics; The Classical
Answer; Measurement; The Ekert Protocol for Quantum Key
Distribution; 6 Classical Logic, Gates, and Circuits;
Logic; Boolean Algebra; Functional Completeness; Gates;
Circuits
505 8 NAND Is a Universal GateGates and Computation; Memory;
Reversible Computation; Billiard Ball Computing; 7 Quantum
Gates and Circuits; Qubits; The CNOT Gate; Quantum Gates;
Quantum Gates Acting on One Qubit; Are There Universal
Quantum Gates?; No Cloning Theorem; Quantum Computation
versus Classical Computation; The Bell Circuit; Superdense
Coding; Quantum Teleportation; Error Correction; 8 Quantum
Algorithms; The Complexity Classes P and NP; Are Quantum
Algorithms Faster Than Classical Ones?; Query Complexity;
Deutsch's Algorithm; The Kronecker Product of Hadamard
Matrices
505 8 The Deutsch-Jozsa AlgorithmSimon's Algorithm; Complexity
Classes; Quantum Algorithms; 9 Impact of Quantum
Computing; Shor's Algorithm and Cryptanalysis; Grover's
Algorithm and Searching Data; Chemistry and Simulation;
Hardware; Quantum Supremacy and Parallel Universes;
Computation; Index
506 Restricted to subscribers or individual electronic text
purchasers
520 An accessible introduction to an exciting new area in
computation, explaining such topics as qubits,
entanglement, and quantum teleportation for the general
reader. Quantum computing is a beautiful fusion of quantum
physics and computer science, incorporating some of the
most stunning ideas from twentieth-century physics into an
entirely new way of thinking about computation. In this
book, Chris Bernhardt offers an introduction to quantum
computing that is accessible to anyone who is comfortable
with high school mathematics. He explains qubits,
entanglement, quantum teleportation, quantum algorithms,
and other quantum-related topics as clearly as possible
for the general reader. Bernhardt, a mathematician himself,
simplifies the mathematics as much as he can and provides
elementary examples that illustrate both how the math
works and what it means. Bernhardt introduces the basic
unit of quantum computing, the qubit, and explains how the
qubit can be measured; discusses entanglement--which, he
says, is easier to describe mathematically than verbally--
and what it means when two qubits are entangled (citing
Einstein's characterization of what happens when the
measurement of one entangled qubit affects the second as
"spooky action at a distance"); and introduces quantum
cryptography. He recaps standard topics in classical
computing--bits, gates, and logic--and describes Edward
Fredkin's ingenious billiard ball computer. He defines
quantum gates, considers the speed of quantum algorithms,
and describes the building of quantum computers. By the
end of the book, readers understand that quantum computing
and classical computing are not two distinct disciplines,
and that quantum computing is the fundamental form of
computing. The basic unit of computation is the qubit, not
the bit
530 Also available in print
538 Mode of access: World Wide Web
588 0 Print version record
650 0 Quantum computing|vPopular works
650 7 Quantum computing.|2fast
655 0 Electronic books
655 7 Popular works.|2fast
710 2 IEEE Xplore (Online Service),|edistributor
710 2 MIT Press,|epublisher
776 08 |iPrint version:|aBernhardt, Chris, author.|tQuantum
computing for everyone|z9780262039253|w(DLC) 2018018398
|w(OCoLC)1032288111
856 41 |zeBook(IEEE-MIT)|uhttps://ieeexplore.ieee.org/xpl/
bkabstractplus.jsp?bkn=8654472