相关论文: A Generalized Quantifier Concept in Computational …

This paper presents a research program aimed at establishing relational foundations for relativistic quantum physics. Although the formalism is still under development, we believe it has matured enough to be shared with the broader…

In this paper, we give appropriate languages in which the theory of tame fields (of any characteristic) admits (relative) quantifier elimination.

The general structure of the Sp(2) covariant version of the field-antifield quantization of general constrained systems in the Lagrangian formalism, the so called triplectic quantization, as presented in our previous paper with…

We present alternative definitions of the first-order stable model semantics and its extension to incorporate generalized quantifiers by referring to the familiar notion of a reduct instead of referring to the SM operator in the original…

Categorical universal algebra can be developed either using Lawvere theories (single-sorted finite product theories) or using monads, and the category of Lawvere theories is equivalent to the category of finitary monads on Set. We show how…

We consider a notion of relative homology (and cohomology) for surfaces with two types of boundaries. Using this tool, we study a generalization of Kitaev's code based on surfaces with mixed boundaries. This construction includes both…

It is indicated that principal models of computation are indeed significantly related. The quantum field computation model contains the quantum computation model of Feynman. (The term "quantum field computer" was used by Freedman.) Quantum…

In a recent paper by the authors, Lie bialgebras structures of generalized Virasoro-like type were considered. In this paper, the explicit formula of the quantization of generalized Virasoro-like algebras is presented.

The theory of computational complexity focuses on functions and, hence, studies programs whose interactive behavior is reduced to a simple question/answer pattern. We propose a broader theory whose ultimate goal is expressing and analyzing…

We firstly show that the standard interpretation of natural quantification in mathematical logic does not provide a satisfying account of its original richness. In particular, it ignores the difference between generic and distributive…

We define generalized bialgebras and Hopf algebras and on this basis we introduce quantum categories and quantum groupoids. The quantization of the category of linear (super)spaces is constructed. We establish a criterion for the classical…

We introduce a hierarchical classification of theories that describe systems with fundamentally limited information content. This property is introduced in an operational way and gives rise to the existence of mutually complementary…

In this Note, we propose a line bundle approach to odd-dimensional analogues of generalized complex structures. This new approach has three main advantages: (1) it encompasses all existing ones; (2) it elucidates the geometric meaning of…

In this paper is considered a generalized quantization principle for the gravitational field in canonical quantum gravity, especially with respect to quantum geometrodynamics. This assumption can be interpreted as a transfer from the…

This is an introductory note concerning the distribution vectors in a unitary representation of a Lie group. We discuss the definition of matrix coefficients associated with a pair of distributions and how one can compute them. Most of the…

Theories of natural language and concepts have been unable to model the flexibility, creativity, context-dependence, and emergence, exhibited by words, concepts and their combinations. The mathematical formalism of quantum theory has…

We introduce a concept of a quantum wide sense stationary process taking values in a C*-algebra and expected in a sub-algebra. The power spectrum of such a process is defined, in analogy to classical theory, as a positive measure on…

This paper introduces a new inequality in algorithmic information theory that can be seen as an extended coding theorem. This inequality has applications in new bounds between quantum complexity measures.

We extend the theory of distributional kernel operators to a framework of generalized functions, in which they are replaced by integral kernel operators. Moreover, in contrast to the distributional case, we show that these generalized…

This article surveys quantum computational complexity, with a focus on three fundamental notions: polynomial-time quantum computations, the efficient verification of quantum proofs, and quantum interactive proof systems. Properties of…