Tootfinder

https://rule34.xxx/index.php?page=post&s=list&tags=go_gopher

Gefunden bei @ungemeve.bsky.social€: Eine Fake-Karte für Pro-Pali-Propaganda, die gerade umgeht. Geschichtsstunde. #Israel " #Palästina"

Fake-Karte für Pro-Pali-Propaganda - Geschichtsstunde
Heute Mittag hatte ich ein Posting von X auf dem Tablett, das eine Karte zeigt. Meine Reaktion war wie ein Meme: Erstmal einige Sekunden ungläubig darauf glotzen. Weil…

[2025-10-07 Tue (UTC), 9 new articles found for cs.LO Logic in Computer Science]
toXiv_bot_toot

[2025-10-07 Tue (UTC), 4 new articles found for cs.PL Programming Languages]
toXiv_bot_toot

edit_wikibooks: Wikipedia book edits (2010)
Two bipartite user-page networks extracted from Wikipedia, about books. A user connects to a page if that user edited that page. Edits (edges) are timestamped. Edge weights represent counts of the number of edits.
This network has 420 nodes and 774 edges.
Tags: Informational, Web graph, Multigraph, Timestamps

An Enriched Approach to the Strictification of $(\infty,1)$-Categories
Kimball Strong
https://arxiv.org/abs/2510.04254 https://arxiv.org/pdf/2510.04254

