The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
P/NP, and the quantum field computer
Open accessAbstract
The central problem in computer science is the conjecture that two complexity classes,P(polynomial time) and NP(nondeterministic polynomial time—roughly those decision problems for which a proposed solution can be checked in polynomial time), are distinct in the standard Turing model of computation:P≠NP. As a generality, we propose that each physical theory supports computational models whose power is limited by the physical theory. It is well known that classical physics supports a multitude of implementation of the Turing machine. Non-Abelian topological quantum field theories exhibit the mathematical features necessary to support a model capable of solving all ⧣P problems, a computationally intractable class, in polynomial time. Specifically, Witten [Witten, E. (1989)Commun. Math. Phys.121, 351–391] has identified expectation values in a certain SU(2)-field theory with values of the Jones polynomial [Jones, V. (1985)Bull. Am. Math. Soc.12, 103–111] that are ⧣P-hard [Jaeger, F., Vertigen, D. & Welsh, D. (1990)Math. Proc. Comb. Philos. Soc.108, 35–53]. This suggests that some physical system whose effective Lagrangian contains a non-Abelian topological term might be manipulated to serve as an analog computer capable of solving NP or even ⧣P-hard problems in polynomial time. Defining such a system and addressing the accuracy issues inherent in preparation and measurement is a major unsolved problem.
Overview
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
Simulating physics with computers
Feynman, R. P. (1982) · International Journal of Theoretical Physics · doi:10.1007/bf02650179 · Cited by 7,691
Quantum field theory and the Jones polynomial
Witten, E. (1989) · Communications in Mathematical Physics · doi:10.1007/bf01217730 · Cited by 4,758
Fractional Statistics and Anyon Superconductivity
Wilczek, F. (1990) · Series on Directions in Condensed Matter Physics · doi:10.1142/0961 · Cited by 1,070
The Geometry and Physics of Knots
Atiyah, M. (1990) · doi:10.1017/cbo9780511623868 · Cited by 597
The partition function of degenerate quadratic functional and Ray-Singer invariants
Schwarz, A. S. (1978) · Letters in Mathematical Physics · doi:10.1007/bf00406412 · Cited by 389
Cited by
New directions in the pursuit of Majorana fermions in solid state systems
Alicea, J. (2012) · Reports on Progress in Physics · doi:10.1088/0034-4885/75/7/076501 · Cited by 2,854
Non-Abelian statistics and topological quantum information processing in 1D wire networks
Alicea, J., Oreg, Y., Refael, G., von Oppen, F., & Fisher, M. P. A. (2011) · Nature Physics · doi:10.1038/nphys1915 · Cited by 1,636
Majorana zero modes and topological quantum computation
Sarma, S. D., Freedman, M., & Nayak, C. (2015) · npj Quantum Information · doi:10.1038/npjqi.2015.1 · Cited by 1,180
Self-citationTopological quantum computation
Freedman, M., Kitaev, A., Larsen, M., & Wang, Z. (2002) · Bulletin of the American Mathematical Society · doi:10.1090/s0273-0979-02-00964-3 · Cited by 669
Self-citationTopological Quantum Computation
Wang, Z. (2010) · CBMS Regional Conference Series in Mathematics · doi:10.1090/cbms/112 · Cited by 576
Metadata
- Authors
- Freedman, M. H.
- Venue
- Proceedings of the National Academy of Sciences
- Published
- 1998-01-06
- Volume
- 95
- Issue
- 1
- Pages
- 98-101
- ISSN
- 0027-8424 (ISSN-L)
- 1091-6490
- OpenAlex
- W2170767514
- Cited by
- 221
- References
- 5
- FWCI
- 1.31
- 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
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.