Subscribe
The Quantum Pontiffs
Pontifex Praeteritorum
Quantum Announcements
Recent Comments
- chb on Resolution of Toom’s rule paradox
- chb on Resolution of Toom’s rule paradox
- Pontifex Praeteritorum on Resolution of Toom’s rule paradox
- rrtucci on Resolution of Toom’s rule paradox
- aram on 4 Pages
- David Poulin on 4 Pages
- Steve on 4 Pages
- Test your Intuition/Knowledge: What was Lord Kelvin’s Main Mistake? | Combinatorics and more on Test your intuition
Category Archives: General
QIP 2012 videos!
The long awaited videos from QIP 2012 are now online. Somewhat. If you see a video that you want that isn’t online, then tell the speaker to sign the release form! I’m looking at you Bravyi, Greiner, Landahl and Popescu! … Continue reading
Posted in Announcement, Conferences, General, Quantum Computing
Comments Off
A jack of two trades and a master of both
IBM, in recounting its history of arranging high-profile contests between humans and computers, describes the tension surrounding the final chess game between Deep Blue and Gary Kasparov. One of the machine’s designers “vividly remembers the final game of the six-game … Continue reading
Ghost Paper Dance!
In a belated revival of the Ghost Pontiff’s “Happy Paper Dance” ritual, I’d like to talk about the recent paper The k-local Pauli Commuting Hamiltonians Problem is in P by my student Jijiang (Johnny) Yan and his former advisor, Dave … Continue reading
Posted in General
4 Comments
|Democrat> + |Republican> / sqrt(2)?
It has long been known that party politics exhibits quantum effects. (An excerpt, that I’m sure is not retaliation for Sokal’s hoax, is “…we show evidence using the Smith et. al data that a tenet of a classical model that … Continue reading
Posted in General
4 Comments
More on the NP-hardness of inferring dynamics
The previous post on David Voss’ APS piece quibbled perhaps excessively about the definition of NP, but neglected to mention the actual subject of the piece, which was Cubitt, Eisert and Wolf’s (CEW) recent paper on the NP-hardness of extracting … Continue reading
Posted in General
3 Comments
Hardness of NP
In computer science, NP-hard problems are widely believed to be intractable, not because they have been proved so, but on the empirical evidence of no one having found a fast algorithm for any of them in over half a century … Continue reading
Posted in General, Nitpicker's Paradiso, Words
1 Comment
What increases when a self-organizing system organizes itself? Logical depth to the rescue.
(An earlier version of this post appeared in the latest newsletter of the American Physical Society’s special interest group on Quantum Information.) One of the most grandly pessimistic ideas from the 19th century is that of “heat death” according to … Continue reading
Posted in Computer Science, General, Mathematics, Physics, Science
6 Comments
Einstein was right!
And so was Sergio Bertolucci (CERN research director) when he said “I have difficulty to believe it, because nothing in Italy arrives ahead of time.” Apparently the timing error was likely caused by a loose cable (h/t rrtucci). Perhaps it … Continue reading
Posted in General
Comments Off