Utilizing intermediate states in quantum annealing for multi-objective optimization
AI Breakdown
Get a structured breakdown of this paper — what it's about, the core idea, and key takeaways for the field.
Abstract
We investigate obtaining intermediate quantum states during the quantum annealing process to address the limitation of the linear weighted sum method in multi-objective optimization, which inherently fails to reach non-convex regions of the Pareto front. We validate this approach through physical experiments utilizing quench-based readout and numerical simulations assuming ideal mid-anneal measurements. Both methods consistently demonstrate a clear trade-off where earlier timing enhances diversity of the solutions, whereas later timing ensures convergence to non-dominated solutions. Notably, a practical compromise timing balances both metrics. The qualitative agreement between practical quench and ideal simulation indicates the potential of accessing the intermediate states for comprehensive Pareto front exploration.