# Completely positive semidefinite rank

@article{Prakash2018CompletelyPS,
title={Completely positive semidefinite rank},
author={Anupam Prakash and Jamie Sikora and Antonios Varvitsiotis and Zhaohui Wei},
journal={Mathematical Programming},
year={2018},
volume={171},
pages={397-431}
}
• Published 25 April 2016
• Mathematics, Computer Science
• Mathematical Programming
An $$n\times n$$n×n matrix X is called completely positive semidefinite (cpsd) if there exist $$d\times d$$d×d Hermitian positive semidefinite matrices $$\{P_i\}_{i=1}^n$${Pi}i=1n (for some $$d\ge 1$$d≥1) such that $$X_{ij}= \mathrm {Tr}(P_iP_j),$$Xij=Tr(PiPj), for all $$i,j \in \{ 1, \ldots , n \}$$i,j∈{1,…,n}. The cpsd-rank of a cpsd matrix is the smallest $$d\ge 1$$d≥1 for which such a representation is possible. In this work we initiate the study of the cpsd-rank which we motivate in two…
Algorithms for positive semidefinite factorization
• Computer Science, Mathematics
Comput. Optim. Appl.
• 2018
This work introduces several local optimization schemes to tackle the problem of positive semidefinite factorization, a generalization of exact nonnegative matrix factorization and introduces a fast projected gradient method and two algorithms based on the coordinate descent framework.
Correlation matrices, Clifford algebras, and completely positive semidefinite rank
• Mathematics
Linear and Multilinear Algebra
• 2018
ABSTRACT A symmetric matrix X is completely positive semidefinite (cpsd) if there exist positive semidefinite matrices (for some ) such that for all . The of a cpsd matrix is the smallest for which
Positively factorizable maps
• Mathematics
Linear Algebra and its Applications
• 2021
Approximate Completely Positive Semidefinite Rank.
• Mathematics, Computer Science
• 2020
This paper makes use of the Approximate Carath\'eodory Theorem in order to construct an approximate matrix with a low-rank Gram representation and employs the Johnson-Lindenstrauss Lemma to improve to a logarithmic dependence of the cpsd-rank on the size.
Semidefinite games
• Economics
• 2022
We introduce and study the class of semidefinite games, which generalizes bimatrix games and finite N -person games, by replacing the simplex of the mixed strategies for each player by a slice of the
Quantum machine learning with subspace states
• Computer Science
ArXiv
• 2022
A new approach for quantum linear algebra based on quantum subspace states is introduced and three new quantum machine learning algorithms are presented that reduce exponentially the depth of circuits used in quantum topological data analysis from O(n) to O(log n).
Lower Bounds on Matrix Factorization Ranks via Noncommutative Polynomial Optimization
• Computer Science, Mathematics
Found. Comput. Math.
• 2019
We use techniques from (tracial noncommutative) polynomial optimization to formulate hierarchies of semidefinite programming lower bounds on matrix factorization ranks. In particular, we consider the
Completely positive completely positive maps (and a resource theory for non-negativity of quantum amplitudes)
• Physics
• 2021
In this work we examine quantum states which have non-negative amplitudes (in a fixed basis) and the channels which preserve them. These states include the ground states of stoquastic Hamiltonians
Bounds on entanglement dimensions and quantum graph parameters via noncommutative polynomial optimization
• Computer Science
Math. Program.
• 2018
A hierarchy of semidefinite programming lower bounds is constructed and convergence to a new parameter is shown, which measures the amount of entanglement needed to reproduce a quantum correlation when access to shared randomness is free.