Showing 2026Show all
3 papers · 1 filter
cs.LG2026
Likelihood scoring for continuations of mathematical text: a self-supervised benchmark with tests for shortcut vulnerabilities
Daniel Ranard
We introduce an automatically generated benchmark for predicting hidden text in technical papers. A paper supplies visible context and a hidden continuation ; the evaluated…
quant-ph2026
Approximate QCAs in one dimension using approximate algebras
Daniel Ranard, Michael Walter, Freek Witteveen
Quantum cellular automata (QCAs) are automorphisms of tensor product algebras that preserve locality, with local quantum circuits as a simple example. We study approximate QCAs, wh…
quant-ph2026
Lower bounding the MaxCut of high girth 3-regular graphs using the QAOA
Edward Farhi, Sam Gutmann, Daniel Ranard +1
We study MaxCut on 3-regular graphs of minimum girth for various 's. We obtain new lower bounds on the maximum cut achievable in such graphs by analyzing the Quantum Approxi…