Revision as of 07:00, 11 November 2020 edit ColeDU (talk \| contribs) 61 edits I expanded the section on simulating quantum gates; specifing more carefully each part. I also put in more expantation to this section where comments sugested Tag: Visual edit ← Previous edit		Revision as of 19:12, 21 November 2020 edit undo ColeDU (talk \| contribs) 61 edits m Changed fact to belief in background. Tag: Visual edit Next edit →
Line 13: While there is no known way to efficiently simulate a quantum computer with a classical computer, it is possible to efficiently simulate a classical computer with a quantum computer. This is evident from the ~~fact~~belief that <math>BBP\subseteq BQP</math>.<ref>{{Cite journal\|last=Watrous\|first=John\|date=2008-04-21\|title=Quantum Computational Complexity\|url=http://arxiv.org/abs/0804.3401\|journal=arXiv:0804.3401 [quant-ph]}}</ref> <u>the above is a great insight but it kind comes out of no where. How does it relate to what you have already discusses or what you will discuss later on</u>

User:ColeDU/Quantum complexity theory: Difference between revisions