Timeline for Why have quantum circuits won out over quantum Turing machines?
Current License: CC BY-SA 4.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 28, 2020 at 9:01 | vote | accept | Gwilym | ||
| Dec 29, 2019 at 23:01 | answer | added | Juzzy | timeline score: 1 | |
| May 9, 2019 at 14:42 | comment | added | user89986 | [cont.] You might be interested in John Watrous' answer to In a Quantum Turing Machine, how is the decision to move along the memory tape made?. | |
| May 9, 2019 at 11:00 | comment | added | user89986 | In short: quantum circuits are easier to comprehend than Turing machines. Similar to why programmers don't code in machine language. Re: "I wondered if quantum Turing machines could not take full advantage of entanglement."...that doesn't make much sense as the two models are equivalent. | |
| May 9, 2019 at 10:55 | history | edited | Juho | CC BY-SA 4.0 |
typos
|
| May 9, 2019 at 10:53 | history | edited | David Richerby | CC BY-SA 4.0 |
Copy-edit
|
| May 9, 2019 at 9:45 | review | First posts | |||
| May 9, 2019 at 9:52 | |||||
| May 9, 2019 at 9:42 | history | asked | Gwilym | CC BY-SA 4.0 |