The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
Classical complexity and quantum entanglement
Open accessOverview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
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
Completely positive linear maps on complex matrices
Choi, M.-D. (1975) · Linear Algebra and its Applications · doi:10.1016/0024-3795(75)90075-0 · Cited by 2,659 · cited 5×
“This question is related to lower bounds on Cap(T ) provided that Choi's representation CH (T ) is an integer semidefinite matrix.”
BackgroundInfluentialBen-Tal, A., & Nemirovski, A. (1998) · Mathematics of Operations Research · doi:10.1287/moor.23.4.769 · Cited by 2,598
Completeness Classes in Algebra
Valiant, L. G. (1979) · ACM eBooks · doi:10.1145/3749740.3749750 · Cited by 465
Classical deterministic complexity of Edmonds' Problem and quantum entanglement
Gurvits, L. (2003) · Proceedings of the thirty-fifth annual ACM symposium on Theory of computing · doi:10.1145/780542.780545 · Cited by 448
Self-citationDerandomizing Polynomial Identity Tests Means Proving Circuit Lower Bounds
Kabanets, V., & Impagliazzo, R. (2004) · computational complexity · doi:10.1007/s00037-004-0182-6 · Cited by 378
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 251
A linear lower bound on the unbounded error probabilistic communication complexity
Forster, J. (2002) · Journal of Computer and System Sciences · doi:10.1016/s0022-0000(02)00019-3 · Cited by 181
Proof of the van der Waerden conjecture regarding the permanent of a doubly stochastic matrix
Falikman, D. (1981) · Mathematical Notes · doi:10.1007/bf01163285 · Cited by 158
Cited by
The computational complexity of linear optics
Aaronson, S., & Arkhipov, A. (2011) · Proceedings of the forty-third annual ACM symposium on Theory of computing · doi:10.1145/1993636.1993682 · Cited by 874
Computational Optimal Transport
Peyré, G., & Cuturi, M. (2019) · now publishers, Inc. eBooks · doi:10.1561/9781680835519 · Cited by 847
Quantum steering: a review with focus on semidefinite programming
Cavalcanti, D., & Skrzypczyk, P. (2017) · Reports on Progress in Physics · doi:10.1088/1361-6633/80/2/024001 · Cited by 454
Bengtsson, I., & Życzkowski, K. (2006) · doi:10.2277/0521814510 · Cited by 449
Entanglement certification from theory to experiment
Friis, N., Vitagliano, G., Malik, M., & Huber, M. (2018) · Nature Reviews Physics · doi:10.1038/s42254-018-0003-5 · Cited by 360
Metadata
- Authors
- Gurvits, L.
- Venue
- Journal of Computer and System Sciences
- Publisher
- Elsevier BV
- Published
- 2004-11
- Volume
- 69
- Issue
- 3
- Pages
- 448-484
- ISSN
- 0022-0000 (ISSN-L)
- OpenAlex
- W1966991151
- Cited by
- 295
- References
- 18
- FWCI
- 2.38
- Type
- journal article
- Language
- en
- Open access
- bronze
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 complexity and quantum entanglement. https://app.cochat.ai/papers/10.1016/j.jcss.2004.06.003
- The paper
- Gurvits, L. (2004). Classical complexity and quantum entanglement. Journal of Computer and System Sciences. https://doi.org/10.1016/j.jcss.2004.06.003
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.