Related papers: A simplified approach to the improved semiclassica…
A quantization procedure, which has recently been introduced for the analysis of Painlev\'e equations, is applied to a general time-independent potential of a Newton equation. This analysis shows that the quantization procedure preserves…
Semiclassical mechanics of systems with first-class constraints is developed. Starting from the quantum theory, one investigates such objects as semiclassical states and observables, semiclassical inner product, semiclassical gauge…
Semi-supervised learning deals with the problem of how, if possible, to take advantage of a huge amount of not classified data, to perform classification, in situations when, typically, the labelled data are few. Even though this is not…
We develop a combinatorial approach to the study of semigroups and monoids with finite presentations satisfying small overlap conditions. In contrast to existing geometric methods, our approach facilitates a sequential left-right analysis…
The universal effective quantum number that determines the level ordering in arbitrary centrally symmetric potentials is defined more precisely by means of an improved variant of the semiclassical approach
Canonical quantization relies on Cartesian, canonical, phase-space coordinates to promote to Hermitian operators, which also become the principal ingredients in the quantum Hamiltonian. While generally appropriate, this procedure can also…
Gaussian boson sampling (GBS) is considered a candidate problem for demonstrating quantum advantage. We propose an algorithm for approximate classical simulation of a lossy GBS instance. The algorithm relies on the Taylor series expansion,…
This paper presents a categorical account of conditional probability, covering both the classical and the quantum case. Classical conditional probabilities are expressed as a certain "triangle-fill-in" condition, connecting marginal and…
Although quantum circuits have been ubiquitous for decades in quantum computing, the first complete equational theory for quantum circuits has only recently been introduced. Completeness guarantees that any true equation on quantum circuits…
Clustering is a well-known unsupervised machine learning approach capable of automatically grouping discrete sets of instances with similar characteristics. Constrained clustering is a semi-supervised extension to this process that can be…
We present a generalization of the well known Next-Closure algorithm working on semilattices. We prove the correctness of the algorithm and apply it on the computation of the intents of a formal context.
Periodic orbit quantization requires an analytic continuation of non-convergent semiclassical trace formulae. We propose a method for semiclassical quantization based upon the Pade approximant to the periodic orbit sums. The Pade…
The accuracies of modern quantum logic clocks have surpassed those of standard atomic fountain clocks. These clocks also provide a greater degree of control, because before and after clock queries, we are able to apply chosen unitary…
Exactly solving first-order constraints (i.e., first-order formulas over a certain predefined structure) can be a very hard, or even undecidable problem. In continuous structures like the real numbers it is promising to compute approximate…
This paper analyzes the correctness of the subsumption algorithm used in CLASSIC, a description logic-based knowledge representation system that is being used in practical applications. In order to deal efficiently with individuals in…
This work presents a new classifier that is specifically designed to be fully interpretable. This technique determines the probability of a class outcome, based directly on probability assignments measured from the training data. The…
A simple mathematical extension of quantum theory is presented. As well as opening the possibility of alternative methods of calculation, the additional formalism implies a new physical interpretation of the standard theory by providing a…
These lectures are an introduction to formal semiclassical quantization of classical field theory. First we develop the Hamiltonian formalism for classical field theories on space time with boundary. It does not have to be a cylinder as in…
We determine the Lagrange function in Taylor polynomial approximation by solving an appropriate initial-value problem. Hence, we determine the remainder term which we then approximate by means of a natural cubic spline. This results in a…
We propose a very simple preprocessing algorithm for semidefinite programming. Our algorithm inspects the constraints of the problem, deletes redundant rows and columns in the constraints, and reduces the size of the variable matrix. It…