Related papers: An algorithm for computing the canonical bases of …
We propose a family of quantum algorithms for estimating Gowers uniformity norms $ U^k $ over finite abelian groups and demonstrate their applications to testing polynomial structure and counting arithmetic progressions. Building on recent…
We construct a q-deformed version of the conformal quantum mechanics model of de Alfaro, Fubini and Furlan for which the deformation parameter is complex and the unitary time evolution of the system is preserved. We also study differential…
Most quantum algorithms that give an exponential speedup over classical algorithms exploit the Fourier transform in some way. In Shor's algorithm, sampling from the quantum Fourier spectrum is used to discover periodicity of the modular…
We present a tensor-structured algorithm for efficient large-scale DFT calculations by constructing a Tucker tensor basis that is adapted to the Kohn-Sham Hamiltonian and localized in real-space. The proposed approach uses an additive…
In this paper, we analyze in depth a simplicial decomposition like algorithmic framework for large scale convex quadratic programming. In particular, we first propose two tailored strategies for handling the master problem. Then, we…
We construct an informationally complete set of mutually unbiased - like bases for N ququarts. These bases are used in an explicit tomographic protocol which performance is analyzed by estimating quadratic errors and compared to other…
This paper introduces a novel tangential-normal ($t$-$n$) decomposition for finite element differential forms, presenting a new framework for constructing bases in finite element exterior calculus. The main contribution is the development…
We introduce variants of Barvinok's algorithm for counting lattice points in polyhedra. The new algorithms are based on irrational signed decomposition in the primal space and the construction of rational generating functions for cones with…
Model-based derivative-free optimization (DFO) methods are an important class of DFO methods that are known to struggle with solving high-dimensional optimization problems. Recent research has shown that incorporating random subspaces into…
In this paper, we consider a quantum algorithm for solving the following problem: ``Suppose $f$ is a function given as a black box (that is also called an oracle) and $f$ is invariant under some AND-mask. Examine a property of $f$ by…
Over the last decade, it has been demonstrated that many systems in science and engineering can be modeled more accurately by fractional-order than integer-order derivatives, and many methods are developed to solve the problem of fractional…
Numerically solving a second quantised many-body model in the permutation symmetric Fock space can be challenging for two reasons: (i) an increased complication in the calculations of the matrix elements of various operators, and (ii) a…
Contrary to the classical methods of quantum mechanics, the deformation quantization can be carried out on phase spaces which are not even topological manifolds. In particular, the Moyal star product gives rise to a canonical functor $F$…
We reformulate base point free theorems. Our formulation is flexible and has some important applications. One of the main purposes of this paper is to prove a generalization of the base point free theorem in Fukuda's paper: On numerically…
In this paper, we investigate the fundamental solution of the fractional Fokker-Planck equation. Utilizing the Littlewood-Paley decomposition technology, we present a concise proof of the pointwise estimate for the fundamental solution.
Cylindrical algebraic decomposition is one of the most important tools for computing with semi-algebraic sets, while triangular decomposition is among the most important approaches for manipulating constructible sets. In this paper, for an…
In this paper we construct explicitly natural (from the geometrical point of view) Fock space representations (contragradient Verma modules) of the quantized enveloping algebras. In order to do so, we start from the Gauss decomposition of…
We propose a new numerical algorithm for computing the tensor rank decomposition or canonical polyadic decomposition of higher-order tensors subject to a rank and genericity constraint. Reformulating this computational problem as a system…
We present a specialized point-counting algorithm for a class of elliptic curves over F\_{p^2} that includes reductions of quadratic Q-curves modulo inert primes and, more generally, any elliptic curve over F\_{p^2} with a low-degree…
Selecting a set of basis states is a common task in quantum computing, in order to increase and/or evaluate their probabilities. This is similar to designing WHERE clauses in classical database queries. Even though one can find heuristic…