This is offtopic: P != NP implies you can't work efficiently with many
nilpotent elements over commutative ring or algebra even on a
quantum computer.
The reduction is from counting hamiltonian cycles in a graph
via powers of nilpotent matrix.
For reference, check:
https://mathoverflow.net/q/364
In case someone wants to follow up, the crash is due to an unsurprising:
Flint exception (Impossible inverse):
Cannot invert modulo 13*13
so perhaps a bit more extensive error catching/processing needs to happen
in the flint wrapper.
On Friday 5 January 2024 at 23:03:48 UTC-8 Georgi Guninsk
