# Quantum computing for the very curious **Covers**:: **Source**:: [Quantum computing for the very curious](https://quantum.country/qcvc) **Creator**:: [[Matuschak, Andy, Nielsen, Michael]] # Highlights ##### ^239060613 Goto: https://quantum.country/qcvc?__readwiseLocation=0%2F1%2F3%2F0%2F0%2F2%3A0%2C2%2F3%2F0%2F0%2F2%3A110#:~:text=Turing%20machine%3A%20a%20single%2C%20universal%2Ccould%20perform%20any%20algorithm%20whatsoever. ###### ^239060613q *Turing machine*: a single, universal programmable computing device that Turing argued could perform any algorithm whatsoever. ^239060613 ##### ^239060641 Goto: https://quantum.country/qcvc?__readwiseLocation=0%2F0%2F9%2F0%2F0%2F2%3A0%2C2%2F0%2F9%2F0%2F0%2F2%3A23#:~:text=Is%20there%20a%20(single)%20universal%2Csimulate%20any%20other%20physical%20system%3F ###### ^239060641q Is there a (single) universal computing device which can efficiently simulate *any* other physical system? ^239060641 ##### ^239060876 Goto: https://quantum.country/qcvc?__readwiseLocation=0%2F10%2F0%2F0%2F2%3A244%2C0%2F10%2F0%2F0%2F2%3A429#:~:text=you%20wouldn%E2%80%99t%20need%20to%20rely%2Cprove%20your%20device%20was%20universal. ###### ^239060876q you wouldn’t need to rely on informal, heuristic arguments to justify your notion of algorithm, as Turing had done. You could use the laws of physics to prove your device was universal. ^239060876 ##### ^239061111 Goto: https://quantum.country/qcvc?__readwiseLocation=3%2F27%2F1%2F1%2F3%3A197%2C5%2F27%2F1%2F1%2F3%3A235#:~:text=a%20quantum%20computer.%20Those%20quantum%2Ccomputing%20model%20than%20conventional%20computers ###### ^239061111q a *quantum computer*. Those quantum computers can do everything conventional computers can do, but are also capable of efficiently simulating quantum-mechanical processes. And so they are arguably a more natural computing model than conventional computers ^239061111