Beating classical heuristics for the binary paint shop problem with the quantum approximate optimization algorithm · HackerPapers discussionshttps://hackerpaper.kaipfister.de/p/2011.03403/Collected HN comments and submissions linking this paper.enMon, 02 Nov 2026 11:16:22 GMTBeating classical heuristics for the binary paint shop problem with the quantum approximate optimization algorithm — mentioned by packetlosthttps://news.ycombinator.com/item?id=28355761urn:hackerpapers:mention:2011.03403:28355761Mon, 30 Aug 2021 14:04:46 GMT<p>Here is an example: https://arxiv.org/pdf/2011.03403.pdf Anything with high scale manufacturing where a %0.01 percent decrease in overhead means millions saved would be interested in certain algorithms quantum computers are good at.</p><p><a href="https://hackerpaper.kaipfister.de/p/2011.03403/">Paper and discussion history</a>. A mention is not an endorsement.</p>quant-ph