Best Title Ever Competition: Quantum Flatland Edition

Today, I looked on the arxiv and found arXiv:0804.0272:

arXiv:0804.0272
Quantum computing using shortcuts through higher dimensions
Authors: B. P. Lanyon, M. Barbieri, M. P. Almeida, T. Jennewein, T. C. Ralph, K. J. Resch, G. J. Pryde, J. L. O'Brien, A. Gilchrist, A. G. White

and nearly fell out of my chair. What an awesome title. A least for me, when I first parsed the title of the paper, the first thing that popped into my head was using spatial dimensions to speed up quantum computation (as opposed to using higher dimensional quantum systems.) Gots to get me some string theories to build my quantum computer :) (Oh and the paper is pretty cool as well!)

Categories

More like this

If I good understand, quantum gates C-NOT and Tofoli was doen, but to perform quantum algorithm need too much such gates and this couse inperfection at very high level?

This is abstract Math, but maybe it's worth coming up with a Quantum Physics application:

Ham Sandwich with Mayo: A Stronger Conclusion to the Classical Ham Sandwich Theorem
Authors: John H. Elton, Theodore P. Hill
Comments: 5 pages, no figures
Subjects: Metric Geometry (math.MG); Probability (math.PR)

The conclusion of the classical ham sandwich theorem of Banach and Steinhaus may be strengthened: there always exists a common bisecting hyperplane that touches each of the sets, that is, intersects the closure of each set. Hence, if the knife is smeared with mayonnaise, a cut can always be made so that it will not only simultaneously bisect each of the ingredients, but it will also spread mayonnaise on each. A discrete analog of this theorem says that n finite nonempty sets in n-dimensional Euclidean space can always be simultaneously bisected by a single hyperplane that contains at least one point in each set. More generally, for n compactly-supported positive finite Borel measures in Euclidean n-space, there is always a hyperplane that bisects each of the measures and intersects the support of each measure.