Related papers: A Simplified and Improved Free-Variable Framework …
We consider the quantum processor based on a chain of trapped ions to propose an architecture wherein the motional degrees of freedom of trapped ions (position and momentum) could be exploited as the computational Hilbert space. We adopt a…
We develop a synthesis of Turing's paradigm of computation and von Neumann's quantum logic to serve as a model for quantum computation with recursion, such that potentially non-terminating computation can take place, as in a quantum Turing…
We use a model operator approach and the spectral theorem for self-adjoint operators in a Hilbert space to derive the basic results of abstract left-definite theory in a straightforward manner. The theory is amply illustrated with a variety…
A class of pseudo-hermitian quantum system with an explicit form of the positive-definite metric in the Hilbert space is presented. The general method involves a realization of the basic canonical commutation relations defining the quantum…
We present a systematic perturbative construction of the most general metric operator (and positive-definite inner product) for quasi-Hermitian Hamiltonians of the standard form, H= p^2/2 + v(x), in one dimension. We show that this problem…
We give an explicit characterization of the most general quasi-Hermitian operator H, the associated metric operators \eta_+, and \eta_+-pseudo-Hermitian operators acting in two-dimensional complex Euclidean space C^2. These operators…
A long-standing practical challenge in the optimization of higher-order languages is inlining functions with free variables. Inlining code statically at a function call site is safe if the compiler can guarantee that the free variables have…
Nondeterministic choice is a useful program construct that provides a way to describe the behaviour of a program without specifying the details of possible implementations. It supports the stepwise refinement of programs, a method that has…
We describe the layer of quantifier alternation depth at most one of the quantifier completion of a Boolean doctrine over a small category. This amounts to a doctrinal version of Herbrand's theorem for formulas with quantifier alternation…
The most developed aspect of the theory of finite semigroups is their classification in pseudovarieties. The main motivation for investigating such entities comes from their connection with the classification of regular languages via…
We investigate the elimination of quantifiers in first-order formulas via Hilbert's epsilon-operator (or -binder), following Bernays' explicit definitions of the existential and the universal quantifier symbol by means of epsilon-terms.…
Over the past two decades several fragments of first-order logic have been identified and shown to have good computational and algorithmic properties, to a great extent as a result of appropriately describing the image of the standard…
While modal extensions of decidable fragments of first-order logic are usually undecidable, their monodic counterparts, in which formulas in the scope of modal operators have at most one free variable, are typically decidable. This only…
We know extensions of first order logic by quantifiers of the kind "there are uncountable many ...", "most ..." with new axioms and appropriate semantics. Related are operations such as "set of x, such that ...", Hilbert's…
The statistical mechanics characterization of a finite subsystem embedded in an infinite system is a fundamental question of quantum physics. Nevertheless, a full closed form { for all required entropic measures} does not exist in the…
Choice constructs are an important part of the language of logic programming, yet the study of their semantics has been a challenging task. So far, only two-valued semantics have been studied, and the different proposals for such semantics…
A new formalism to express and operate on diversity measures of qualitative variables, built in a Hilbert space, is presented. The abstract character of the Hilbert space naturally incorporates the equivalence between qualitative variables…
Hilbert's Entscheidungsproblem has given rise to a broad and productive line of research in mathematical logic, where the classification process of decidable classes of first-order sentences represent only one of the remarkable results.…
This paper proves normalisation theorems for intuitionist and classical negative free logic, without and with the $\invertediota$ operator for definite descriptions. Rules specific to free logic give rise to new kinds of maximal formulas…
We consider optimization problems with polynomial inequality constraints in non-commuting variables. These non-commuting variables are viewed as bounded operators on a Hilbert space whose dimension is not fixed and the associated polynomial…