We’re rewarding the question askers & reputations are being recalculated! Read more.

# Tag Info

10

For qubits, we usually base all of our operators on the Pauli matrices. Our basic gate set consists of the Pauli matrices themselves, Clifford gates like $H$ and $S$ that map between Pauli matrices, controlled operations like the CNOT that implement a Pauli on one qubit depending on the Pauli eigenstate of another, etc. For any larger $d$-dimensional ...

7

Determining whether a given state is entangled or not is NP hard. So if you include all possible types on entanglement, including mixed states and multipartite entanglement, there is never going to be an elegant solution. Techniques are therefore defined for specific cases, where the structure of the problem can be used to create an efficient solution. For ...

7

The Hilbert space dimension of $n$ qudits is $d^n$, where $d$ is the dimension of the qudit ($d=2$ for qubit, $d=3$ for qutrit, etc). So three qubits have an $8$ dimensional space, two qutrits have a $9$ dimensional space, and one $d=6$ qudit has a six dimensional space. As such, we cannot regard them as equivalent. I guess you meant to compare situations ...

7

Yes the Hilbert space is the same, but you have to choose the isomorphism $\phi : \; \; (\mathbb{C}^2)^{\otimes 2} \simeq \mathbb{C}^4$. But the different setup will mean some unitaries that will be easy to implement in one setup will be hard in the other. For example, as 2 qubits gates something like $\sigma_z \otimes 1$ will be easy. But if you write that ...

6

I am not really sure about what you mean by "unmeasuring" a qubit, but if you mean to recover the qubit that was measured by manipulating the post-measurement state then I am afraid that the answer is no. When a quantum state is measured, the supoerposition state of such is collpased to one of the possible outcomes of the measurement, and so the qubit is ...

6

To simplify things a bit, let's take a single qubit and a single qutrit for comparison. First, the amplitude damping channel (giving e.g. emission of a photon) for a qubit is $\mathcal E\left(\rho\right) = E_0\rho E_0^\dagger + E_1\rho E_1^\dagger$, where E_0 = \begin{pmatrix}1 && 0 \\ 0 &&\sqrt{1-\gamma}\end{pmatrix}, \quad E_1 = \begin{...

6

The statement in Wikipedia is very generic, and only cites this paper as a reference. Quoting from the abstract of the paper: We demonstrate that decoherence of many-spin systems can drastically differ from decoherence of single spin systems. The difference originates at the most basic level, being determined by parity of the central system, i.e., ...

6

I don't think you'll find a good visual representation. The Bloch sphere for a qubit is a particularly unique coincidence because the number of parameters to represent an arbitrary mixed state is only 1 more than the number of parameters required to represent an arbitrary pure state, and so the pure states can be thought of as the surface to a mixed state's ...

5

As suggested in your Wiki link, the way to detect an entangled state is to find a hyperplane that separates it from the convex set of separable states. This hyperplane represents what is called an entanglement witness. The PPT criterion that you mentioned is one such witness. Now to construct entanglement witnesses for higher dimensional systems is not ...

5

There is no standard name for a qudit for $d>3$. The community has mostly settled on the term qudit (but you will still find qunit or quNit, for example, using $n$ or $N$ instead of $d$ in some older papers). You will find the odd paper where an individual author will pick a name for the $d=4$ case. I’ve certainly seen ququad and ququart. But I think ...

5

The definition you give for a graph state, and in particular the quantum Fourier transform $F$ and the controlled-$Z$ operator — where we take $Z$ to be the unitary generalisation of the Pauli $Z$ operator, satisfying $Z = F XF^\dagger$ for $X$ a shift-by-one permutation operation — are all well-defined even in composite dimension. The Fourier ...

5

A logical qubit is made out of many physical qubits (or qudits), simply selecting a particular two-dimensional subspace. So you can’t make it “exclusively” out of logical qubits because they sit on top of real physical qubits. In fact, if you're thinking about a terminology of "virtual qubits", that is actually best thought of as a synonym for "logical ...

4

Quantum walks are a simple case of quantum dynamics that involves a qubit (named coin in this context) interacting with a high-dimensional qudit (named walker in this context). Almost anything in quantum optics can be thought of as "combining different qunits" as well: a photon in a superposition of many spatial modes (high-dimensional qudit), together with ...

4

