Grover’s search is not a practical attack on symmetric-key and hash-based crypto.
Or, “Discrete log, factoring, and proofs of quantumness in 2026.” My talk as a series of blog posts.
Discrete log is probably more relevant.
Astoundingly, we can sometimes get away with fewer than \(n\) qubits.
With new hardware and error correction architectures, other metrics also come into play.
Measurement is a powerful tool in circuit compilation.
We voted on a name for not-post-quantum crypto, and landed on: “quantum-insecure crypto.”
In which I accidentally go shoulders-deep into optimizing Julia code
And got repaid in snacks (and deep personal satisfaction).
Tired of distributing code with your manuscript? How about distributing your code as your manuscript!
A trick for avoiding floating-point errors when numerically computing the fidelity of quantum state vectors.
