The DOI matches its Crossref record; 21 of the 21 references it cites were found in a registry or an index.
Classical deterministic complexity of Edmonds' Problem and quantum entanglement
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 .
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Interior-Point Polynomial Algorithms in Convex Programming
Nesterov, Y., & Nemirovskii, A. (1994) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611970791 · Cited by 4,334
Geometric Algorithms and Combinatorial Optimization
Grötschel, M., Lovász, L., & Schrijver, A. (1988) · Algorithms and Combinatorics · doi:10.1007/978-3-642-97881-4 · Cited by 3,431
Convex Bodies: The Brunn–Minkowski Theory
Schneider, R. (1993) · Cambridge University Press eBooks · doi:10.1017/cbo9780511526282 · Cited by 3,345
The complexity of computing the permanent
Valiant, L. G. (1979) · Theoretical Computer Science · doi:10.1016/0304-3975(79)90044-6 · Cited by 2,705
Ben-Tal, A., & Nemirovski, A. (1998) · Mathematics of Operations Research · doi:10.1287/moor.23.4.769 · Cited by 2,598
Cabano, F. G., Müller, S., & Gelbrich, K. (2024) · Interfaith Marketing · doi:10.4324/9781003506010-51 · Cited by 1,464
A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries
Jerrum, M., Sinclair, A., & Vigoda, E. (2004) · Journal of the ACM · doi:10.1145/1008731.1008738 · Cited by 792
Positive maps of low dimensional matrix algebras
Woronowicz, S. L. (1976) · Reports on Mathematical Physics · doi:10.1016/0034-4877(76)90038-0 · Cited by 445
Largest separable balls around the maximally mixed bipartite quantum state
Gurvits, L., & Barnum, H. (2002) · Physical Review A · doi:10.1103/physreva.66.062311 · Cited by 281
Self-citationMatrix integrals and map enumeration: An accessible introduction
Zvonkin, A. K. (1997) · Mathematical and Computer Modelling · doi:10.1016/s0895-7177(97)00210-0 · Cited by 215
Cited by
Gühne, O., & Tóth, G. (2009) · Physics Reports · doi:10.1016/j.physrep.2009.02.004 · Cited by 2,401
Noisy intermediate-scale quantum algorithms
Bharti, K., Cervera-Lierta, A., Kyaw, T. H., Haug, T., Alperin-Lea, S., Anand, A., Degroote, M., Heimonen, H., Kottmann, J. S., Menke, T., et al. (2022) · Reviews of Modern Physics · doi:10.1103/revmodphys.94.015004 · Cited by 2,231
Quantum Hamiltonian Complexity
Gharibian, S., Huang, Y., Landau, Z., & Shin, S. W. (2015) · Foundations and Trends® in Theoretical Computer Science · doi:10.1561/0400000066 · Cited by 144
The Complexity of Relating Quantum Channels to Master Equations
Cubitt, T. S., Eisert, J., & Wolf, M. M. (2012) · Communications in Mathematical Physics · doi:10.1007/s00220-011-1402-y · Cited by 44
Representing dynamic biological networks with multi-scale probabilistic models
Groß, A., Kracher, B., Kraus, J. M., Kühlwein, S. D., Pfister, A. S., Wiese, S., Luckert, K., Pötz, O., Joos, T., Van Daele, D., et al. (2019) · Communications Biology · doi:10.1038/s42003-018-0268-3 · Cited by 32
Metadata
- Authors
- Gurvits, L.
- Venue
- Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
- Publisher
- ACM
- Published
- 2003-06-09
- Pages
- 10-19
- OpenAlex
- W2044630019
- Cited by
- 448
- References
- 21
- FWCI
- 5.56
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Classical deterministic complexity of Edmonds' Problem and quantum entanglement. https://app.cochat.ai/papers/10.1145/780542.780545
- The paper
- Gurvits, L. (2003). Classical deterministic complexity of Edmonds' Problem and quantum entanglement. Proceedings of the thirty-fifth annual ACM symposium on Theory of computing. https://doi.org/10.1145/780542.780545
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.