This question does not need to be phrased as a quantum question. One can equally ask what classical register can be used to store a string that uniquely identifies each different configuration of the Rubik’s Cube. This is already implicitly answered in the question: you need 27 bits, 14 trits.... However, this is labouring under the assumption that you can ...

4

A fundamental difference between the two kinds of systems is that a two-qubit system can actually be in an entangled state. On the other hand, a single d=4 dimensional system does not possess entanglement, since entanglement is always defined with respect to more than one party. Consequently, for the purposes of quantum protocols that exploit entanglement as ...

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 ...

4

Without additional assumptions or context, there is no fundamental difference between an "$2^n$-dimensional qudit" and "$n$ qubits". Any "qudit system" over $2^n$ modes for some integer $n$ can be thought of as a system of $n$ qubits. Equivalently, an $n$-qubit system is nothing but a $2^n$-dimensional qudit system. The difference is in the fact that if you ...

3

Is quantum computing limited to a superposition of only two states? In theory, it is not. Keep in mind that a qubit is a quantum analogue of the classical "bit" which has only two states $0$ and $1$. In principle, there is no limit to the dimension of the state space of a quantum system. There could even be an "infinite" dimensional separable Hilbert ...

3

You can compute by measuring - see cluster-based quantum computation - but the whole thing that makes measurement different in quantum mechanics is that it destroys the superposition. It can't be undone. Once you measure, the qudit isn't in a state $|\psi\rangle = \alpha|0\rangle + \beta|1\rangle + ... +\gamma|n\rangle$ but in a state $|\psi\rangle = |0\... 3 For a pure state of 8 qubits, the Hilbert space is$2^8$dimensional. Dropping the normalization and phase information means you are left with the space$\mathbb{CP}^{2^8-1}$. Unlike a single qubit which give the Bloch sphere$\mathbb{CP}^{2^1-1}$, this is too big to draw directly. Instead one usually draws simpler spaces that capture the essential features.... 3 Yes. Just to give one example, the PPT criterion is necessary and sufficient to decide whether a state is separable for qubit-qubit and qubit-qutrit systems, but not beyond. 2 I'm not familiar with how graph states extend to qudits, so let me just answer for the specific case of qubits. Consider a graph$G$, and we create the corresponding graph state$|G\rangle$by placing a qubit on every vertex in the$|+\rangle$state, and applying a controlled-phase gate along every edge. Now, take a bipartition of$G$. On either side of ... 2 Short answer: Logical qubits are just an abstraction above physical qubits. A logical qubit is something (see after for examples) that acts like a qubit. Some examples A logical qubit can be: A single physical qubit. This is the case for most of (all?) the quantum chips currently available. In this case, the logical qubit has no advantage over the ... 2 It is incorrect to use modulo arithmetic in this context. Instead finite field arithmetic should be applied. In$\textrm{GF}(4) = \{0, 1, x, x^2\}$where$x^2 = x + 1$and conjugation of$a$is defined as$\bar{a} = a^2$. Addition, multiplication and conjugation tables are then as follows: In this picture we have$0 \equiv 0$,$1 \equiv 1$,$2 \equiv x$, ... 2 Unitary operation is revesible, but measurement is a projection operation, which is not reveaible. Think about matrix inverse, projection matrix has lower rank and does not have inverse 2 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 ... 2 There is also a difference if you consider experiments or implementations. To make a physical qubit, I need to use a two-level quantum system. Qudits than require a more complicated quantum system, e.g., with four levels for a d=4 qudit. The engineering justification for using the more complicated system would be that you than require fewer of the four-level ... 2 They are not equivalent. It can be seen by the fact that the system of$3$qubits acts on a$8$dimensional Hilbert space, the 2 qutrit system acts on a$9$dimensional Hilbert space, and the 6 level qunit acts on a$6$dimensional Hilbert space. Consequently, the nature of the states defined by each of the quantum systems is different. This dimension ... 2 For theoretical purposes, I would say that describing two qubits either as exactly that, two qubits ($\mathbb{C}^2\otimes\mathbb{C}^2$), or as a single$d=4$spin, ($\mathbb{C}^4\$) are essentially equivalent, assuming you have universal control over the whole Hilbert space, because it means you can do whatever you want. The distinction is usually most ...

Only top voted, non community-wiki answers of a minimum length are eligible