The physics of classical information storage. Why is it that your hard drive works? A modern miracle, I tell you! Part III of my attempt to explain one of my main research interests in quantum computing: “self-correcting quantum computers.” Prior parts: Part I, Part II
Continue reading “Self-Correcting Quantum Computers, Part III”
Self-Correcting Quantum Computers, Part II
Why is classical computing possible at all? A silly question, but one which never ceases to amaze me. Part II of my attempt to explain one of my main research interests in quantum computing: “self-correcting quantum computers.” Prior parts: Part I
Continue reading “Self-Correcting Quantum Computers, Part II”
Self-Correcting Quantum Computers, Part I
Quantum computing is hair-brained, but then again so is classical probabilistic computing. Part I of my attempt to explain one of my main research interests in quantum computing: “self-correcting quantum computers.”
Continue reading “Self-Correcting Quantum Computers, Part I”
We Don't Need Another Hero
I knew there was a reason I called this blog “The Quantum Pontiff.” Amazon-ing my name:
QEC 07 Videos Online
Interested in quantum error correction (who isn’t!) Daniel Lidar informs me that the talks from the QEC07 conference are now all available online.
Continue reading “QEC 07 Videos Online”
The Smell of Bacon in the Morning
Me, personally, I wake to the smell of Bacon every morning. But others may need help. Here it is: the Wakin’ with Bacon alarm clock.
Action Dog to the Rescue
No fun must go on without the dogs participation, of course:
A Dog's View
Surveying the queen’s domain:
Count the Headlights on the Highway
Yep, it’s paper dance time. This one is less of a dance and more of a shuffle:
arXiv:0808.0174 (scirate)
Title: Simon’s Algorithm, Clebsch-Gordan Sieves, and Hidden Symmetries of Multiple Squares
Author: D. Bacon
Abstract: The first quantum algorithm to offer an exponential speedup (in the query complexity setting) over classical algorithms was Simon’s algorithm for identifying a hidden exclusive-or mask. Here we observe how part of Simon’s algorithm can be interpreted as a Clebsch-Gordan transform. Inspired by this we show how Clebsch-Gordan transforms can be used to efficiently find a hidden involution on the group G^n where G is the dihedral group of order eight (the group of symmetries of a square.) This problem previously admitted an efficient quantum algorithm but a connection to Clebsch-Gordan transforms had not been made. Our results provide further evidence for the usefulness of Clebsch-Gordan transform in quantum algorithm design.
Yet another step in my ever increasing quest to become a lone author lunatic (er, lunatic!) of quant-ph. Next step is obviously Microsoft Word only arXiv postings.
Bonus points for identifying the song, of course.
The Bar Scene
Someone at Caltech’s PR office sure was having fun:
Caltech Astronomers Describe the Bar Scene at the Beginning of the Universe
PASADENA, Calif.–Bars abound in spiral galaxies today, but this was not always the case. A group of 16 astronomers, led by Kartik Sheth of NASA’s Spitzer Science Center at the California Institute of Technology, has found that bars tripled in number over the past seven billion years, indicating that spiral galaxies evolve in shape.
Oh, I can tell you all about the bar scene near Caltech. Dive bar: The Colorado. Beer for graduate students: Lucky Baldwin’s. Quantum margarita night: Amigos. Quantum beer night: drive five hours north to Albatross in Berkeley, CA.