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
Quantum annealing with manufactured spins
Johnson, M. W., Amin, M. H. S., Gildert, S., Lanting, T., Hamze, F., Dickson, N., Harris, R., Berkley, A. J., Johansson, J., Bunyk, P., et al. (2011) · Nature · doi:10.1038/nature10012 · Cited by 1,891
Computational Complexity: A Modern Approach
Arora, S., & Barak, B. (2009) · doi:10.1017/cbo9780511804090 · Cited by 1,690
Albash, T., & Lidar, D. A. (2018) · Reviews of Modern Physics · doi:10.1103/revmodphys.90.015002 · Cited by 1,546
On the computational complexity of Ising spin glass models
Barahona, F. (1982) · Journal of Physics A: Mathematical and General · doi:10.1088/0305-4470/15/10/028 · Cited by 1,306
Simulating Hamiltonian Dynamics
Leimkuhler, B., & Reich, S. (2005) · Cambridge University Press eBooks · doi:10.1017/cbo9780511614118 · Cited by 1,130
Mathematical Aspects of Classical and Celestial Mechanics: Third Edition
Arnold, V. I., Kozlov, V. V., & Neishtadt, A. I. (2006) · Encyclopaedia of Mathematical Sciences · doi:10.1007/978-3-540-48926-9 · Cited by 1,102
On the Adiabatic Theorem of Quantum Mechanics
Kato, T. (1950) · Journal of the Physical Society of Japan · doi:10.1143/jpsj.5.435 · Cited by 1,055
Goldstein, H., Poole, C. P., Safko, J. L., & Addison, S. R. (2002) · American Journal of Physics · doi:10.1119/1.1484149 · Cited by 823
Evidence for quantum annealing with more than one hundred qubits
Boixo, S., Rønnow, T. F., Isakov, S. V., Wang, Z., Wecker, D., Lidar, D. A., Martinis, J. M., & Troyer, M. (2014) · Nature Physics · doi:10.1038/nphys2900 · Cited by 810
A coherent Ising machine for 2000-node optimization problems
Inagaki, T., Haribara, Y., Igarashi, K., Sonobe, T., Tamate, S., Honjo, T., Marandi, A., McMahon, P. L., Umeki, T., Enbutsu, K., et al. (2016) · Science · doi:10.1126/science.aah4243 · Cited by 796
A fully programmable 100-spin coherent Ising machine with all-to-all connections
McMahon, P. L., Marandi, A., Haribara, Y., Hamerly, R., Langrock, C., Tamate, S., Inagaki, T., Takesue, H., Utsunomiya, S., Aihara, K., et al. (2016) · Science · doi:10.1126/science.aah5178 · Cited by 702
Colloquium : Quantum annealing and analog quantum computation
Das, A., & Chakrabarti, B. K. (2008) · Reviews of Modern Physics · doi:10.1103/revmodphys.80.1061 · Cited by 700
Computational Complexity: ADVANCED TOPICS
Arora, S., & Barak, B. (2009) · Cited by 624
Network of time-multiplexed optical parametric oscillators as a coherent Ising machine
Marandi, A., Wang, Z., Takata, K., Byer, R. L., & Yamamoto, Y. (2014) · Nature Photonics · doi:10.1038/nphoton.2014.249 · Cited by 541
An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design
Barahona, F., Grötschel, M., Jünger, M., & Reinelt, G. (1988) · Operations Research · doi:10.1287/opre.36.3.493 · Cited by 504
Physics-Inspired Optimization for Quadratic Unconstrained Problems Using a Digital Annealer
Aramon, M., Rosenberg, G., Valiante, E., Miyazawa, T., Tamura, H., & Katzgraber, H. G. (2019) · Frontiers in Physics · doi:10.3389/fphy.2019.00048 · Cited by 442
Coherent Ising machine based on degenerate optical parametric oscillators
Wang, Z., Marandi, A., Wen, K., Byer, R. L., & Yamamoto, Y. (2013) · Physical Review A · doi:10.1103/physreva.88.063853 · Cited by 391
A 20k-Spin Ising Chip to Solve Combinatorial Optimization Problems With CMOS Annealing
(2016) · IEEE Journal of Solid-State Circuits · doi:10.1109/jssc.2015.2498601 · Cited by 368
Coherent Ising machines—optical neural networks operating at the quantum limit
Yamamoto, Y., Aihara, K., Leleu, T., Kawarabayashi, K.-I., Kako, S., Fejer, M., Inoue, K., & Takesue, H. (2017) · npj Quantum Information · doi:10.1038/s41534-017-0048-9 · Cited by 258
Bifurcation-based adiabatic quantum computation with a nonlinear oscillator network
Goto, H. (2016) · Scientific Reports · doi:10.1038/srep21686 · Cited by 226
Self-citationSolving the Optimal Trading Trajectory Problem Using a Quantum Annealer
Rosenberg, G., Haghnegahdar, P., Goddard, P., Carr, P., Wu, K., & de Prado, M. L. (2016) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2016.2574703 · Cited by 171
Optimised simulated annealing for Ising spin glasses
Isakov, S., Zintchenko, I., Rønnow, T. F., & Troyer, M. (2014) · Computer Physics Communications · doi:10.1016/j.cpc.2015.02.015 · Cited by 164
Quantum annealing with all-to-all connected nonlinear oscillators
Puri, S., Andersen, C. K., Grimsmo, A. L., & Blais, A. (2017) · Nature Communications · doi:10.1038/ncomms15785 · Cited by 164
Quantum Computation Based on Quantum Adiabatic Bifurcations of Kerr-Nonlinear Parametric Oscillators
Goto, H. (2019) · Journal of the Physical Society of Japan · doi:10.7566/jpsj.88.061015 · Cited by 117
Self-citationRobust quantum optimizer with full connectivity
Nigg, S. E., Lörch, N., & Tiwari, R. P. (2017) · Science Advances · doi:10.1126/sciadv.1602273 · Cited by 104
An Accelerator Architecture for Combinatorial Optimization Problems
Tsukamoto, S., Motomu, T., Matsubara, S., & Hirotaka, T. (2017) · Fujitsu Scientific and Technical Journal · Cited by 91
Combinatorial optimization using dynamical phase transitions in driven-dissipative systems
Leleu, T. G., Yamamoto, Y., Utsunomiya, S., & Aihara, K. (2017) · Physical review. E · doi:10.1103/physreve.95.022118 · Cited by 77
Boltzmann sampling from the Ising model using quantum heating of coupled nonlinear oscillators
Goto, H., Lin, Z., & Nakamura, Y. (2018) · Scientific Reports · doi:10.1038/s41598-018-25492-8 · Cited by 74
Self-citationSiarry, P. (2016) · Springer eBooks · doi:10.1007/978-3-319-45403-0 · Cited by 73
Performance evaluation of coherent Ising machines against classical neural networks
Haribara, Y., Ishikawa, H., Utsunomiya, S., Aihara, K., & Yamamoto, Y. (2017) · Quantum Science and Technology · doi:10.1088/2058-9565/aa8190 · Cited by 45
Hiromasa, S., Ogata, K., Isomura, T., Utsunomiya, S., Yamamoto, Y., & Aihara, K. (2016) · Entropy · doi:10.3390/e18100365 · Cited by 42
FPGA-based Annealing Processor for Ising Model
Yoshimura, C., Hayashi, M., Okuyama, T., & Yamaoka, M. (2016) · International Symposium on Computing and Networking · doi:10.1109/candar.2016.0081 · Cited by 33
Shortcuts to adiabatic classical spin dynamics mimicking quantum annealing
Hatomura, T., & Mori, T. (2018) · Physical review. E · doi:10.1103/physreve.98.032136 · Cited by 24
Computing architecture to perform approximated simulated annealing for Ising models
Okuyama, T., Yoshimura, C., Hayashi, M., & Yamaoka, M. (2016) · IEEE International Conference on Rebooting Computing (ICRC) · doi:10.1109/icrc.2016.7738673 · Cited by 23
A Time-Division Multiplexing Ising Machine on FPGAs
Yamamoto, K., Huang, W., Takamaeda-Yamazaki, S., Ikebe, M., Asai, T., & Motomura, M. (2017) · International Symposium on Highly Efficient Accelerators and Reconfigurable Technologies (HEART) · doi:10.1145/3120895.3120905 · Cited by 22
Solving the Optimal Trading Trajectory Problem Using a Quantum AnnealerPreprint
Rosenberg, G., Haghnegahdar, P., Goddard, P., Carr, P., Wu, K. J., & de Prado, M. L. (2015) · SSRN Electronic Journal · doi:10.2139/ssrn.2649376 · Cited by 17
Kihara, Y., Ito, M., Saito, T., Shiomura, M., Sakai, S., & Shirakashi, J. (2017) · IEEE International Conference on Nanotechnology (IEEE-NANO) · doi:10.1109/nano.2017.8117327 · Cited by 13
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
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.