| Display title | Solovay–Kitaev theorem |
| Default sort key | Solovay-Kitaev theorem |
| Page length (in bytes) | 17,836 |
| Namespace ID | 0 |
| Page ID | 56073671 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of page watchers | Fewer than 30 watchers |
| Number of redirects to this page | 1 |
| Counted as a content page | Yes |
| Wikidata item ID | Q48999814 |
| Local description | Theorem in quantum information theory |
| Central description | theorem in quantum information theory that if single-qubit quantum gates generates a dense subset of SU(2), then that set is guaranteed to fill SU(2) quickly |
| Page views in the past 30 days | |
| Edit | Allow all users (no expiry set) |
| Move | Allow all users (no expiry set) |
| Page creator | Nerd1a4i (talk | contribs) |
| Date of page creation | 20:22, 17 December 2017 |
| Latest editor | Countercheck (talk | contribs) |
| Date of latest edit | 00:22, 21 November 2024 |
| Total number of edits | 55 |
| Recent number of edits (within past 30 days) | 1 |
| Recent number of distinct authors | 1 |
| Hidden categories (4) | This page is a member of 4 hidden categories (help):
|
| Transcluded templates (47) | Pages transcluded onto the current version of this page (help):
|
| Wikidata entities used in this page | |
