Related papers: Talking quiescence: a rigorous theory that support…
It is generally recognized that a distinguishing feature of life is its peculiar capability to avoid equilibration. The origin of this capability and its evolution along the timeline of abiogenesis is not yet understood. We propose to study…
We introduce a bisimulation learning algorithm for non-deterministic transition systems. We generalise bisimulation learning to systems with bounded branching and extend its applicability to model checking branching-time temporal logic,…
We study the transition probability and coherence of a two-site system, interacting with an oscillator. Both properties depend on the initial preparation. The oscillator is prepared in a thermal state and, even though it cannot be…
Parallel test-time scaling (TTS) is a pivotal approach for enhancing large language models (LLMs), typically by sampling multiple token-based chains-of-thought in parallel and aggregating outcomes through voting or search. Recent advances…
Confinement is an intriguing phenomenon prevalent in condensed matter and high-energy physics. Exploring its effect on the far-from-equilibrium criticality of quantum many-body systems is of great interest both from a fundamental and…
This article deals with input-to-state stability (ISS) of discrete-time switched systems. Given a family of nonlinear systems with exogenous inputs, we present a class of switching signals under which the resulting switched system is ISS.…
Text-to-speech (TTS) synthesis has seen renewed progress under the discrete modeling paradigm. Existing autoregressive approaches often rely on single-codebook representations, which suffer from significant information loss. Even with…
Phase transitions mark qualitative reorganizations of collective behavior, yet identifying their boundaries remains challenging whenever analytic solutions are absent and conventional simulations fail. Here we introduce learnability as a…
Large language models (LLMs) rarely admit uncertainty, often producing fluent but misleading answers, rather than abstaining (i.e., refusing to answer). This weakness is even evident in temporal question answering, where models frequently…
Linear time-translation-invariant (LTI) models offer simple, yet powerful, abstractions of complex classical dynamical systems. Quantum versions of such models have so far relied on assumptions of Markovianity or an internal state-space…
Zero-shot Text-to-Speech (TTS) has recently advanced significantly, enabling models to synthesize speech from text using short, limited-context prompts. These prompts serve as voice exemplars, allowing the model to mimic speaker identity,…
Learning problems involving quantum data are natural candidates for demonstrating an advantage in quantum machine learning. Recent results indicate that, for certain tasks and under noiseless conditions, coherent processing of quantum data…
This Report explores recent advances in our understanding of the physics of open quantum systems (OQSs) which consist of some localized region that is coupled to an external environment. Examples of such systems may be found in numerous…
Quantum sensors and qubits are usually two-level systems (TLS), the quantum analogs of classical bits which assume binary values '0' or '1'. They are useful to the extent to which they can persist in quantum superpositions of '0' and '1' in…
Dynamical quantum phase transitions (DQPTs) extend the concept of phase transitions and thus universality to the non-equilibrium regime. In this letter, we investigate DQPTs in a string of ions simulating interacting transverse-field Ising…
We examine the complementarity among coherence (visibility), predictability, and entanglement for qubit and qutrit systems subjected to noisy quantum channels. Using the system-path entanglement framework, analytical expressions for all…
State machine formalisms equipped with hierarchy and parallelism allow to compactly model complex system behaviours. Such models can then be transformed into executable code or inputs for model-based testing and verification techniques.…
We propose a relaxation to the definition of well-structured transition systems (\WSTS) while retaining the decidability of boundedness and non-termination. In this class, the well-quasi-ordered (wqo) condition is relaxed such that it is…
Quantum computers promise to perform computations beyond the reach of modern computers with profound implications for scientific research. Due to remarkable technological advances, small scale devices are now becoming available for use. One…
Recently, in order to mix algebraic and logic styles of specification in a uniform framework, the notion of a logic labelled transition system (Logic LTS or LLTS for short) has been introduced and explored. A variety of constructors over…