Quantum Information
Introduction to reversible computing and the Bloch sphere
Last updated
Introduction to reversible computing and the Bloch sphere
Last updated
In this section, we'll combine many of the concepts we've discussion in the tutorial so far. This means that if anything so far has confused you or if you feel like you need more information on anything, this would be the time to review.
Simply put, quantum calculations need to be reversible. During the process of quantum computation, information should not be destroyed.
In a classical system this isn't a concern - as long as we get the result we're looking for, we don't have any problem. For our Turing machine, the state of the system changes with every instruction. We're not so concerned with remembering the previous state, as long as the current state conforms to our expectations.
A computation is reversible if it is always possible to uniquely recover the input, given the output. For example, the NOT operation is reversible, because if the output bit is 0, you know the input bit must have been 1, and vice versa. On the other hand, the AND operation is not reversible. (Kaye, P. - p.12)
It's important to fully understand what this means. If I provide to you only the resulting state of some quantum computation, it must be true that you can figure out where I started from.
While most classical gates are not reversible, we can change them so that they are. This requires adding more wires, used only to keep the information we put in (Kaye, P. - p.12):
The one non-reversible action we take in quantum computation is measuring (or observation).
When we measure a qubit, it collapses into a particular state. It's forced to reveal what it had been doing this whole time - like our cat in the box, we know if it was alive or not.
This means we need to measure at the end whenever possible, so that we preserve reversibility until we have no choice.
The Bloch sphere can be used to describe the behaviour of single qubit systems (Wikipedia - 2020). Here we see that we have a 3-dimensional space, and like all quantum system we're able to range across the complex numbers as well as the real numbers.
Let's explore some of the things labelled on this diagram:
Note that the sphere has a radius of exactly one unit
See that these two are opposite each other on the diagram
Our qubit projects a shadow - this is the dotted line we see
When we draw a line between the shadow and our vector, we get a right angle triangle
This diagram doesn't show multiple qubits systems, mostly because it can't. Systems with more than one qubit are too complex to imagine with a picture like this.
Using these principles of quantum information, we can begin to construct quantum circuits in the same way that we would with a classical circuit.
Like classical gates, quantum gates are all described with a transformation matrix which tells us how they change our qubit vector.
However, there are a few important differences between classical gates and quantum gates. One is that all these operators will be reversible. This means our transformation matrices will have an inverse that we put our output in to get back to our input.
Another is that we can now include imaginary and complex numbers in our transformations. This accounts for quantum vectors ranging over the set of complex numbers in addition to real ones.
Lastly quantum gates produce the same number of outputs as we provide inputs. This means no quantum gates are like the classical AND gate, where they two in two inputs and produce one output. This relates back to reversibility - no information can be lost.
We draw quantum circuits in a similar way that we draw classical gates. We start with our inputs on one side, put them through various transformations via logic gate, and on the other side we get our outputs.
Though the quantum circuit doesn't have a wire like the classical one, we'll still use a line to show which inputs are entering which gates and in what order.
Most gates will be represented by a box around their corresponding symbol - some may be represented by other symbols. As we go through descriptions for the different gates, we'll include their symbols (Kuo, S. - 2013):
Though the process of measurement doesn't have a transformation matrix and isn't really a gate, we'll use a similar notation for it:
Recall that measurements are stored in classical bits, so our diagram will also include those:
For these tutorials, gates will be produce using IBMQ's Circuit Composer tool. We'll talk more about how you can get access to this later on.
are our three axis for 3-dimentional space
and are our two distinguishable states
is our vector in an unknown state - the single qubit we're describing
is the angle between the vector for our qubit and the axis
is the angle between the shadow of our qubit and the axis
The sphere shows us all of the possible states our single qubit can be in. Not just and , but the infinite combinations in between. By measuring the angle the vector and it's shadow make with respect to the , and axis, we can derive the probability of finding our qubit in a particular state when we measure it.
.svg?alt=media&token=462f2b48-d642-4a42-8aa0-e167facc0745)
.svg?alt=media&token=a114b816-582e-4778-930f-1ccd58205983)
