Classical deterministic complexity of Edmonds' problem and Quantum Entanglement
| dc.creator | Gurvits, Leonid | |
| dc.date | 2003-03-11 | |
| dc.date.accessioned | 2026-07-07T06:06:18Z | |
| dc.date.available | 2026-07-07T06:06:18Z | |
| dc.description | 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 . | |
| dc.description | 31 pages, long version of STOC-2003 paper | |
| dc.identifier | https://arxiv.org/abs/quant-ph/0303055 | |
| dc.identifier | http://arxiv.org/abs/quant-ph/0303055 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/90926 | |
| dc.subject | Quantum Physics | |
| dc.title | Classical deterministic complexity of Edmonds' problem and Quantum Entanglement | |
| dc.type | text |