Related papers: Lifting QBF Resolution Calculi to DQBF
The backup control barrier function (CBF) was recently proposed as a tractable formulation that guarantees the feasibility of the CBF quadratic programming (QP) via an implicitly defined control invariant set. The control invariant set is…
The quantum Fourier transform (QFT) is the principal algorithmic tool underlying most efficient quantum algorithms. We present a generic framework for the construction of efficient quantum circuits for the QFT by ``quantizing'' the…
Quantum federated learning (QFL) has recently received increasing attention, where quantum neural networks (QNNs) are integrated into federated learning (FL). In contrast to the existing static QFL methods, we propose slimmable QFL…
Let Q be a non-singular quadratic form with integer coefficients. When Q is indefinite we provide new upper bounds for the least non-trivial integral solution to the equation Q=0. When Q is positive definite we provide improved upper bounds…
While 5G is being deployed worldwide, 6G is receiving increasing attention from researchers to meet the growing demand for higher data rates, lower latency, higher density, and seamless communications worldwide. To meet the stringent…
Cheng and Wan have related the decoding of Reed-Solomon codes to the computation of discrete logarithms over finite fields, with the aim of proving the hardness of their decoding. In this work, we experiment with solving the discrete…
Monte Carlo integration is a widely used numerical method for approximating integrals, which is often computationally expensive. In recent years, quantum computing has shown promise for speeding up Monte Carlo integration, and several…
Research on quantum computing has recently gained significant momentum since first physical devices became available. Many quantum algorithms make use of so-called oracles that implement Boolean functions and are queried with highly…
This report introduces a novel class of reasoning architectures, termed Quantum Circuit Reasoning Models (QCRM), which extend the concept of Variational Quantum Circuits (VQC) from energy minimization and classification tasks to structured…
We give a new theoretical solution to a leading-edge experimental challenge, namely to the verification of quantum computations in the regime of high computational complexity. Our results are given in the language of quantum interactive…
Iterative Refinement (IR) is a classical computing technique for obtaining highly precise solutions to linear systems of equations, as well as linear optimization problems. In this paper, motivated by the limited precision of quantum…
Uncertainty quantification (UQ) is crucial for deploying machine learning models in high-stakes applications, where overconfident predictions can lead to serious consequences. An effective UQ method must balance computational efficiency…
Given a compact basic semi-algebraic set $K\subset R^n\times R^m$, a simple set $B$ (box or ellipsoid), and some semi-algebraic function $f$, we consider sets defined with quantifiers, of the form $R_f:=\{x\in B: \mbox{$f(x,y)\leq 0$ for…
A system of linear dependent types for the lambda calculus with full higher-order recursion, called dlPCF, is introduced and proved sound and relatively complete. Completeness holds in a strong sense: dlPCF is not only able to precisely…
In this work, we implement a relatively new analytical technique, the Improved Amplitude-Frequency Formulation (IAFF) method, approach for solving accurate approximate analytical solutions for strong nonlinear oscillators, which may contain…
Quantum linear system algorithms (QLSAs) have the potential to speed up algorithms that rely on solving linear systems. Interior Point Methods (IPMs) yield a fundamental family of polynomial-time algorithms for solving optimization…
A general and easy-to-code numerical method based on radial basis functions (RBFs) collocation is proposed for the solution of delay differential equations (DDEs). It relies on the interpolation properties of infinitely smooth RBFs, which…
This paper extends our previous quantum Fisher information (QFI) based analysis of the problem of separating a pair of equal-brightness incoherent point sources in three dimensions to the case of a pair of sources that are unequally bright.…
We provide a new expression of the quantum Fisher information(QFI) for a general system. Utilizing this expression, the QFI for a non-full rank density matrix is only determined by its support. This expression can bring convenience for a…
An algebraic $q$-difference equation is considered. A sufficient condition for the existence of a formal power-logarithmic expansion of a solution to such an equation in the neighborhood of zero is proposed. An example of applying this…