HIGHLIGHTS
SUMMARY
The Quantum Approximate Optimization Algorithm (QAOA) is a promising attempt at trying to find a quantum advantage when using nearterm Noisy Intermediate-Scale Quantum (NISQ) devices. For the present problem of correlation clustering, they offer a support with the Hilbert space which is native to the studied problem, namely the different qudit states can encode the labelling of nodes into their respective cluster. The authors encode the correlation clustering problem into the QAOA paradigm, specifically tailored for qudit quantum systems. A key difference between correlation clustering and the other studied problems is the explicit . . .
If you want to have access to all the content you need to log in!
Thanks :)
If you don't have an account, you can create one here.