A nudged-system optimization method recovers parameters in the Lorenz-63 system from partial noisy observations, with theoretical guarantees on synchronization and identifiability.
super hub Mixed citations
Optimization by Simulated Annealing
Mixed citation behavior. Most common role is background (67%).
27
Pith papers citing it
33.5k
external citations · Crossref
Background
67% of classified citations
hub tools
citation-role summary
background 5
method 1
citation-polarity summary
claims ledger
- method distance term changes the solution distribution. Before reconstruction, one-hot valid- ity and anchor completeness were explicitly verified so that invalid decoded states were not interpreted as geometric solutions. 3.6 Solvers, baselines, and resource logging Primary solver (simulated annealing). The main Q-SFD benchmark used classical simulated annealing (SA) [32] with mul- tiple reads; the top-5 solutions were retained for each case. Retaining a pool of near-optimal states allows downstream r
- background space of combinatorial optimization problems (COPs) can grow faster than exponentially in the number of objects, making exhaustive search impractical [ 6]. As a result, several algorithms and hardware accelerators have been developed over the years which aim to provide high-quality solutions with minimal consumption of resources such as time and energy [7, 8]. Ising machines (IMs) [9, 10, 11, 8] are hardware accelera- tors designed to find low-energy states of theIsing model of statistical mecha
- background Classical simulations and hybrid classical-quantum algorithms can be a useful approach to overcome the physical limitations of current Noisy Intermediate-Scale Quantum (NISQ) [38] devices. Our technique to solve the TSP is based on the classical sim- ulation of Quantum Annealing (QA) [ 29] via the Path Integral Monte Carlo (PIMC) method [34]. In particular, Martoňák et al. [35] proposed a PIMC quantum annealing scheme based on a highly constrained Ising-like representation of the TSP. While thei
- background straints into molecular binding and then letting the sys- tem settle [24]. In engineered hardware, analogous solver behavior appears in systems whose dynamics minimize an implicit cost function, such as spin glasses or elastic networks that relax to reduce frustration or stress. The connection between annealing in statistical physics and combinatorial optimization was formalized by Kirkpatrick et al. [25]. Conceptually, these systems admit a scalar "energy" (or Hamiltonian) that acts as a Lyapun
- background softx.2022.101109. [100] X. Wang, C. Han, R. Leus, Scheduling multiple agile earth observation satellites with multiple observations, Advances in Space Research (2025). doi: 10.1016/j.asr.2025.10. 042. [101] S. Kirkpatrick, C. D. Gelatt, M. P. Vecchi, Optimization by simulated annealing, Science 220 (1983) 671-680. doi: 10.1126/science.220.4598.671. [102] G. Wu, H. Wang, W. Pedrycz, et al., Satellite observation scheduling with a novel adaptive simulated annealing algorithm and a dynamic task cl
- background Journal of the Physical Society of Japan, 5(6): 435-439, 1950.doi:10.1143/JPSJ.5.435. [46] Edward Farhi, Jeffrey Goldstone, Sam Gutmann, and Michael Sipser. Quantum computation by adiabatic evolution, 2000. [47] S. Kirkpatrick, C. D. Gelatt Jr., and M. P. Vecchi. Optimization by simulated annealing.Science, 220(4598): 671-680, 1983.doi:10.1126/science.220.4598.671. [48] D. R. Hartree. The wave mechanics of an atom with a non-coulomb central field. part ii. some results and discussion.Mathematica
authors
co-cited works
representative citing papers
Ising machines outperform every tested Potts machine on Max-k-Cut problems, with the performance gap widening from k=3 to k=4.
EOS-Bench creates thousands of satellite scheduling test cases spanning small to large scales and evaluates multiple solver types across five performance metrics.
AI coding agents evolve simple ground-state protocols into improved versions for VQE, DMRG, and AFQMC on spin models and molecules by using executable energy scores under fixed compute budgets.
Four continuous relaxations turn non-differentiable coverage and revisit calculations into a fully differentiable pipeline that optimizes satellite orbits via gradients and outperforms metaheuristics.
Gaussian particles in a linearized Bures-Wasserstein space perform consensus optimization for variational inference and outperform deterministic gradient methods on low-dimensional non-log-concave targets.
AtomTreeSearch embeds a neutral-atom quantum MWIS subroutine inside Monte Carlo Tree Search and matches or exceeds OR-Tools and simulated annealing on TSP instances up to 100 cities.
Coupling-Grouped XY-QAOA enables joint anomaly-feature selection via a constraint-preserving grouped-angle QAOA variant, achieving 45.9-61.3% circuit depth reduction and larger feasible executions (64 qubits at p=2) on IBM Heron hardware compared to standard approaches.
Simulated annealing with seasonal sliced Wasserstein distance selects climate year subsets that are 2.5-3.5 times more representative than ENTSO-E practice and achieve 4-5 times effective sample size.
Introduces a beam-search heuristic for random subset sum that uses meshing to obtain inverse-quadratic expected error decay in linearithmic time.
Hybrid quantum-classical GA uses a 3n-qubit O(n²)-gate quantum evaluator for the Gowers U2 norm to search for bent Boolean functions, validated on n=8 with exact threshold achievement.
Q-SFD, a QUBO formulation for simultaneous fragment docking with an added inter-fragment distance term, approximately doubles top-1 recovery of reconstruction-feasible pose pairs and places at least one feasible pair in the top-5 for over 90% of benchmark cases without losing pose accuracy.
A quantum MCMC algorithm leveraging the MBL phase and its thermal-to-localized transition to tune acceptance rates and sample thermal distributions on programmable quantum simulators for combinatorial optimization.
HYPERHEURIST uses simulated annealing to refine functionally validated LLM-generated RTL designs, producing more stable PPA optimization than single-pass LLM generation across eight benchmarks.
QAOA-based QuSO achieves end-to-end speedup over classical baselines for power grid unit commitment with up to 14 qubits using 16 layers in high-load scenarios via efficient classical pre-computation.
Presents an optimal gate-packing partitioning scheme for the QFT that aims to minimize e-bit count in distributed quantum systems and validates it on hardware.
A quantum-assisted agentic DAI framework formulates microgrid dispatch as QUBO problems solved by solver portfolios with agentic selection and belief-shaped storage valuation, achieving exact optimum in a 24-hour simulation with 97.83% renewable utilization.
Apollo is a room-temperature 10000-node CMOS neuromorphic chip whose p-qubit network emulates transverse-field quantum annealing via Suzuki-Trotter and reportedly achieves lower energies than cryogenic QA on 3D spin-glass benchmarks across 300 realizations.
A quantum-inspired framework using effective Hamiltonians, Metropolis annealing and stochastic tensor-network compression is proposed for adaptive multi-demand routing in large-scale QKD networks.
A framework combining linear mixed-effects models for player ratings and prices with multi-criteria optimization and auction simulation for football transfers, illustrated on 2018-19 Premier League data.
Graph contraction reduces TSP instances to smaller sub-problems solvable by quantum annealers, shown via Path Integral Monte Carlo simulation and D-Wave hardware.
A digital twin framework integrates agent-based decision support and metaheuristic optimization to dynamically model and optimize EV charging infrastructure, policies, and renewables in a Hanoi university campus setting.
GPU implementation of global optimization for logic model identification from time-course data achieves 33-1866% speedups over CPU baselines on two example regulatory networks.
Thesis uses statistical mechanics to study DAM and RBM models for understanding memorization, low-dimensional learning, and adversarial robustness in neural networks.
citing papers explorer
-
Simultaneous Fragment Docking for Geometrically Linkable Pose Pairs
Q-SFD, a QUBO formulation for simultaneous fragment docking with an added inter-fragment distance term, approximately doubles top-1 recovery of reconstruction-feasible pose pairs and places at least one feasible pair in the top-5 for over 90% of benchmark cases without losing pose accuracy.