An Enriched Approach to the Strictification of $(\infty,1)$-Categories
We define a functor which takes in an $(\infty,1)$-category and outputs an $(ω,1)$-category, the natural maximally "strict" version of an $(\infty,1)$-category. We do this by modeling $(\infty,1)$-categories as categories enriched in $\infty$-groupoids, and then "locally strictifying" (applying the strictification of $\infty$-groupoids to each hom space) to obtain a category enriched in $ω$-groupoids with respect to the Gray tensor product, followed by "globally strictifying" (strictifying th…

In #Wikimedia land, I created my first #Lua module in #WikimediaCommons:

Apparently even NIOSH can't spell "fluoride" right consistently

On Cryptography and Distribution Verification, with Applications to Quantum Advantage
Bruno Cavalar, Eli Goldin, Matthew Gray, Taiga Hiroka, Tomoyuki Morimae
https://arxiv.org/abs/2510.05028

On Cryptography and Distribution Verification, with Applications to Quantum Advantage
One of the most fundamental problems in the field of hypothesis testing is the identity testing problem: whether samples from some unknown distribution $\mathcal{G}$ are actually from some explicit distribution $\mathcal{D}$. It is known that when the distribution $\mathcal{D}$ has support $[N]$, the optimal sample complexity for the identity testing problem is roughly $O(\sqrt{N})$. However, many distributions of interest, including those which can be sampled efficiently, have exponential supp…

[2025-10-07 Tue (UTC), 5 new articles found for math.LO Logic]
toXiv_bot_toot

[2025-10-07 Tue (UTC), 28 new articles found for math.CO Combinatorics]
toXiv_bot_toot

[2025-10-07 Tue (UTC), 1 new article found for math.AT Algebraic Topology]
toXiv_bot_toot

[2025-10-07 Tue (UTC), 36 new articles found for math.OC Optimization and Control]
toXiv_bot_toot

On Information Transfer and Symmetry Breaking in Dynamical Systems
Subhrajit Sinha, Parvathi Kooloth
https://arxiv.org/abs/2510.03572 https://arxiv.org/pdf…

On Information Transfer and Symmetry Breaking in Dynamical Systems
In this work, we propose a novel approach to investigate symmetry breaking in dynamical systems. In particular, we use the notion of information transfer, which provides a measure of the entropy transfer between any pair of observables in a system, to predict symmetry breaking. We show that as a system loses symmetry, its trajectories \emph{slow down} and its Shannon entropy increases. This connection enables us to use information transfer to predict the onset of symmetry breaking. Furthermore,…

[2025-10-07 Tue (UTC), no new articles found for cs.FL Formal Languages and Automata Theory]
toXiv_bot_toot

Rankings for Week 6 https://www.espn.com/fantasy/football/story/_/page/FFWeeklyPlayerRank25main-46028352/fantasy-football-rankings-2025-nfl-week-qb-rb-wr-te-dst

[2025-10-07 Tue (UTC), 10 new articles found for cs.IT Information Theory]
toXiv_bot_toot

TopInG: Topologically Interpretable Graph Learning via Persistent Rationale Filtration
Cheng Xin, Fan Xu, Xin Ding, Jie Gao, Jiaxin Ding
https://arxiv.org/abs/2510.05102 https:/…

TopInG: Topologically Interpretable Graph Learning via Persistent Rationale Filtration
Graph Neural Networks (GNNs) have shown remarkable success across various scientific fields, yet their adoption in critical decision-making is often hindered by a lack of interpretability. Recently, intrinsically interpretable GNNs have been studied to provide insights into model predictions by identifying rationale substructures in graphs. However, existing methods face challenges when the underlying rationale subgraphs are complex and varied. In this work, we propose TopInG: Topologically Int…

[2025-10-07 Tue (UTC), 2 new articles found for cs.CC Computational Complexity]
toXiv_bot_toot

[2025-10-07 Tue (UTC), 22 new articles found for stat.ML Machine Learning]
toXiv_bot_toot

[2025-10-07 Tue (UTC), 3 new articles found for cs.DB Databases]
toXiv_bot_toot

Crosslisted article(s) found for cs.AI. https://arxiv.org/list/cs.AI/new
[14/17]:
- Noise or Signal? Deconstructing Contradictions and An Adaptive Remedy for Reversible Normalizatio...
Fanzhe Fu, Yang Yang

🔥Trump said that he’s considering invoking the Insurrection Act,
a 19th-century law which would allow him to federalize the national guard, on the grounds of an “invasion” or “rebellion”.
🔥On Monday, a federal judge did not immediately block the president’s move to deploy national guard troops, including hundreds from Texas, to Chicago.
Instead, the judge set a hearing for Thursday,
leaving room for the military to make their way to the windy city as soon as today.

[2025-10-07 Tue (UTC), 19 new articles found for stat.ME Methodology]
toXiv_bot_toot

Black hole thermodynamics is around the corner
Gerui Chen, Wei Guo, Xin Lan, Hongbao Zhang, Wei Zhang
https://arxiv.org/abs/2510.04499 https://arxiv.org/pd…

Black hole thermodynamics is around the corner
We propose to work on the Euclidean black hole solution with a corner rather than with the prevalent conical singularity. As a result, we find that the Wald formula for black hole entropy can be readily obtained for generic F(Rabcd) gravity by using both the action without the corner term and the action with the corner term due to their equivalence to the first order variation, which implies that it is the corner rather than the corner term that encodes the entropy related information. With suc…

[2025-10-07 Tue (UTC), 19 new articles found for cs.HC Human-Computer Interaction]
toXiv_bot_toot

[2025-10-07 Tue (UTC), 6 new articles found for math.GR Group Theory]
toXiv_bot_toot

How I Built ASR for Endangered Languages with a Spoken Dictionary
Christopher Bartley, Anton Ragni
https://arxiv.org/abs/2510.04832 https://arxiv.org/pdf/2…

How I Built ASR for Endangered Languages with a Spoken Dictionary
Nearly half of the world's languages are endangered. Speech technologies such as Automatic Speech Recognition (ASR) are central to revival efforts, yet most languages remain unsupported because standard pipelines expect utterance-level supervised data. Speech data often exist for endangered languages but rarely match these formats. Manx Gaelic ($\sim$2,200 speakers), for example, has had transcribed speech since 1948, yet remains unsupported by modern systems. In this paper, we explore how litt…

[2025-10-07 Tue (UTC), 17 new articles found for cs.CY Computers and Society]
toXiv_bot_toot

Saw an AI-enhanced news page that categorised the Embassy of China as "anti-establishment" and I think we maybe have taxonomy problem as much as an AI problem.

Wann immer linke, liberale und ökologische Kräfte einen Sieg erreichen, treten sie mit einem vielfältigen und charismatischen Team an. Wenn aber Pelosi, Newsom und wie sie alle heißen, ihre eigene Agenda verfolgen, geht man eben gemeinsam unter. Und wir gehen mit. | Nils Minkmar zum neuen Buch von Kamala Harris https://

[2025-10-07 Tue (UTC), 8 new articles found for cs.DC Distributed, Parallel, and Cluster Computing]
toXiv_bot_toot

[2025-10-07 Tue (UTC), 6 new articles found for physics.ao-ph Atmospheric and Oceanic Physics]
toXiv_bot_toot

[2025-10-07 Tue (UTC), 1 new article found for q-fin.TR Trading and Market Microstructure]
toXiv_bot_toot

edit_wikiquote: Wikiquote edits (2010)
A bipartite user-page network extracted from Wikiquotes. A user connects to a page if that user edited that page. Edits (edges) are timestamped. Edge weights represent counts of the number of edits.
This network has 423 nodes and 667 edges.
Tags: Informational, Web graph, Multigraph, Timestamps

Unreliability in Practical Subclasses of Communicating Systems
Amrita Suresh, Nobuko Yoshida
https://arxiv.org/abs/2510.03941 https://arxiv.org/pdf/2510.03…

Unreliability in Practical Subclasses of Communicating Systems
Systems of communicating automata are prominent models for peer-to-peer message-passing over unbounded channels, but in the general scenario, most verification properties are undecidable. To address this issue, two decidable subclasses, Realisable with Synchronous Communication (RSC) and k-Multiparty Compatibility} (k-MC), were proposed in the literature, with corresponding verification tools developed and applied in practice. Unfortunately, both RSC and k-MC are not resilient under failures: (…

PLSEMANTICSBENCH: Large Language Models As Programming Language Interpreters
Aditya Thimmaiah, Jiyang Zhang, Jayanth Srinivasa, Junyi Jessy Li, Milos Gligoric
https://arxiv.org/abs/2510.03415

PLSEMANTICSBENCH: Large Language Models As Programming Language Interpreters
As large language models (LLMs) excel at code reasoning, a natural question arises: can an LLM execute programs (i.e., act as an interpreter) purely based on a programming language's formal semantics? If so, it will enable rapid prototyping of new programming languages and language features. We study this question using the imperative language IMP (a subset of C), formalized via small-step operational semantics (SOS) and rewriting-based operational semantics (K-semantics). We introduce three ev…

[2025-10-07 Tue (UTC), 2 new articles found for math.CT Category Theory]
toXiv_bot_toot

Week 14 inactives: Jayden Daniels returns, Rome Odunze sits https://www.espn.com/fantasy/football/story/_/page/FFSundayInactives-47211819/nfl-fantasy-football-espn-injured-inactives-watchlis…

From Noisy Traces to Stable Gradients: Bias-Variance Optimized Preference Optimization for Aligning Large Reasoning Models
Mingkang Zhu, Xi Chen, Bei Yu, Hengshuang Zhao, Jiaya Jia
https://arxiv.org/abs/2510.05095

From Noisy Traces to Stable Gradients: Bias-Variance Optimized Preference Optimization for Aligning Large Reasoning Models
Large reasoning models (LRMs) generate intermediate reasoning traces before producing final answers, yielding strong gains on multi-step and mathematical tasks. Yet aligning LRMs with human preferences, a crucial prerequisite for model deployment, remains underexplored. The statistically correct objective for preference alignment requires marginalizing over reasoning traces, but this computation is intractable in practice. A common workaround optimizes a single sampled trajectory, which introdu…

[2025-10-07 Tue (UTC), 12 new articles found for math.DS Dynamical Systems]
toXiv_bot_toot

Bondi expected to be grilled about use of justice department to investigate Trump’s political enemies – live
Attorney general Pam Bondi is facing senators on the judiciary committee now.
She’ll face questions lawmakers about her tenure at the justice department (DoJ) so far,
particularly as Democratic senators have called out the Trump administration for
weaponizing the DoJ to investigate and prosecute political enemies.
Democratic senator Adam Schiff, of Cali…

Electromagnetic instability of vacuum with instantons in the holographic plasma
Shao-cheng Hou, Si-wen Li
https://arxiv.org/abs/2510.04348 https://arxiv.or…

Electromagnetic instability of vacuum with instantons in the holographic plasma
Using the gauge-gravity duality, we study the electromagnetic instability of vacuum with instantons in holographic plasma. The model we employ is the D(-1)-D3 brane system in which the D(-1)-branes correspond to the instantons in holography. To take into account the flavored quarks, the coincident probe D7-branes as flavors are embedded into the bulk geometry so that the effective electromagnetic Lagrangian with flavors corresponds to the action of the D7-branes according to gauge-gravity duali…

Hybrid Architectures for Language Models: Systematic Analysis and Design Insights
Sangmin Bae, Bilge Acun, Haroun Habeeb, Seungyeon Kim, Chien-Yu Lin, Liang Luo, Junjie Wang, Carole-Jean Wu
https://arxiv.org/abs/2510.04800

Hybrid Architectures for Language Models: Systematic Analysis and Design Insights
Recent progress in large language models demonstrates that hybrid architectures--combining self-attention mechanisms with structured state space models like Mamba--can achieve a compelling balance between modeling quality and computational efficiency, particularly for long-context tasks. While these hybrid models show promising performance, systematic comparisons of hybridization strategies and analyses on the key factors behind their effectiveness have not been clearly shared to the community.…

Machine Learning and Control: Foundations, Advances, and Perspectives
Enrique Zuazua
https://arxiv.org/abs/2510.03303 https://arxiv.org/pdf/2510.03303

Machine Learning and Control: Foundations, Advances, and Perspectives
Control theory of dynamical systems offers a powerful framework for tackling challenges in deep neural networks and other machine learning architectures. We show that concepts such as simultaneous and ensemble controllability offer new insights into the classification and representation properties of deep neural networks while the control and optimization of static systems can be employed to better understand the performance of shallow networks. Inspired by the classical concept of turnpike, we…

Replaced article(s) found for quant-ph. https://arxiv.org/list/quant-ph/new
[4/4]:
- QDFlow: A Python package for physics simulations of quantum dot devices
Donovan L. Buterakos, Sandesh S. Kalantre, Joshua Ziegler, Jacob M Taylor, Justyna P. Zwolak

Interpolation in First-Order Logic
Balder ten Cate, Jesse Comer
https://arxiv.org/abs/2510.03822 https://arxiv.org/pdf/2510.03822

Interpolation in First-Order Logic
In this chapter we give a basic overview of known results regarding Craig interpolation for first-order logic as well as for fragments of first-order logic. Our aim is to provide an entry point into the literature on interpolation theorems for first-order logic and fragments of first-order logic, and their applications. In particular, we cover a range of known refinements of the Craig interpolation theorem, we discuss several important applications of interpolation in logic and computer science…

edit_wikiquote: Wikiquote edits (2010)
A bipartite user-page network extracted from Wikiquotes. A user connects to a page if that user edited that page. Edits (edges) are timestamped. Edge weights represent counts of the number of edits.
This network has 550 nodes and 938 edges.
Tags: Informational, Web graph, Multigraph, Timestamps

Learning to Interpret Weight Differences in Language Models
Avichal Goel, Yoon Kim, Nir Shavit, Tony T. Wang
https://arxiv.org/abs/2510.05092 https://arxiv…

Learning to Interpret Weight Differences in Language Models
Finetuning (pretrained) language models is a standard approach for updating their internal parametric knowledge and specializing them to new tasks and domains. However, the corresponding model weight changes ("weight diffs") are not generally interpretable. While inspecting the finetuning dataset can give a sense of how the model might have changed, these datasets are often not publicly available or are too large to work with directly. Towards the goal of comprehensively understanding weight di…

Chiral algebra, Wilson lines, and mixed Hodge structure of Coulomb branch
Yutong Li, Yiwen Pan, Wenbin Yan
https://arxiv.org/abs/2510.03888 https://arxiv.o…

Chiral algebra, Wilson lines, and mixed Hodge structure of Coulomb branch
We find an intriguing relation between the chiral algebra and the mixed Hodge structure of the Coulomb branch of four dimensional $\mathcal{N} = 2$ superconformal field theories. We identify the space of irreducible characters of the $\mathcal{N} = 4$ $SU(N)$ chiral algebra $\mathbb{V}[\mathcal{T}_{SU(N)}]$ by analytically computing the Wilson line Schur index, and imposing modular invariance. We further establish a map from the $\mathbb{V}[\mathcal{T}_{SU(N)}]$ characters to the characters of …

An algebra modality admitting countably many deriving transformations
Jean-Baptiste Vienney
https://arxiv.org/abs/2510.03953 https://arxiv.org/pdf/2510.039…

An algebra modality admitting countably many deriving transformations
A differential category is an additive symmetric monoidal category, that is, a symmetric monoidal category enriched over commutative monoids, with an algebra modality, axiomatizing smooth functions, and a deriving transformation on this algebra modality, axiomatizing differentiation. Lemay proved that a comonoidal algebra modality has at most one deriving transformation, thus differentiation is unique in models of differential linear logic. It was then an open problem whether this result extend…

Retrofitting Control Flow Graphs in LLVM IR for Auto Vectorization
Shihan Fang, Wenxin Zheng
https://arxiv.org/abs/2510.04890 https://arxiv.org/pdf/2510.04…

Retrofitting Control Flow Graphs in LLVM IR for Auto Vectorization
Modern processors increasingly rely on SIMD instruction sets, such as AVX and RVV, to significantly enhance parallelism and computational performance. However, production-ready compilers like LLVM and GCC often fail to fully exploit available vectorization opportunities due to disjoint vectorization passes and limited extensibility. Although recent attempts in heuristics and intermediate representation (IR) designs have attempted to address these problems, efficiently simplifying control flow a…

Crosslisted article(s) found for cs.CL. https://arxiv.org/list/cs.CL/new
[3/4]:
- Don't Pass$\mathtt{@}k$: A Bayesian Framework for Large Language Model Evaluation
Mohsen Hariri, Amirhossein Samandar, Michael Hinczewski, Vipin Chaudhary

An Empirical Study of Rational Tree Unification for miniKanren
Eridan Domoratskiy, Dmitrii Kosarev, Dmitry Boulytchev
https://arxiv.org/abs/2510.03789 https://

An Empirical Study of Rational Tree Unification for miniKanren
We present a study of unification for rational trees in the context of miniKanren. We give the definition of rational trees, specify the unification algorithm and prove some of its properties. We also introduce a number of heuristic optimizations and evaluate them for a number of relevant benchmarks. Finally we discuss the relations between rational and conventional unification algorithms and possible scenarios of their coexistence in the context of relational programming.

On Convergence Rates of General $N$-Player Stackelberg Games to their Mean Field Limits
Alain Bensoussan, Ziyu Huang, Sheng Wang, Sheung Chi Phillip Yam
https://arxiv.org/abs/2510.02380

On Convergence Rates of General $N$-Player Stackelberg Games to their Mean Field Limits
In this article, we establish precise convergence rates of a general class of $N$-Player Stackelberg games to their mean field limits, which allows the response time delay of information, empirical distribution based interactions, and the control-dependent diffusion coefficients. All these features makes our problem nonstandard, barely been touched in the literature, and they complicate the analysis and therefore reduce the convergence rate. We first justify the same convergence rate for both t…

Replaced article(s) found for quant-ph. https://arxiv.org/list/quant-ph/new
[3/4]:
- Error stabilized logical qubits in qudit generalizations of the monitored Kitaev model
Aayush Vijayvargia, Ezra Day-Roberts, Onur Erten

MICROTRIPS: MICRO-geography TRavel Intelligence and Pattern Synthesis
Yangyang Wang, Tayo Fabusuyi
https://arxiv.org/abs/2510.05080 https://arxiv.org/pdf/2…

MICROTRIPS: MICRO-geography TRavel Intelligence and Pattern Synthesis
This study presents a novel small-area estimation framework to enhance urban transportation planning through detailed characterization of travel behavior. Our approach improves on the four-step travel model by employing publicly available microdata files and machine learning methods to predict travel behavior for a representative, synthetic population at small geographic areas. This approach enables high-resolution estimation of trip generation, trip distribution, mode choice, and route assignm…

edit_wiktionary: Wiktionary edits (2010)
Three bipartite user-page networks extracted from Wiktionary, for French, German, and English. A user connects to a page if that user edited that page. Edits (edges) are timestamped. Edge weights represent counts of the number of edits.
This network has 142 nodes and 156 edges.
Tags: Informational, Web graph, Multigraph, Timestamps

Encoding Numeric Computations and Infusing Heuristic Knowledge Using Integrity Constraints in stableKanren
Xiangyu Guo, Ajay Bansal
https://arxiv.org/abs/2510.04049 https://

Encoding Numeric Computations and Infusing Heuristic Knowledge Using Integrity Constraints in stableKanren
This paper presents examples of using integrity constraints in stableKanren to encode numeric computations for problem solving. Then, we use one of the examples to introduce multiple ways to infuse heuristic knowledge and reduce solving time. stableKanren is an extension of miniKanren that supports normal logic programs under stable model semantics. stableKanren further supports numeric computation by constructing a constraint store for integrity constraints. There are three ways to extend a re…

[2025-10-06 Mon (UTC), 18 new articles found for math.OC Optimization and Control]
toXiv_bot_toot

Replaced article(s) found for quant-ph. https://arxiv.org/list/quant-ph/new
[2/4]:
- Pre-Floquet states facilitating coherent subharmonic response of periodically driven many-body sy...
Steffen Seligmann, Hamed Koochaki Kelardeh, Martin Holthaus

Boomerang Distillation Enables Zero-Shot Model Size Interpolation
Sara Kangaslahti, Nihal V. Nayak, Jonathan Geuter, Marco Fumero, Francesco Locatello, David Alvarez-Melis
https://arxiv.org/abs/2510.05064

Boomerang Distillation Enables Zero-Shot Model Size Interpolation
Large language models (LLMs) are typically deployed under diverse memory and compute constraints. Existing approaches build model families by training each size independently, which is prohibitively expensive and provides only coarse-grained size options. In this work, we identify a novel phenomenon that we call boomerang distillation: starting from a large base model (the teacher), one first distills down to a small student and then progressively reconstructs intermediate-sized models by re-in…

Replaced article(s) found for cs.LO. https://arxiv.org/list/cs.LO/new
[1/1]:
- Extensional Taylor Expansion
Lison Blondeau-Patissier, Pierre Clairambault, Lionel Vaux Auclair

Replaced article(s) found for quant-ph. https://arxiv.org/list/quant-ph/new
[1/4]:
- HierarchicalEOM.jl: An efficient Julia framework for hierarchical equations of motion in open qua...
Huang, Kuo, Lambert, Cirio, Cross, Yang, Nori, Chen

ResCP: Reservoir Conformal Prediction for Time Series Forecasting
Roberto Neglia, Andrea Cini, Michael M. Bronstein, Filippo Maria Bianchi
https://arxiv.org/abs/2510.05060 https…

ResCP: Reservoir Conformal Prediction for Time Series Forecasting
Conformal prediction offers a powerful framework for building distribution-free prediction intervals for exchangeable data. Existing methods that extend conformal prediction to sequential data rely on fitting a relatively complex model to capture temporal dependencies. However, these methods can fail if the sample size is small and often require expensive retraining when the underlying data distribution changes. To overcome these limitations, we propose Reservoir Conformal Prediction (ResCP), a…

Crosslisted article(s) found for cs.LO. https://arxiv.org/list/cs.LO/new
[1/1]:
- Bridging LLM Planning Agents and Formal Methods: A Case Study in Plan Verification
Keshav Ramani, Vali Tawosi, Salwa Alamir, Daniel Borrajo

Crosslisted article(s) found for quant-ph. https://arxiv.org/list/quant-ph/new
[2/2]:
- Finite temperature dopant-induced spin reorganization explored via tensor networks in the two-dim...
Yintati Zhang, Aritra Sinha, Marek M. Rams, Jacek Dziarmaga

One rig to control them all
Chris Heunen, Robin Kaarsgaard, Louis Lemonnier
https://arxiv.org/abs/2510.05032 https://arxiv.org/pdf/2510.05032

One rig to control them all
We introduce a theory for computational control, consisting of seven naturally interpretable equations. Adding these to a prop of base circuits constructs controlled circuits, borne out in examples of reversible Boolean circuits and quantum circuits. We prove that this syntactic construction semantically corresponds to taking the free rig category on the base prop.

Crosslisted article(s) found for quant-ph. https://arxiv.org/list/quant-ph/new
[1/2]:
- Spatial uniformity of g-tensor and spin-orbit interaction in germanium hole spin qubits
Inga Seidler, et al.

Curved Boolean Logic: A Contextual Generalization of Propositional Logic with Algorithmic Consequences
Maximilian R. P. von Liechtenstein
https://arxiv.org/abs/2510.04716 https:…

Curved Boolean Logic: A Contextual Generalization of Propositional Logic with Algorithmic Consequences
Curved Boolean Logic (CBL) generalizes propositional logic by allowing local truth assignments that do not extend to a single global valuation, analogous to curvature in geometry. We give equivalent sheaf and exclusivity-graph semantics and a context-aware proof calculus that is conservative in the flat limit. We formalize CBL-SAT and basic complexity (NP-complete in general) and present operational operators (CBL-AC and CBL-CONS) that prune contradictions earlier on classical hardware. We mode…

Simulating fermions with exponentially lower overhead
Nathan Constantinides, Jeffery Yu, Dhruv Devulapalli, Ali Fahimniya, Andrew M. Childs, Michael J. Gullans, Alexander Schuckert, Alexey V. Gorshkov
https://arxiv.org/abs/2510.05099

Simulating fermions with exponentially lower overhead
Simulating time evolution under fermionic Hamiltonians is a compelling application of quantum computers because it lies at the core of predicting the properties of materials and molecules. Fermions can be simulated on qubit-based quantum computers using a fermion-to-qubit mapping, subject to an overhead -- the circuit depth on a qubit quantum computer divided by that on a quantum computer built from native fermionic modes -- at worst scaling linearly with the number of modes $N$. Existing appro…

Continuation Semantics for Fixpoint Modal Logic and Computation Tree Logics
Ryota Kojima, Corina Cirstea
https://arxiv.org/abs/2510.04653 https://arxiv.org…

Continuation Semantics for Fixpoint Modal Logic and Computation Tree Logics
We introduce continuation semantics for both fixpoint modal logic (FML) and Computation Tree Logic* (CTL*), parameterised by a choice of branching type and quantitative predicate lifting. Our main contribution is proving that they are equivalent to coalgebraic semantics, for all branching types. Our continuation semantics is defined over coalgebras of the continuation monad whose answer type coincides with the domain of truth values of the formulas. By identifying predicates and continuations, …

QuantumBoost: A lazy, yet fast, quantum algorithm for learning with weak hypotheses
Amira Abbas, Yanlin Chen, Tuyen Nguyen, Ronald de Wolf
https://arxiv.org/abs/2510.05089 https…

QuantumBoost: A lazy, yet fast, quantum algorithm for learning with weak hypotheses
The technique of combining multiple votes to enhance the quality of a decision is the core of boosting algorithms in machine learning. In particular, boosting provably increases decision quality by combining multiple weak learners-hypotheses that are only slightly better than random guessing-into a single strong learner that classifies data well. There exist various versions of boosting algorithms, which we improve upon through the introduction of QuantumBoost. Inspired by classical work by Bar…

A Complete Diagrammatic Calculus for Conditional Gaussian Mixtures
Mateo Torres-Ruiz, Robin Piedeleu, Alexandra Silva, Fabio Zanasi
https://arxiv.org/abs/2510.04649 https://

A Complete Diagrammatic Calculus for Conditional Gaussian Mixtures
We extend the synthetic theories of discrete and Gaussian categorical probability by introducing a diagrammatic calculus for reasoning about hybrid probabilistic models in which continuous random variables, conditioned on discrete ones, follow a multivariate Gaussian distribution. This setting includes important classes of models such as Gaussian mixture models, where each Gaussian component is selected according to a discrete variable. We develop a string diagrammatic syntax for expressing and…

Strategy Logic, Imperfect Information, and Hyperproperties
Raven Beutner, Bernd Finkbeiner
https://arxiv.org/abs/2510.03952 https://arxiv.org/pdf/2510.0395…

Strategy Logic, Imperfect Information, and Hyperproperties
Strategy logic (SL) is a powerful temporal logic that enables first-class reasoning over strategic behavior in multi-agent systems (MAS). In many MASs, the agents (and their strategies) cannot observe the global state of the system, leading to many extensions of SL centered around imperfect information, such as strategy logic with imperfect information (SL$_\mathit{ii}$). Along orthogonal lines, researchers have studied the combination of strategic behavior and hyperproperties. Hyperproperties …

On the Cryptographic Foundations of Interactive Quantum Advantage
Kabir Tomer (University of Illinois Urbana-Champaign), Mark Zhandry (Stanford University)
https://arxiv.org/abs/2510.05082

On the Cryptographic Foundations of Interactive Quantum Advantage
In this work, we study the hardness required to achieve proofs of quantumness (PoQ), which in turn capture (potentially interactive) quantum advantage. A ``trivial'' PoQ is to simply assume an average-case hard problem for classical computers that is easy for quantum computers. However, there is much interest in ``non-trivial'' PoQ that actually rely on quantum hardness assumptions, as these are often a starting point for more sophisticated protocols such as classical verification of quantum co…

On Hyperproperty Verification, Quantifier Alternations, and Games under Partial Information
Raven Beutner, Bernd Finkbeiner
https://arxiv.org/abs/2510.03942 https://

On Hyperproperty Verification, Quantifier Alternations, and Games under Partial Information
Hyperproperties generalize traditional trace properties by relating multiple execution traces rather than reasoning about individual runs in isolation. They provide a unified way to express important requirements such as information flow and robustness properties. Temporal logics like HyperLTL capture these properties by explicitly quantifying over executions of a system. However, many practically relevant hyperproperties involve quantifier alternations, a feature that poses substantial challen…

Engineering the uncontrollable: Steering noisy spin-correlated radical-pairs with coherent and incoherent control
Farhan T. Chowdhury, Luke D. Smith, Daniel R. Kattnig
https://arxiv.org/abs/2510.05074 …

Engineering the uncontrollable: Steering noisy spin-correlated radical-pairs with coherent and incoherent control
The quantum control of spin-correlated radical pairs (SCRPs) holds promise for the targeted manipulation of magnetic field effects, with potential applications ranging from the design of noise-resilient quantum information processors to genetically encodable quantum sensors. However, achieving precise handles over the intricate interplay between coherent electron spin dynamics and incoherent relaxation processes in photoexcited radical-pair reactions requires tractable approaches for numericall…

The role of entropy production and thermodynamic uncertainty relations in the thermalization of open quantum systems
\'Alvaro Tejero
https://arxiv.org/abs/2510.05072 https:/…

The role of entropy production and thermodynamic uncertainty relations in the thermalization of open quantum systems
The asymmetry between heating and cooling in open quantum systems is a hallmark of nonequilibrium dynamics, yet its thermodynamic origin has remained unclear. Here, we investigate the thermalization of a quantum system weakly coupled to a thermal bath, focusing on the entropy production rate and the quantum thermokinetic uncertainty relation (TKUR). We derive an analytical expression for the entropy production rate, showing that heating begins with a higher entropy production, which drives fast…

On the Cryptographic Futility of Non-Collapsing Measurements
Alper Cakan (Carnegie Mellon University), Dakshita Khurana (University of Illinois Urbana-Champaign, NTT Research), Tomoyuki Morimae (Yukawa Institute for Theoretical Physics, Kyoto University), Yuki Shirakawa (Yukawa Institute for Theoretical Physics, Kyoto University), Kabir Tomer (University of Illinois Urbana-Champaign), Takashi Yamakawa (NTT Social Informatics Laboratories)

On the Cryptographic Futility of Non-Collapsing Measurements
We investigate quantum analogues of collision resistance and obtain separations between quantum ``one-way'' and ``collision-resistant'' primitives. 1. Our first result studies one-wayness versus collision-resistance defined over quantum circuits that output classical strings. We show that there is a classical oracle $\mathcal{O}$ relative to which (sub-exponentially secure) indistinguishability obfuscation and one-way permutations exist even against adversaries that make quantum queries to a …

Optimizaci\'on de la Transmisi\'on de Estados Cu\'anticos en Cadenas de Qubits usando Deep Reinforcement Learning y Algoritmos Gen\'eticos
Sof\'ia Per\'on Santana, Ariel Fiuri, Omar Osenda, Mart\'in Dom\'inguez
https://arxiv.org/abs/2510.05010

Optimización de la Transmisión de Estados Cuánticos en Cadenas de Qubits usando Deep Reinforcement Learning y Algoritmos Genéticos
Quantum state transfer (QST) via homogeneous spin chains plays a crucial role in building scalable quantum hardware. A basic quantum state transmission protocol prepares a state in one qubit and transfers it to another through a channel, seeking to minimize the time and avoid information loss. The fidelity of the process is measured by functions proportional to the transition probability between both states. We approach this optimization problem using constant magnetic pulses and two complement…

Correcting quantum errors using a classical code and one additional qubit
Tenzan Araki, Joseph F. Goodwin, Zhenyu Cai
https://arxiv.org/abs/2510.05008 https://

Correcting quantum errors using a classical code and one additional qubit
Classical error-correcting codes are powerful but incompatible with quantum noise, which includes both bit-flips and phase-flips. We introduce Hadamard-based Virtual Error Correction (H-VEC), a protocol that empowers any classical bit-flip code to correct arbitrary Pauli noise with the addition of only a single ancilla qubit and two layers of controlled-Hadamard gates. Through classical post-processing, H-VEC virtually filters the error channel, projecting the noise into pure Y-type errors that…

Characterization of permutation gates in the third level of the Clifford hierarchy
Zhiyang He, Luke Robitaille, Xinyu Tan
https://arxiv.org/abs/2510.04993 https://

Characterization of permutation gates in the third level of the Clifford hierarchy
The Clifford hierarchy is a fundamental structure in quantum computation whose mathematical properties are not fully understood. In this work, we characterize permutation gates -- unitaries which permute the $2^n$ basis states -- in the third level of the hierarchy. We prove that any permutation gate in the third level must be a product of Toffoli gates in what we define as \emph{staircase form}, up to left and right multiplications by Clifford permutations. We then present necessary and suffic…

Less is More: On Copy Complexity in Quantum Cryptography
Prabhanjan Ananth, Eli Goldin
https://arxiv.org/abs/2510.04992 https://arxiv.org/pdf/2510.04992

Less is More: On Copy Complexity in Quantum Cryptography
Quantum cryptographic definitions are often sensitive to the number of copies of the cryptographic states revealed to an adversary. Making definitional changes to the number of copies accessible to an adversary can drastically affect various aspects including the computational hardness, feasibility, and applicability of the resulting cryptographic scheme. This phenomenon appears in many places in quantum cryptography, including quantum pseudorandomness and unclonable cryptography. To address th…

Quantum walks through generalized graph composition
Arjan Cornelissen
https://arxiv.org/abs/2510.04973 https://arxiv.org/pdf/2510.04973

Quantum walks through generalized graph composition
In this work, we generalize the recently-introduced graph composition framework to the non-boolean setting. A quantum algorithm in this framework is represented by a hypergraph, where each hyperedge is adjacent to multiple vertices. The input and output to the quantum algorithm is represented by a set of boundary vertices, and the hyperedges act like switches, connecting the input vertex to the output that the algorithm computes. Apart from generalizing the graph composition framework, our ne…

Quantum Filtering at Finite Temperature
John Gough
https://arxiv.org/abs/2510.04967 https://arxiv.org/pdf/2510.04967

Quantum Filtering at Finite Temperature
We pose and solve the problem of quantum filtering based on continuous-in-time quadrature measurements (homodyning) for the case where the quantum process is in a thermal state. The standard construction of quantum filters involves the determination of the conditional expectation onto the von Neumann algebra generated by the measured observables with the non-demolition principle telling us to restrict the domain (the observables to be estimated) to the commutant of the algebra. The finite-tempe…

Rapid Mixing of Quantum Gibbs Samplers for Weakly-Interacting Quantum Systems
\v{S}t\v{e}p\'an \v{S}m\'id, Richard Meister, Mario Berta, Roberto Bondesan
https://arxiv.org/abs/2510.04954

Rapid Mixing of Quantum Gibbs Samplers for Weakly-Interacting Quantum Systems
Dissipative quantum algorithms for state preparation in many-body systems are increasingly recognised as promising candidates for achieving large quantum advantages in application-relevant tasks. Recent advances in algorithmic, detailed-balance Lindbladians enable the efficient simulation of open-system dynamics converging towards desired target states. However, the overall complexity of such schemes is governed by system-size dependent mixing times. In this work, we analyse algorithmic Lindbla…

Leveraging Analog Neutral Atom Quantum Computers for Diversified Pricing in Hybrid Column Generation Frameworks
C\'edrick Perron, Yves B\'erub\'e-Lauzi\`ere, Victor Drouin-Touchette
https://arxiv.org/abs/2510.04946

Leveraging Analog Neutral Atom Quantum Computers for Diversified Pricing in Hybrid Column Generation Frameworks
In this work, we develop new pulse designs and embedding strategies to improve the analog quantum subroutines of hybrid column generation (CG) algorithms based on neutral-atoms quantum computers (NAQCs). These strategies are designed to improve the quality and diversity of the samples generated. We apply these to an important combinatorial optimization (CO) problem in logistics, namely the fleet assignment. Depending on the instance tested, our quantum protocol has a performance that is either …

The NPA hierarchy does not always attain the commuting operator value
Marco Fanizza, Larissa Kroell, Arthur Mehta, Connor Paddock, Denis Rochette, William Slofstra, Yuming Zhao
https://arxiv.org/abs/2510.04943

The NPA hierarchy does not always attain the commuting operator value
We show that it is undecidable to determine whether the commuting operator value of a nonlocal game is strictly greater than 1/2. As a corollary, there is a boolean constraint system (BCS) game for which the value of the Navascués-Pironio-Acín (NPA) hierarchy does not attain the commuting operator value at any finite level. Our contribution involves establishing a computable mapping from Turing machines to BCS nonlocal games in which the halting property of the machine is encoded as a decisio…

Efficient Quantum Hermite Transform
Siddhartha Jain, Vishnu Iyer, Rolando D. Somma, Ning Bao, Stephen P. Jordan
https://arxiv.org/abs/2510.04929 https://ar…

Efficient Quantum Hermite Transform
We present a new primitive for quantum algorithms that implements a discrete Hermite transform efficiently, in time that depends logarithmically in both the dimension and the inverse of the allowable error. This transform, which maps basis states to states whose amplitudes are proportional to the Hermite functions, can be interpreted as the Gaussian analogue of the Fourier transform. Our algorithm is based on a method to exponentially fast forward the evolution of the quantum harmonic oscillato…

Improved Clifford operations in constant commutative depth
Richard Cleve, Zhiqian Ding, Luke Schaeffer
https://arxiv.org/abs/2510.04921 https://arxiv.org/p…

Improved Clifford operations in constant commutative depth
The commutative depth model allows gates that commute with each other to be performed in parallel. We show how to compute Clifford operations in constant commutative depth more efficiently than was previously known. Bravyi, Maslov, and Nam [Phys. Rev. Lett. 129:230501, 2022] showed that every element of the Clifford group (on $n$ qubits) can be computed in commutative depth 23 and size $O(n^2)$. We show that the Prefix Sum problem can be computed in commutative depth 16 and size $O(n \log n)$, …

Do Qubit States have to be non-degenerate two-level systems?
Zhuoran Bao, Daniel F. V. James
https://arxiv.org/abs/2510.04880 https://arxiv.org/pdf/2510.04…

Do Qubit States have to be non-degenerate two-level systems?
A qubit, or quantum bit, is conventionally defined as "a physical system for storing information that is capable of existing in either of two quantum states or in a superposition of both". In this paper, we examine the simple question of whether two distinct levels, each consisting of multiply degenerate sub-states, could serve as a practical quantum bit. We explore this idea using a well-characterized atomic system of the kind employed in several quantum computing implementations. We approxima…

A new application of the Fox-Wright functions: the coherent states formalism
Dusan Popov
https://arxiv.org/abs/2510.04874 https://arxiv.org/pdf/2510.04874

A new application of the Fox-Wright functions: the coherent states formalism
In this paper we extend the applicability of Fox-Wright functions beyond mathematics, specifically in quantum physics. We focused our attention on a new application, on the connection between the Fox-Wright functions and the generalized coherent states formalism. We constructed the generalized coherent states in the Barut-Girardello manner, in which the Fox-Wright functions play the role of normalization functions, and we demonstrated that the Fox-Wright coherent states satisfy all general cond…

Information-thermodynamic bounds on precision in interacting quantum systems
Ryotaro Honma, Tan Van Vu
https://arxiv.org/abs/2510.04866 https://arxiv.org/p…

Information-thermodynamic bounds on precision in interacting quantum systems
The thermodynamic uncertainty relation quantifies a trade-off between the relative fluctuations of trajectory currents and the thermodynamic cost, indicating that the current precision is fundamentally constrained by entropy production. In classical bipartite systems, it has been shown that information flow between subsystems can enhance the current precision alongside thermodynamic dissipation. In this study, we investigate how information flow, local dissipation, and quantum effects jointly c…

Super-resolution of partially coherent bosonic sources
Joaqu\'in L\'opez-Su\'arez, Michalis Skotiniotis
https://arxiv.org/abs/2510.04818 https://

Super-resolution of partially coherent bosonic sources
We consider the problem of imaging two partially coherent sources and derive the ultimate quantum limits for estimating all relevant parameters, namely their separation, relative intensity, as well as their coherence factor. We show that the separation of the two sources can be super-resolved over the entire range of all other pertinent parameters (with the exception of fully coherent sources), with anti-correlated sources furnishing the largest possible gain in estimation precision, using a bi…

Far-from-equilibrium thermodynamics of non-Abelian thermal states
Franklin L. S. Rodrigues, Eric Lutz
https://arxiv.org/abs/2510.04788 https://arxiv.org/pd…

Far-from-equilibrium thermodynamics of non-Abelian thermal states
Noncommutativity of observables is a central feature of quantum physics. It plays a fundamental role in the formulation of the uncertainty principle for complementary variables and strongly affects the laws of thermodynamics for systems with noncommuting, that is, non-Abelian, conserved quantities. We here derive nonequilibrium generalizations of the second law of thermodynamics in the form of fluctuation relations, both for mechanically and thermally driven quantum systems. We identify a non-A…

Counterdiabatic driving at Rydberg excitation for symmetric $C_Z$ gates with ultracold neutral atoms
I. I. Beterov, K. V. Kozenko, P. Xu, I. I. Ryabtsev
https://arxiv.org/abs/2510.04766

Counterdiabatic driving at Rydberg excitation for symmetric $C_Z$ gates with ultracold neutral atoms
We extend the scheme of neutral atom Rydberg $C_Z$ gate based on double sequence of adiabatic pulses applied symmetrically to both atoms using counterdiabatic driving in the regime of Rydberg blockade. This provides substantial reducing of quantum gate operation times (at least five times) compared to previously proposed adiabatic schemes, which is important for high-fidelity entanglement due to finite Rydberg lifetimes. We analyzed schemes of adiabatic rapid passage with counterdiabatic drivin…

Collusion-Resistant Quantum Secure Key Leasing Beyond Decryption
Fuyuki Kitagawa, Ryo Nishimaki, Nikhil Pappu
https://arxiv.org/abs/2510.04754 https://arxi…

Collusion-Resistant Quantum Secure Key Leasing Beyond Decryption
Secure key leasing (SKL) enables the holder of a secret key for a cryptographic function to temporarily lease the key using quantum information. Later, the recipient can produce a deletion certificate, which proves that they no longer have access to the secret key. The security guarantee ensures that even a malicious recipient cannot continue to evaluate the function, after producing a valid deletion certificate. Most prior work considers an adversarial recipient that obtains a single leased …

Quantum Reservoir Computing for Credit Card Default Prediction on a Neutral Atom Platform
Giacomo Vitali, Chiara Vercellino, Paolo Viviani, Olivier Terzo, Bartolomeo Montrucchio, Valeria Zaffaroni, Francesca Cibrario, Christian Mattia, Giacomo Ranieri, Alessandro Sabatino, Francesco Bonazzi, Davide Corbelletto
https://arxiv.org/abs/2510.04…

Quantum Reservoir Computing for Credit Card Default Prediction on a Neutral Atom Platform
In this paper, we define and benchmark a hybrid quantum-classical machine learning pipeline by performing a binary classification task applied to a real-world financial use case. Specifically, we implement a Quantum Reservoir Computing (QRC) layer within a classical routine that includes data preprocessing and binary classification. The reservoir layer has been executed on QuEra's Aquila, a 256-qubit neutral atom simulator, using two different types of encoding: position and local detuning. In …

Quantum Subgradient Estimation for Conditional Value-at-Risk Optimization
Vasilis Skarlatos, Nikos Konofaos
https://arxiv.org/abs/2510.04736 https://arxiv.…

Quantum Subgradient Estimation for Conditional Value-at-Risk Optimization
Conditional Value-at-Risk (CVaR) is a leading tail-risk measure in finance, central to both regulatory and portfolio optimization frameworks. Classical estimation of CVaR and its gradients relies on Monte Carlo simulation, incurring $O(1/ε^2)$ sample complexity to achieve $ε$-accuracy. In this work, we design and analyze a quantum subgradient oracle for CVaR minimization based on amplitude estimation. Via a tripartite proposition, we show that CVaR subgradients can be estimated with $O(1/ε)$…