Explore >> Select a destination
|
You are here 
|
scottaaronson.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,... | |
| | | | |
windowsontheory.org
|
|
| | | | | (Also available as a pdf file. Apologies for the many footnotes, feel free to skip them.) Computational problems come in all different types and from all kinds of applications, arising from engineering as well the mathematical, natural, and social sciences, and involving abstractions such as graphs, strings, numbers, and more. The universe of potential algorithms... | |
| | | | |
rjlipton.com
|
|
| | | | | Further discussions of the proof that factoring is in BQP Scott Aaronson is a, if not the, world expert on quantum computation. He writes, as you all know, one of the best blogs on quantum and many more things. Today I and Ken want to make a short summary on the last discussion: is factoring... | |
| | | | |
2016.splashcon.org
|
|
| | | OOPSLA seeks outstanding contributions on all aspects of programming languages and software engineering. Papers may target any stage of software development, including requirements, modeling, prototyping, design, implementation, generation, analysis, verification, testing, evaluation, maintenance, and reuse of software systems. Contributions may include the development of new tools (such as language front-ends, program analyses, and runtime systems), new techniques (such as methodologies, design processe... | ||
