Classical deterministic complexity of Edmonds' Problem and quantum entanglement

@inproceedings{Gurvits2003ClassicalDC,
  title={Classical deterministic complexity of Edmonds' Problem and quantum entanglement},
  author={Leonid I. Gurvits},
  booktitle={Symposium on the Theory of Computing},
  year={2003},
  url={https://api.semanticscholar.org/CorpusID:5745067}
}
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.
View on ACM
arxiv.org
470 Citations
Highly Influential Citations
33
Background Citations
248
Methods Citations
28
Results Citations
6

470 Citations

Classical complexity and quantum entanglement

    L. Gurvits
  • Physics, Mathematics
    J. Comput. Syst. Sci.
  • 2004

On convex optimization problems in quantum information theory

This method allows us to find explicit formulae for the REE and the Rains bound, two well-known upper bounds on the distillable entanglement, and yields interesting information about these quantities, such as the fact that they coincide in the case where at least one subsystem of a multipartite state is a qubit.

Applications of matrix spaces in quantum information and computational complexity

It is shown that determining the parallel distinguishability of quantum channels is equivalent to determining whether the orthogonal complement of a given matrix space contains nonzero positive semidefinite matrices.

Computing finite-dimensional bipartite quantum separability

This work motivates a new interior-point algorithm which, given the expected values of a subset of an orthogonal basis of observables of an otherwise unknown quantum state, searches for an entanglement witness in the span of the subset of Observables, and solves the separability problem.

On the Hardness of the Quantum Separability Problem and the Global Power of Locally Invariant Unitary Operations

Given a bipartite density matrix ρ of a quantum state, the Quantum Separability problem (QUSEP) asks — is ρ entangled, or separable? In this thesis, we first strengthen Gurvits’ 2003 NP-hardness…

Quantum entanglement, sum of squares, and the log rank conjecture

The algorithm is based on the sum-of-squares hierarchy and its analysis is inspired by Lovett's proof that the communication complexity of every rank-n Boolean matrix is bounded by Õ(√n).

Quantum entanglement, symmetric nonnegative quadratic polynomials and moment problems

Quantum states are represented by positive semidefinite Hermitian operators with unit trace, known as density matrices. An important subset of quantum states is that of separable states, the…

Geometry of Entanglement and Quantum Simulators

The Jordan-Wigner transformation is used to create a compiler that takes any two-body fermionic Hamiltonian and outputs all qubit gates needed to simulate the time evolution of that Hamiltonian.

The complexity of the consistency and N-representability problems for quantum states - eScholarship

This dissertation shows some new QMA-complete problems which are very different from those known previously, and have applications in quantum chemistry, and shows that two problems from quantum Chemistry, Fermionic Local Hamiltonian and N- representability, are QMA -complete.

Quantum-Inspired Hierarchy for Rank-Constrained Optimization

It is proved that a large class of rank-constrained semidefinite programs can be written as a convex optimization over separable quantum states, and consequently, a complete hierarchy of semideFinite programs are constructed for solving the original problem.
...

45 References

Quantum Matching Theory (with new complexity theoretic, combinatorial and topological insights on the nature of the Quantum Entanglement)

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…

Largest separable balls around the maximally mixed bipartite quantum state

For finite-dimensional bipartite quantum systems, we find the exact size of the largest balls, in spectral ${l}_{p}$ norms for $1l~pl~\ensuremath{\infty},$ of separable (unentangled) matrices around…

On complexity of matrix scaling

Rank two bipartite bound entangled states do not exist

A Deterministic Algorithm for Approximating the Mixed Discriminant and Mixed Volume, and a Combinatorial Corollary

We present a deterministic polynomial-time algorithm that computes the mixed discriminant of an n -tuple of positive semidefinite matrices to within an exponential multiplicative factor. To this end…

Mixed discriminants of positive semidefinite matrices

A deterministic polynomial-time algorithm for approximating mixed discriminant and mixed volume

The notion of doubly stochastic matrix scaling is extended to a larger class of n-tuples of positive semidefinite matrices, and a polynomial-time algorithm for this scaling is provided.

Polynomial Time Algorithms to Approximate Permanents and Mixed Discriminants Within a Simply Exponential Factor

We present real, complex, and quaternionic versions of a simple randomized polynomial time algorithm to approximate the permanent of a nonnegative matrix and, more generally, the mixed discriminant…

On the Permanent of a Doubly Stochastic Matrix

If is an n X n matrix, the permanent of A, Per A, is defined by 1 where the sum is over all permutations. If A is doubly stochastic (i.e., nonnegative with row and column sums all equal to 1), then…

An inequality for products of polynomials

Beauzamy, Bombieri, Enflo, and Montgomery recently established an inequality for the coefficients of products of homogeneous polynomials in several variables with complex coefficients (forms). We…
...

Related Papers

Showing 1 through 3 of 0 Related Papers