Related papers: Algorithms for SU(n) boson realizations and D-func…
We present new algorithms to compute fundamental properties of a Boolean function given in truth-table form. Specifically, we give an O(N^2.322 log N) algorithm for block sensitivity, an O(N^1.585 log N) algorithm for `tree decomposition,'…
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…
Submodular functions are a fundamental object of study in combinatorial optimization, economics, machine learning, etc. and exhibit a rich combinatorial structure. Many subclasses of submodular functions have also been well studied and…
The problem of function approximation by neural dynamical systems has typically been approached in a top-down manner: Any continuous function can be approximated to an arbitrary accuracy by a sufficiently complex model with a given…
Quantum theory is based on a mathematical structure totally different from conventional arithmetic. Due to the symmetric nature of bosonic particles, annihilation or creation of single particles translates a quantum state depending on how…
We introduce a new constructive recognition algorithm for finite special linear groups in their natural representation. Given a group $G$ generated by a set of $d\times d$ matrices over a finite field $\mathbb{F}_q$, known to be isomorphic…
We introduce a new combinatorial structure: the superselector. We show that superselectors subsume several important combinatorial structures used in the past few years to solve problems in group testing, compressed sensing, multi-channel…
Empirical evidence reveals existence of partial D-operators for the generalized IBP (BT) reduction algorithms that are, counterintuitively, much simpler and much easier to find than the complete D-operators from the foundational Bernstein…
In this paper, we address a class of specially structured problems that include speed planning, for mobile robots and robotic manipulators, and dynamic programming. We develop two new numerical procedures, that apply to the general case and…
We present a classical algorithm for approximating the expectation values of observables in linear-optical circuits with arbitrary product input states, achieving additive-error accuracy. This result indicates that current applications of…
We present a variation of a quantum algorithm for the machine learning task of classification with graph-structured data. The algorithm implements a feature extraction strategy that is based on Gaussian boson sampling (GBS) a near term…
We demonstrate a method for general linear optical networks that allows one to factorize any SU($n$) matrix in terms of two SU($n-1)$ blocks coupled by an SU(2) entangling beam splitter. The process can be recursively continued in an…
A recursive method for construction of symmetric irreducible representations of O(2l+1) in the O(2l + 1) supset O(3) basis for identical boson systems is proposed. The formalism is realized based on the group chain U(2l + 1) supset U(2l- 1)…
We discuss a microscopic framework for phenomenological boson-fermion models of nuclear structure based on the U($n/m$) type of superalgebras. The generalized Dyson mapping of fermion collective superalgebras provides a basis to do so and…
Let X be a smooth projective curve. Write Bun_{SO_{2n}} for the moduli stack of SO_{2n}-torsors on X. We give a geometric interpretation of the automorphic function f on Bun_{SO_{2n}} corresponding to the minimal representation. Namely, we…
Random point patterns are ubiquitous in nature, and statistical models such as point processes, i.e., algorithms that generate stochastic collections of points, are commonly used to simulate and interpret them. We propose an application of…
A numerical algorithm that computes the decomposition of any finite-dimen\-sio\-nal unitary reducible representation of a compact Lie group is presented. The algorithm, which does not rely on an algebraic insight on the group structure, is…
We introduce the Hidden Polynomial Function Graph Problem as a natural generalization of an abelian Hidden Subgroup Problem (HSP) where the subgroups and their cosets correspond to graphs of linear functions over the finite field F_p. For…
We propose a methodology to address two analysis problems concerning complex systems, namely bounding state functionals of stochastic differential equations (SDEs) and verifying set avoidance of systems described by partial differential…
The Bogoliubov transformation for a monopole boson induces an unitary transformation connecting the Fock spaces of initial and correlated boson-s. Here we provide a very simple method for deriving the analytical expression for the overlap…