For any connected selection-rule graph, any single-qudit unitary decomposes into at most d(d−1)/2 allowed two-level pulses via a BFS-based QR-style algorithm.
Title resolution pending
1 Pith paper cite this work, alongside 10 external citations. Polarity classification is still indexing.
1
Pith paper citing it
10
external citations · OpenAlex
fields
quant-ph 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Transition-aware decomposition of single-qudit gates
For any connected selection-rule graph, any single-qudit unitary decomposes into at most d(d−1)/2 allowed two-level pulses via a BFS-based QR-style algorithm.