Gottesman–Knill theorem
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 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.
Gottesman–Knill theorem - Wikipedia Jump to content From Wikipedia, the free encyclopedia Theorem of quantum circuits 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 time on a probabilistic classical computer. The Clifford group can be generated solely by using the controlled NOT , Hadamard , and phase gates (CNOT, H and S );
saved by
related reading
- Quantum computing for the very curiousquantum.country
- Quantum computing - Wikipediaen.wikipedia.org
- [2601.20927] Entangling logical qubits without physical operationsarxiv.org
- A tutorial quantum interpreter in 150 lines of Lispstylewarning.com
- No-communication theoremen.wikipedia.org
- How the quantum search algorithm worksquantum.country
- Shtetl-Optimizedscottaaronson.blog
- Quantum computing for everyone – Michael Nielsenmichaelnielsen.org
- But what is quantum computing? (Grover's Algorithm)youtube.com
- On the Computational Hardness Needed for Quantum Cryptographysimons.berkeley.edu
- Quantum computational advantage with a programmable photonic processornature.com
- Run your first circuit on hardware | IBM Quantum Documentationqiskit.org