Summer doesn't officially start here in Seattle until the fourth of July, but the summer vibe is definitely here. Which means no teaching, so it's all research all the time. But a man cannot live by his own research alone, which leads me to the vast brain dump that is the internet.
Things found...
- The Innsbruck group has a new paper out on a very cool way to shuffle ions in a trap: arXiv:0906.5335
- The info processor points to a review of power laws in finance/economics
- Via the one honest man a strangely mesmerizing history of yield curve spreads:
- It looks like a group has finally gotten to the threshold for the NetFlix prize. I'll admit it. I downloaded the data sets and spent a good day goofing around. My first algorithms were....not so good :)
- Lots of news about the recent work out of the Yale group on a two qubit superconducting device. Nature article here. The NSF PR title reads "Scientists Create First Working Model of a Two-Qubit Electronic Quantum Processor." Which is a reasonable title, due to the word electronic. DailyTech turns this into "Researchers Claim First 'Real' Quantum Processor" which is a bit of a stretch, and I'm guessing not what the authors wanted to convey. While chattahbox "Yale Researchers Create First Ever, Two-Qubit Quantum Processor" which would receive some strong debate from quite a few other experimental efforts in quantum computing
Categories
- Log in to post comments
More like this
The Optimizer has gotten tired of everyone asking him about D-wave and gone and written a tirade about the subject. Like all of the optimizer's stuff it's a fun read. But, and of course I'm about to get tomatoes thrown on me for saying this, I have to say that I disagree with Scott's assessment…
Quantum Loonies
Alán Aspuru-Guzik
Brissie to Brizzle
Cohærence*
Complementary Slackness
David Deutsch's Blog
not exactly in focus
Physics and cake
Quantized Thoughts
Quantum Algorithms
Quantum Moxie
Quantum Quandries
rdv live from Tokyo
rose.blog
Shtetl-Optimized
we don't need no "sticking" room…
Trip to Zurich for 8th Symposium on Topological Quantum Computing, Zurich 29th-31st August 2009.
Thursday 8/27 - 7:30am SEA to 3:30pm IAD, 6:00pm IAD to 8:00am ZRH. Attempt to upgrade first leg failed which is too bad as it was the international version of the 767-300 which has a pretty nice (by…
Physics World has a nice news article about a new experimental development in quantum computing, based on a forthcoming paper from the Wineland group at NIST in Boulder. I'd write this up for ResearchBlogging, but it's still just on the arxiv, and I don't think they've started accepting arxiv…
In the best brain-dumping internetty way, connected to your blog title, I'm cross-posting this from Dr. Scott Aaronson's blog.
# Jonathan Vos Post Says: Your comment is awaiting moderation.
Comment #37 June 30th, 2009 at 1:00 pm
Thank you, John Armstrong â âpontificesâ has the right tone indeed, close in semantic/syntactic space to artifices, simplices, polytope faces, ⦠The Pontifex Maximus (which literally means âGreatest Bridge-makerâ) was the high priest of the Ancient Roman College of Pontiffs. This was the most important position in the ancient Roman religion, open only to patricians until 254 BC, when a plebeian first occupied this post. If there was also a Pontifex Minimus, then there was a Lattice of Pontifices. Of course, this also makes on think of Pons Asinorum (Latin for âBridge of Assesâ) for Euclidâs fifth proposition in Book 1 of his Elements of geometry, the theorem on isosceles triangles.
just what we need, a two-bit computer... :P
Great, now we can factor numbers up to 3 (does Shor's algorithm even work for numbers that small?)
Hi Dave:
The work in the Chatterbox article is described as being conducted by "a team of Yale theoretical physicists." I thought theoretical guys only are permitted to use pencils and paper. I guess this is what happens when a theorist gets a box of crayons too. Rocky
Heh, I'd missed the "theoretical physicists" line. Those are fighting words to an experimental physicist!
sep332: You really need to go to four bit numbers before Shor's becomes interesting. Shor's algorithm can be run, I think for N=3, and it will just loop until it spits out that N is prime with high probability.