Now on ScienceBlogs: The Galaxy's Biggest Valentine

ScienceBlogs Book Club: Inside the Outbreaks

Search

rss.jpg   Subscribe to RSS feed

Follow dabacon on Twitter

Profile

davidog.pngDave Bacon is a theoretical ski bum who is also a pseudo professor. His research is on quantum computing, his scientific passions extend to everything in physics, mathematics, computer science and beyond, and his personal pleasures include making wine, playing poker, skiing, camping, and daydreaming (although not all of those at the same time.) Nothing he says on this blog should be construed as having anything to do with his employer or his dog.


Recent Comments

Recent Posts

Other Information

The use of Occam's razor on this website is strickly prohibited.

Cows are well approximated by a sphere.
rss.jpg   Subscribe to RSS feed

Follow dabacon on Twitter

« Let's Make Them Fight Each Other | Main | An ArXiv PDF Mime Fix for Firefox 3.0 »

Best Title Ever Competition: Quantum Flatland Edition

Category: Best Title EverQuantum Computing
Posted on: April 3, 2008 1:50 PM, by Dave Bacon

Share:

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!)

Share on Facebook
Share on StumbleUpon
Share on Facebook
Find more posts in: Physical Science

TrackBacks

TrackBack URL for this entry: http://scienceblogs.com/mt/pings/68535

Comments

1

I'll wait for the movie.

Posted by: Jonathan Vos Post | April 3, 2008 9:28 PM

2

Glad you like it! (The title *and* the paper, that is). Now if only you were one of our referees...

Posted by: Andrew | April 4, 2008 3:47 AM

3

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?

Posted by: if | April 4, 2008 10:35 AM

4

Is that you "possible?"

Posted by: Dave Bacon | April 4, 2008 10:50 AM

5

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.

Posted by: Jonathan Vos Post | January 19, 2009 9:31 PM

Comments have been closed as this blog has moved to http://dabacon.org/pontiff.
Click here to search for this post on the new blog.

ScienceBlogs

Search ScienceBlogs:

Go to:

Advertisement
Follow ScienceBlogs on Twitter

© 2006-2011 ScienceBlogs LLC. ScienceBlogs is a registered trademark of ScienceBlogs LLC. All rights reserved.