|
| related topics |
| {let, theorem, proof} |
| {algorithm, log, probability} |
| {operator, operators, space} |
| {state, states, entangled} |
| {states, state, optimal} |
| {information, entropy, channel} |
| {energy, gaussian, time} |
| {equation, function, exp} |
| {state, algorithm, problem} |
|
Classical deterministic complexity of Edmonds' problem and Quantum
Entanglement
Leonid Gurvits
abstract: 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 .
- oai_identifier:
- oai:arXiv.org:quant-ph/0303055
- categories:
- quant-ph
- comments:
- 31 pages, long version of STOC-2003 paper
- arxiv_id:
- quant-ph/0303055
- created:
- 2003-03-10
Full article ▸
|
|
| related documents |
| 0503221v2 |
| 0308142v2 |
| 0512241v1 |
| 0410120v1 |
| 0405081v1 |
| 0206023v2 |
| 0605239v4 |
| 0410229v1 |
| 0307139v1 |
| 0503159v2 |
| 0701143v2 |
| 0501104v4 |
| 0605090v1 |
| 0401053v1 |
| 0308151v2 |
| 0610235v2 |
| 0702212v1 |
| 0509166v2 |
| 0701037v2 |
| 0304145v2 |
| 0502040v2 |
| 0309057v1 |
| 0603206v1 |
| 0305031v1 |
| 0312164v1 |
|