相关论文: Hidden Structure in the Solutions Set of the N Que…

We give a quantum algorithm for solving a shifted multiplicative character problem over Z/nZ and finite fields. We show that the algorithm can be interpreted as a matrix factorization or as solving a deconvolution problem and give…

We present solutions to a set of problems that arise in quantum entanglement theory, whose common trait is the use of algebraic methods. The backbone of the thesis consists of two general theorems, pertaining to specific convex sets of…

We present a matrix-theoretic approach for studying and enumerating finite posets through their incidence representations, referred to as poset matrices. Naturally labelled posets are encoded as Boolean lower triangular matrices, allowing a…

A numerical irreducible decomposition for a polynomial system provides representations for the irreducible factors of all positive dimensional solution sets of the system, separated from its isolated solutions. Homotopy continuation methods…

In this paper, we propose a unified approach for solving structure-preserving eigenvalue embedding problem (SEEP) for quadratic regular matrix polynomials with symmetry structures. First, we determine perturbations of a quadratic matrix…

Parts I-IV showed that the number of ways to place $q$ nonattacking queens or similar chess pieces on an $n\times n$ chessboard is a quasipolynomial function of $n$ whose coefficients are essentially polynomials in $q$. For partial queens,…

We construct quadratic finite-dimensional Poisson algebras and their quantum versions related to rank N and degree one vector bundles over elliptic curves with n marked points. The algebras are parameterized by the moduli of curves. For N=2…

We study solutions of a quadratic matrix equation arising in Riemannian geometry. Let $S$ be a real symmetric $n\times n$-matrix with zeros on the diagonal and let $\theta$ be a real number. We construct nonzero solutions $(S,\theta)$ of…

We obtain the generic real Jordan canonical forms for $n\times n$ matrices with real entries. More precisely, we prove that the set of $n\times n$ real matrices is the union of the closures of $\lfloor n/2\rfloor+1$ sets, which are called…

Entanglement is a well known fundamental resource in quantum information. Here the following question is addressed : which are the deeper roots of entanglement that may help in its better understanding and use ? The answer is that one can…

We consider several families of combinatorial polytopes associated with the following NP-complete problems: maximum cut, Boolean quadratic programming, quadratic linear ordering, quadratic assignment, set partition, set packing, stable set,…

This article discusses the concept of Boolean spaces endowed with a Boolean valued inner product and their matrices. A natural inner product structure for the space of Boolean n-tuples is introduced. Stochastic boolean vectors and…

We investigate the geometry of the matrix model associated with an N=1 super Yang-Mills theory with three adjoint fields, which is a massive deformation of N=4. We study in particular the Riemann surface underlying solutions with arbitrary…

Matrices with the displacement structures of circulant, Toeplitz, and Hankel types as well as matrices with structures generalizing these types are omnipresent in computations of sciences and engineering. In this paper, we present efficient…

We derive a formula connecting the derivatives of parallel section functions of an origin-symmetric star body in R^n with the Fourier transform of powers of the radial function of the body. A parallel section function (or (n-1)-dimensional…

We explore the set of unitary matrices characterized by a given structure in the context of their applications in the field of Quantum Information. In the first part of the Thesis we focus on classification of special classes of unitary…

The problem "Given a Boolean function $f$ of $n$ variables by its truth table vector. Find (if exists) a vector $\alpha \in \{0,1\}^n$ of maximal (or minimal) weight, such that $f(\alpha)= 1$." is considered here. It is closely related to…

We define a new numerical range of an n\timesn complex matrix in terms of correlation matrices and develop some of its properties. We also define a related numerical range that arises from Alain Connes' famous embedding problem.

We analyse the problem of solving Boolean equation systems through the use of structure graphs. The latter are obtained through an elegant set of Plotkin-style deduction rules. Our main contribution is that we show that equation systems…

We prove that constant-depth quantum circuits are more powerful than their classical counterparts. To this end we introduce a non-oracular version of the Bernstein-Vazirani problem which we call the 2D Hidden Linear Function problem. An…