2
$\begingroup$

What Hilbert space of dimension greater than 4.3e19 would be most convenient for working with the Rubik's Cube verse one qudit?

The cardinality of the Rubik's Cube group is given by:

enter image description here

Examples

66 Qubits yields ~7.378697629484e19 states (almost more than double the number of states needed)

42 Qutrits yields ~1.094189891315e20 states (more than double the needed states)

|improve this question
$\endgroup$
  • 2
    $\begingroup$ This question could be improved if you specify that you want a Hilbert space of dimension greater than that 4.3e19 such that particular operations from the previous question are implemented more easily. That would be a easier than a single qudit with that enormous d. $\endgroup$ – AHusain Aug 7 '18 at 3:21
  • $\begingroup$ @AHusain thank you for the feedback! question updated. $\endgroup$ – meowzz Aug 7 '18 at 3:49
  • $\begingroup$ A qubyte has dimension $2^8$, not 8. $\endgroup$ – DaftWullie Aug 7 '18 at 6:49
4
$\begingroup$

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 easily pick and choose your information carrier, and combine together arbitrary sets with different dimensions, and easily talk about the logic operations on them and how they all interact. This is clearly not how it works in classical: your computer only processes bits (and if you want different dimensional systems, the software can handle the conversion: see, for example, the MixedRadix function in Mathematica), and the same will be true of quantum. A particular experiment will focus on one type of information carrier, and will be able to manipulate a certain number of levels. You might be able to repeat that many times, but you won’t be combining qubits, qutrits etc. So you’ll probably be using qubits, and you just need to find the smallest Hilbert space that’s larger than the required dimension. Again, as indicated by the question, that’s 66 qubits.

Perhaps the concern is that 66 seems like a lot of qubits and we need to make that number as small as possible. Remember that computations will require error correction, which means increasing the number of qubits by several orders of magnitude. One extra qubit doesn’t matter so much on the scale of things.

|improve this answer
$\endgroup$
  • $\begingroup$ It isn't so much the extra qubit as all the extra states that are unused. Seems like a lot of pointless overhead. Also, they idea of mixing qubits, qutrits, etc has been on my mind recently & may be a seperate question soon. $\endgroup$ – meowzz Aug 7 '18 at 6:40
  • 1
    $\begingroup$ Same difference. It’s much more useful just to take the log of all these things and take that as a measure of size rather than the exponential version. $\endgroup$ – DaftWullie Aug 7 '18 at 6:41
  • 2
    $\begingroup$ Again, it’s nothing to do with quantum specifically. It comes back to classical ideas of circuit complexity. You look at complexity theory, for example, and the measure is the number of bits required to describe the problem instance, not the number of states that the register has to hold. If I wanted to store a number 0 to 9 on a computer, i’d Need to store it as bits, and I’d need 4 of them. But that wastes 6 states. Nobody loses any sleep over it. $\endgroup$ – DaftWullie Aug 7 '18 at 7:04
  • 2
    $\begingroup$ No, it's really now. Complexity classes have nothing to do with this directly (they talk about how something scales with the size of the problem instance, and there are no problem instances here), I was just using it as an example of where counting is done in terms of $n$, not $2^n$. My reason for picking this particular example was that the relevant literature (and I mean very introductory text books) will probably discuss the $n$ vs $2^n$ issue. $\endgroup$ – DaftWullie Aug 7 '18 at 7:37
  • 1
    $\begingroup$ If you ask "how hard is it to determine the mixing time or God's number of a (Cayley graph of a) group of order $O(\exp n)$, with $O(n)$ generators" that is a question about complexity classes. The number of bits/qubits to encode each element of such a group is $O(n)$. $\endgroup$ – Mark S Aug 7 '18 at 12:06

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.