Closed isaacdevlugt closed 10 months ago
Hey @isaacdevlugt I can work on this. My idea is to have a method for all gates (which don't have a decomposition method) to give their clifford+T decomposition. Then the transform can go through the tape, decompose the gates, and replace them with their clifford+T substitutes. The decomposition can only be an approximation, the order of which will have to be decided. Let me know.
fixed decomposition will not work for parameterised gates. An algorithm will have to be used for such gates, which will generate the decomposition up to a threshold error
This has been done with #4801 and #4802 :tada: It will be part of the 0.34 release next week.
Feature details
Given a quantum function or operation, decompose it into gates from a universal gate set (Clifford + T).
Implementation
Add a new transform to the set of compilation transforms we have (e.g., qml.transforms.clifford_decomposition()).
How important would you say this feature is?
1: Not important. Would be nice to have.
Additional information
Feature request driven by this user question.