The DOI matches its Crossref record; 47 of the 47 references it cites were found in a registry or an index.
Combinatorial optimization by simulating adiabatic bifurcations in nonlinear Hamiltonian systems
Open accessAbstract
Nonlinear Hamiltonian systems search optimal solutions exploiting their adiabatic and chaotic evolutions.
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
Optimization by Simulated Annealing
Kirkpatrick, S., Gelatt, C. D., & Vecchi, M. P. (1983) · Science · doi:10.1126/science.220.4598.671 · Cited by 45,134
Neural networks and physical systems with emergent collective computational abilities.
Hopfield, J. J. (1982) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.79.8.2554 · Cited by 19,270
Mathematical Methods of Classical Mechanics
Arnold, V. I. (1989) · Graduate Texts in Mathematics · doi:10.1007/978-1-4757-2063-1 · Cited by 9,116
Mersenne twister: a 623-dimensionally equidistributed uniform pseudo-random number generator
Matsumoto, M., & Nishimura, T. (1998) · ACM Transactions on Modeling and Computer Simulation · doi:10.1145/272991.272995 · Cited by 5,780
Nonequilibrium Equality for Free Energy Differences
Jarzynski, C. (1997) · Physical Review Letters · doi:10.1103/physrevlett.78.2690 · Cited by 5,293
Goemans, M. X., & Williamson, D. P. (1995) · Journal of the ACM · doi:10.1145/227683.227684 · Cited by 3,587
Ising formulations of many NP problems
Lucas, A. (2014) · Frontiers in Physics · doi:10.3389/fphy.2014.00005 · Cited by 2,512
Computational Complexity: A Modern Approach
Arora, S., & Barak, B. (2009) · Cited by 2,371
Quantum annealing in the transverse Ising model
Kadowaki, T., & Nishimori, H. (1998) · Physical Review E · doi:10.1103/physreve.58.5355 · Cited by 2,339
A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
Farhi, E., Goldstone, J., Gutmann, S., Lapan, J., Lundgren, A., & Preda, D. (2001) · Science · doi:10.1126/science.1057726 · Cited by 2,056
Cited by
Ising machines as hardware solvers of combinatorial optimization problems
Mohseni, N., McMahon, P. L., & Byrnes, T. (2022) · Nature Reviews Physics · doi:10.1038/s42254-022-00440-8 · Cited by 543
100,000-spin coherent Ising machine
Honjo, T., Sonobe, T., Inaba, K., Inagaki, T., Ikuta, T., Yamada, Y., Kazama, T., Enbutsu, K., Umeki, T., Kasahara, R., et al. (2021) · Science Advances · doi:10.1126/sciadv.abh0952 · Cited by 341
High-performance combinatorial optimization based on classical mechanics
Goto, H., Endo, K., Suzuki, M., Sakai, Y., Kanao, T., Hamakawa, Y., Hidaka, R., Yamasaki, M., & Tatsumura, K. (2021) · Science Advances · doi:10.1126/sciadv.abe7953 · Cited by 231
Designing metamaterials with quantum annealing and factorization machines
Kitai, K., Guo, J., Ju, S., Tanaka, S., Tsuda, K., Shiomi, J., & Tamura, R. (2020) · Physical Review Research · doi:10.1103/physrevresearch.2.013319 · Cited by 181
PyQUBO: Python Library for Mapping Combinatorial Optimization Problems to QUBO Form
Zaman, M., Tanahashi, K., & Tanaka, S. (2021) · arXiv · doi:10.48550/arxiv.2103.01708 · Cited by 114
PyQUBO: Python Library for Mapping Combinatorial Optimization Problems to QUBO Form
Zaman, M., Tanahashi, K., & Tanaka, S. (2022) · IEEE Transactions on Computers · doi:10.1109/tc.2021.3063618 · Cited by 114
On the emerging potential of quantum annealing hardware for combinatorial optimization
Tasseff, B., Albash, T., Morrell, Z., Vuffray, M., Lokhov, A. Y., Misra, S., & Coffrin, C. (2024) · Journal of Heuristics · doi:10.1007/s10732-024-09530-5 · Cited by 42
Benchmark Test of Black-box Optimization Using D-Wave Quantum Annealer
Koshikawa, A. S., Ohzeki, M., Kadowaki, T., & Tanaka, K. (2021) · Journal of the Physical Society of Japan · doi:10.7566/jpsj.90.064001 · Cited by 43
Hybrid Annealing Method Based on subQUBO Model Extraction With Multiple Solution Instances
Atobe, Y., Tawada, M., & Togawa, N. (2022) · IEEE Transactions on Computers · doi:10.1109/tc.2021.3138629 · Cited by 38
The quantum transition of the two-dimensional Ising spin glass
Bernaschi, M., González-Adalid Pemartín, I., Martín-Mayor, V., & Parisi, G. (2024) · Nature · doi:10.1038/s41586-024-07647-y · Cited by 35
Coupling quantum-like cognition with the neuronal networks within generalized probability theory
Khrennikov, A., Ozawa, M., Benninger, F., & Shor, O. (2025) · Journal of Mathematical Psychology · doi:10.1016/j.jmp.2025.102923 · Cited by 17
Metadata
- Authors
- Goto, H., Tatsumura, K., & Dixon, A. R.
- Venue
- Science Advances
- Published
- 2019-04-05
- Volume
- 5
- Issue
- 4
- Pages
- eaav2372-eaav2372
- ISSN
- 2375-2548 (ISSN-L)
- OpenAlex
- W2938847643
- Cited by
- 405
- References
- 47
- FWCI
- 17.04
- Type
- journal article
- Language
- en
- Open access
- gold
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.