Related papers: Dynamic Conjunctive Queries
The qualitatively new concept of dynamic complexity in quantum mechanics is based on a new paradigm appearing within a nonperturbational analysis of the Schroedinger equation for a generic Hamiltonian system. The unreduced analysis…
Let $M$ be a smooth manifold equipped with a conformal structure, $E[w]$ the space of densities with the the conformal weight $w$ and $D_{w,w+\de}$ the space of differential operators from $E[w]$ to $E[w+\delta]$. Conformal quantization $Q$…
Existential rules are an expressive knowledge representation language mainly developed to query data. In the literature, they are often supposed to be in some normal form that simplifies technical developments. For instance, a common…
Complex dynamics when occurring autonomously, i.e. without external driving, is usually associated with everyday length scales and classical physics, e.g. living organisms. This dynamics is \emph{not} quantum coherent. Quantum coherent…
Quantum Darwinism (QD) proposes that classical objectivity emerges from the broadcast of information about a microscopic degree of freedom into multiple fractions of a many-body environment. Such a broadcast of information is in sharp…
We discuss dissipative systems in Quantum Field Theory by studying the canonical quantization of the damped harmonic oscillator (dho). We show that the set of states of the system splits into unitarily inequivalent representations of the…
We present new descriptive complexity characterisations of classes REG (regular languages), LCFL (linear context-free languages) and CFL (context-free languages) as restrictions on inference rules, size of formulae and permitted connectives…
Phase covariant qubit dynamics describes an evolution of a two-level system under simultaneous action of pure dephasing, energy dissipation, and energy gain with time-dependent rates $\gamma_z(t)$, $\gamma_-(t)$, and $\gamma_+(t)$,…
Due to the importance of linear algebra and matrix operations in data analytics, there is significant interest in using relational query optimization and processing techniques for evaluating (sparse) linear algebra programs. In particular,…
We study the enumeration complexity of Unions of Conjunctive Queries(UCQs). We aim to identify the UCQs that are tractable in the sense that the answer tuples can be enumerated with a linear preprocessing phase and a constant delay between…
Extensive research in the field of ontology-based query answering has led to the identification of numerous fragments of existential rules (also known as tuple-generating dependencies) that exhibit decidable answering of atomic and…
Coarse-grained descriptions can be used to account for physical processes in which information is lost or not entirely accessible. In this paper, we start by proposing a connection between effective, coarse-grained descriptions of quantum…
During the last decades, a lot of effort was put into identifying decidable fragments of first-order logic. Such efforts gave birth, among the others, to the two-variable fragment and the guarded fragment, depending on the type of…
The theory of quantum dynamical semigroups within the mathematically rigorous framework of completely positive dynamical maps is reviewed. First, the axiomatic approach which deals with phenomenological constructions and general…
Classical model S_dc of Dirac particle S_D is constructed. S_D is the dynamic system described by the Dirac equation. Its classical analog S_dc is described by a system of ordinary differential equations, containing the quantum constant h…
Despite considerable progress in several approaches to quantum gravity, there remain uncertainties on the conceptual level. One issue concerns the different roles played by space and time in the canonical quantum formalism. This issue…
In idealized models of a quantum register and its environment, quantum information can be stored indefinitely by encoding it into a decoherence-free subspace (DFS). Nevertheless, perturbations to the idealized register-environment coupling…
Quantum language models have shown competitive performance on sequential tasks, yet whether trained quantum circuits exploit genuinely quantum resources -- or merely embed classical computation in quantum hardware -- remains unknown. Prior…
Constraints over finite sequences of variables are ubiquitous in sequencing and timetabling. Moreover, the wide variety of such constraints in practical applications led to general modelling techniques and generic propagation algorithms,…
Automatic differentiation represents a paradigm shift in scientific programming, where evaluating both functions and their derivatives is required for most applications. By removing the need to explicitly derive expressions for gradients,…