Quantumania 21 - Slot Machines
A ket is a “regular” vector, from the vector space , a bra is a covector from the dual space
(here I think QM has the upper hand, because almost everything is a vector, so it helps to have a specific term for a “regular” vector.)
A covector is a black box machine with one slot in the top, and you insert a vector
, and out pops a scalar
:
It’s linear:
We can add such machines (make a machine with one input slot, and internally it just feeds a copy of that input to two hidden machines and then sums their output scalars to produce the final output). Likewise we can scale a machine. The space of all such possible machines is a vector space . In QM we write such a machine as
and have it operate on a vector
like this:
, and we define a one-to-one mapping between bras and kets. In general, that asterisk notation
for the dual space of a space
has nothing to do with complex conjugates. It’s a neat coincidence that the bra-ket mapping in a QM state space involves complex conjugation.
We can also make a machine with two slots, accepting vectors and
, but still with one output hole that gives us back a scalar
:
Suppose that this two-slot machine had an especially simple inner mechanism: inside the box there are two single-slot boxes (covectors)
and
. The machinery inserts input
into box
, and input
into box
, to obtain two scalars, which it simply multiplies together to produce its own resultant scalar that falls out of the hole of
. In other words, it’s really just two covectors glued together by scalar multiplication, and they act independently on the inputs. We can think of the tensor product on the input vectors as gluing them together in a specific order so it’s clear which slot each one is meant to go in:
This is a product machine, it’s behaviour explicable in terms of two separate inner machines. This is not true of all two-slot machines. Once again, these are vectors from a combined vector space, . We can add a pair of two-slot machines to make another two-slot machine. Thus any two-slot machine might not be separable into two one-slot machines. It may only be expressible as the sum of multiple product machines. Or in QM terms:
The and
are product machines, but their sum is not.
Note that it isn’t necessary to provide both inputs at once. Such a two-slot machine can be given one input, say for the first slot, which clogs up that slot, resulting in what is in effect a one-slot machine. Generalising further, the scalar that falls out after both inputs are provided is, in a sense, a zero-slot machine!
The symmetry of the notation where a bra acts on a ket to produce a scalar, , can just as well be read as the ket acting on the bra; when implemented as a calculation in terms of coordinates, it has the same machinery as the familiar dot product: coordinate-wise multiplication to produce terms in a sum. So you can completely flip the picture around as visualise a ket as a one-slot machine that takes a bra as its input, and the tensor product of two kets as a two-slot machine, and so on.
We can even stitch together a two-slot machine from , that is, being defined conceptually through the combining of a ket and a bra (in that order), its inputs need to be a bra and a ket (again, in that order).
Wait a second… this is the shape of a projection operator! The QM notation is itself a shorthand for
. When we write:
This is the operator acting on the ket
, or we can say it’s the ket
being inserted into the second slot of the two-slot machine
.
So a term written like this in QM notation:
is building a four-slot machine. The two qubits ,
have their own vector spaces
,
, so the four-slot machine is from the space:
Now, given that the slots of these machines are either ket-shaped, expecting to be fed a bra, or bra-shaped and expecting to be fed a ket, its not that far-fetched to suppose that you could connect one of the slots to another! They just need to be slots of the opposite type, from the same dual-space pair, such as and
, connected by a logical pipe of some kind. This is the so-called partial trace.
Once we adopt this way of thinking, we can completely forget about matrices altogether. There’s really only one bit of notation from classical physics (GR) that we haven’t yet borrowed, and it’s awfully tempting. Cast your mind all the way back up the page to when we wrote our joint state’s density operator as:
I made a big deal of how I’d written the indices clustered in a certain way to get across how they relate to which system versus bra/ket. There’s already a way to do this properly. The object holding the coefficients for the
possible four-slot machines can be written:
The indices are written “up” or “down” to signify the type of object they label, up for a ket and down for a bra. This means we can divide them into rows to separate ket from bra indices, or into columns (albeit slightly staggered) to group by qubit. It’s just a labelled collection of numbers, with no inherent matrix structure. We can slice it however it suits us.
Of course to interpret it properly we need to use each of these coefficients to scale a basis element, and rather than writing , we can represent a basis regular vector (ket) by
(index down) and a basis covector (bra) by
(index up). This opposing convention, where a coefficient and its corresponding basis element have oppositely positioned indices, has a purpose, which we’re about to get to.
The final ingredients are the summation symbols, but here we come to what Einstein jokingly called his only contribution to mathematics. In an expression like the above where the same index appears twice, once up and once down, this automatically implies summation over that index. So the above expression is in fact the complete equivalent of our original way of writing it.
We can go a step further and use abstract tensor notation, also known as the slot naming convention. This means we interpret not as merely a collection of labelled numeric coefficients, but as the full geometric object, the four-slot machine, silently agreeing to imagine that it has the
part built into it.
With this understanding, we’re writing the whole density operator for our two-qubit system as:
Not only is this remarkably compact, it also means that if we want to “trace out” the second qubit, we just tie together its indices, which sit in the second column, by using the same symbol for both:
Because the index label appears once up and once down, it is summed over, eliminating those two slots, and this is precisely the same thing as the partial trace. We’re left with the density operator for qubit
,
.
The implied basis vector factor , also has the repeated
index, and
is equivalent to the identity operator, because it is summed over, and each term in the sum contributes a
to the diagonal in the matrix representation, so it too disappears, leaving only the implied
factor, exactly as required.
So a density operator, , can be simplistically viewed as a two-slot machine, where the slots accept a bra and a ket. Why such a pair? Together they represent an input that accepts a density operator.
So in the usual QM notation, we can write:
and is a scalar. Why the sandwich? Because the QM notation pays tribute to the pattern of matrix multiplication and the pieces have to be written in that order for such a multiplication to work. If we instead used explicit index notation:
then we could write the factors in any order. The pairing of the indices describes a topological “wiring up” between connection points. Interpreting the factors as labelled coefficients, they are just numbers being multiplied, so clearly the order is unimportant. What matters is which combinations are multiplied and then summed. The result is still a scalar, because of the implied summation.
To supply a density operator to the slots is to ask a question. If we supply , that’s a simple projection operator representing a specific state, and the question is: “What’s the probability that the system is in this state?” and
is the answer.
The deeper point is that this two-slot case, while a valid way to describe any complex system, is a simplification if we are interested in the subsystems that comprise that complex system. Each subsystem can be thought of as having its own bra-ket pair of slots, and we can eliminate one subsystem by tying its slots together.
These two viewpoints are perfectly compatible because the tensor product allows us to connect the state spaces of any group of subsystems together into one state space. We can group them into a hierarchy, deal with them individually or all at once. If our system contains qubits, we can divide them into three registers of
,
and
qubits each, each register exposing two slots. It’s vital to remember that they might not be three independent machines: their behaviour maybe correlated by entanglement.
Not yet regretting the time you've spent here?
Keep reading: