The classical setup

Let’s make the photocopier mathematically precise. We start with the classical case, where everything is ordinary probability theory.

Pick a small number of distinct states your image can be in. Say three, and to keep them vivid, call them red, green, and blue. At any moment a pixel of the image need not be one definite colour. Noise has crept in, and the honest description is a list of how likely each colour is. Right now it might be definitely red. After a few passes through the copier, it might be 40% red, 50% green, 10% blue.

We write that list as a vector. Definitely red is ; the blurred state is , read in the order red, green, blue. Two rules turn a list of numbers into a probability distribution, and we lean on both later. The entries cannot be negative, since a probability below zero is meaningless. And they must sum to one, since the pixel is certainly some colour. Every classical state we write obeys these two rules, and nothing else counts.

Now picture all the lawful states at once. With three colours a state is three numbers summing to one, so fixing any two pins the third: only two are free. Two free numbers trace out a flat, two-dimensional shape, and that shape is a triangle. Its three corners are the sure things, one per colour: is definitely red, definitely green, definitely blue. Walk along an edge joining two corners and the third colour stays impossible while the other two trade off. Drift inward and the three probabilities become more balanced, until at the dead centre you reach : an even wash of red, green, and blue with no colour favoured, the state that could have come from anything. That even wash is exactly the grey noise from the start of this post, the worn-out photocopy written as a vector, and pushing every corner toward it is the whole job of an erasing copier. The triangle has a name, the simplex, and for states it becomes the -dimensional version of the same idea (Figure 1).

A copy operation takes one probability distribution as input and returns another. Before we write down what kind of object such an operation is, it is worth asking what we want to insist on.

The first thing is linearity. The copier has to be a linear map: if you feed it a coin-flip mixture of two inputs, the output has to be the same coin-flip mixture of the two separate outputs. Anything else would let the copier react to information beyond what the input distribution actually contains, which is a contradiction in terms.

A linear map of vectors is exactly a matrix, so from here on our copier is a matrix, which we will call , and applying it to a distribution is ordinary matrix-times-vector multiplication.

It is worth seeing what that does to our three corners, because it pins down the whole matrix. Feed in pure red, the vector . Multiplying by a vector that is all zeros except for a single one just reads off the matching column, so the output is the first column of : whatever does to red lives there. Pure green picks out the second column, pure blue the third. The three columns of are therefore nothing but the images of the three pure states, the three places the corners are sent, and once those are fixed linearity supplies every blend in between.

That already constrains the entries. Each column is the image of a pure state, and that image has to be a legal state in its own right: its entries non-negative and summing to one, The same holds for every column, and linearity then takes care of every mixture in between. A matrix of this kind, non-negative entries with every column summing to one, is called a stochastic matrix: exactly the linear maps that send probability distributions to probability distributions.

There is one more restriction we will impose, and in retrospect it is the most interesting one. We will only consider copiers that leave the uniform distribution untouched, the grey centre of the triangle from a moment ago: the flat distribution that puts equal weight on every state has to come back out exactly as it went in.

Why? The uniform distribution is the symmetric point of the simplex, the one distribution that treats every colour exactly alike. It is also the destination. The grey centre is exactly where an erasing copier is trying to send everything, so a process whose job is to forget should come to rest there once it arrives, not stir the grey back into a sharper image. A copier that moved the centre would be privileging some outcomes over others, a bias built into the dynamics rather than read from the input, and leaving the grey centre fixed is the natural way to rule that out. (In the quantum upgrade later in the post, the analogous restriction is more than just natural, it is the standard convention. For now, take it as a sensible thing to ask for; in a moment it will reveal itself as no restriction at all.)

This small demand has a tidy consequence. We already know the columns of sum to one. Insisting that the uniform distribution survives forces the rows to sum to one as well. A stochastic matrix with that extra symmetry is called bistochastic, and from here on “copier” will mean “bistochastic matrix.”

One small fact worth pinning down before we go further: the product of two bistochastic matrices is bistochastic, which you can verify directly from the row and column sum conditions. So stays bistochastic for any , and the question of finite roots is going to be a question about powers of matrices that stay safely inside our chosen class.

Now we can say precisely what “total erasure” means. The most depolarizing copier you can write down is the one whose every column is the uniform distribution. Every input state, no matter which one, produces the same uniform output:

Apply to anything and you get the uniform distribution back. All information about the input has been thrown away in a single step. Apply again and nothing changes: the simplex has contracted to a single point, the centre, and just keeps mapping it there. This is bistochastic by inspection (every row sums to one as well), and it is the completely depolarizing channel in dimension , or CDC for short.

With pinned down, the question we opened with stops being a story about photocopiers and becomes one line of mathematics. The copier that erases in steps, the demand that it finish after exactly identical passes: all of it is now this. Here is a positive integer, the number of passes. A -th root of is a bistochastic matrix for which Spelled out: apply the copier exactly times and you get , total erasure; apply it any smaller number of times and the erasure has not happened yet. The first equation is the whole post in miniature, a single copier that erases totally in identical steps; the second pins down as the exact number, and that exact is called the order of the root. Everything from here on is the hunt for such an with as large as possible, and the difficulty (and the beauty) is finding a non-trivial one, an that is not simply itself.

And here the restriction we imposed by hand grants itself. Suppose were merely stochastic, columns summing to one, rows unconstrained, and satisfied . Multiply one more copy of onto that equation, once on each side: both products are , so . Now feed any distribution through both sides. The right side copies first and then erases, , the uniform distribution, no matter what was. The left side erases first and then copies once more, . So : every stochastic root of fixes the uniform distribution of its own accord, rows summing to one and all. Bistochasticity is not a fence we built around the hunt. It is a property every candidate already has, and demanding it up front just names the terrain honestly.

