Related papers: Dynamic Conjunctive Queries
We introduce a quantum extension of dynamic programming, a fundamental computational method that efficiently solves recursive problems using memory. Our innovation lies in showing how to coherently generate recursion step unitaries by using…
A formalism is presented in which quantum particle dynamics can be developed on its own rather than `quantization' of an underlying classical theory. It is proposed that the unification of probability and dynamics should be considered as…
It is well known that dependence logic captures the complexity class NP, and it has recently been shown that inclusion logic captures P on ordered models. These results demonstrate that team semantics offers interesting new possibilities…
A causal, non-Hermitian, renormalizable, local, unitary and Lorentz convariant formulation of Quantum Theory (QT) (= Quantum Mechanics (QM) and Quantum Field Theory (QFT)) is developed which is free of formalistic problems we face in the…
In conventional quantum mechanics the quantum particle is a special object, whose properties are described by special concepts and quantum principles. The quantization is a special procedure, which is accompanied by introduction of special…
A dynamical quantum model assigns an eigenstate to a specified observable even when no measurement is made, and gives a stochastic evolution rule for that eigenstate. Such a model yields a distribution over classical histories of a quantum…
Combining abstract to laboratory projected quantum states a general analysis of headline quantum phenomena is presented. Standard representation mode is replaced; instead quantum states sustained by elementary material constituents occupy…
Ontology-based query answering (OBQA) asks whether a Boolean conjunctive query is satisfied by all models of a logical theory consisting of a relational database paired with an ontology. The introduction of existential rules (i.e., Datalog…
Cumulative logics are studied in an abstract setting, i.e., without connectives, very much in the spirit of Makinson's early work. A powerful representation theorem characterizes those logics by choice functions that satisfy a weakening of…
Quantum physics has revealed many interesting formal properties associated with the algebra of two operators, A and B, satisfying the partial commutation relation AB-BA=1. This study surveys the relationships between classical combinatorial…
We investigate the complexity of satisfiability for finite-variable fragments of propositional dynamic logics. We consider three formalisms belonging to three representative complexity classes, broadly understood,---regular PDL, which is…
I offer a case that quantum query complexity still has loads of enticing and fundamental open problems -- from relativized QMA versus QCMA and BQP versus IP, to time/space tradeoffs for collision and element distinctness, to polynomial…
We investigate the query evaluation problem for fixed queries over fully dynamic databases where tuples can be inserted or deleted. The task is to design a dynamic data structure that can immediately report the new result of a fixed query…
We study the problem of consistent query answering under primary key violations. In this setting, the relations in a database violate the key constraints and we are interested in maximal subsets of the database that satisfy the constraints,…
We analyze the behaviour of two quantum dynamical entropies in connection with the classical limit. Using strongly chaotic classical dynamical systems as models (Arnold Cat Maps and Sawtooth Maps), we also propose a discretization procedure…
We study the problem of answering conjunctive queries with free access patterns (CQAPs) under updates. A free access pattern is a partition of the free variables of the query into input and output. The query returns tuples over the output…
This paper explores the space of (propositional) probabilistic logical languages, ranging from a purely `qualitative' comparative language to a highly `quantitative' language involving arbitrary polynomials over probability terms. While…
We employ $(1 + 1)$-dimensional quantum cellular automata to study the evolution of entanglement and coherence near criticality in quantum systems that display non-equilibrium steady-state phase transitions. This construction permits direct…
The formalism of classical and quantum mechanics on phase space leads to symplectic and Heisenberg group representations, respectively. The Wigner functions give a representation of the quantum system using classical variables. The…
Standard answer set programming (ASP) targets at solving search problems from the first level of the polynomial time hierarchy (PH). Tackling search problems beyond NP using ASP is less straightforward. The class of disjunctive logic…