Improved decomposition of DiagonalQubitUnitary

[dwierichs]

Context:
A diagonal unitary operator can be decomposed iteratively into RZ multiplexers (SelectPauliRot) and a global phase.
PennyLane is not using this quite established decomposition yet.
Similar to the QubitUnitary decomposition implemented in #7277, the method implemented here stems from Shende et al. (2004).
It uses fewer CNOTs that the current implementation, but has larger classical computing/memory cost.

Description of the Change:
Replace current decomposition of DiagonalQubitUnitary by multiplexer-based decomposition.

Also fixes a validation in __init__ of SelectPauliRot to allow for parameter broadcasting.

Benefits:
Quantumly cheaper decomposition of DiagonalQubitUnitary.

Possible Drawbacks:
Increase classical computing /memory cost if the decomposition is carried out down to elementary gates (due to SelectPauliRot decomposition).
This increased classical cost is remedied by #7377

Related GitHub Issues:

[sc-90706]

[codecov]

Codecov Report

All modified and coverable lines are covered by tests ✅

Project coverage is 99.69%. Comparing base (b1db988) to head (48bdc6f).
Report is 2 commits behind head on master.

Additional details and impacted files

@@            Coverage Diff             @@
##           master    #7370      +/-   ##
==========================================
- Coverage   99.69%   99.69%   -0.01%     
==========================================
  Files         529      529              
  Lines       50745    50738       -7     
==========================================
- Hits        50590    50583       -7     
  Misses        155      155              

☔ View full report in Codecov by Sentry.
📢 Have feedback on the report? Share it here.

🚀 New features to boost your workflow:

• ❄️ Test Analytics: Detect flaky tests, report on failures, and find test suite problems.

[KetpuntoG]

Looks great and works perfectly! ✅