Quantum Circuits That Can Be Simulated Classically in Polynomial Time (Q3149866)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Quantum Circuits That Can Be Simulated Classically in Polynomial Time |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Quantum Circuits That Can Be Simulated Classically in Polynomial Time |
scientific article |
Statements
Quantum Circuits That Can Be Simulated Classically in Polynomial Time (English)
0 references
29 September 2002
0 references
quantum computation
0 references
Turing hypothesis
0 references
matchgates
0 references
polynomial time simulation
0 references
algebraic complexity theory
0 references
