8 papers
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…
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…
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…
The threshold for quantum-classical correspondence is
Felipe Hernández, Daniel Ranard, C. Jess Riedel
In chaotic quantum systems, an initially localized quantum state can deviate strongly from the corresponding classical phase-space distribution after the Ehrenfest time $t_{\mathrm…
Classical correspondence beyond the Ehrenfest time for open quantum systems with general Lindbladians
Felipe Hernández, Daniel Ranard, C. Jess Riedel
Quantum and classical systems evolving under the same formal Hamiltonian may dramatically differ after the Ehrenfest timescale , even as $\hbar \to 0…
Ehrenfest's theorem beyond the Ehrenfest time
Felipe Hernández, Daniel Ranard, C. Jess Riedel
In closed quantum systems, wavepackets can spread exponentially in time due to chaos, forming long-range superpositions in just seconds for ordinary macroscopic systems. A weakly c…