New monogamy bounds via SOS certify max energy by graph matching for specific qudit Hamiltonians; matching algorithm gives 1/d approximation (1/2 for D≤5 regular graphs) and 0.595 for qubits, outperforming prior 1/2.
In particular, if |ψ⟩ is maximally entangled then A ∈ U (d)
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
2024 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Monogamy of Entanglement Bounds and Improved Approximation Algorithms for Qudit Hamiltonians
New monogamy bounds via SOS certify max energy by graph matching for specific qudit Hamiltonians; matching algorithm gives 1/d approximation (1/2 for D≤5 regular graphs) and 0.595 for qubits, outperforming prior 1/2.