Nonlinear extension of the quantum dynamical semigroup

In this paper we consider deterministic nonlinear time evolutions satisfying so called convex quasi-linearity condition. Such evolutions preserve the equivalence of ensembles and therefore are free from problems with signaling. We show that if family of linear non-trace-preserving maps satisfies the semigroup property then the generated family of convex quasi-linear operations also possesses the semigroup property. Next we generalize the Gorini-Kossakowski-Sudarshan-Lindblad type equation for the considered evolution. As examples we discuss the general qubit evolution in our model as well as an extension of the Jaynes-Cummings model. We apply our formalism to spin density matrix of a charged particle moving in the electromagnetic field as well as to flavor evolution of solar neutrinos.

Absence of Non-Trivial Fuzzy Inner Product Spaces and the Cauchy–Schwartz Inequality

First, we show that the non-trivial fuzzy inner product space under the linearity condition does not exist, which means a fuzzy inner product space with linearity produces only a crisp real number for each pair of vectors. If the positive-definiteness is added to the condition, then the Cauchy–Schwartz inequality is also proved.

Complexity and Expressive Power of Disjunction and Negation in Limit Datalog

Limit Datalog is a fragment of Datalogℤ—the extension of Datalog with arithmetic functions over the integers—which has been proposed as a declarative language suitable for capturing data analysis tasks. In limit Datalog programs, all intensional predicates with a numeric argument are limit predicates that keep maximal (or minimal) bounds on numeric values. Furthermore, to ensure decidability of reasoning, limit Datalog imposes a linearity condition restricting the use of multiplication in rules. In this paper, we study the complexity and expressive power of limit Datalog programs extended with disjunction in the heads of rules and non-monotonic negation under the stable model semantics. We show that allowing for unrestricted use of negation leads to undecidability of reasoning. Decidability can be restored by stratifying the use of negation over predicates carrying numeric values. We show that the resulting language is Π2EXP -complete in combined complexity and that it captures Π2P over ordered structures in the sense of descriptive complexity.We also provide a study of several fragments of this language: we show that the complexity and expressive power of the full language are already reached for disjunction-free programs; furthermore, we show that semi-positive disjunctive programs are coNEXPcomplete and that they capture coNP.