Before hunting, notice where the teeth of the problem are. Finding some matrix with is a linear-algebra exercise. The demand with teeth is that must be a lawful copier: entries non-negative, every column summing to one, and, by our standing rule, every row as well. The hunt is always for the largest order inside the set of lawful matrices, and it is worth marking the non-negativity half of that checklist now. It looks like the tamest of the conditions. It returns in every setting of this post, wearing a different name each time, and in the quantum world it will grow into the main obstacle of the whole story. How large can be?

The smallest case settles itself. A two-state bistochastic matrix has a single free number, and is the case . Its one direction away from the grey centre, , is merely rescaled, so scales it by . Asking forces , and a number powers to zero only if it was already zero. So and from the start: one classical bit has no genuine root, , erasure in a single shot.

Three states are the first with room to spare, and the clean way to find that room is to stop guessing whole matrices and split off the part that does the forgetting. Every copier in our class fixes the grey centre, so write with the completely depolarizing channel and whatever is left over. Two facts about make this split pay off. It is idempotent, , and it absorbs from both sides, (the columns of sum to zero because those of and both sum to one, and its rows sum to zero because fixes the uniform state). Square and the cross terms vanish: The question has collapsed. holds exactly when . We no longer need a square root of ; we need a single nonzero that squares to zero and keeps a legal copier.

So solve directly. The condition is stricter than it looks. If squares to zero it can have rank at most one, which means it is a single outer product, and then all three demands become conditions on the two vectors alone: the last two being the vanishing column and row sums. In words: take any two vectors that are orthogonal and that each sum to zero. That is the whole recipe.

The simplest such pair is small and concrete: orthogonal, each summing to zero. Their outer product, scaled by so that stays non-negative, is and adding it to gives an honest copier, non-negative, with every row and column summing to one. By construction while , so this is a genuine square root of total erasure: a copier that erases a three-state image in two equal steps rather than one, funnelling every point along a two-step path to the grey centre (Figure 2). It is one especially simple member of a continuous family of such roots (any orthogonal pair of zero-sum vectors, scaled gently enough, gives another), and it is the member drawn in the figure.

That same split hands us the general bound for free. For any in our class the cross terms always die, so , and exactly when . Erasing in exactly steps is nothing more than being nilpotent of order , and a nilpotent map on the -dimensional space of deviations from the grey centre runs out of room after at most steps. So the bound is already reached at by the matrix above. (In the quantum upgrade these deviations become the traceless operators, the same idea in matrix language.)

And that is the classical story. A clean bound, a clean construction, and not much more to say about it.

The interesting thing is what happens to that bound when we let ourselves leave classical probability behind.

The quantum upgrade

Everything so far was a rehearsal. The real question is about quantum information, and a quantum state carries more than a classical probability distribution does. More in a way we can count, and the count turns out to be the whole plot of this section.

Go back to the smallest example. A classical bit is one number: how a coin is weighted between its two outcomes, and . Picture that number as a position on a line segment. The two ends are the only certain states, “definitely ” and “definitely ”; every point between is a blend, more or less uncertain, with the fair coin sitting at the dead centre. One number, one dimension of freedom.

A quantum bit, a qubit, has more room, and the cleanest way to see how much more is to ask what its certain states are. (Quantum mechanics also allows genuine superpositions, the of the amplitude picture,³ but for a story about forgetting we want the geometry of states, not the algebra of amplitudes.) Classically there were exactly two certain states, the two ends of the line. A qubit has infinitely many. That is one of the genuine surprises of quantum mechanics, and not one this post can derive; we take it as given and simply draw it. The certain states no longer sit at two points. They fill the entire surface of a ball.

This is not a mathematical fiction. Two everyday incarnations make it concrete. The polarization of a photon is a qubit: a filter aligned with it passes the photon every time, a filter at right angles blocks it, and one at lets it through half the time. So is the spin of an electron: point a detector along the spin and you always read the same way, turn the detector sideways and the outcome goes random. In each, the certain states are not two but a whole continuum, one for every direction on the Bloch sphere.

That continuum is the surface of the qubit’s state space, the Bloch ball (Figure 3). Picture a state as an arrow inside the ball, with a direction and a length. The length says how certain the state is: arrows reaching the surface are the certain, pure states, shorter arrows are blurrier mixtures, and the zero-length arrow at the dead centre is total ignorance, the quantum coin flip. The direction says which question the state answers with certainty. Every direction names a measurement you could make, and the state pointing that way is the one whose outcome you can predict. The poles are the ordinary question, “are you or ?”, and the classical bit’s two states sit there. A state out on the equator answers that question with a perfect coin flip, yet is itself perfectly definite, just for a different question. Ask a qubit the wrong question and the answer turns random; that, and not fuzziness, is what the surface is encoding.

The object that bookkeeps this arrow is a small matrix, the density matrix, and for a qubit it is small enough that we will shortly write it out whole and watch the ball fall out of it.

Notice what happened to the dimension. The classical bit lived on a line, one dimension; the qubit fills a ball, three. Where does three come from? For a qubit, nothing has to be taken on faith, because the promised bookkeeping matrix is small enough to write out entry by entry, with the arrow filed inside it: Look at how little freedom the grid has. The two diagonal entries are real and sum to one, so a single number, , fixes both. The two off-diagonal entries are mirror images of each other across the diagonal (complex conjugates), so a single complex number, worth two real ones, fixes that pair. Three free real numbers in all, and they are exactly the coordinates of the arrow. The ball’s three dimensions are not a metaphor. They are the room this matrix has.

