The Problem of Finding A Maximal Set of MUBs When d = 6
The smallest dimension that is not an integer power of a prime is d = 6. This is also the smallest dimension for which the number of mutually unbiased bases is not known. The methods used to determine the number of mutually unbiased bases when d is an integer power of a prime number cannot be used in this case. Searches for a set of four mutually unbiased bases when d = 6, both by using Hadamard matrices and numerical methods have been unsuccessful. The general belief is that the maximum number of mutually unbiased bases for d = 6 is .
Read more about this topic: Mutually Unbiased Bases
Famous quotes containing the words problem, finding and/or set:
“To make a good salad is to be a brilliant diplomatist—the problem is entirely the same in both cases. To know exactly how much oil one must put with one’s vinegar.”
—Oscar Wilde (1854–1900)
“As a father I had some trouble finding the words to separate the person from the deed. Usually, when one of my sons broke the rules or a window, I was too angry to speak calmly and objectively. My own solution was to express my feelings, but in an exaggerated, humorous way: “You do that again and you will be grounded so long they will call you Rip Van Winkle II,” or “If I hear that word again, I’m going to braid your tongue.””
—David Elkind (20th century)
“We Russians have assigned ourselves no other task in life but the cultivation of our own personalities, and when we’re barely past childhood, we set to work to cultivate them, those unfortunate personalities.”
—Ivan Sergeevich Turgenev (1818–1883)