SearcharxivSearch

arXiv subjects

Seiya Miyamoto

Publications and source records attributed to Seiya Miyamoto.

2 recordsLinked to original sources

QUBO-Based Optimization of Social Indicator Configurations for Working-Age Population Growth

The decline of the working-age population is a major challenge for regional sustainability, particularly in ageing societies such as Japan. We present a methodological demonstration of a quadratic unconstrained binary optimization (QUBO)-based framework for exploring social-indicator configurations associated with working-age population growth. Using Japanese municipal data, we regressed the 2010-2020 working-age population growth rate on ten discretized social indicators. The resulting quadratic surrogate model showed reasonable predictive performance, with a test-set correlation coefficient of 0.84 and an average R-squared value of 0.76. Its coefficient matrix provides an interpretable representation of individual indicator-level contributions and pairwise associations. We converted the fitted model into a QUBO formulation with one-hot constraints and optimized it using quantum annealing, simulated annealing, and Gurobi. All three methods identified the same optimal feasible configuration, while the annealing-based samplers also generated feasible suboptimal configurations with different predicted growth rates. Municipality-level single-indicator analyses showed that changing one indicator can increase or decrease the predicted growth rate depending on the other indicators. The framework provides an interpretable and optimization-ready approach for connecting municipal social statistics, nonlinear interactions, and model-based scenario generation. It should be regarded as an exploratory tool for policy discussion rather than as a causal estimate of policy interventions.

quant-ph

Dynamical Criticality of a Machine-learning-assisted Monte Carlo algorithm for a Mean-Field Spin Glass model

We critically assess the performance of an autoregressive generative neural network model by applying it to an antiferromagnetic Ising model on a random regular graph. We train the network on equilibrium configurations in the low-temperature spin-glass phase of the model and perform Monte Carlo simulations using spin configurations generated by the network. The relaxation time of the Monte Carlo simulations drastically decreases with increasing the size of the training dataset and converges to an optimal value. The dynamical exponent characterizing the growth of the optimal relaxation time as a function of the system size is slightly reduced compared to the local Monte Carlo dynamics. However, we find that the size of the training dataset to achieve the optimal performance grows much faster with the system size than the relaxation time, implying that the total training cost eventually hinders a practical use of the method at large system sizes.

cond-mat.dis-nn