"Gottesman-Knill theorem" meaning in All languages combined

{
  "etymology_text": "Named after Daniel Gottesman and Emanuel Knill.",
  "forms": [
    {
      "form": "the Gottesman-Knill theorem",
      "tags": [
        "canonical"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {
        "def": "1"
      },
      "expansion": "the Gottesman-Knill theorem",
      "name": "en-prop"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "name",
  "senses": [
    {
      "categories": [
        {
          "kind": "other",
          "name": "English entries with incorrect language header",
          "parents": [
            "Entries with incorrect language header",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "English entries with language name categories using raw markup",
          "parents": [
            "Entries with language name categories using raw markup",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "English terms with non-redundant non-automated sortkeys",
          "parents": [
            "Terms with non-redundant non-automated sortkeys",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with 1 entry",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with entries",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Quantum computing",
          "orig": "en:Quantum computing",
          "parents": [
            "Computing",
            "Quantum mechanics",
            "Technology",
            "Physics",
            "All topics",
            "Sciences",
            "Fundamental"
          ],
          "source": "w"
        }
      ],
      "glosses": [
        "A result that states that stabilizer circuits (those consisting only of gates from the normalizer of the qubit Pauli group, or Clifford group) can be perfectly simulated in polynomial time on a probabilistic classical computer."
      ],
      "id": "en-Gottesman-Knill_theorem-en-name-Ua1WR1Le",
      "links": [
        [
          "quantum computing",
          "quantum computing"
        ],
        [
          "stabilizer",
          "stabilizer"
        ],
        [
          "circuit",
          "circuit"
        ],
        [
          "gate",
          "gate"
        ],
        [
          "normalizer",
          "normalizer"
        ],
        [
          "qubit",
          "qubit"
        ],
        [
          "polynomial time",
          "polynomial time"
        ],
        [
          "probabilistic",
          "probabilistic"
        ],
        [
          "classical computer",
          "classical computer"
        ]
      ],
      "qualifier": "quantum computing",
      "raw_glosses": [
        "(quantum computing) A result that states that stabilizer circuits (those consisting only of gates from the normalizer of the qubit Pauli group, or Clifford group) can be perfectly simulated in polynomial time on a probabilistic classical computer."
      ]
    }
  ],
  "word": "Gottesman-Knill theorem"
}

{
  "etymology_text": "Named after Daniel Gottesman and Emanuel Knill.",
  "forms": [
    {
      "form": "the Gottesman-Knill theorem",
      "tags": [
        "canonical"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {
        "def": "1"
      },
      "expansion": "the Gottesman-Knill theorem",
      "name": "en-prop"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "name",
  "senses": [
    {
      "categories": [
        "English entries with incorrect language header",
        "English entries with language name categories using raw markup",
        "English eponyms",
        "English lemmas",
        "English multiword terms",
        "English proper nouns",
        "English terms with non-redundant non-automated sortkeys",
        "English uncountable nouns",
        "Pages with 1 entry",
        "Pages with entries",
        "en:Quantum computing"
      ],
      "glosses": [
        "A result that states that stabilizer circuits (those consisting only of gates from the normalizer of the qubit Pauli group, or Clifford group) can be perfectly simulated in polynomial time on a probabilistic classical computer."
      ],
      "links": [
        [
          "quantum computing",
          "quantum computing"
        ],
        [
          "stabilizer",
          "stabilizer"
        ],
        [
          "circuit",
          "circuit"
        ],
        [
          "gate",
          "gate"
        ],
        [
          "normalizer",
          "normalizer"
        ],
        [
          "qubit",
          "qubit"
        ],
        [
          "polynomial time",
          "polynomial time"
        ],
        [
          "probabilistic",
          "probabilistic"
        ],
        [
          "classical computer",
          "classical computer"
        ]
      ],
      "qualifier": "quantum computing",
      "raw_glosses": [
        "(quantum computing) A result that states that stabilizer circuits (those consisting only of gates from the normalizer of the qubit Pauli group, or Clifford group) can be perfectly simulated in polynomial time on a probabilistic classical computer."
      ]
    }
  ],
  "word": "Gottesman-Knill theorem"
}