REVIEW 4 cited by
Classical deterministic complexity of Edmonds' problem and Quantum Entanglement
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original 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 .
Forward citations
Cited by 4 Pith papers
-
Witness based nonlinear detection of quantum entanglement
A crossed multi-copy pairing of entanglement witnesses detects entangled states that the individual witnesses and the standard same-copy pairing fail to detect.
-
Physics of the Electron-Ion Collider in China
A review of the EicC physics case argues that the proposed Chinese electron-ion collider, at 15-20 GeV collision energy, can complement the US EIC with high-precision measurements of sea-quark spin structure, proton m...
-
Particle Collisions & Quantum Entanglement in High-Energy Collisions
A review summarizing advancements in probing quantum entanglement and Bell inequalities using high-energy particle colliders.
-
Entanglement Certification $-$ From Theory to Experiment
Reviews paradigmatic entanglement quantifiers and state-of-the-art detection/certification methods, with emphasis on assumptions about states and measurements.
Discussion (0). Continue with ORCID to comment.