4.2.1 No cloning
When we have a classical bit, it is easy to copy or clone it – simply look at it and copy what you see:
Can we also clone quantum bits?
Let us assume for a moment that this is possible. This would mean that there exists a quantum operation that, given any qubit in state and a fresh qubit in state , acts as
to produce two copies of out of a single copy. (Why do we supply the fresh qubit? This is so that has the same number of input qubits as output qubits.)
For example, the cloner would operate as follows on the basis states:
Just like we can easily clone a classical bit, it is easy to find a quantum operation that clones the basis states. For example, the controlled-NOT operation from Eq. 3.63 does this job.
But is there a quantum operation that can clone an arbitrary unknown qubit state, not just a basis state? In the following homework problem, you will show that this is not possible.
Homework 4.1 (No cloning).
In this homework problem we want to prove that there exists no quantum operation that satisfies Eq. 4.16.
We will use a trick called proof by contradiction.
This means that we will show that if such a cloning operation existed then this would imply something that we know to be wrong (e.g., “”).
From this we can then conclude that no such can exist.
Thus let us start by assuming that there is a quantum operation that satisfies Eq. 4.16.
Now you can calculate in two different ways:
- 1.
- 2.
Do you get the same answer in both cases? If not, what can you conclude?
Hack.
Assuming such an operation is possible, let us see how it would act on . On one hand, since is supposed to clone any single-qubit states, including , we should get
On the other hand, since all quantum operations must be linear,
where the last equality follows from Eq. 4.17. Since these two equations give different results, we get a contradiction. Hence we conclude that there is no quantum operation that can clone an unknown quantum state.
This famous result is known as the no cloning theorem. The same conclusion (and likely also the argument that you gave in 4.1) applies also to probabilistic bits! Here is an intuitive explanation for why we can copy neither probabilistic nor quantum information. If this were possible then, given a probabilistic bit in an unknown state or a qubit in an unknown state , we could first produce as many copies of and as we like. Given these copies, we could then measure them in various ways and use the obtained data to estimate the probabilities of or the amplitudes of to arbitrary precision (just like we did in in Section 2.5.1 to figure out the inner workings of the yellow mystery box). Thus, we could from a single probabilistic or quantum bit learn an arbitrary amount of information. This should clearly not be possible!
Indeed, if this were possible then we would live in a very strange world (much stranger than the one described by quantum mechanics)! For example, imagine a coin whose probability of heads is where the binary digits encode the whole content of Wikipedia as well as all YouTube videos and all pictures of cats you can find on the internet. If cloning probabilistic bits were possible, I could flip this coin once and write down which outcome I got. This is a probabilistic bit of information that is equal to with probability . If I send this probabilistic bit to you and you have the ability to clone it, you could produce as many copies of it as you want and then measure them all. By looking at the measurement outcomes and counting how many zeroes you got, you could estimate the probability . In fact, by producing sufficiently many copies of the original bit, you could estimate this probability arbitrarily well! In particular, you would be able to extract out any binary digit of and hence also all the information encoded in , including the cat picture number 65535!
This should clearly be impossible, since otherwise we would not need USB drives, data centers, or to pay for our mobile phone data connection – we could just store all our information in a single probabilistic bit and transmit it all by sending this bit to somebody else! This is certainly too good to be true…