An amazing book talk about quantum computing, I absorbed portion of this book because of my short for computing science and mathematics knowledge, especially for linear algebra, abstract algebra, computational complexity, and leave the other portion for next time reading again
Quantum computing is a distant field to me, I read this book because my friend ask me for some learning materials at this field, so I find some for him, glance an article say:
Loops and conditional branching are indispensable tools in classical computer programming. How can we possibly get along without them? Anyone building a pure quantum computer will have to confront this difficult question. As a practical matter, however, the answer is: Don’t build a pure quantum computer. Build a classical computer with a quantum subsystem, then create appropriate software for each part.
Quite interest, remind me the article Finally, a Problem That Only Quantum Computers Will Ever Be Able to Solve:
Early on in the study of quantum computers, computer scientists posed a question whose answer, they knew, would reveal something deep about the power of these futuristic machines. Twenty-five years later, it’s been all but solved. In a paper posted online at the end of May, computer scientists Ran Raz and Avishay Tal provide strong evidence that quantum computers possess a computing capacity beyond anything classical computers could ever achieve.
So I ‘shut up and read’ this book to help me know more about quantum computing, hopefully one day I have change to learn more in this field
Author Scott Aaronson’s talk at Y Combinator, he said he blog in this area for 15 years:
