3 ms·
Why are they trying to colour graphs with quantum computers? Just reading the title
by m3kw9 3y ago
Why are they trying to colour graphs with quantum computers? Just reading the title
- david_draco 3y agoI suspect the point is that all NP-hard problems are equivalent to each other, often one can be transform one NP-hard problem to another. This shows that quantum will not save us. This is bad but also good for encryption. NP remains an important topic post-quantum that cannot be hand-waved away.
- cochne 3y agoNP hard problems aren’t all equivalent, that’s NP complete.
- david_draco 3y agoThanks!