2026-03-06 02:22 UTC
@cwebber@social.coop mostly agree, especially about them not being compilers, but some compilers aren't deterministic. You'll get a different result in memory layout or optimization sometimes. Especially for quantum compilers, where the compilation process itself is known to be NP hard, so heuristics are used.
Replies (2)
-
@cdonat@hostsharing.coop 2026-03-06 05:28
@rdviii@famichiki.jp @cwebber@social.coop Heuristics aren't non-deterministic by definition. Of course it is possible to come up with non-deterministic heuristics, just like with any kind of algorithm. But by far most heuristics are very deterministic, just like most algorithms are, heuristic, or not.
-
@yaleman@mastodon.social 2026-03-06 08:23
@rdviii@famichiki.jp Ok but who's actually talking about *quantum compilers* when they are just saying "compilers" as a general term? ... other than people who work exclusively on QC's, who would be ... an incredibly tiny minority :)