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/364267/12481 -- You received this message because you are subscribed to the Google Groups "sage-devel" group. To unsubscribe from this group and stop receiving emails from it, send an email to sage-devel+unsubscr...@googlegroups.com. To view this discussion on the web visit https://groups.google.com/d/msgid/sage-devel/CAGUWgD9u4SrSWfTAWApJtFa86CXOQCEr%3DnDrK9A8Us7cRNstNg%40mail.gmail.com.
