ArticleScience advances2019
Combinatorial optimization by simulating adiabatic bifurcations in nonlinear Hamiltonian systems.
Article in Science advances, 2019. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 42 papers.
What it found
Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.
The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.
The trial behind it
Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.
Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.
Who cites it
42 citing papers in PubMed.
- Real-time black-box optimization for dynamic discrete environments using embedded Ising machines.Nature communications · 2026Article
- Precision meets speed through an FPGA-based natively sparse Ising machine for combinatorial optimization.Nature communications · 2026Article
- Deciphering optical coupled resonant systems with physics-data co-driven deep neural networks.Light, science & applications · 2026Article
- Machine learning-assisted high-speed combinatorial optimization with Ising machines for dynamically changing problems.Nature communications · 2026Article
- Factorization machine with quadratic-optimization annealing for RNA inverse folding and evaluation of binary-integer encoding and nucleotide assignment.Scientific reports · 2026Article
- Higher-order neuromorphic Ising machines-autoencoders and Fowler-Nordheim annealers are all you need for scalability.Nature communications · 2026Article
- A unified performance-cost landscape of parallel p-bit Ising machines based on update dynamics.Scientific reports · 2026Article
- A hardware-adaptive learning algorithm for superlinear-capacity associative memory on memristor crossbars.Nature communications · 2026Article
- Quantum-Inspired Fast Algorithm and Circuit Realization for Constrained Combinatorial Optimization Problem.Research (Washington, D.C.) · 2026Article
- Enhancing vehicle-mountable multiple object tracking systems with embeddable Ising machines.Nature communications · 2025Article
- Efficient optimization accelerator framework for multi-state spin Ising problems.Nature communications · 2025Article
- Quantum Computing for Transport Network Optimization.Entropy (Basel, Switzerland) · 2025Article
- Adiabatic Energetic Annealing via Dual Single-Pixel Detection in an Optical Nonlinear Ising Machine.ACS photonics · 2025Article
- ON-OFF neuromorphic ISING machines using Fowler-Nordheim annealers.Nature communications · 2025Article
- GPU-accelerated simulated annealing based on p-bits with real-world device-variability modeling.Scientific reports · 2025Article
- Entanglement-assisted variational algorithm for discrete optimization problems.Communications physics · 2025Article
- Collaborative filtering based on nonnegative/binary matrix factorization.Frontiers in big data · 2025Article
- All-to-all reconfigurability with sparse and higher-order Ising machines.Nature communications · 2024Article
- Hybrid quantum-classical computation for automatic guided vehicles scheduling.Scientific reports · 2024Article
- Article
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
3 authors.
Funding
No grant is acknowledged in the PubMed record.
Abstract
Combinatorial optimization problems are ubiquitous but difficult to solve. Hardware devices for these problems have recently been developed by various approaches, including quantum computers. Inspired by recently proposed quantum adiabatic optimization using a nonlinear oscillator network, we propose a new optimization algorithm simulating adiabatic evolutions of classical nonlinear Hamiltonian systems exhibiting bifurcation phenomena, which we call simulated bifurcation (SB). SB is based on adiabatic and chaotic (ergodic) evolutions of nonlinear Hamiltonian systems. SB is also suitable for parallel computing because of its simultaneous updating. Implementing SB with a field-programmable gate array, we demonstrate that the SB machine can obtain good approximate solutions of an all-to-all connected 2000-node MAX-CUT problem in 0.5 ms, which is about 10 times faster than a state-of-the-art laser-based machine called a coherent Ising machine. SB will accelerate large-scale combinatorial optimization harnessing digital computer technologies and also offer a new application of computational and mathematical physics.
Identifiers
What OpenQuestion holds
Registered trials
Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.