The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
Nonlinear Quantum Mechanics Implies Polynomial-Time Solution forNP-Complete and #PProblems
Open accessAbstract
If quantum states exhibit small nonlinearities during time evolution, then quantum computers can be used to solve $\mathrm{NP}$-complete and # $P$ problems in polynomial time. We provide algorithms that solve $\mathrm{NP}$-complete and # $P$ oracle problems by exploiting nonlinear quantum logic gates. Using the Weinberg model as a simple example, the explicit construction of these gates is derived from the underlying physics. Nonlinear quantum algorithms are also presented using Polchinski type nonlinearities which do not allow for superluminal communication.
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
Simulating physics with computers
Feynman, R. P. (1982) · International Journal of Theoretical Physics · doi:10.1007/bf02650179 · Cited by 7,691
Lloyd, S. (1996) · Science · doi:10.1126/science.273.5278.1073 · Cited by 3,088
Self-citationDiVincenzo, D. P. (1995) · Science · doi:10.1126/science.270.5234.255 · Cited by 1,651
Quantum computation and Shor's factoring algorithm
Ekert, A., & Jozsa, R. (1996) · Reviews of Modern Physics · doi:10.1103/revmodphys.68.733 · Cited by 1,354
Weinberg's nonlinear quantum mechanics and the Einstein-Podolsky-Rosen paradox.
Polchinski, J. (1991) · Physical Review Letters · doi:10.1103/physrevlett.66.397 · Cited by 312
Test of the linearity of quantum mechanics by rf spectroscopy of theBe+9ground state
Bollinger, J. J., Heinzen, D. J., Itano, W. M., Gilbert, S. L., & Wineland, D. J. (1989) · Physical Review Letters · doi:10.1103/physrevlett.63.1031 · Cited by 151
Cited by
Ultimate physical limits to computation
Lloyd, S. (2000) · Nature · doi:10.1038/35023282 · Cited by 1,120
Self-citationOn the role of entanglement in quantum-computational speed-up
Jozsa, R., & Linden, N. (2003) · Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rspa.2002.1097 · Cited by 839
Information processing in generalized probabilistic theories
Barrett, J. (2007) · Physical Review A · doi:10.1103/physreva.75.032304 · Cited by 768
Computational Capacity of the Universe
Lloyd, S. (2002) · Physical Review Letters · doi:10.1103/physrevlett.88.237901 · Cited by 571
Self-citationAn introduction to quantum computing for non-physicists
Rieffel, E., & Polak, W. (2000) · ACM Computing Surveys · doi:10.1145/367701.367709 · Cited by 407
Metadata
- Authors
- Abrams, D. S., & Lloyd, S.
- Venue
- Physical Review Letters
- Publisher
- American Physical Society (APS)
- Published
- 1998-11-02
- Volume
- 81
- Issue
- 18
- Pages
- 3992-3995
- ISSN
- 0031-9007 (ISSN-L)
- 1079-7114
- OpenAlex
- W2085142809
- Cited by
- 249
- References
- 6
- FWCI
- 7.88
- Type
- journal article
- Language
- en
- Open access
- green
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: Nonlinear Quantum Mechanics Implies Polynomial-Time Solution forNP-Complete and #PProblems. https://app.cochat.ai/papers/10.1103/physrevlett.81.3992
- The paper
- Abrams, D. S., & Lloyd, S. (1998). Nonlinear Quantum Mechanics Implies Polynomial-Time Solution forNP-Complete and #PProblems. Physical Review Letters. https://doi.org/10.1103/physrevlett.81.3992
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.