In quantum information and computation, the Solovay-Kitaev theorem states that if a set of single-qubit quantum gates generates a dense subgroup of SU(2), that set can be used to approximate any desired quantum gate with a short sequence of gates that can also be found efficiently. Robert M. Solovay first announced the theorem in 1995, and Alexei Kitaev independently proved it in 1997; Michael Nielsen and Christopher M. Dawson have noted its importance to the field of quantum computation.
Facts
StatementIf a set of single-qubit quantum gates generates a dense subgroup of SU(2), then that set can be used to approximate any desired quantum gate. 1 Classification
Statement Form Connections
Has Statement Form
In Branch
Source Solovay-Kitaev theorem, Wikipedia
Proved By
Source Solovay-Kitaev theorem, Wikipedia
In the Other Atlases
Credited To
Also in Computing Atlas: credited with this subject.
Sources
1. Solovay-Kitaev theorem, Wikipedia
Statement
if a set of single-qubit quantum gates generates a dense subgroup of SU(2), then that set can be used to approximate any desired quantum gate
Attribution
independently proven by Alexei Kitaev in 1997
In Branch: Mathematical Physics, Lead
In quantum information and computation, the Solovay-Kitaev theorem says that if a set of single-qubit quantum gates generates a dense subgroup of SU(2), then that set can be used to approximate any desired quantum gate with a short sequence of gates that can also be found efficiently.
Proved By: Robert M. Solovay, Lead
This theorem is considered one of the most significant results in the field of quantum computation and was first announced by Robert M. Solovay in 1995 and independently proven by Alexei Kitaev in 1997.
In Group: Quantum Mechanics and Quantum Field Theory, Lead section
In quantum information and computation, the Solovay-Kitaev
View the SourceReader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.