The matrix even knows the ball is round. Its two eigenvalues work out to , with the length of the arrow (a two-line computation, done in the aside below), and the eigenvalues of a density matrix are the probabilities it carries, a point made precise in a moment. Probabilities cannot go negative, so : one inequality, and it carves the solid ball out of space. The surface is , eigenvalues and , some question answered with certainty, which is why the certain states live exactly there; the zero-length arrow at the centre has eigenvalues and , the fair coin. And file one promise away as you look at the grid: in the next section each of the three directions will get a matrix of its own, and the way those matrices multiply carries the rest of the post.

That jump, one dimension to three, is the pattern worth chasing, but to count it for any number of levels we first have to say what a quantum state even is beyond the qubit.

For levels the bookkeeping object is the same kind of thing as the grid we just unpacked: a matrix, the density matrix at full size, and its rules are not arbitrary. They are exactly what it takes to still be describing probabilities. The matrix is Hermitian, mirror-conjugate across the diagonal just like the qubit’s, so its eigenvalues are real; those eigenvalues are non-negative and sum to one. That last clause is the point, because non-negative numbers summing to one are a probability distribution. So each density matrix carries a classical probability distribution inside it: the eigenvalues are the probabilities, and the eigenvectors say which mutually exclusive pure states they are spread across. But the basis belongs to the state, and that is where the quantum content lives: two density matrices need not agree about which alternatives they are distributions over, and when they disagree they do not commute. The classical simplex from the first half of this post is the special case where one common set of axes has been fixed once and for all.

Now we can count. A quantum state in dimension is pinned down by real numbers, the qubit’s three being the case .

So the quantum state space is -dimensional, against the classical simplex’s . For a single bit, three against one. The freedom grew quadratically, and every result in this post is a shadow of that one fact.

The rest of the cast carries over almost unchanged. A quantum copier is a channel: a linear map that turns density matrices into density matrices. It has to be linear for exactly the reason it was classically, that a coin-flip mixture of inputs must come out as the same coin-flip mixture of outputs. And the classical lawfulness checklist survives the upgrade, renamed. Non-negative entries grow into positivity: a channel must keep the density matrix’s eigenvalues non-negative, so that they can stay probabilities. Columns summing to one grow into trace preservation, the matrix version of “the outcomes still add up to one”. (Row sums, our standing fixed-centre rule, return in a moment.) Only one word of the checklist is genuinely new. The positivity demand sharpens to complete positivity: the map must keep sending valid states to valid states even when it acts on only part of a larger entangled system, a failure mode classical probability simply does not have. Channels are well-understood objects with a clean structure theory.⁴ For us they are simply the right notion of “physically allowed operation,” and we will not pry them open.

We make the same restriction we made classically. Out of all channels we keep the ones that leave the state of total ignorance untouched. Classically that was the uniform distribution. Here it is the maximally mixed state, the centre of the Bloch ball, written with the identity matrix. A channel that fixes it prefers no state to any other, which is the least we should ask of a process whose only job is to forget. (Such channels have a name, unital, but the name matters less than the picture.)

Total erasure is the same idea as before, too. The completely depolarizing channel sends every input, no exceptions, to the maximally mixed state. The whole Bloch ball collapses to its centre point in a single step. This is the quantum CDC, and it is the operator we now want to take roots of.

The classical bonus survives the upgrade word for word. The argument that any stochastic root of the classical fixes the uniform distribution used nothing but and the fact that erases everything, and both survive here. So any trace-preserving channel root of the quantum CDC fixes the maximally mixed state of its own accord: unitality, like bistochasticity before it, is not a restriction on the hunt but a property every candidate brings along.

Here is where that quadratic shows up where it counts. Ask the same question as in the classical case: how large can be, if a channel satisfies but no smaller power does? The argument has the same skeleton. The quantum CDC is again a rank-one map, rank one as a linear map on the -dimensional space of operators: it sends the entire space of traceless operators, the directions away from the maximally mixed state, to zero. Any powering to it must carry a nilpotent part on that space, and a single nilpotent block on a space of dimension takes at most steps to wind down. Only now rather than , so

Set . The classical bound was : a single bit could not be erased in more than one step. The quantum bound is . Three gentle steps to forget one qubit (Figure 4), where one classical bit allowed only the abrupt single step. The room to subdivide erasure grew, and it grew quadratically.

The unrestricted answer is therefore , ceiling and construction both: the aside above delivers a channel of exactly that order in every dimension. How much of that quadratic scaling survives inside a far more rigid family? That is the question with life left in it, and the rest of the post lives in a smaller room: a family of channels with a handful of parameters in place of the full continuum, one that has proved fruitful before across quantum information, and simple enough that the question yields to direct computation. Building the room takes a little construction work, and the construction starts further back than you might expect.

Rebuilding the qubit from the bit

Two settings are closed, and it is worth reading the scoreboard before opening a third. Both times the same skeleton carried the argument: split the copier as , watch the cross terms die, and read the largest order off the size of the space has to wander in. Classically that space was the set of deviations from the grey centre, of dimension . Quantum mechanically it was the traceless operators, of dimension . Both bounds were reached, and both times the part of the argument with teeth was not the order but the lawfulness check, non-negative entries in one world and complete positivity in the other, paid off by shrinking the nilpotent part until the check went through.

	Classical	Quantum	Clifford
Copiers considered	bistochastic matrices	channels fixing the centre	a rigid subfamily, built below
Free parameters			a finite choice, plus scale factors
The condition with teeth	non-negative entries	complete positivity	complete positivity, as one explicit matrix
Largest order			?
Reached by	a nilpotent on the deviations, scaled gently	a nilpotent on the traceless operators, shrunk until the Choi matrix stays positive	?
Seen in action	, two steps (Figure 2)	, three steps (Figure 4)	?

