Quantum Circuits That Can Be Simulated Classically in Polynomial Time (Q3149866): Difference between revisions
From MaRDI portal
Created a new Item |
Set profile property. |
||
| (3 intermediate revisions by 2 users not shown) | |||
| Property / author | |||
| Property / author: Q600246 / rank | |||
| Property / author | |||
| Property / author: Leslie G. Valiant / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 09:55, 5 March 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
