Classical deterministic complexity of Edmonds' Problem and quantum entanglement

@inproceedings{Gurvits2003ClassicalDC,
  title={Classical deterministic complexity of Edmonds' Problem and quantum entanglement},
  author={L. Gurvits},
  booktitle={STOC '03},
  year={2003}
}
  • L. Gurvits
  • Published in STOC '03 2003
  • Mathematics, Physics, Computer Science
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… Expand
306 Citations
Classical complexity and quantum entanglement
  • L. Gurvits
  • Computer Science, Mathematics
  • J. Comput. Syst. Sci.
  • 2004
  • 186
  • PDF
Computing finite-dimensional bipartite quantum separability
  • 7
  • PDF
Quantum entanglement, sum of squares, and the log rank conjecture
  • 20
  • PDF
On the Hardness of the Quantum Separability Problem and the Global Power of Locally Invariant Unitary Operations
  • Highly Influenced
Computational complexity of the quantum separability problem
  • L. Ioannou
  • Computer Science, Mathematics
  • Quantum Inf. Comput.
  • 2007
  • 69
  • Highly Influenced
  • PDF
Deterministic Polynomial Time Algorithms for Matrix Completion Problems
  • 22
  • PDF
...
1
2
3
4
5
...

References

Geometric Algorithms and Combinatorial Optimization, Springer-Verlag, Berlin
  • 1988