Quantum advantage for NP approximation? For REAL this time?

Shtetl-Optimized 2024-10-05

Summary:

The other night I spoke at a quantum computing event and was asked—for the hundredth time? the thousandth?—whether I agreed that the quantum algorithm called QAOA was poised revolutionize industries by finding better solutions to NP-hard optimization problems. I replied that while serious, worthwhile research on that algorithm continues, alas, so far I have yet […]

Link:

https://scottaaronson.blog/?p=8375

From feeds:

Online Mathematical Communication » Shtetl-Optimized

Tags:

complexity

Authors:

Scott

Date tagged:

10/05/2024, 23:30

Date published:

10/05/2024, 17:43