/explore
|
You are here 
|
windowsontheory.org | ||
| | | | |
www.scientificamerican.com
|
|
| | | | | Quantum computers would be exceptionally fast at a few specific tasks, but it appears that for most problems they would outclass today's computers only modestly. This realization may lead to a new fundamental physical principle | |
| | | | |
scottaaronson.blog
|
|
| | | | | So I've written an article about the above questionfor PBS's website---a sort of tl;dr version of my 2005 survey paperNP-Complete Problems and Physical Reality, butupdated with new material about the simulation of quantum field theories and about AdS/CFT. Go over there, read the article (it's free), then come back here to talk about it if... | |
| | | | |
rjlipton.com
|
|
| | | | | Are quantum errors incorrigible? Discussion between Gil Kalai and Aram Harrow Gil Kalai and Aram Harrow are world experts on mathematical frameworks for quantum computation. They hold opposing opinions on whether or not quantum computers are possible. Today and in at least one succeeding post, Gil and Aram will discuss the possibility of building large-scale... | |
| | | | |
blog.sigfpe.com
|
|
| | | [AI summary] The author writes a Haskell blog post exploring quantum mechanics as a generalization of probability theory by implementing and simulating quantum algorithms like the quantum Zeno effect using custom monads. | ||
