4 citations · 20 across the 25 of their papers we have counts for
31 papers
Limitations on Autoregressive Token Generation via Sequential Sampling
Gal Arnon, Andrej Bogdanov, Paul Lou +3
We study autoregressive token generation through the notion of sequential samplers: A circuit that samples the next symbol only given the previous ones and possibly a small amount…
From Chunks to Functional Evidence: Function-Aware Retrieval for EDA Documentation QA
Xiaotian Qiu, Kairui Liu, Shi Chenyi +3
Retrieval-Augmented Generation (RAG) is widely used to ground answers in documents. For complex technical documentation, however, the primary bottleneck is often not model reasonin…
The Grothendieck Game and Self-Testing Continuous Groups
Alexander Kulpe, Giulio Malavolta, Simon Schmidt +1
Self-testing certifies quantum states and measurements from observed correlations alone, without requiring a description of the devices that produce them. In this work we establish…
Polynomial-Time Algorithms for Nuclear Tensor Norms and Multipartite Separability
Martino Bernasconi, Giulio Malavolta
We study a multilinear optimization problem for tensors with bounded Frobenius norm, where each of the local factors of dimension is chosen from a convex set. We give a det…
Succinct Arguments for QMA from Collapsing Hash Functions
James Bartusek, Giulio Malavolta
We prove the existence of succinct arguments for QMA, assuming only the existence of collapsing hash functions. This is the first scheme that relies only on unstructured ``Minicryp…
Sharper Bounds for the Complex Grothendieck Constant
Steven Heilman, Chris Jones, Giulio Malavolta
We show that , where is the complex Grothendieck constant. The upper bound improves on Haagerup's bound of $1.40490913\ldots…