So why open a third column when the second is closed? Because the quantum construction settles the number and shows no structure. A Jordan block on the traceless operators, in any orthonormal basis you care to pick, shrunk until the Choi matrix stays positive, is an existence proof. It certifies that steps of room are there and is indifferent to everything else: the axes are arbitrary, and lawfulness is settled by an inequality rather than seen. The family this section builds, the Clifford channels, is a room small enough for the mechanism to sit in plain view. Inside it the non-commutativity of quantum mechanics is packaged as bookkeeping on a finite grid of labels, the root problem turns into a board game on that grid, and complete positivity, the condition that separates channels from mere linear maps, becomes the positivity of one matrix whose entries are the channel’s own parameters.

Nor is the family a toy invented for the occasion. The bit-flip, dephasing and depolarizing noise models that quantum error correction is built to fight are all members, so the question of how slowly such noise can erase has standing of its own. And the payoff is the surprise promised in the hook. Rigidity turns out to cost almost nothing: in prime dimensions the family gives up a factor of two against the full quantum bound, and nothing more. Where that factor comes from, and why the drop is not most of the way back to the classical , is the rest of the post.

Where should the building start? Look once more at the Bloch ball of Figure 3, because something classical is hiding in plain sight. The two states of an ordinary bit sit at the poles. The straight line between them, running through the centre, is the entire state space of the classical bit: the segment from the very start of this post, with its two certain ends and its ignorant middle. The quantum ball did not replace the classical picture. It grew around it.

That is worth taking seriously, because it says which way round to build. The previous section went at the space of all quantum channels from the top and got its number by shrinking a block until an inequality held. This time we go the other way around. Start from the classical bit, the smallest state space we own, and take the smallest step that turns it quantum, keeping both hands on the algebra the whole way. By the end of the section that small step will have produced a coordinate system for the qubit, a family of channels that respects those coordinates, and a rederivation of the three-step eraser of Figure 4: not pulled from a hat this time, but designed, with every choice visible.

Begin with the bit, dressed in matrix clothes. A classical bit is a probability of reading and of reading , and its density matrix is diagonal: Two matrices carry the whole classical story: the identity , and As sweeps from one to zero, slides from down to , and traces out exactly the vertical diameter of the Bloch ball. So and are a basis for the classical states: every state of a bit is a combination of these two matrices, and nothing else is needed.

That is the first role the two matrices play. Here is the second, and it looks almost too small to mention. Give them labels: attach to and to , writing and . The labels add modulo , the arithmetic of even and odd; as a group this label set is called . Now multiply the matrices and watch the labels. , which is . , which is . Multiplication upstairs is addition downstairs, exactly, with nothing left over. An assignment with this property is called a representation of the group. Nor is the label on a choice we made. Read down its diagonal: at the outcome , at the outcome , the parity of the outcome , while the diagonal of is the constant . The label is the exponent in , and multiplying the matrices multiplies these entries, which adds the exponents. The representation was handed to us by the bit. For the moment this is idle bookkeeping. It is also the seed of everything below.

To watch the bookkeeping earn its keep, take the one copier family we have already solved and translate it. The two-state copier from the classical section was copying faithfully with probability and flipping with probability . In matrix clothes its entire action collapses to two statements: The identity is left alone, and is multiplied by a number. That is the whole copier. (The vector that carried the classical computation back then is nothing but the diagonal of .) And the classical no-root theorem, the fact that a bit cannot be erased gently, becomes a single sentence: applying repeatedly multiplies by , and a product of copies of one number vanishes only if that number was zero from the start. One label beyond the identity, one number attached to it, no room to manoeuvre. Keep this template in view: a copier in these coordinates is a rule for the labels plus a number per label. The rest of the section is that sentence, rerun with better ingredients.

Is this the only way can sit inside the matrices? It is not, and the second way needs no new ingredient. So far the addition table of has been applied to the labels. Apply it to the outcomes instead: adding sends the outcome to and the outcome to . That is the flip. On a probability vector it moves the weight of each outcome onto the other, , and the matrix that does this is a plain permutation matrix. It is Hermitian, and : flipping twice is doing nothing, which is once more. So is a second representation of the very same group, and it was there from the start, in the group law itself. In the classical family above it sits at the corner , the copier that flips every bit with certainty.

Notice how the two representations kept apart in the classical world. The states of the bit live in the span of and . The copiers live in the span of and : the two-state copier is the matrix , a mixture of doing nothing and flipping. One representation spans what the bit is, the other what can be done to it, and the classical world never puts the two side by side. The qubit is where they meet as equals: both become operators on the same two-dimensional space, and both are Hermitian, so both become observables too. Put them together and the labels pair up, a label that says whether to flip and whether to read the parity, each coordinate adding modulo on its own. (Physicists call this product the phase space of the bit, by analogy with the position-and-momentum pairs of mechanics, and the symplectic form that a phase space carries is about to show up as a sign. The doubled group also has a name of its own, the Klein four-group; we will simply keep writing .) The four labels get their candidate matrices in the obvious way, and only one of the four, the product , is genuinely new. Now count. The previous section counted real numbers for a qubit state, and the count came from the real dimensions of Hermitian matrices, with one dimension spent on fixing the trace. A basis for everything needs four matrices, and four is exactly what the two representations produced between them. Nothing had to be added, and nothing is left over. Before writing the new matrix out, though, there is a question that sounds pedantic until you take it seriously.

