Related papers: Synthesis with Explicit Dependencies
There has been some recent interest in applying the techniques of Algebraic Quantum Field Theory (AQFT) to entanglement problems in perturbative QFT. In particular, the Hilbert space independence of this formulation makes it particularly…
Quantified constraints over the reals appear in numerous contexts. Usually existential quantification occurs when some parameter can be chosen by the user of a system, and univeral quantification when the exact value of a parameter is…
In the quantitative theory of quantum coherence, the amount of coherence for given states can be meaningfully discussed only when referring to a preferred basis. One of the objections to this quantification is that the amount of coherence…
We combine the finite size scaling method with the meshfree spectral method to calculate quantum critical parameters for a given Hamiltonian. The basic idea is to expand the exact wave function in a finite exponential basis set and…
We replace a Hamiltonian with a modular Hamiltonian in the spectral form factor and the level spacing distribution function. This study establishes a connection between quantities within Quantum Entanglement and Quantum Chaos. To have a…
These lecture notes provide a comprehensive introduction to Quantitative Methods in Finance (QMF), designed for graduate students in finance and economics with heterogeneous programming backgrounds. The material develops a unified toolkit…
Qualitative numerical planning is classical planning extended with non-negative real variables that can be increased or decreased "qualitatively", i.e., by positive indeterminate amounts. While deterministic planning with numerical…
We show that every finite Boolean combination of polynomial equalities and inequalities in C^n admits two uniform normal forms: an $\exists\forall$ form and a $\forall\exists$ form, each using a single polynomial equation. Both forms use…
A different approach towards quantum theory is proposed in this paper. The basis is taken to be conceptual variables, physical variables that may be accessible or inaccessible, i.e., it may be possible or impossible to assign numerical…
Given a boolean formula $\Phi$(X, Y, Z), the Max\#SAT problem asks for finding a partial model on the set of variables X, maximizing its number of projected models over the set of variables Y. We investigate a strict generalization of…
Quantum Boltzmann machines (QBMs) are machine-learning models for both classical and quantum data. We give an operational definition of QBM learning in terms of the difference in expectation values between the model and target, taking into…
A generalization of the Heisenberg algebra has been recently constructed. This generalized algebra has a characteristic function which depends on one of its generators. When this function is linear, $qJ_0+s$, it is possible to construct a…
An abstract formulation of quantum dynamics in the presence of a general set of quantum constraints is developed. Our constructive procedure is such that the relevant projection operator onto the physical Hilbert space is obtained with a…
Recently developed quantum algorithms suggest that quantum computers can solve certain problems and perform certain tasks more efficiently than conventional computers. Among other reasons, this is due to the possibility of creating…
This paper is devoted to a generalisation of the quantum adiabatic theorem to a nonlinear setting. We consider a Hamiltonian operator which depends on the time variable and on a finite number of parameters and acts on a separable Hilbert…
With the applications of quantum computing becoming more and more widespread, finding ways that allow end users without experience in the field to apply quantum computers to solve their individual problems is becoming a crucial task.…
Certifying the safety of nonlinear systems, through the lens of set invariance and control barrier functions (CBFs), offers a powerful method for controller synthesis, provided a CBF can be constructed. This paper draws connections between…
Advances in data collection using inexpensive sensors have enabled monitoring the performance of dynamic systems, and to implement appropriate control actions to improve their performance. Moreover, engineering systems often operate under…
Quantitative separation logic (QSL) is an extension of separation logic (SL) for the verification of probabilistic pointer programs. In QSL, formulae evaluate to real numbers instead of truth values, e.g., the probability of memory-safe…
The paper is concerned with a problem of coherent (measurement-free) filtering for physically realizable (PR) linear quantum plants. The state variables of such systems satisfy canonical commutation relations and are governed by linear…