Frontier Decoder Breaks Geometry Limits of Topological Codes
In some sense, the Frontier decoder is closely related to tensor-network decoders, with the MPS approximation replaced by a small list. The advantage is that the decoder doesn't care about the geometry of the code and is not restricted to low-dimensional topological codes.
LLM‑assisted Breakthrough Improves Depolarizing Channel Bound
A nice application of LLMs (Codex with gpt5.5 here) for research. Yesterday, a paper appeared on arXiv with an improved lower bound on the capacity threshold of the depolarizing channel, one of the most frustrating open problems in quantum information...
Simplified Quantum Tanner Codes Derive From Lifted Products
Quantum Tanner codes are a simplified version of the lifted product codes of Panteleev and Kalachev, with one type of data qubits removed. One can similarly obtain the rotated surface code [[d^2,1,d]] from the standard surface code [[2d^2,1,d]]. This can...
GPT5.5-pro Generates PhD‑Level Combinatorics Chapter in Hours
Tim Gowers on GPT5.5-pro: "I would judge the level of the result that ChatGPT found in under two hours to be that of a perfectly reasonable chapter in a combinatorics PhD."
New Cascade Decoder Signals End for BP+OSD
Might be time to retire BP+OSD soon. Many new decoders for qLDPC codes with really impressive performance these days, e.g. the Cascade decoder from the Harvard group https://t.co/5qeOhZbCrQ
Upcoming arXiv Overlay Will Flag Errors in Papers
I expect that in a few months, someone will create an arxiv overlay that will summarize the small errors (or big ones) in each paper. That will be tremendously useful (once it's reliable).
Tao's Paper Validates LLMs; Many Still Dismiss Them
The latest paper by Terry Tao acknowledges use of LLMs. Yet many researchers still think they are worthless for research. https://t.co/vlQE6IlpY8
Access Small-Scale Quantum Tanner Codes with Good Parameters
if you want to play with smallist quantum Tanner codes, here is a bunch of codes with fairly good parameters.