Gottesman–Knill theorem (Q5588002)
Jump to navigation
Jump to search
in quantum computing, the theorem that circuits that only consist of gates from the Clifford group can be perfectly simulated in polynomial time on a probabilistic classical computer
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Gottesman–Knill theorem |
in quantum computing, the theorem that circuits that only consist of gates from the Clifford group can be perfectly simulated in polynomial time on a probabilistic classical computer |
Statements
Identifiers
Sitelinks
Wikipedia(1 entry)
- enwiki Gottesman–Knill theorem