Quantum compiling with diffusive sets of gates
Quantum compiling with diffusive sets of gates
Given a set of quantum gates and a target unitary operation, the most elementary task of quantum compiling is the identification of a sequence of the gates that approximates the target unitary to a determined precision $\ensuremath{\varepsilon}$. The Solovay-Kitaev theorem provides an elegant solution which is based on the construction …