Content deleted Content added
removed the quantum query complexity section for the time being to make the page less cluttered while I'm not working on that section. |
m Added a link to the Wikipedia page on logic gates where I first mention classical gates. |
||
Line 12:
== Simulating Quantum Circuits ==
There is no known way to efficiently simulate a quantum computational model with a classical computer. This means that a classical computer cannot simulate a quantum computational model in polynomial time. However, a quantum circuit of <math>S(n)</math> qubits with <math>O(T(n))</math> [[quantum gates]] can be simulated by a classical circuit with <math>O(2^{S(n)}T(n)^3)</math> [[Logic gate|classical gates]]<ref name=":1">{{Citation|last=Cleve|first=Richard|title=An Introduction to Quantum Complexity Theory|date=2000|url=http://dx.doi.org/10.1142/9789810248185_0004|work=Quantum Computation and Quantum Information Theory|volume=|pages=103–127|publisher=WORLD SCIENTIFIC|isbn=978-981-02-4117-9|access-date=October 10, 2020}}</ref>
== References ==
| |||