Quantum Circuits That Can Be Simulated Classically in Polynomial Time (Q3149866): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 21:53, 3 February 2024
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
