- Amazing: Stefan Glock, Daniela Kühn, Allan Lo, and Deryk Osthus give a new proof for Keevash’s Theorem. And more news on designs.
- The US Elections and Nate Silver: Informtion Aggregation, Noise Sensitivity, HEX, and Quantum Elections.
- Avifest live streaming
- AlexFest: 60 Faces of Groups
- Postoctoral Positions with Karim and Other Announcements!
- AviFest, AviStories and Amazing Cash Prizes.
- Polymath 10 post 6: The Erdos-Rado sunflower conjecture, and the Turan (4,3) problem: homological approaches.
- Polymath 10 Emergency Post 5: The Erdos-Szemeredi Sunflower Conjecture is Now Proven.
Top Posts & Pages
- Answer: Lord Kelvin, The Age of the Earth, and the Age of the Sun
- Amazing: Stefan Glock, Daniela Kühn, Allan Lo, and Deryk Osthus give a new proof for Keevash's Theorem. And more news on designs.
- יופיה של המתמטיקה
- Sarkaria's Proof of Tverberg's Theorem 1
- The Quantum Computer Puzzle @ Notices of the AMS
- Emmanuel Abbe: Erdal Arıkan's Polar Codes
- Believing that the Earth is Round When it Matters
- 'Gina Says'
- A Breakthrough by Maryna Viazovska Leading to the Long Awaited Solutions for the Densest Packing Problem in Dimensions 8 and 24
Tag Archives: Quantum computers
Over the last two meetings of our HU quantum computation seminar we heard two talks about symplectic geometry and its relations to quantum mechanics and quantum noise. Yael Karshon: Manifolds, symplectic manifolds, Newtonian mechanics, quantization, and the non squeezing theorem. … Continue reading
Quid est noster computationis mundus? Nine months after is started, (much longer than expected,) and after eight posts on GLL, (much more than planned,) and almost a thousand comments of overall good quality, from quite a few participants, my … Continue reading
In a couple of days, we will resume the debate between Aram Harrow and me regarding the possibility of universal quantum computers and quantum fault tolerance. The debate takes place over GLL (Godel’s Lost Letter and P=NP) blog. The Debate Where were … Continue reading
Heavier than air flight of the 21 century? The very first post on this blog entitled “Combinatorics, Mathematics, Academics, Polemics, …” asked the question “Are mathematical debates possible?” We also had posts devoted to debates and to controversies. A few days ago, … Continue reading
Scott Aaronson gave a thought-provoking lecture in our Theory seminar three weeks ago. (Actually, this was eleven months ago.) The slides are here . The lecture discussed two results regarding the computational power of quantum computers. One result from this paper gives an … Continue reading
I wrote a short paper entitled “when noise accumulates” that contains the main conceptual points (described rather formally) of my work regarding noisy quantum computers. Here is the paper. (Update: Here is a new version, Dec 2010.) The new exciting innovation in computer … Continue reading
“Imagine there’s no heaven, it’s easy(?) if you try,” John Lennon Disclaimer: It is a reasonable belief (look here, and here), and an extremely reasonable working assumption (look here) that computationally superior quantum computers can be built. (This post and the … Continue reading