Coming soon
This note is part of the notebook and is planned, but has not been written yet.
Planned coverage: The theorem that a discrete universal gate set can approximate any unitary efficiently.
ὑπομνήματα
This note is part of the notebook and is planned, but has not been written yet.
Planned coverage: The theorem that a discrete universal gate set can approximate any unitary efficiently.