Quantum Information
1.Introduction
1.1.A bit of history
1.2.Quantum is different
1.3.Computers and information
1.4.Recommended literature
2.Quantum mechanics essentials
3.Measurement and uncertainty
4.Qubits and the Bloch sphere
5.Bipartite systems
6.Entanglement applications
7.Information theory
8.Changelog
9.Bibliography
\(\newcommand{\Hint}[1]{{\flushleft{\bf Hint:}} #1}\)
\(\newcommand{\Tr}{\mathrm{Tr}}\)
\(\renewcommand{\d}{\mathrm{d}}\)
\(\renewcommand{\vec}[1]{\mathbf{#1}}\)
\(\newcommand{\cvec}[1]{\left( \begin{array}{c} #1 \end{array} \right)}\)
\(\newcommand{\ket}[1]{\left\vert #1 \right\rangle}\)
\(\newcommand{\bra}[1]{\left\langle #1 \right\vert}\)
\(\newcommand{\ipop}[3]{\left\langle #1 \left\vert #2 \vphantom{#1 #3} \right\vert #3 \right\rangle}\)
\(\newcommand{\ip}[2]{\left\langle #1 \left\vert #2 \vphantom{#1} \right\rangle \right.}\)
\(\newcommand{\ev}[1]{\left\langle #1 \right\rangle}\)
\(\newcommand{\com}[2]{\left[ \hat{#1}, \hat{#2} \right]}\)
\(\newcommand{\acom}[2]{\left\{ \hat{#1}, \hat{#2} \right\}}\)
\(\newcommand{\norm}[1]{\vert\vert \ket{#1} \vert \vert}\)
1.Introduction
1.1.A bit of history
1
While it perfectly possible to study quantum information and quantum computing as isolated mathematical topics without any reference their origin in physics, this would ignore a large part of interesting historical development, and it would also fail to catch the actual real-world importance it may one day have. So before we go into the underlying maths, this chapter will put things into context and try to give some idea about what you can and cannot do with quantum information and quantum computing.
Historically, the field is now almost 45 years old. The first suggestion of using a quantum version of the universal Turing machine goes back to the work of Paul Benioff [1] in 1980. Richard Feynman [2] and Yuri Manin then independently came to the conclusion that simulating the quantum world on a classical computer is very limiting (for reasons we will explore later) and those limitations might be avoidable by using a computer based on quantum mechanics itself instead. Theoretical work in that direction, namely the development of algorithms that could be run on such – as of then non-existent – quantum computers where developed by many people starting with the work of David Deutsch [3] and Peter Shor in the early 1980's. It then took some four decades to get to actual physical realisations of quantum computers, and even those are still quite limited in size and capability.
But before we go deeper into the details of those developments, and get lost in mathematical details that sometimes hide the things that are really important, it is good to think briefly about why quantum computing might be different from classical computing. In physics terms, there are two key things in quantum mechanics which make it different from classical mechanics: superposition and entanglement. These two things simply do not exist in classical systems. We will discuss these in some more detail below to refresh your memory.
Most of the notes here will discuss what is known as “quantum information”: how you store and manipulate information in systems which are built from quantum-mechanical ingredients. The second part of the module will then use this to study quantum computing: how can we do computations by manipulating quantum information, and how do those computations differ from classical computations.
1.2.Quantum is different
1.2.1.Superposition: doing multiple things at once
A typical course on quantum mechanics introduces the need for something beyond the classical world by discussing the double-slit experiment. This famous experiment involves a single source emitting individual particles or photons. Their path is blocked by a screen with two slits, and behind that screen sits a detector.
Figure 1.1: The double slit experiment, in which the quantum particle goes through two slits at the same time.
Even though we can see particle-like behaviour of the quanta because individual blobs appear on the detector one-by-one, the pattern that emerges after a large number of quanta have been emitted is one of interference.
Superposition means that quantum systems “compute” multiple classical things at the same time.
What this shows is that quantum particles, in a way, go through both slits at once, and only the measurement at the detector forces them to become classical again, giving a concrete outcome for the position. The quantum world thus makes the particle do two things at the same time, only collapsing onto a definite prediction once the measurement is made. The state of the system, until the time that the measurement is made, is one of a superposition of the particle going through slit \(S_1\) and another one of the particle going through slit \(S_2\).
Application of superposition: quantum algorithms and quantum computing.
It is this “doing multiple things at once” aspect that underlies the fact that quantum computers can do things “much faster” (in a sense that will be made precise later in this course) than classical computers. From this simple example it is also already clear that, while quantum systems can do multiple classical things at once, the tricky bit will be to somehow make use of that and extract all those multiple “computations” at the end.
1.2.2.Entanglement: connection without interaction
Entanglement is often only discussed once spin systems are introduced into quantum mechanics, but we have seen that entanglement really is a property of the quantum world that already exists for simple two-particle systems for which each particle is only labelled by a position.
Figure 1.2: Probability density for two states of a two-particle system. On the left, the wave function is separable, while on the right it is non-separable.
If the positions of the two particles are labelled by \(x_1\) and \(x_2\) respectively, then the wave function is some complex-valued function \(\psi(x_1,x_2)\) of these two variables. In the special case that the function is separable, that is, when it takes the form
\begin{equation} \psi(x_1, x_2) = \psi_1(x_1) \psi_2(x_2)\,, \end{equation}
the system is non-entangled. This means that a measurement of the position of particle 2 does not influence the measurement of the position of particle 1. If we do not measure particle 2, the probability density for particle 1 is
\begin{equation} P_1(x_1) = \int \big|\psi(x_1,x_2)\big|^2 {\rm d}x_2 = \big|\psi_1(x_1)\big|^2\,, \end{equation}
because \(\psi_2(x_2)\) is itself normalised. If we first measure the position of particle 2 to be \(x_2=q\), then the wave function collapses to
\begin{equation} \tilde{\psi}(x_1) = N \psi(x_1, q) = N \psi_1(x_1) \psi_2(q) = \psi_1(x_1) \,, \end{equation}
where the constant \(N\) is determined by imposing that \(\tilde{\psi}(x_1)\) is normalised. Because the wave function was separable, the probability density is the same as before, \(P_1(x_1) = \big|\psi_1(x_1)\big|^2\). In terms of the picture above, the measurement of particle 1 before we know anything about particle 2 is obtained by integrating over the vertical direction, while measuring particle 1 after we measure particle 2 is done by evaluating the function at a particular vertical position. For a separable function, these are equivalent.
However, when the wave function is not separable, these two computations generally differ. For instance, assume that the wave function is
\begin{equation} \psi(x_1,x_2) = \psi_1(x_1)\psi_2(x_2) + \chi_1(x_1)\chi_2(x_2) \end{equation}
for four different functions \(\psi_1, \psi_2, \chi_1, \chi_2\). Integrating the complex norm-squared over \(x_2\) or inserting a particular value \(x_2=q\) will now typically not produce the same function of \(x_1\). In the picture on the right above, the difference is clear: integrating along the vertical direction \(x_2\) does not produce the same function of \(x_1\) as slicing the plot along some horizontal line \(x_2=q\).
Entangled states lead to one particle influencing the other even when there is no interaction, and even when the particles are separated by an arbitrary distance.
So typically, the measurement of the position of particle 2 changes the subsequent probability distribution for the measurement of the position of particle 1. This is what is known as entanglement. The important aspect of this is that measuring one particle immediately has consequences for the measurement of the other particle, even though the particles do not interact and even though the particles can be arbitrarily far separated. This never happens in classical mechanics.
Applications of entanglement: secure communication and quantum key distribution, teleportation, deciding whether nature is fundamentally non-classical (“Bell inequalities”).
Entanglement provides us with new ways to secure communication channels and also allows us to “teleport” a quantum state to a different location using classical communication. Moreover, it has played a crucial role in deciding whether the probabilistic character of quantum mechanics is merely due to “lack of understanding”, or whether it is something fundamental. We will see that there are certain inequalities (the “Bell inequalities”) which will tell us that nature is not classical.
1.3.Computers and information
Both examples discussed above are in a way much more complicated than the ones that we will be discussing at length in the present notes. For the purpose of quantum computing, we will no longer look at systems with a continuous space of classical states, but rather at much simpler ones in which the possible classical states are discrete. Think simply about ordinary digital computers: these are built from “bits”, which are simple classical things which can take either one of two values.
Application of quantum information: Von Neumann and Entanglement entropy.
Restricting to discrete systems will make our life a lot easier: there are no integrals but only sums, and all Hilbert spaces are finite-dimensional and operators acting in them can thus (if we want) be written out in terms of explicit finite-size matrices. With those systems, we can (and will, in the last chapter of these notes) develop the formalism to quantify how much information (“quantum entropy”) is stored in a quantum system.
Where practical quantum computation mainly struggles at the moment is in scaling such systems up to respectable sizes. While typical digital computers, like your phone, contain at least on the order of \(10^{10}\) to \(10^{11}\) classical bits, the most powerful quantum computers around the time of writing do not get beyond \(10^3\) quantum bits. That these can still do useful things, and that scaling this up by only a few orders of magnitude will lead to dramatical changes in e.g. cryptography, is something that this module will try to get explain.
1.4.Recommended literature
There is a large body of literature, both in book form an in the form of online courses, that deals with quantum information and quantum computing. The list below includes some of my own personal favourites, but that does of course not mean that other resources cannot be useful.
If you do not care about any of the physics background, and just want to “get going” with the maths of quantum information, there are some more recent resources which can help:
Ask a question about the highlighted paragraph(s):
Your question will be raised anonymously and the answer will appear here at some point.
Long-tap anywhere to ask a question (or see the reply). Right-click anywhere to ask a question (or see the reply).