Related papers: Matrix reduction and Lagrangian submodules
Circuit quantization is an extraordinarily successful theory that describes the behavior of quantum circuits with high precision. The most widely used approach of circuit quantization relies on introducing a classical Lagrangian whose…
In this paper and a companion paper, we show how the framework of information geometry, a geometry of discrete probability distributions, can form the basis of a derivation of the quantum formalism. The derivation rests upon a few…
We provide some constructions using Lagrangian cobordisms which improve known examples for some symplectic squeezing problems. Additionally, we prove a flexibility result that Lagrangian submanifolds which are Lagrangian isotopic are also…
A basic problem in linear particle optics is to find a symplectic transformation that brings the (symmetric) beam matrix to a special diagonal form, called normal form. The conventional way to do this involves an eigenvalue-decomposition of…
We build generalizations of the Grassmann algebras from a few simple assumptions which are that they are graded, maximally symmetric and contain an ordinary Grassmann algebra as a subalgebra. These algebras are graded by Z_{n}^{3} and…
We develop a Lagrangian approach for constructing a symplectic structure for singular systems. It gives a simple and unified framework for understanding the origin of the pathologies that appear in the Dirac-Bergmann formalism, and offers a…
We introduce a new convex optimization problem, termed quadratic decomposable submodular function minimization. The problem is closely related to decomposable submodular function minimization and arises in many learning on graphs and…
We present efficient algorithms to calculate trajectories for periodic Lorentz gases consisting of square lattices of circular obstacles in two dimensions, and simple cubic lattices of spheres in three dimensions; these become increasingly…
Because of the significant increase in size and complexity of the networks, the distributed computation of eigenvalues and eigenvectors of graph matrices has become very challenging and yet it remains as important as before. In this paper…
This paper contains a thorough introduction to the basic geometric properties of the manifold of Lagrangian subspaces of a linear symplectic space, known as the Lagrangian Grassmannian. It also reviews the important relationship between…
In this paper, we review the problem of matrix completion and expose its intimate relations with algebraic geometry, combinatorics and graph theory. We present the first necessary and sufficient combinatorial conditions for matrices of…
This paper is an introduction to polarizations in the symplectic and orthogonal settings. They arise in association to a triple of compatible structures on a real vector space, consisting of an inner product, a symplectic form, and a…
Quantum magnetism in low dimensions has been one of the central areas of theoretical research for many decades now. One of the key reasons for the long standing interest in this field has been the existence of simplified models, which serve…
Motivated by applications in robotics and computer vision, we study problems related to spatial reasoning of a 3D environment using sublevel sets of polynomials. These include: tightly containing a cloud of points (e.g., representing an…
We introduce the notion of a symplectic Lie affgebroid and their Lagrangian submanifolds in order to describe the Lagrangian (Hamiltonian) dynamics on a Lie affgebroid in terms of this type of structures. Several examples are discussed.
Recent studies on quantum computing algorithms focus on excavating features of quantum computers which have potential for contributing to computational model enhancements. Among various approaches, quantum annealing methods effectively…
We study the Quadratic Cycle Cover Problem (QCCP), which aims to find a node-disjoint cycle cover in a directed graph with minimum interaction cost between successive arcs. We derive several semidefinite programming (SDP) relaxations and…
The clear understanding of the non-convex landscape of neural network is a complex incomplete problem. This paper studies the landscape of linear (residual) network, the simplified version of the nonlinear network. By treating the gradient…
In this paper, we describe a low-rank matrix completion method based on matrix decomposition. An incomplete matrix is decomposed into submatrices which are filled with a proposed trimming step and then are recombined to form a low-rank…
It is shown that quantum mechanics on noncommutative (NC) spaces can be obtained by canonical quantization of some underlying constrained systems. Noncommutative geometry arises after taking into account the second class constraints…