Explore >> Select a destination
|
You are here 
|
scottaaronson.blog | ||
| | | | |
www.kuniga.me
|
|
| | | | | NP-Incompleteness: Introduction to quantum computing and the Deutsch-Jozsa Algorithm | |
| | | | |
algassert.com
|
|
| | | | | Craig Gidney's computer science blog | |
| | | | |
windowsontheory.org
|
|
| | | | | (see also pdf version) Quantum computing is one of the most exciting developments of computer science in the last decades. But this concept is not without its critics, often known as "quantum computing skeptics" or "skeptics" for short. The debate on quantum computing can sometimes confuse the physical and mathematical aspects of this question,... | |
| | | | |
almostsuremath.com
|
|
| | | The aim of this post is to motivate the idea of representing probability spaces as states on a commutative algebra. We will consider how this abstract construction relates directly to classical probabilities. In the standard axiomatization of probability theory, due to Kolmogorov, the central construct is a probability space $latex {(\Omega,\mathcal F,{\mathbb P})}&fg=000000$. This consists... | ||
