Leonid Gurvits
ABSTRACT
Generalizing a decision problem for bipartite perfect matching, J. Edmonds introduced in [14] the problem (now known as the Edmonds Problem) of deciding if a given linear subspace of M(N) contains a nonsingular matrix, where M(N) stands for the linear space of complex NxN matrices. This problem led to many fundamental developments in matroid theory etc.Classical matching theory can be defined in terms of matrices with nonnegative entries. The notion of Positive operator, central in Quantum Theory, is a natural generalization of matrices with nonnegative entries. (Here operator refers to maps from matrices to matrices.) First, we reformulate the Edmonds Problem in terms of of completely positive operators, or equivalently, in terms of bipartite density matrices. It turns out that one of the most important cases when Edmonds' problem can be solved in polynomial deterministic time, i.e. an intersection of two geometric matroids, corresponds to unentangled (aka separable) bipartite density matrices. We introduce a very general class (or promise) of linear subspaces of M(N) on which there exists a polynomial deterministic time algorithm to solve Edmonds' problem. The algorithm is a thoroughgoing generalization of algorithms in [23], [26], and its analysis benefits from an operator analog of permanents, so called Quantum Permanents. Finally, we prove that the weak membership problem for the convex set of separable normalized bipartite density matrices is NP-HARD.
- D. Zeilberger, CHu's 1303 identity implies Bombieri's 1990 norm-inequality {Via an identity of Beauzamy and Degot}, Amer. Math. Monthly, 1994.Google Scholar
- B. Beauzamy, E. Bombieri, P. Enflo, H.L. Montgomery, Products of polynomials in many variables, Journal of Number Theory 36, 219--245, 1990.Google ScholarCross Ref
- B. Reznick, An inequality for products of polynomials, Proc. of AMS, vol. 117, Is. 4, 1063--1073, 1993.Google Scholar
- B. Beauzamy, Products of polynomials and a priori estimates for coefficients in polynomial decompositions : A sharp result, J. Symbolic Computation 13 (1992), 463--472. Google ScholarDigital Library
- A. Nemirovski, Personal Communication, 2001.Google Scholar
- V. Kabanets and R. Impagliazzo, Derandomizing polynomial identity tests means proving circuit lower bounds, Electronic Colloq. on Comp. Complex, No. 55, 2002.Google Scholar
- L. Gurvits, Quantum Matching Theory (with new complexity-theoretic, combinatorial and topological insights on the nature of the Quantum Entanglement), arXiv.org preprint quant-ph/02010222, 2002.Google Scholar
- L. Gurvits, Classical deterministic complexity of Edmonds' problem and Quantum Entanglement, arXiv.org preprint quant-ph/0303055, 2003.Google Scholar
- L. Gurvits, Unbiased nonnegative valued random estimator for permanents of complex positive semidefinite matrices, LANL unclassified report LAUR 02-5166, 2002.Google Scholar
- H. Minc, Permanents, Addison - Wesley, Reading, MA, 1978.Google Scholar
- R. B. Bapat, Mixed discriminants of positive semidefinite matrices, Linear Algebra and its Applications 126, 107--124, 1989.Google ScholarCross Ref
- A. Ben-Tal and A. Nemirovski, Robust convex optimization, Mathematics of Operational Research, Vol. 23, 4 (1998), 769--805. Google ScholarDigital Library
- D. B. Yudin and A. S. Nemirovskii, Informational complexity and efficient methods for the solution of convex extremal problems (in Russian), Ekonomica i Matematicheskie Metody 12 (1976), 357--369.Google Scholar
- J. Edmonds, System of distinct representatives and linear algebra, Journal of Research of the National Bureau of Standards 718, 4(1967), 242--245.Google Scholar
- A. Chistov, G. Ivanyos, M. Karpinski, Polynomial time algorithms for modules over finite dimensional algebras, Proc. of ISSAC'97, pp. 68--74, Maui, Hawaii, USA, 1997. Google ScholarDigital Library
- A. I. Barvinok, Computing Mixed Discriminants, Mixed Volumes, and Permanents, Discrete & Computational Geometry, 18 (1997), 205--237.Google Scholar
- A. I. Barvinok, Polynomial time algorithms to approximate permanents and mixed discriminants within a simply exponential factor, Random Structures & Algorithms, 14 (1999), 29--61. Google ScholarDigital Library
- G. P. Egorychev, The solution of van der Waerden's problem for permanents, Advances in Math., 42, 299--305, 1981.Google ScholarCross Ref
- D. I. Falikman, Proof of the van der Waerden's conjecture on the permanent of a doubly stochastic matrix, Mat. Zametki 29, 6: 931-938, 957, 1981, (in Russian).Google Scholar
- M. Grötschel, L. Lovasz and A. Schrijver, Geometric Algorithms and Combinatorial Optimization, Springer-Verlag, Berlin, 1988.Google ScholarCross Ref
- L. Gurvits, Van der Waerden Conjecture for Mixed Discriminants, submitted, 2000; accepted for publication in Advances in Mathematics, 2001.Google Scholar
- A. Zvonkin, Matrix integral and map enumeration : an accessible introduction, Mathl. Comput. Modelling, Vol. 26, No. 8-10, pp. 281--304, 1997. Google ScholarDigital Library
- N. Linial, A. Samorodnitsky and A. Wigderson, A deterministic strongly polynomial algorithm for matrix scaling and approximate permanents, Proc. 30 ACM Symp. on Theory of Computing, ACM, New York, 1998. Google ScholarDigital Library
- L. Gurvits and A. Samorodnitsky, A deterministic polynomial-time algorithm for approximating mised discriminant and mixed volume, Proc. 32 ACM Symp. on Theory of Computing, ACM, New York, 2000. Google ScholarDigital Library
- L. Gurvits and A. Samorodnitsky, A deterministic algorithm approximating the mixed discriminant and mixed volume, and a combinatorial corollary, Discrete Comput. Geom. 27 : 531--550, 2002 /Google Scholar
- L. Gurvits and P. Yianilos, The deflation-inflation method for certain semidefinite programming and maximum determinant completion problems, NECI technical report, 1998.Google Scholar
- J. Forster, A Linear Lower Bound on the Unbounded Error Probabilistic Communication Complexity, Sixteenth Annual IEEE Conference on Computational Complexity, 2001. Google ScholarDigital Library
- L. Gurvits and H. Barnum, Largest separable balls around the maximally mixed bipartite quantum state," Phys. Rev. A 66 062311 (2002).Google ScholarCross Ref
Index Terms
- Classical deterministic complexity of Edmonds' Problem and quantum entanglement
Recommendations
Classical complexity and quantum entanglement
Special issue: STOC 2003Generalizing a decision problem for bipartite perfect matching, Edmonds (J. Res. Natl. Bur. Standards 718(4) (1967) 242) introduced the problem (now known as the Edmonds Problem) of deciding if a given linear subspace of M(N) contains a non-singular ...
Quantum and classical complexity classes: Separations, collapses, and closure properties
We study the complexity of quantum complexity classes such as EQP, BQP, and NQP (quantum analogs of P, BPP, and NP, respectively) using classical complexity classes such as ZPP, WPP, and C=P. The contributions of this paper are threefold. First, via ...
Topological aspects of quantum entanglement
Kauffman and Lomonaco (New J Phys 4:73.1---73.18, 2002. arXiv:quant-ph/0401090, New J Phys 6:134.1---134.40, 2004) explored the idea of understanding quantum entanglement (the non-local correlation of certain properties of particles) topologically by ...
Comments