Each representation on its own was exact: multiplication matched addition with nothing left over. Can the pair stay exact together? Could four matrices be chosen, these or any others, so that the match stays perfect and the four still span everything? The answer is no, and the reason is a counting argument, not an accident of and . Labels commute: . If multiplication upstairs copied addition downstairs exactly, the four matrices would have to commute with one another too. But commuting is contagious: a matrix that commutes with all four basis matrices commutes with everything they span, and their span was supposed to be all matrices. A matrix that commutes with every matrix can only be a multiple of the identity. So all four would be stretched copies of , spanning a single dimension rather than four. Phase-free multiplication and a full basis cannot coexist. Something has to give, and in quantum mechanics exactly one thing is allowed to give: a number out front. The matrices may multiply like the labels up to a scalar factor. That factor is not a blemish on an otherwise clean story. It is the mechanism by which four commuting labels manage to span a non-commuting world, and by the end of the post it will be carrying the answer.

Now watch the compulsory phase show up in the flesh. Multiply the two generators in both orders: The same matrix, with opposite signs: . The labels added the same way both times, , but the matrices remember the order, and they file that memory in a sign. (That sign is the symplectic form the phase space was promised. For a bit it is the whole of it: two labels either commute or they do not.)

One cosmetic decision before the full table. The fourth matrix is the odd sibling: and are Hermitian, but transposing and conjugating flips its sign. A phase out front is ours to spend, it never touches the label bookkeeping, so spend it on restoring the family resemblance: define Hermitian, and squaring to like its siblings. The label of is , and the quartet is complete. These are the Pauli matrices, the standard cast of single-qubit quantum mechanics, rebuilt here from the bit upward rather than handed down from above.

Here are all sixteen products.

The multiplication table of the Pauli quartet: row times column.

Now do the exercise this table is begging for: put a thumb over the phases and read only the letters. lands on , and the labels agree: . lands on : . Every diagonal entry is : any label added to itself is . Sixteen products, and the letters add coordinate-wise every single time, without exception. The scattered ’s and signs are trailing decoration that the labels never see.

This situation has a name. A rule satisfying multiplication matching addition up to a phase factor, is called a projective representation of the group. The name should not suggest something second-rate. Quantum mechanics never cared about overall phases in the first place: a state and its phase-rotated copy answer every measurement identically, so representation up to phase is the native quantum notion of realizing a symmetry, not a defect of our particular matrices. And the aside above says the projective escape hatch is not merely permitted here. It is the one door that counting left open.

Coordinates in hand, we can finally say which copiers deserve them. A channel is linear, so it is pinned down by what it does to a basis; this is the move we used on the corners of the simplex, and we now use it on the quartet. A generic qubit channel that fixes the centre sprays each Pauli across all three Pauli directions, a grid of numbers, nine parameters with no structure to hold on to, and the coordinates we just built play no role in it whatsoever. The channels worth keeping are the ones that respect the labels, sending each Pauli to a multiple of a single Pauli: where shuffles the three letters and each is a plain number. In group language: the channel leaves the structure we built invariant, mapping the representation onto itself instead of dissolving it. Geometrically: axes go to axes, possibly shrunk, never smeared. These are the Clifford channels.⁶

So a Clifford channel is two pieces of data. The skeleton : one of the six ways to shuffle three letters, a finite list. And three numbers : one scale factor per axis. The requirement is our standing rule that the centre stays fixed, nothing new. The scale factors, though, are less free than they look. A channel maps states to states, and since every Hermitian matrix is a real combination of states, it maps Hermitian to Hermitian; with all four basis matrices Hermitian, each must be real. Feeding in the pure state produces , which is a legal state only if : scale factors live between and . Hold on to the reality of the scale factors, by the way. It looks like a convenience. At the end of the section it will reveal itself as a symmetry with a price tag attached.

Necessary is not sufficient, and honesty requires the flag: complete positivity, the condition that makes a linear map a channel, applies to this family as it did to the whole space. The old checklist splits here exactly as it always has: normalization is built in (, and traces are preserved by the label bookkeeping), while the positivity half is the fee. Not every setting of skeleton and scale factors is a lawful channel, and no amount of tidy bookkeeping waives that fee. What the small room changes is how the fee gets paid: by inspection, not by an estimate. For the one channel this section is hunting, we will exhibit lawfulness outright, no criterion needed.

The family is small, but everything this post has met so far is already inside it. Three exhibits.

First, the classical copier, lifted. Flip the qubit with probability : that is the channel . Conjugating by leaves itself alone and flips the sign of and of (two quick visits to the multiplication table: and ), so the mixture has skeleton and scale factors . Restricted to the vertical diameter it multiplies by : exactly the classical copier we translated at the start. The lift is faithful.

Second, the reversible members. Conjugation by alone is the case : scale factors , nothing shrunk, two axes reflected. Conjugation by the Hadamard gate , the unitary that exchanges the roles of and , gives the first nontrivial skeleton: swaps and fixes , with scale factors . Negative scale factors are legal, and reversible Clifford channels are precisely the famous Clifford gates, met here in channel clothing.

Third, total erasure itself. Set every scale factor to zero. Each Pauli dies, every Bloch vector is sent to the origin, and is the completely depolarizing channel itself, whatever the skeleton. The object we want roots of is a member of the family. The hunt can begin at home.

Apply a Clifford channel twice, and watch the bookkeeping run itself: and likewise for the other letters. Nothing new is ever created. Each letter walks, one step along per application of the channel. And the scale factors multiply along the walk: after steps a letter carries the product of the scale factors it collected on departure. Meanwhile is the channel that kills all three letters. So The channel question has become a question about walks on three points and products of numbers along them. This is the reduction the whole post has been steering toward, and it will survive word for word when three letters become .

One consequence is immediate, and it echoes the classical bit. Scale factors are real numbers, and a product of nonzero numbers is never zero. A walk’s product dies only by stepping on a zero scale factor. Erasure, in this family, is not a gradual conspiracy of small numbers. It happens exactly where the zeros are.

And now the hunt fits in three short paragraphs, because a shuffle of three letters has only three possible shapes.

