Classical deterministic complexity of Edmonds' problem and Quantum Entanglement

Details Classical deterministic complexity of Edmonds' problem and Quantum Entanglement Classical deterministic complexity of Edmonds' problem and Quantum Entanglement

2003-03-11

arxiv.org/abs/quant-ph/0303055v1

Physics

Quantum Physics

31 pages, long version of STOC-2003 paper

Scientific paper

This paper continues research initiated in quant-ph/0201022 . The main subject here is the so-called Edmonds' problem of deciding if a given linear subspace of square matrices contains a nonsingular matrix . We present a deterministic polynomial time algorithm to solve this problem for linear subspaces satisfying a special matroids motivated property, called in the paper the Edmonds-Rado property . This property is shown to be very closely related to the separability of bipartite mixed states . One of the main tools used in the paper is the Quantum Permanent introduced in quant-ph/0201022 .

Affiliated with

Also associated with

No associations

Rating

Classical deterministic complexity of Edmonds' problem and Quantum Entanglement does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Classical deterministic complexity of Edmonds' problem and Quantum Entanglement, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Classical deterministic complexity of Edmonds' problem and Quantum Entanglement will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-130881