About: Gottesman–Knill theorem

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: Gottesman–Knill theorem Goto Sponge NotDistinct Permalink

An Entity of Type : owl:Thing, within Data Space : dbpedia.demo.openlinksw.com associated with source document(s)
QRcode icon

http://dbpedia.demo.openlinksw.com/describe/?url=http%3A%2F%2Fdbpedia.org%2Fresource%2FGottesman%E2%80%93Knill_theorem&invfp=IFP_OFF&sas=SAME_AS_OFF

In quantum computing, the Gottesman–Knill theorem is a theoretical result by Daniel Gottesman and 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 time on a probabilistic classical computer. The Clifford group can be generated solely by using CNOT, Hadamard, and phase gate S; and therefore stabilizer circuits can be constructed using only these gates.

Attributes	Values
rdfs:label	Gottesman–Knill theorem (en)
rdfs:comment	In quantum computing, the Gottesman–Knill theorem is a theoretical result by Daniel Gottesman and 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 time on a probabilistic classical computer. The Clifford group can be generated solely by using CNOT, Hadamard, and phase gate S; and therefore stabilizer circuits can be constructed using only these gates. (en)
dcterms:subject	Quantum information science
Wikipage page ID	5006371 (xsd:integer)
Wikipage revision ID	1087460130 (xsd:integer)
Link from a Wikipage to another Wikipage	Quantum entanglement Qubit Entanglement distillation Quantum computing Pauli group Quantum Computation and Quantum Information (book) Generating set of a group Controlled NOT gate Clifford gates Magic state distillation Daniel Gottesman Centralizer and normalizer Graph state Quantum error correction Quantum information science Group action (mathematics) Hadamard Hadamard gate dbr:Emanuel_Knill
sameAs	Gottesman–Knill theorem Gottesman–Knill theorem Gottesman–Knill theorem
dbp:wikiPageUsesTemplate	dbt:Citation_needed dbt:Cite_book dbt:Cite_journal dbt:Math dbt:Reflist dbt:Short_description dbt:Use_American_English dbt:Quantum_computing
has abstract	In quantum computing, the Gottesman–Knill theorem is a theoretical result by Daniel Gottesman and 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 time on a probabilistic classical computer. The Clifford group can be generated solely by using CNOT, Hadamard, and phase gate S; and therefore stabilizer circuits can be constructed using only these gates. The reason for the speed up of quantum computers is not yet fully understood. The theorem proves that, for all quantum algorithms with a speed up that relies on entanglement which can be achieved with a CNOT and a Hadamard gate to produce entangled states, this kind of entanglement alone does not give any computing advantage. There exists a more efficient simulation of stabilizer circuits than the construction of the original publication with an implementation. The Gottesman–Knill theorem was published in a single author paper by Gottesman in which he credits Knill with the result through private communication. (en)
gold:hypernym	Result
prov:wasDerivedFrom	wikipedia-en:Gottesman–Knill_theorem?oldid=1087460130&ns=0
page length (characters) of wiki page	4188 (xsd:nonNegativeInteger)
foaf:isPrimaryTopicOf	wikipedia-en:Gottesman–Knill_theorem
is Link from a Wikipage to another Wikipage of	Quantum logic gate One-way quantum computer Timeline of quantum computing and communication Continuous-variable quantum information Clifford gates Magic state distillation Quantum supremacy Daniel Gottesman Gottesman Gottesman-Knill theorem List of theorems Randomized benchmarking Gottesman-Knill Theorem
is Wikipage redirect of	Gottesman-Knill theorem Gottesman-Knill Theorem
is Wikipage disambiguates of	Gottesman
is known for of	Daniel Gottesman
is known for of	Daniel Gottesman
is foaf:primaryTopic of	wikipedia-en:Gottesman–Knill_theorem

Faceted Search & Find service v1.17_git139 as of Feb 29 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 08.03.3330 as of Mar 19 2024, on Linux (x86_64-generic-linux-glibc212), Single-Server Edition (378 GB total memory, 45 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software