Is there a quantum-safe time lock? Most successive squaring time lock puzzles I've seen appear to be broken by Shor's algorithm. Is there another practical and efficient time lock protocol that is not broken by Shor's algorithm? If not, what will I need to make one?
time lock requirements
What I mean as a time lock puzzle is something that balances being cheap to crack, but requires a lot of time to crack. This is achievable by requiring that a solver computes a long, non-parallelizable function. However, it has to be very cheap (less than a minute of modern CPU time) to make. In order to encrypt something with the puzzle, the creator probably needs to know the outcome of the puzzle when creating it. If there is a way to encrypt something with out knowing the solution (via asymmetric encryption) that will also be acceptable.
known research
I have read that as of 2014 there were no (at least practical) alternatives to successive squaring. A lot has happened since then. One more recent creation, verifiable delay functions(VDF), are very similar to time lock puzzles but has a different purpose. It may be worth looking in to to see if VDFs can be converted to time locks.
A similar construct to a time-lock puzzle is a verifiable delay function. They have a similar notion of "inherent sequentially". They have an unrelated "public verifiability" property which you do not care about.

Boneh et al. build verifiable delay function from a construct called ``Incrementally Verifiable Computation'', which they can instantiate from certain SNARKs/SNARGs. There exist lattice based SNARGS, which I imagine are post-quantum.

I have not checked if all of these notions line up to directly give someone post-quantum VDFs (and therefore post-quantum Time-Lock Puzzles), but this seems like an excellent candidate for what you're looking for.