aiqbench analysis
This research establishes unconditional theoretical separations between low-depth quantum circuits (QNC⁰) and bounded-resource classical architectures like diffusion language models in both prediction and generation tasks. By demonstrating specific distributions and functions that require exponentially larger classical widths to approximate, the study formally initiates a rigorous framework for assessing quantum advantage within the current era of large AI systems.
Separating quantum circuits from classical LLMs
arXiv:2608.03962v1 Announce Type: new Abstract: 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. Concretely, we exhibit the following: 1. Distributional separation. We give a distribution that is sampleable by $\textsf{QNC}^0$ circuits (i.e., a family of constant-depth quantum circuits consisting of bounded fan-in gates) that no constant-round diffusion language model ($\textsf{DLM}$) with shallow scheduling and denoising can sample within constant distance, even when allowed sublinear chain-of-thought and output-token revision/remasking events, the very features modern $\textsf{DLM}$s rely on. 2. Functional separation. We exhibit a function computable in $\land \circ \textsf{QNC}^0[\log\log n]$ (i.e., a family of O$(\log\log n)$-depth $\textsf{QNC}^0$ circuits, where $n$ is the input length, followed by a single classical $\mathsf{AND}$ gate) such that any constant-depth decoder-only transformer computing the function must be large: it would have to have width $n^{\Omega(1)}$. Together, our work initiates the study of quantum advantage in the era of large language models.
Abstract: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. Concretely, we exhibit the following: 1. Distributional separation. We give a distribution that is sampleable by $\textsf{QNC}^0$ circuits (i.e., a family of constant-depth quantum circuits consisting of bounded fan-in gates) that no constant-round diffusion language model ($\textsf{DLM}$) with shallow scheduling and denoising can sample within constant distance, even when allowed sublinear chain-of-thought and output-token revision/remasking events, the very features modern $\textsf{DLM}$s rely on. 2. Functional separation. We exhibit a function computable in $\land \circ \textsf{QNC}^0[\log\log n]$ (i.e., a family of O$(\log\log n)$-depth $\textsf{QNC}^0$ circuits, where $n$ is the input length, followed by a single classical $\mathsf{AND}$ gate) such that any constant-depth decoder-only transformer computing the function must be large: it would have to have width $n^{\Omega(1)}$. Together, our work initiates the study of quantum advantage in the era of large language models.
Quantum Physics (quant-ph); Artificial Intelligence (cs.AI); Computational Complexity (cs.CC)
arXiv:2608.03962 [quant-ph]
(or arXiv:2608.03962v1 [quant-ph] for this version)
https://doi.org/10.48550/arXiv.2608.03962 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 271 words
Related coverage

NTU-IBM Quantum Hub shows shallow circuits beat language models on key tasks
Quantum Zeitgeist · Sep 15, 2026

Korea University Team Presents LLM-Qubo Framework for Multi-Drone Assignment Optimisation
Quantum Zeitgeist · Jun 17, 2026
QEncodeBench: Can Large Language Models Encode Classical Problems into Verified Quantum Oracles?
arXiv · Sep 18, 2026

Harvard, Anthropic, and QuEra Use LLMs to Discover Quantum Circuits with Up to 9,100x Lower Resource Costs
Quantum Computing Report · Oct 17, 2026