Quantum ComputingQuantum computing merges two successful scientific and technological developments, quantum physics and computer science. Although some of its developments are in their infancy, this book provides elements from both sciences as well as reviewing concepts and methods from a computing point of view. |
From inside the book
Results 1-3 of 81
Page 74
... example , if a pair of particles is created simultaneously and in such a way that some of their attributes ( say spin or polarization ) are preserved ; for example , if one particle has spin and second has spin- , or if one particle has ...
... example , if a pair of particles is created simultaneously and in such a way that some of their attributes ( say spin or polarization ) are preserved ; for example , if one particle has spin and second has spin- , or if one particle has ...
Page 240
... example of the bit commitment protocol . In the field of the classical cryptographic protocols BCP play an important role . For example , with such a protocol one can construct zero - knowledge proofs for a variety of statements.15 6.3 ...
... example of the bit commitment protocol . In the field of the classical cryptographic protocols BCP play an important role . For example , with such a protocol one can construct zero - knowledge proofs for a variety of statements.15 6.3 ...
Page 372
... example , if 1 1 [ 11 ) = | 0 ) → | 1 ) and [ √2 ) = √ ( 10 ) + 1 ) ) ℗ ( 10 ) − 11 ) ) are two mixed states ... example of a mixed state with two pure states and another example of a mixed state with three pure states such that the ...
... example , if 1 1 [ 11 ) = | 0 ) → | 1 ) and [ √2 ) = √ ( 10 ) + 1 ) ) ℗ ( 10 ) − 11 ) ) are two mixed states ... example of a mixed state with two pure states and another example of a mixed state with three pure states such that the ...
Common terms and phrases
1QFA addition Alice and Bob amplitudes ancilla automaton basic basis Bennett bits Boolean bound cellular automata classical computing codewords communication complexity classes concepts configuration consider corresponding decoherence defined denote density matrix deterministic efficient eigenvalues electron encoding entropy error error-correcting codes evolution example Exercise exponentially fault-tolerant Figure Grover's Hadamard Hilbert space implementation important input Lemma mapping measurement networks observable oracle orthogonal orthonormal outcome particles performed photons polarization polynomial probability problem protocol quantum algorithms quantum channel quantum circuit quantum computing quantum entanglement quantum error-correcting codes quantum gates quantum information processing quantum mechanics quantum system quantum theory quantum Turing machines qubits random randomly Section sequence Shor's Show shown simulated space H step subspace superoperator superposition syndrome tape teleportation Theorem Toffoli gate transition function transmission unitary matrix unitary operator unitary transformation vector XOR gate
References to this book
Classical and Quantum Computation Alexei Yu. Kitaev,Alexander Shen,Mikhail N. Vyalyi No preview available - 2002 |