A frustration graph formalism for prime-d qudit observables yields a unitary map to generalized Pauli form plus bounds on observable sums used for qudit entanglement quantification.
Lovasz, IEEE Transactions on Information Theory 25, 1 (1979)
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Frustration graph formalism for qudit observables
A frustration graph formalism for prime-d qudit observables yields a unitary map to generalized Pauli form plus bounds on observable sums used for qudit entanglement quantification.