A more efficient implementation of Shor's algorithm
Summary
Explains a new paper that demonstrates a memory efficient Shor's algorithm implementation, using fewer than 1,200 logical qubits and zero-knowledge proofs to verify a quantum circuit without disclosing its details. The article also surveys quantum background, error correction, and the STARK vs SNARK transition, and discusses implications for post-quantum cryptography and trust in open scientific results.