The skeleton could fix all three letters. Then each letter walks in place, multiplying its own scale factor over and over, and dying forces that scale factor to be zero. All three scale factors zero means from the very start. This is the classical bit’s tragedy, tripled: no roots live here.

The skeleton could swap two letters and fix the third. The fixed letter needs its own zero, as before. The swapped pair walk into each other, so at least one of their two scale factors must vanish, and then both of those walks are dead within two steps. Order two at best: a square root of erasure, the quantum sibling of the classical construction, and nothing more.

Or the skeleton could cycle all three letters. Now a single zero serves everybody, because every walk eventually passes through it, and the walks reach it at different times. Put the zero on , keep the other two scale factors alive at one half: dies immediately. steps onto and dies departing it: two steps. takes the long way round, and it pays to compute it once in full: So , while : the quarter of still alive at step two is the witness. Order exactly three.

Three is the ceiling for the entire family, because the survey was exhaustive: no shuffle of three letters offers a longer walk to a zero. And three is at . Read that twice. The tiny, rigid family, six skeletons and three scale factors, reaches the same maximal order that the whole quantum machinery allows. Nothing was lost by retreating into the small room (Figure 6).

You have seen this channel before. On Bloch vectors it sends to , which is the three-step eraser of Figure 4, the one the previous section produced without explanation. Its , then , then stages are nothing but the walk around the cycle, one axis per step, and the cycle itself is the very one drawn on the right panel of Figure 5. What arrived last section as a rabbit from a hat is, in coordinates, a two-line design: spend one zero, take the longest walk. (The halves are a choice with a ceiling of their own: the two surviving scale factors cannot sum to more than one, so ours sit exactly on the boundary of what is allowed.⁷)

One debt remains, and it is the decisive one. A linear map of the right order is not yet a channel: complete positivity still has to be checked. Our is, so far, four tidy equations. Is it physical?

Here is the same wearing different clothes. Let be the rotation of the Bloch ball by a third of a turn about the diagonal axis through , oriented so that it carries the -axis onto the -axis, the -axis onto the -axis, and the -axis onto the -axis. Then In words: flip a three-sided coin with weights one half, one quarter, one quarter, and depending on the outcome apply one of three rotations to the qubit: , or followed by an -flip, or followed by a -flip. That is the entire channel. A mixture of unitaries is a channel beyond any possible doubt: each branch is reversible physics, and forgetting the outcome of a coin flip cannot break positivity, complete or otherwise. Lawfulness by inspection. The fee the general construction paid with a shrinking factor and a Choi-matrix estimate is paid here, in the small room, with a coin and three rotations.

Two loose threads remain, both deliberately left dangling, both pointing straight at the next section.

First, a free pass we quietly enjoyed. We called a shuffle and never demanded that it respect the labels’ arithmetic. It did so anyway, automatically: send two of the three letters wherever you like, and their sum, which is always the third letter, has nowhere to go but the remaining slot. Every shuffle of three letters is compatible with the addition of labels. That is a coincidence of the smallest case, and it expires immediately. In the next section the label plane has eight nonzero points, and of the ways to shuffle eight points, exactly respect the addition of labels. The relabelling will have to be linear, and that phrase, a linear map on a plane of labels, is the door through which the finite-field machinery enters.

Second, look once more at where we spent the zero. It sits at the label . What is the negative of that label? In arithmetic modulo , where , every label is its own negative: . That innocent-looking fact has been working for us all section. The general rule, visible in the next section, is that the scale factors at a label and at its negative are complex conjugates of one another; here every label is its own mirror, which is why our scale factors merely had to be real, and why a single zero came for the price of one. For odd , a label and its negative are different points, and every zero will drag its mirror partner down with it: two zeros, minimum, cutting the longest walk short. That coincidence, quietly worth a factor of two, is the last thing the qubit gives us for free.

Clifford channels in higher dimensions

The qubit section ended by flagging two pieces of luck: every shuffle of three letters respected the label arithmetic on its own, and every label was its own mirror. Neither survives in higher dimensions, and this section is where both bills arrive. Paying them is not a chore. The first payment turns the relabelling into a linear map on a finite plane, which is where the finite fields promised at the very start of the post finally walk on stage. The second cuts the achievable order cleanly in half, and that factor of two is the punchline the whole post has been walking toward.

The play itself you have already watched. Build labelled matrices, keep the channels that respect the labels, reduce to walks and scale factors, then design the slowest possible eraser. Only the stage grows.

Start with the cast. A system with levels has a density matrix, and the counting from the quantum section says a basis of everything needs matrices. So we need labels: pairs , each coordinate now running and wrapping around, addition modulo in both slots. The labels fill a grid, the label plane, and we write for a point of it when the pair travels as one thing. Note what the count buys: the nonzero labels are exactly one per traceless direction, the directions the CDC has to kill. Nothing is wasted and nothing is missing.

The two generators grow up along with the labels. For a bit, the flip swapped two states; for levels the natural move is add one and wrap around, the odometer step. Its companion kicks in phases instead of positions. For : with a corner of the unit triangle in the complex plane, a cube root of one. For general the same recipes run with slots and , and : applications of either is a full lap. The matrix at label is the product , just as it was for the qubit.

Multiply the generators in both orders and watch the qubit’s sign grow up too: Same matrix, and the memory of the order is now a full -th root of unity rather than a sign: the trailing phase has become a -hour clock. Everything else holds: the products multiply by adding labels, up to such a phase, and they form a basis of all matrices, so a channel is still pinned down by what it does to them.

One piece of grooming, and it is the same grooming as before. At the qubit stage we multiplied the odd sibling by to restore the family resemblance. The general recipe sprinkles a square root of in front: Read as “half of the label product , on the -clock”, which makes sense because can be divided away modulo an odd number. For odd this square root already sits on the -hour clock; at it does not, which is why the qubit had to borrow from outside. The mysterious grooming of the last section was this convention all along.

