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 14
Page 287
... syndrome computation network for Steane's code . Syndromes for LMPZ's code can be computed with the same circuit as for code gener- ation ; it is only necessary to run this circuit backward . A relation between syndromes and errors is ...
... syndrome computation network for Steane's code . Syndromes for LMPZ's code can be computed with the same circuit as for code gener- ation ; it is only necessary to run this circuit backward . A relation between syndromes and errors is ...
Page 298
... syndrome computation such circuits as in Figure 7.10a , in which one ancilla qubit is used " to xor " information from several data qubits . Indeed , a spontaneous phase error at an ancilla qubit , a far from unexpected event , could ...
... syndrome computation such circuits as in Figure 7.10a , in which one ancilla qubit is used " to xor " information from several data qubits . Indeed , a spontaneous phase error at an ancilla qubit , a far from unexpected event , could ...
Page 304
... syndrome computations ) . For example , if the number of gates needed to perform the syndrome measurement increases as ( e ) , then the probability that e + 1 errors accumulate before syndrome mea- surement is complete grows as ( ( e ...
... syndrome computations ) . For example , if the number of gates needed to perform the syndrome measurement increases as ( e ) , then the probability that e + 1 errors accumulate before syndrome mea- surement is complete grows as ( ( e ...
Contents
FUNDAMENTALS | 1 |
ELEMENTS | 57 |
Minimumfinding algorithm | 88 |
Copyright | |
10 other sections not shown
Common terms and phrases
addition Alice and Bob Alice's amplitudes ancilla automata basic basis Bennett binary bits Bob's bound Brassard classical computing codewords communication complexity classes concepts configuration considered correct corresponding decoherence defined denote density matrix efficient eigenvalues encoding entropy error-correcting codes evolution example Exercise exponentially fault-tolerant Figure finite function Hadamard Hilbert space implementation important input interpretation Lemma linear mapping measurement networks observable oracle orthogonal orthonormal outcome particles performed photons polarization polynomial probability problem quantum algorithms quantum channel quantum circuit quantum computing quantum cryptography quantum entanglement quantum error-correcting codes quantum gates quantum information processing quantum mechanics quantum physics quantum system quantum theory quantum Turing machines qubits random randomly Section sequence Shor's Show shown simulated space H step subspace superposition syndrome tape teleportation Theorem transition 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 |