arXiv:2506.20108 · Japanese Journal of Applied Physics

Quantum annealing with qubit–resonator systems for simultaneous optimization of binary and continuous variables

Seiya Endo, Shohei Kawakatsu, Hiromichi Matsuyama, Kohei Suzuki, Yuichiro Matsuzaki

Published Dec 15, 2025• 0 citations

Abstract

Abstract Quantum annealing is a method developed to solve combinatorial optimization problems by utilizing quantum bits. Solving such problems corresponds to minimizing a cost function defined over binary variables. However, in many practical cases, the cost function may also involve continuous variables. Representing continuous variables using quantum bits requires binary encoding, which demands a large number of qubits. To overcome this limitation, an approach using quantum resonators has been proposed, enabling the direct handling of continuous variables within the quantum annealing framework. On the other hand, certain optimization problems involve both binary and continuous variables simultaneously, and a quantum annealing method capable of efficiently solving such hybrid problems has not been established. Here, we propose a quantum annealing method based on a hybrid system composed of qubits and resonators, aiming to minimize cost functions that contain both binary and continuous variables. We present a general framework for hybrid quantum annealing using such systems, and investigate its feasibility and effectiveness through numerical simulations.

DOI: 10.35848/1347-4065/ae2cd3

Related papers

Solving Differential Equations Using Continuous-Variable Quantum Annealing

Kazuki Miyanishi, Soshun Naito, Asuka Koura +3 more

Most existing quantum annealing approaches are formulated for qubit-based architectures. Consequently, applying them to continuous-variable optimization problems requires discretizing the variables, which can incur substantial qubit overhead. Continuous-variable quantum annealing based on bosonic systems has recently been proposed as an alternative framework, in which each optimization variable is directly encoded in a bosonic mode, such as a cavity mode. In this work, we develop a continuous-variable quantum annealing formulation for solving linear differential equations. By recasting the determination of the solution as a continuous-variable optimization problem, the differential equation can be mapped onto an objective function compatible with bosonic quantum annealing. Numerical simulations of second-order linear differential equations demonstrate that, under the conditions considered, the proposed formulation reproduces the corresponding analytical solutions. These results establish a potential route toward solving differential equations without the discretization overhead inherent in qubit-based implementations.

quant-pharXiv:2608.04601Aug 6, 20260 citations

Adaptive Encoding Strategy for Quantum Annealing in Mixed-Variable Engineering Optimization

Fabian Key, Lukas Freinberger, Mayu Muramatsu +1 more

Mixed discrete-continuous optimization is central to engineering design, where discrete choices interact with continuous fields. These problems are difficult due to high-dimensional, complex search spaces. To tackle them, Quantum Annealing (QA) is promising, yet its native binary nature supports only discrete variables, making accurate and efficient encodings of continuous quantities a central challenge. Existing approaches either split the coupled problem, mapping discrete decisions to QA while solving continuous fields classically, or use fixed-bit-depth encodings. The former compromises QA's global search advantages; the latter can underrepresent dynamic range or inflate the number of binary variables. We show that simply increasing bit depth can even degrade performance on current QA hardware, underscoring the need for alternative encodings. In response, we introduce an adaptive encoding strategy for continuous variables in QA that enables efficient treatment of coupled mixed-variable problems. We propose an update strategy for the representable ranges of the continuous variables and demonstrate its utility by integrating it into the minimum complementary energy formulation for structural design optimization, which provides a single, coupled constrained problem. We apply a quadratic penalty method where we update the representation of the continuous variables while targeting the full original objective, preserving QA's global search capability. On a published benchmark, the size optimization of a composite rod, our adaptive encoding improves solution quality under a fixed binary variable budget, demonstrating a superior precision-resource trade-off. Since the framework generalizes beyond structural design, it offers practical guidance for encoding continuous variables for QA and indicates that adaptive representations can enhance precision on current hardware.

arXiv:2603.17506Mar 18, 20260 citations

Extending Quantum Annealing to Continuous Domains: a Hybrid Method for Quadratic Programming

Hristo N. Djidjev

We propose Quantum Enhanced Simulated Annealing (QESA), a novel hybrid optimization framework that integrates quantum annealing (QA) into simulated annealing (SA) to tackle continuous optimization problems. While QA has shown promise in solving binary problems such as those expressed in Ising or QUBO form, its direct applicability to real-valued domains remains limited. QESA bridges this gap by using QA to select discrete search directions that guide SA through the continuous solution space, enabling the use of quantum resources without requiring full problem discretization. We demonstrate QESA’s effectiveness on box-constrained quadratic programming (QP) problems, a class of non-convex optimization tasks that frequently arise in practice. Experimental results show that QESA consistently outperforms classical baselines in solution quality, particularly on larger and more ill-conditioned problems, while maintaining competitive runtime. As quantum annealing hardware matures, QESA offers a scalable and flexible strategy for leveraging quantum capabilities in continuous optimization.

arXiv:2504.02073ACM Transactions on Quantum ComputingApr 7, 20260 citations

Optimization with Quantum Annealing Machines

Samuel Deleplanque

Quantum annealing is a method based on simulated annealing where temperature variations are replaced by quantum fluctuations that cause qubit state transitions. ISING problems and Quadratic Unconstrained Binary Optimization problems (QUBO) can be tackled by quantum annealing-based machines. We can link the interconnected qubits of the machine and the binaries of our model: qubits are binary variables and each pair of them linked by a coupler has a strong impact on the equality or the non-equality of the two binaries of the associated pair. Quantum annealing is based on the fact that any system tends to seek its minimum energy state. Starting from qubits in a state of superposition where all the solutions to the problem are fairly represented, the machine will apply a magnetic field by targeting the qubits and couplers in such a way as to make their value energetically favorable in the direction of optimization (minimization). For the coupled qubits, it is the quadratic products of the binary variables that are considered here and the physical system will make it energetically favorable for them to take (or not) the same values. To work on these machines based on quantum annealing in order to solve optimization problems with constraints, the latter must be relaxed while penalizing the Objective function. After presenting the case of the Max-Cut problem, we will look at such constrained problems.

Jul 3, 20220 citations

Quantum annealing applications in high-energy phenomenology

Juan Carlos Criado

Abstract The quantum annealing framework provides a general technique for the solution of a wide variety of optimization problems. Recent technological developments have made it possible to build quantum annealing devices with thousands of qubits, bringing them within range to tackle real-world problems in the near future. In this paper, I review this framework, and present a method for its use in the minimization of functions of continuous variables. Then, I discuss how this method can be employed to solve optimization problems with applications in high-energy physics, including training neural networks for classification, solving partial differential equations, and fitting effective field theories to experimental data.

Journal of Physics Conference SeriesApr 1, 20260 citations

Quantum Annealing Combinatorial Optimization (QACO)

Jincheng Zhang

This paper explores the application of Quantum Annealing (QA) to the field of combinatorial optimization. The core idea is to leverage the principles of quantum mechanics, specifically quantum tunneling, to efficiently solve complex optimization problems. We present a framework for utilizing QA to tackle problems represented as quadratic unconstrained binary optimization (QUBO) models. The methodology focuses on mapping the problem's constraints and objective function into a form suitable for QA hardware. We discuss the challenges involved in this mapping process, including the limitations of current QA devices and the need for careful problem formulation. Furthermore, we analyze the potential advantages of QA over classical optimization techniques, particularly concerning the exploration of a wider solution space. The research highlights the promise of QACO as a viable approach for tackling computationally demanding combinatorial optimization tasks, offering a novel method to enhance optimization efficiency.

Sep 3, 20260 citations