What the grooming buys has changed, though. For no phase makes Hermitian, so the qubit’s luxury of an all-Hermitian basis is simply gone. What survives is the next best thing, a mirror symmetry: the adjoint of the matrix at is the matrix at the opposite label , on the nose, no stray phase (checked in the aside below). Keep that mirror in view. It is the second debt from the qubit section, and it will collect at the very end.

And now the fine print that has been riding along quietly: from here on, must be a prime. The grooming already divided by ; everything below divides by worse. Modulo a prime, every nonzero number can be divided away, and the integers modulo form a field, written , an arithmetic where division works as cleanly as addition. Modulo a composite the floor gives way: mod , for instance, , and a “plane” over such an arithmetic has lines that collapse. So the label plane is , a plane over a field, and the linear algebra we are about to do on it can be trusted. (Prime powers have a parallel story over their own finite fields; genuinely composite is murkier territory, and the theorem below is a prime- theorem.)

Here is the family, at full scale. A Clifford channel in dimension sends each labelled matrix to a multiple of one labelled matrix: with a relabelling of the plane fixing , and one scale factor per label, complex now, sizes at most one. (At the qubit stage we earned that size bound by feeding a state through the channel. Here the labelled matrices are no longer Hermitian, and that trick only delivers a slightly weaker bound. The sharp one is complete positivity’s doing, and the aside on the CP criterion later in this section records the one-line argument.) But here the first debt falls due. For three letters, any shuffle respected addition on its own. On a bigger plane that is spectacularly false, and respecting the group structure, , forces to be linear: an invertible matrix with entries in , acting on label pairs. (Invertible, because a relabelling worthy of the name must not crush two directions into one. The count: the first column can be any of the nonzero pairs, the second anything off the line through the first, choices. For that is maps for shuffles, which is why every qubit shuffle passed for free. For it is , against shuffles of the eight nonzero labels: the collapse promised last section.)

The scale factors are constrained the same way they were for the qubit, with the mirror doing the work Hermiticity used to do. A channel maps Hermitian to Hermitian (real combinations of states, as before), and chasing that through the mirror symmetry gives the mirror rule: The scale factor at a label and the scale factor at its mirror are complex conjugates. At , where , this collapses to “scale factors are real”, which is exactly what we found. And complete positivity is still to be checked: not every is a lawful channel. The fee gets paid at the end of the section, with the same coin that paid it classically.

The reduction now carries over word for word, as promised. Apply repeatedly and nothing new is ever created: each label walks, one step of per application, and the scale factors multiply along the walk: is the channel that kills every nonzero label, so exactly when every label’s -step product has died, and a product of nonzero numbers never dies, so every walk must step on a zero of . Since is invertible it chops the nonzero labels into closed cycles, and the game is suddenly a board game: mark some squares with zeros, subject to the rules, and ask how long the luckiest token stays alive, where a token dies on the turn it departs a marked square, since the scale factor is applied on departure. Two questions decide everything. How long can a cycle be? And how few marked squares can we get away with?

Take the cycle question first. The best imaginable would sweep all nonzero labels in one grand cycle, and it is not obvious such a linear map exists: linearity is a strong leash. The reason it exists is the loveliest structural fact in this post: the label plane is secretly a number system. Recall how the complex numbers are built from the reals: the equation has no solution, so you adjoin a symbol that solves it, and pairs close up into a field. Now run the same construction over . The polynomial has no root there (its values at are ), so adjoin a symbol that solves it, and consider all expressions with . There are nine of them, they add and multiply like ordinary numbers (reducing via the rule above), and they form a field with nine elements, written . But pairs are exactly our labels: the label plane and the field are the same set. The plane we have been drawing points on all along can secretly multiply.

That changes everything, because now “multiply by ” is a candidate relabelling. It is linear in , since multiplication distributes over addition. Its matrix is read off column by column: sends to , and sends to , so And its cycle structure is a question about powers of . Compute them, reducing with as you go: Pause on that last line. In , the number is : four multiplications by amount to a single overall sign flip. Squaring once more, , and no earlier power returns to (the powers visibly involve , and ). So has order exactly : its powers are eight different nonzero elements, and there are only eight to be had. The powers of visit every nonzero label exactly once. Translated back to pairs, the matrix drives the whole plane around one grand cycle, which is the ring drawn in Figure 7. An element like , whose powers exhaust every nonzero element, is called a generator, its minimal polynomial is called a primitive polynomial, and the matrix built from it is that polynomial’s companion matrix. Generators exist for every prime , not just , and the aside below proves it from scratch, so a grand cycle of length is always available.

So cycles can be as long as , and one marked square per cycle is the least the rules could possibly demand. If that were the end of the story, the Clifford family would match the full quantum bound in every dimension: put the single zero on the grand cycle, and the slowest token, starting just after it, walks the whole ring and dies only on turn , the turn it must depart the zero itself. For the qubit, that is exactly what happened.

Here the second debt falls due. Zeros of cannot be placed one at a time, because the mirror rule pairs the scale factors up: , so where one scale factor dies its mirror dies with it. For the qubit this cost nothing, since every label was its own mirror. But for odd , a nonzero label and its mirror are always different points ( would mean , and modulo an odd prime you can divide the away, leaving ). Zeros now come in genuine pairs: mark one square and a second square is marked for you, whether you wanted it or not.

