4

In Classical Simulation of Quantum Error Correction in a Fibonacci Anyon Code, the authors state on page 2 in section I. Background, A. Topological model:

We consider a system supporting nonabelian Fibonacci anyon excitations, denoted by $\tau$. Two such anyons can have total charge that is either $\tau$ or $ \mathbb I$ (vacuum), or any superposition of these, and so the fusion space in this case is 2-dimensional. We can represent basis states for this space using diagrams of definite total charge for the Wilson loops, and arbitrary states as linear combinations of these diagrams: Definite total charge for the Wilson loops.png

For $n$ anyons of type $\tau$, the dimension of the fusion space grows asymptotically as $\varphi^n$, where $\varphi$ = $\frac{1+\sqrt 5}{2}$ is the golden ratio.

Observables associated with non-intersecting loops commute, and so a basis for the space can be built from a maximal set of disjoint, nested loops.


Finally, in "Coherence Frame, Entanglement Conservation, and Einselection" the authors state on page 3:

Preferred basis problem. From the method of CF, we discuss the preferred basis problem (PBP), which has been studied via the einselection approach [7, 8]. We will show, yet, the method of einselection is incomplete.

This method is described via the Stern-Gerlach experiment, as shown in the Fig. 1 of Ref. 7. The system is represented by the spin states (up and down) along some directions. One atom is put near one channel to serve as the apparatus to interact with the spin, causing entanglement. In this measurement, the PBP means that there is no physical difference between states

We also demonstrated that the preferred basis problem can be resolved more naturally by the method of coherence frame than the einselection method.

Question: Are there different bases for each part of the model. Is there a preferred basis for a qudit or does it depend upon the underlying technology used to implement the qudits. How is the basis integral to the control and measurement?

Note: This may be related to, but is not a duplicate of: What is meant by the term "computational basis"?, nor is one of the answers currently offered there an answer to this question.


Initially, efforts where made to address some comments but this only succeeded in making the question longer and less clear, I've stripped it down but the edits can be reviewed by the curious in the edit history.

Adam Zalcman
  • 25,260
  • 3
  • 40
  • 95
Rob
  • 2,339
  • 1
  • 16
  • 30

2 Answers2

4

You may be confusing two uses of the word "base". One definition of "base" has to do with how many digits are used to represent a number. For example, base two uses the digits 0 and 1, and the number five is written as 101 in base two. But in quantum mechanics there is another use of the word "base" which has to do with basis vectors for a vector space. This is almost entirely unrelated to the "base" of a number system.

I see that once you start talking about qubits versus qudits there is further confusion. Perhaps you could try thinking of a qubit as a two dimensional space, and the basis within that space as giving a preferred "direction", or coordinate axes. Similarly, a qutrit is a three dimensional space, etc. (This is a geometric intuition that might help you get started with thinking about quantum states, it needs some more work before it is precise.)

Simon Burton
  • 658
  • 3
  • 7
3

The preferred basis problem is essentially something from the many worlds interpretation: If we are to interpret a superposition as representing many universes, what basis should we choose? Since this comes from the foundations of QM, this aspect of your question is perhaps better suited to the physics stack exchange.

Is there a preferred basis for a qudit or does it depend upon the underlying technology used to implement the qudits.

For qudits (and qubits) the only distinction between bases is in the physical implementation. At the abstract mathematical level, all are equivalent.

This not only means that you are free to choose your computational basis. You also have some freedom in how to generalize the Pauli matrices. For a $d$ level qudit, for example, you could choose to label your basis states with the elements of a group with order $d$. Your can then define generalizations of Pauli $X$ that implement the group multiplication, and generalization of $Z$ that depend on the representations. See here for some examples.

How you choose to do this might depend on the physics of the qudits (perhaps the interactions naturally implement such operations) or it might depend on what you want to do with the qudits (such as create exotic topological error correcting codes). But other than concerns like these, nothing is forcing you to make any particular decisions.

Usually we choose the basis that is easiest for us to measure. Superconducting qubits/qudits for examples are made from the lowest $d$ levels of an anharmonic oscillator. These energy eigenstates are what we typically measure, and that is the reason they are used as the computational basis.

For Fibonacci anyons, we have to deal with a Hilbert space that isn’t really built for being carved into qubits. Typically we take a subspace for which measurements aren’t too convoluted. But then we also need to worry about braiding leaking the state out of the subspace. This gives us a whole bunch of practical concerns to think about when choosing our basis. But nevertheless, it is only these practical concerns that lead to a preferred choice, and different authors may very well choose different conventions.

James Wootton
  • 11,700
  • 1
  • 35
  • 74