Related papers: An algorithm for computing the canonical bases of …
In this paper, we present an algorithm to compute a basis of the space of algebraic modular forms on the maximal order of the definite quaternion algebra of discriminant $2$, and provide a database of such bases. One of our motivations is…
In this work we consider unconstrained optimization problems. The objective function is known through a zeroth order stochastic oracle that gives an estimate of the true objective function. To solve these problems, we propose a…
Mutually unbiased bases are an important tool in many applications of quantum information theory. We present a new algorithm for finding the mutually unbiased bases for two-qubit systems. We derive a system of four equations in the Galois…
We investigate how to carry out universal quantum computation deterministically with free electrons in decoherence-free subspace by using polarizing beam splitters, charge detectors, and single-spin rotations. Quantum information in our…
We present a general diagrammatic approach to the construction of efficient algorithms for computing the Fourier transform of a function on a finite group. By extending work which connects Bratteli diagrams to the construction of Fast…
An algorithm to compute the set of prime implicates of a quantifier-free clausal formula X in first order logic had been presented in earlier work. As the knowledge base X is dynamic, new clauses are added to the old knowledge base. In this…
We construct a quantum-inspired classical algorithm for computing the permanent of Hermitian positive semidefinite matrices, by exploiting a connection between these mathematical structures and the boson sampling model. Specifically, the…
We propose a randomized polynomial time algorithm for computing nontrivial zeros of quadratic forms in 4 or more variables over $\mathbb{F}_q(t)$, where $\mathbb{F}_q$ is a finite field of odd characteristic. The algorithm is based on a…
Quantum computing improves substantially on known classical algorithms for various important problems, but the nature of the relationship between quantum and classical computing is not yet fully understood. This relationship can be…
We construct bases for the spaces of higher order modular forms of all orders and weights. We also provide a cohomological interpretation of these forms.
We discuss a new method to compute the canonical height of an algebraic point on a hyperelliptic jacobian over a number field. The method does not require any geometrical models, neither $p$-adic nor complex analytic ones. In the case of…
We give a pedagogical introduction to the basics of deformations of relativistic symmetries and the Hilbert spaces of free quantum fields built as their representations. We focus in particular on the example of a $\kappa$-deformed scalar…
Simulating noninteracting fermion systems is a common task in computational many-body physics. In absence of translational symmetries, modeling free fermions on $N$ modes usually requires poly$(N)$ computational resources. While often…
A Radial Basis Function Generated Finite-Differences (RBF-FD) inspired technique for evaluating definite integrals over bounded volumes that have smooth boundaries in three dimensions is described. A key aspect of this approach is that it…
The Macdonald process is a stochastic process on the collection of partitions that is a $(q,t)$-deformed generalization of the Schur process. In this paper, we approach the Macdonald process identifying the space of symmetric functions with…
A radial basis function (RBF) method based on matrix-valued kernels is presented and analyzed for computing two types of vector decompositions on bounded domains: one where the normal component of the divergence-free part of the field is…
The discovery of an algorithm for factoring which runs in polynomial time on a quantum computer has given rise to a concerted effort to understand the principles, advantages, and limitations of quantum computing. At the same time, many…
We show that cellular bases of generalized $q$-Schur algebras can be constructed by gluing arbitrary bases of the cell modules and their dual basis (with respect to the anti-involution giving the cell structure) along defining idempotents.…
The goal of this work is to provide an elementary construction of the canonical basis $\mathbf B(w)$ in each quantum Schubert cell~$U_q(w)$ and to establish its invariance under modified Lusztig's symmetries. To that effect, we obtain a…
A deformed $q$-calculus is developed on the basis of an algebraic structure involving graded brackets. A number operator and left and right shift operators are constructed for this algebra, and the whole structure is related to the algebra…