And the geometry of the grand cycle decides where that unwanted second zero lands. The mirror map is multiplication by , and on the cycle of we have already met : it is , the halfway point. (That is no accident of : the element satisfies while , and in a field the equation has no room for solutions beyond and .) So the mirror of any label sits exactly half a cycle away, diametrically opposite on the ring, just as Figure 7 shows. Mark the square , and the rules mark : not adjacent, not random, but precisely antipodal, cutting the grand cycle into two arcs of length exactly each. The slowest token starts just after either zero and walks the far arc, alive after every turn but the last, dying exactly on turn the turn it must depart the other zero, and not one sooner. The mirror rule has taken the qubit’s gift back, and it has taken exactly a factor of two.

Assemble the channel and settle its legality. Take the companion matrix of a primitive polynomial, and set the scale factors to with a small positive number. The mirror rule holds ( is real, and mirrors carry equal scale factors), the walk products die exactly as the arcs dictate, so while : the token that started just after a zero is still alive, carrying , as the witness. And complete positivity, the fee the qubit section paid with a coin flip of three rotations, is where the Clifford family shows its final virtue: here the condition has an explicit face. A Clifford channel is completely positive exactly when a single matrix assembled from the scale factors is positive semidefinite, and a classical eigenvalue theorem turns that condition into a simple sufficient condition on the absolute values of the scale factors: If the absolute values of the scale factors sum to at most one, the channel is lawful. Our root sets on the surviving labels, so every satisfies the condition, and the order of the root never cared how small is. The aside shows the criterion and derives the sufficient condition; the exact boundary of legality is a genuinely harder computation, and for that the thesis does the honest work.⁹

One suspicion should still be nagging. The construction used a very particular and the stingiest legal set of zeros. Could a cleverer , or a cleverer placement, beat one half? It cannot, and the reason is pleasantly structural: however the board is set up, either the two zeros of a pair share a cycle, and symmetry pins them opposite each other, or they sit in two different cycles, and then each cycle is at most half the plane anyway. Both roads cap the survival time at .

That is the theorem this post set out to retell. For every odd prime there is a Clifford channel whose order is exactly , and no Clifford channel does better. The qubit stays the lone exception: there the mirror degenerates, the pairing costs nothing, and the family reaches the full , as we watched it do.

Line the three answers up for a three-level system. A classical copier can stretch erasure to steps. The full quantum bound is . And the Clifford family, rigid as it is, manages : half of everything quantum mechanics allows, from a corner of it that you can hold in your hand.

Step back and look at where the room came from. We began with the full space of quantum channels, a space whose dimension grows like , and found the bound . We then threw essentially all of that freedom away. What survived was one invertible matrix over a finite field and a handful of scale factors, and the achievable order fell only from to . The room to divide erasure slowly never lived in the richness of the channel family. It lives in the orbit structure of a linear map on a tiny plane: in how long one matrix can wander labels before a mirror-forced pair of zeros cuts the journey in half. Slow forgetting is not an exotic quantum resource. It is finite-field bookkeeping, and you can check every step of it with a pencil.

What’s next

One loose thread remains: the factor of two. Is the end of the story, or just the end of the Clifford story? It is only the Clifford story, and the post has already shown as much: the aside in the quantum section shrinks a nilpotent block into a lawful channel of the full order , in every dimension. That construction gives up the tidy Weyl structure we leaned on, works directly at the level of the channel’s representation, and never meets a mirror pair, which is why no factor of two appears in it.¹⁰ One caution against a wrong impression the shrinking might leave: maximal roots are not condemned to huddle near total erasure. In every dimension there are maximal roots sitting at a distance from that does not shrink as the dimension grows, and our qubit root, with its two scale factors at one half, was never a small perturbation to begin with.

Historically the discoveries ran in the opposite order from this post. Complete positivity kept the general construction out of reach for most of my thesis: a Jordan block hands you a linear map of the right order, and it was long unclear that a bound-saturating block could be shrunk into a lawful channel without losing its order. The Clifford family was the smaller room where the question first yielded, and the general root arrived only at the very end. That more general result subsumes the Clifford one, which is why the Clifford construction does not appear in the final paper. I wanted to write it up anyway, because it is the cleanest place I know to actually see the finite-field representation theory at work. In the general construction the orbit structure is buried inside linear algebra over . Here it sits on the surface: a point hopping around a plane of labels, a matrix of order , and a single symmetry that costs a factor of two. The whole argument fits in the palm of your hand, and you can check the case by stepping around an eight-point cycle with a pencil.

There is one more way to read these numbers, and it closes a loop opened at the very start of the post: the device that carries a private memory from one use to the next, and is strictly forgetful when that memory is provably purged after finitely many uses. A qubit memory can survive for at most three uses. A Clifford memory of odd prime dimension can survive for , and the most stubborn quantum memory of all for . After that, the influence of how the memory began is not merely small. It is gone.

Here is the scoreboard of Table 1 with its third column filled in.

	Classical	Quantum	Clifford
Copiers considered	bistochastic matrices	channels fixing the centre	channels sending each labelled matrix to a multiple of one labelled matrix
Free parameters			one invertible matrix over , plus scale factors
The condition with teeth	non-negative entries	complete positivity	complete positivity, as positivity of one matrix of scale factors; sufficient: their absolute values sum to at most one
Largest order			for odd prime ; at ; open for composite
Reached by	a nilpotent on the deviations, scaled gently	a nilpotent on the traceless operators, shrunk until the Choi matrix stays positive	a grand cycle of the label plane with zeros on one mirror pair, a small everywhere else
Seen in action	, two steps (Figure 2)	, three steps (Figure 4)	, three steps (Figure 4); , the eight-point ring (Figure 7)

One thread I never pulled: the Clifford result is a prime- result. Prime powers should tell a parallel story over their own finite fields, and genuinely composite , where the label plane is no longer a plane over a field, is territory I never found the time to look at.

The full development, including the classical and general quantum bounds and the Clifford channels above, is in my diploma thesis.¹¹

Page views: …