Unitary Synthesis Problem: The Boolean Oracle Behind OpenAI’s Surprising Answer

Compact quantum circuit reading a huge binary data wall, illustrating the unitary synthesis problem and Boolean oracle.

OpenAI claims a positive answer to the unitary synthesis problem: a quantum computer can approximate any quantum unitary efficiently when supplied with a suitably chosen classical Boolean oracle. The qualification belongs in the opening sentence. The paper does not show how to construct that oracle efficiently. That still makes this a striking claim. The problem … Read more

Derandomization of Logarithmic Space: Inside OpenAI’s Bold L = RL = BPL Breakthrough Claim

Dice becoming one light path through a narrow memory slot: derandomization of logarithmic space

Randomness is a useful shortcut in computing. A few coin flips can help a memory-starved algorithm explore possibilities without recording every step. For decades, theoretical computer scientists have asked whether those random bits provide genuine extra power when an algorithm has almost no working memory. OpenAI says the answer is no. In a 108-page manuscript … Read more

OpenAI Integer Multiplication: A Tiny Crack in the n log n Barrier

OpenAI integer multiplication concept: a glowing hairline crack splitting a vast n log n barrier wall

The improvement is so small that rounding it casually would erase it. The mathematical claim is large enough to challenge a conjecture that has stood since 1971. OpenAI integer multiplication research claims an exact, deterministic algorithm for multiplying two (n)-bit integers in less than (n\log n) asymptotic time. The saving sits in the exponent of … Read more

OpenAI Matrix Multiplication: The Proof Behind the 2.25 Leap

OpenAI Matrix Multiplication cover art: a dense cubic grid reshaped into a leaner lattice for the 2.25 bound

AI runs on an extraordinary amount of matrix multiplication. Training models, processing attention and transforming hidden representations all depend on combining grids of numbers efficiently. A better mathematical bound for that operation deserves attention, even when it doesn’t arrive with a CUDA kernel attached. The OpenAI Matrix Multiplication paper, dated October 2, 2026, establishes an … Read more

Unique Games Conjecture: OpenAI’s Proof and the Approximation Ceiling

Glowing graph lattice meeting a glass ceiling, symbolizing the Unique Games Conjecture and the approximation limit

When an algorithm gives you a pretty good answer, the obvious next question is whether a cleverer algorithm could do better. Sometimes the obstacle is engineering. Sometimes it may be a mathematical ceiling. The Unique Games Conjecture sits at that boundary. OpenAI has published a manuscript claiming to prove it, alongside formalization materials describing the … Read more