Completely positive linear maps as related to sums of squares

来源 :2016年张量和矩阵学术研讨会(International conference on Tensor, Matrix a | 被引量 : 0次 | 上传用户:ninetails
下载到本地 , 更方便阅读
声明 : 本文档内容版权归属内容提供方 , 如果您对本文有版权争议 , 可与客服联系进行内容授权或下架
论文部分内容阅读
  There are so many deep aspects of real positive-semi-definite quadratic forms (alias, symmetric matrices or symmetric second order tensors) and their generalizations. Here, we look into the structure of completely positive linear maps, in connection with recent development of quantum computers. This is an expository talk on my personal adventure in the quantum wonderland.
其他文献
  We will talk about some latest research results on · semi-classical solutions of nonlinear Dirac equations; · bifurcation on compact spin manifolds; · co
会议
  Let m, m, n be positive integers. Let A be an mth order n-dimensional complex tensor and B be an m0th order n-dimensional complex tensor. Suppose that Bxm i
会议
  Two major tools in the study of multi-relational datasets are (i) higher-order Markov chains and (ii) linear algebra-inspired computations on hypermatrices
会议
  It is known that computing the largest(smallest) Z-eigenvalue of a symmetric ten-sor is equivalent to maximizing(minimizing) a homogeneous polynomial over t
会议
  The nonnegative tensor (matrix) factorization finds more and more applications in various disciplines including machine learning, data mining, and blind sou
会议
  In this talk, we discuss the partition of a nonnegative tensor which is intended for finding its spectral radius via the spectral radii of its principal blo
会议
  In this talk, we consider a class of n-person noncooperative games, where the utility function of every player is given by a homogeneous polynomial defined
会议
  In this talk, we try to generalize the construction of circulant preconditioners from matrix to tensor. The preconditioners could be used to solve linear or
会议
  We consider the numerical solution of a c-stable linear equation in the tensor product space Rn1×···×nd, arising from a discretized elliptic partial di
会议
  Hillar and Lim famously demonstrated that multilinear (tensor) analogues of many efficiently computable problems in numerical linear algebra are NP-hard". D
会议