Hugging Face Trending Papers

Separating quantum circuits from classical LLMs

Read the original on Hugging Face Trending Papers →

Modern large language models - transformers and diffusion language models - are built around two canonical algorithmic tasks: prediction and generation. We prove unconditional separations between low-depth quantum computation and the corresponding bounded-resource classical language-model architectures in both regimes.

Summary generated by The Flow from the publisher's feed. The full article lives at Hugging Face Trending Papers.

arXiv AI
Aug 6

Representational separation between unitary and channel quantum generative models via shared classical randomness at shallow depth

arXiv:2608. 05110v1 Announce Type: cross Abstract: Near-term quantum hardware limits circuit depth and often imposes geometrically local connectivity for quantum generative models, restricting the output distributions accessible to shallow unitary Born models.

By Arunava Majumder, Marius Krumm, Hendrik Poulsen Nautrup, Hans J. Briegel
arXiv AI
Jun 19

Efficiently Representing Algorithms With Chain-of-Thought Transformers

arXiv:2606. 19697v1 Announce Type: cross Abstract: The increasing popularity of \emph{reasoning} models -- language models that output a series of reasoning or thought tokens before producing an answer -- is justified, in part, by theoretical results showing that chain-of-thought (CoT) transformers can simulate Turing machines, and thus perform arbitrary computation.

By Yanhong Li, Anej Svete, Ashish Sabharwal, William Merrill
arXiv Machine Learning
Jun 3

Why Are Linear RNNs More Parallelizable?

arXiv:2603. 03612v3 Announce Type: replace Abstract: The community is increasingly exploring linear RNNs (LRNNs) as language models, motivated by their expressive power and parallelizability.

By William Merrill, Hongjian Jiang, Yanhong Li, Anthony Lin, Ashish Sabharwal
arXiv Machine Learning
Jun 11

Higher-Order Token Interactions via Quantum Attention

arXiv:2606. 11673v1 Announce Type: cross Abstract: Standard dot-product self-attention computes, in a single layer, only pairwise (order-2) interactions between tokens; representing a generic order-$k$ interaction is known to require either super-quadratic resources in one layer or composition across depth.

By Jian Xu, Chao Li, Delu Zeng, John Paisley, Qibin Zhao