Related papers: Bounded Quantifier Instantiation for Checking Indu…
The identifiability of a system is concerned with whether the unknown parameters in the system can be uniquely determined with all the possible data generated by a certain experimental setting. A test of quantum Hamiltonian identifiability…
Automatic structures are first-order structures whose universe and relations can be represented as regular languages. It follows from the standard closure properties of regular languages that the first-order theory of an automatic structure…
We analyze inexact fixed point iterations where the generating function contains an inexact solve of an equation system to answer the question of how tolerances for the inner solves influence the iteration error of the outer fixed point…
We introduce a refined immersed boundary (IB) methodology that is better-than-first-order accurate in practice, while preserving key properties of "continuous-forcing" IB approaches that retain a singular source term in the governing…
Equivalence between Positive Partial Transpose (PPT) entanglement and bound entanglement is a long-standing open problem in quantum information theory. So far limited progress has been made, even on the seemingly simple case of Werner…
Is there any hope for quantum computing to challenge the Turing barrier, i.e. to solve an undecidable problem, to compute an uncomputable function? According to Feynman's '82 argument, the answer is {\it negative}. This paper re-opens the…
We discuss the topic of unsatisfiability proofs in SMT, particularly with reference to quantifier free non-linear real arithmetic. We outline how the methods here do not admit trivial proofs and how past formalisation attempts are not…
In this paper we introduce a method for solving linear and nonlinear scattering problems for wave equations using a new hybrid approach. This new approach consists of a reformulation of the governing equations into a form that can be solved…
Precondition inference is a non-trivial task with several applications in program analysis and verification. We present a novel iterative method for automatically deriving sufficient preconditions for safety and unsafety of programs which…
A new method for solving stiff boundary value problems is described and compared to other known approaches using the Troesch's problem as a test example. The method is based on the general idea of alternate approximation of either the…
We present a verification technique for program safety that combines Iterated Specialization and Interpolating Horn Clause Solving. Our new method composes together these two techniques in a modular way by exploiting the common Horn Clause…
We introduce an intermediate quantum computing model built from translation-invariant Ising-interacting spins. Despite being non-universal, the model cannot be classically efficiently simulated unless the polynomial hierarchy collapses.…
We propose a numerical method to solve general hyperbolic systems in any space dimension using forward Euler time stepping and continuous finite elements on non-uniform grids. The properties of the method are based on the introduction of an…
In this paper we are concerned with the existence of invariant tori in nearly integrable Hamiltonian systems \begin{equation*} H=h(y)+f(x,y,t), \end{equation*} where $y\in D\subseteq\mathbb{R}^n$ with $D$ being a closed bounded domain,…
An optical procedure in the context of continuous variables to verify bipartite entanglement without destroying both systems and their entanglement is proposed. To perform the nondestructive verification of entanglement, the method relies…
We show that quantification of the performance of quantum-enhanced measurement schemes based on the concept of quantum Fisher information yields asymptotically equivalent results as the rigorous Bayesian approach, provided generic…
The aim of the paper is to study an optimal control problem on infinite horizon for an infinite dimensional integro-differential equation with completely monotone kernelskernels, where we assume that the noise enters the system when we…
Starting with the first-order singular Lagrangian containing the redundant variables, the noncommutative quantum mechanics on a curved space is investigated by the constraint star-product quantization formalism of the projection operator…
We introduce a graceful approach to probabilistic inference called bounded conditioning. Bounded conditioning monotonically refines the bounds on posterior probabilities in a belief network with computation, and converges on final…
A numerical tool relying on sharp Immersed Boundary Method (IBM) is developed for the analysis of aerospace applications. The method, which is conceived for application using segregated solvers relying on implicit time discretization, uses…