Related papers: On the Optimality of Gauss's Algorithm over Euclid…
We describe a conjectural approach to obtaining canonical bases of the Hecke algebra at $q=1$ via continuous quadratic optimization. We focus on Specht modules $S^\lambda$ and proper cones inside $S^\lambda$ that are invariant under the…
We give a $2^{n+o(n)}$-time and space randomized algorithm for solving the exact Closest Vector Problem (CVP) on $n$-dimensional Euclidean lattices. This improves on the previous fastest algorithm, the deterministic…
When the Euclidean algorithm produces a symmetric sequence of quotients, we give explicit formulas for the remainders that allow the analysis of two families of quadratic forms in the remainders.
We discuss continued fractions on real quadratic number fields of class number 1. If the field has the property of being 2-stage euclidean, a generalization of the euclidean algorithm can be used to compute these continued fractions.…
We design a sublinear-time approximation algorithm for quadratic function minimization problems with a better error bound than the previous algorithm by Hayashi and Yoshida (NIPS'16). Our approximation algorithm can be modified to handle…
Lattice gauge theory should be able to address significant new scientific questions when implemented on quantum computers. In practice, error-mitigation techniques have already allowed encouraging progress on small lattices. In this work we…
In this paper, we draw connections between ideal lattices and multivariate polynomial rings over integers using Gr\"obner bases. Ideal lattices are ideals in the residue class ring, $\mathbb{Z}[x]/\langle f \rangle$ (here $f$ is a monic…
We consider the computation of the entanglement-assisted quantum rate-distortion function, which plays a central role in quantum information theory. We propose an efficient alternating minimization algorithm based on the Lagrangian…
It appears that, along with many of my friends and colleagues, I had been brainwashed by the great and tragic lives of Abel and Galois to believe that no general formulas are possible for roots of equations higher than quartic. This seemed…
We present a proximal augmented Lagrangian based solver for general convex quadratic programs (QPs), relying on semismooth Newton iterations with exact line search to solve the inner subproblems. The exact line search reduces in this case…
We show that the graph of normalized elliptic Dedekind sums is dense in its image for arbitrary imaginary quadratic fields, generalizing a result of Ito in the Euclidean case. We also derive some basic properties of Martin's continued…
Work on generalizing the deflated, restarted GMRES algorithm, useful in lattice studies using stochastic noise methods, is reported. We first show how the multi-mass extension of deflated GMRES can be implemented. We then give a deflated…
Continued fractions in the field of $p$--adic numbers have been recently studied by several authors. It is known that the real continued fraction of a positive quadratic irrational is eventually periodic (Lagrange's Theorem). It is still…
We propose a recursive lattice reduction framework for finding short non-zero vectors or dense sublattices of a lattice. The framework works by recursively searching for dense sublattices of dense sublattices (or their duals) with…
A non-perturbative algebraic theory of lattice Boltzmann method is developed based on a symmetry of a product. It involves three steps: (i) Derivation of admissible lattices in one spatial dimension through a matching condition which…
We study theoretical runtime guarantees for a class of optimization problems that occur in a wide variety of inference problems. these problems are motivated by the lasso framework and have applications in machine learning and computer…
In this work, we propose a novel discrete-time distributed algorithm for finding least-squares solutions of linear algebraic equations with a scheduling protocol to further enhance its scalability. Each agent in the network is assumed to…
Lattice gauge theories in varying dimensions, lattice volumes, and truncations offer a rich family of targets for Hamiltonian simulation on quantum devices. In return, formulating quantum simulations can provide new ways of thinking about…
Quantum simulation of Lattice Gauge Theories has been proposed and used as a method to overcome theoretical difficulties in dealing with the non-perturbative nature of such models. In this work we focus on two important bottlenecks that…
An algorithm for embedding finite dimensional Lie algebras into Lie algebras of vector fields (and Lie superalgebras into Lie superalgebras of vector fields) is offered in a way applicable over ground fields of any characteristic. The…