Display title | Gottesman–Knill theorem |
Default sort key | Gottesman-Knill theorem |
Page length (in bytes) | 4,158 |
Namespace ID | 0 |
Page ID | 206116 |
Page content language | en - English |
Page content model | wikitext |
Indexing by robots | Allowed |
Number of redirects to this page | 0 |
Counted as a content page | Yes |
HandWiki item ID | None |
Edit | Allow all users (infinite) |
Move | Allow all users (infinite) |
Page creator | imported>NBrushPhys |
Date of page creation | 16:01, 6 February 2024 |
Latest editor | imported>NBrushPhys |
Date of latest edit | 16:01, 6 February 2024 |
Total number of edits | 1 |
Recent number of edits (within past 90 days) | 0 |
Recent number of distinct authors | 0 |
Description | Content |
Article description: (description ) This attribute controls the content of the description and og:description elements. | In quantum computing, the Gottesman–Knill theorem is a theoretical result by Daniel Gottesman and Emanuel Knill that states that stabilizer circuits, circuits that only consist of gates from the normalizer of the qubit Pauli group, also called Clifford group, can be perfectly simulated in polynomial... |