
related topics 
{math, number, function} 
{math, energy, light} 
{system, computer, user} 
{mi², represent, 1st} 
{law, state, case} 
{theory, work, human} 
{acid, form, water} 

The nocloning theorem is a result of quantum mechanics that forbids the creation of identical copies of an arbitrary unknown quantum state. It was stated by Wootters, Zurek, and Dieks in 1982, and has profound implications in quantum computing and related fields.
The state of one system can be entangled with the state of another system. For instance, one can use the Controlled NOT gate and the WalshHadamard gate to entangle two qubits. This is not cloning. No welldefined state can be attributed to a subsystem of an entangled state. Cloning is a process whose end result is a separable state with identical factors.
Contents
Proof
Suppose the state of a quantum system A, which we wish to copy, is (see braket notation). In order to make a copy, we take a system B with the same state space and initial state . The initial, or blank, state must be independent of , of which we have no prior knowledge. The composite system is then described by the tensor product, and its state is
There are only two ways to manipulate the composite system. We could perform an observation, which irreversibly collapses the system into some eigenstate of the observable, corrupting the information contained in the qubit. This is obviously not what we want. Alternatively, we could control the Hamiltonian of the system, and thus the time evolution operator U (for time independent Hamiltonian, , and is called the generator of translations in time) up to some fixed time interval, which yields a unitary operator. Then U acts as a copier provided that
Full article ▸


related documents 
Harmonic function 
Symplectic manifold 
Examples of differential equations 
Vector quantization 
Convex hull 
Periodic function 
Cauchy distribution 
Hidden Markov model 
Triangle inequality 
Bézout's theorem 
Inverse element 
Coset 
Sigmaalgebra 
Interior (topology) 
Harmonic series (mathematics) 
Monomorphism 
Initial and terminal objects 
Entailment 
Congruence relation 
Torsion subgroup 
Discrete space 
Quaternion group 
Toeplitz matrix 
Principal ideal 
CYK algorithm 
ElGamal encryption 
Event (probability theory) 
Fuzzy set 
Order of magnitude 
Compilercompiler 
