Classical complexity and quantum entanglement

By Leonid Gurvits. Journal of computer and system sciences (Print), 2004

311 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Entanglement certification from theory to experiment (2018, background): “[62] Leonid Gurvits, “Classical complexity and quantum entanglement,” J.”
A review of matrix scaling and Sinkhorn's normal form for matrices and positive maps (2016, methodology): “> 0, det(X) = 1} (44) We will start with covering approximate scaling: Approximate scalability The capacity is the right functional to study scaling: Lemma 9.8 (Gurvits 2004).”
Geometry of Quantum States: Index (2007, background): “28 This result is due to Gurvits [379]; see also Gharibian [329].”
On the number of matrices and a random matrix with prescribed row and column sums and 0–1 entries☆ (2008, background): “ are products of linear forms, then hp,qi = perD, where D = (dij) is the m× m matrix deﬁned by dij = Xn k=1 bikcjk for all i,j, see Lemma 4.5 of [Ba07] or, for a more general identity, Theorem 3.8 of [Gu04]. Thus we may write |Σ(R,C;W)| = Ym i=1 1 (n−ri)! ! Yn j=1 1 cj! × * Ym i=1 tn−r i i Yn j=1”
The computational complexity of linear optics (2010, unknown): “Building on earlier work [14, 15, 22, 27, 36], we define and study a formal model of quantum computation with noninteracting bosons.”