First rigorous poly-time classical algorithm for simulating OTOCs in 1D systems
AmiraMorphism · x · 2026-11-22
Laura Lewis, Antonio Mele, Ronald de Wolf, Jarrod McClean and collaborators present the first rigorous polynomial-time algorithm for classically simulating OTOCs in 1D, showing it also works well in practice—not just in theory.
More from Research
- When no human can follow machine-checked proofs, compression becomes scarce work — l4rz · 2026-11-22
- ICLR 2027 AC: 10 of 24 reviews flagged AI-generated, 11 reviewers silent — rao2z · 2026-11-22
- Weak-form proofs mostly eliminated DoS bugs in httpd-rs — a verifiable RL-training target — jd_pressman · 2026-11-22
- If AI says 'X likely treats pancreatic cancer,' how would we verify it? — Afinetheorem · 2026-11-22
- The real bottleneck for AI discovery beyond math may be verification — Afinetheorem · 2026-11-22
- Math community's wholesale AI rejection wastes top human time, dev warns — cgarciae88 · 2026-11-22