Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2410.08569 · Japanese Journal of Applied Physics

Linear regression using quantum annealing with continuous variables

Asuka Koura, Takashi Imoto, Katsuki Ura, Yuichiro Matsuzaki

Published Jan 23, 2025• 5 citations
arXivHTMLPDF

Abstract

Abstract Linear regression is a data analysis technique that is categorized as supervised learning. By utilizing known data, we can predict unknown data. Recently, researchers have explored the use of quantum annealing (QA) to perform linear regression, where parameters are approximated to discrete values using binary numbers. However, this approach has a limitation: we need to increase the number of qubits to improve the accuracy. Here, we propose a novel linear regression method using QA that leverages continuous variables. In particular, the boson system facilitates the optimization of linear regression without resorting to discrete approximations, as it directly manages continuous variables while engaging in QA. The major benefit of our new approach is that it can ensure accuracy without increasing the number of qubits as long as the adiabatic condition is satisfied.

DOI
10.35848/1347-4065/adad7e

Related papers

Adaptive Learning for Quantum Linear Regression

Costantino Carugno, Maurizio Ferrari Dacrema, Paolo Cremonesi

The recent availability of quantum annealers as cloud-based services has enabled new ways to handle machine learning problems, and several relevant algorithms have been adapted to run on these devices. In a recent work, linear regression was formulated as a quadratic binary optimization problem that can be solved via quantum annealing. Although this approach promises a computational time advantage for large datasets, the quality of the solution is limited by the necessary use of a precision vector, used to approximate the real-numbered regression coefficients in the quantum formulation. In this work, we focus on the practical challenge of improving the precision vector encoding: instead of setting an array of generic values equal for all coefficients, we allow each one to be expressed by its specific precision, which is tuned with a simple adaptive algorithm. This approach is evaluated on synthetic datasets of increasing size, and linear regression is solved using the D-Wave Advantage quantum annealer, as well as classical solvers. To the best of our knowledge, this is the largest dataset ever evaluated for linear regression on a quantum annealer. The results show that our formulation is able to deliver improved solution quality in all instances, and could better exploit the potential of current quantum devices.

arXiv:2408.02833•IEEE International Conference on Quantum Computing and Engineering (QCE)•Sep 15, 2024•4 citations

On the Influence of Numerical Representations in Quantum-Annealing-Based Linear Regression

Pedro Faria Albuquerque, Leonardo Tomazeli Duarte

Quantum annealers are a class of quantum technologies that have attracted increasing attention due to their natural suitability for solving combinatorial optimization problems.Recent works reformulated the linear regression as a Quadratic Unconstrained Binary Optimization (QUBO) problem, enabling its implementation on quantum annealers and offering potential speed-ups for large datasets.However, this QUBO-based formulation requires the definition of a precision vector to represent the real-valued regression coefficients as integers variables, which introduces limitations related to the quantization accuracy.In this work, we investigate several numerical representations strategies for defining the precision vector.By performing a set of numerical experiments with synthetic datasets, we analyze the performance of these strategies in different configurations.Our results that the strategy usually known as conventional binary representation provides the best trade-off between performance and resource efficiency for quantum-assisted linear regression.

Anais de XXXV Simpósio Brasileiro de Telecomunicações e Processamento de Sinais•Jan 1, 2025•0 citations

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.04601•Aug 6, 2026•0 citations

Quadratic Continuous Quantum Optimization

Sascha Mücke, Thore Gerlach, Nico Piatkowski

Quantum annealers can solve QUBO problems efficiently but struggle with continuous optimization tasks like regression due to their discrete nature. We introduce Quadratic Continuous Quantum Optimization (QCQO), an anytime algorithm that approximates solutions to unconstrained quadratic programs via a sequence of QUBO instances. Rather than encoding real variables as binary vectors, QCQO implicitly represents them using continuous QUBO weights and iteratively refines the solution by summing sampled vectors. This allows flexible control over the number of binary variables and adapts well to hardware constraints. We prove convergence properties, introduce a step size adaptation scheme, and validate the method on linear regression. Experiments with simulated and real quantum annealers show that QCQO achieves accurate results with fewer qubits, though convergence slows on noisy hardware. Our approach enables quantum annealing to address a wider class of continuous problems.

quant-pharXiv:2512.24759•IEEE International Conference on Quantum Artificial Intelligence (QAI)•Jan 1, 2026•0 citations

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

Seiya Endo, Shohei Kawakatsu, Hiromichi Matsuyama +2 more

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.

arXiv:2506.20108•Japanese Journal of Applied Physics•Dec 15, 2025•0 citations

Quantum Support Vector Regression for Biophysical Variable Estimation in Remote Sensing

Edoardo Pasetto, Amer Delilbasic, Gabriele Cavallaro +4 more

Regression analysis has a crucial role in many Earth Ob-servation (EO) applications. The increasing availability and recent development of new computing technologies moti-vate further research to expand the capabilities and enhance the performance of data analysis algorithms. In this paper, the biophysical variable estimation problem is addressed. A novel approach is proposed, which consists in a reformulated Support Vector Regression (SVR) and leverages Quantum Annealing (QA). In particular, the SVR optimization prob-lem is reframed to a Quadratic Unconstrained Binary Opti-mization (QUBO) problem. The algorithm is then tested on the D-Wave Advantage quantum annealer. The experiments presented in this paper show good results, despite current hardware limitations, suggesting that this approach is viable and has great potential.

IEEE International Geoscience and Remote Sensing Symposium (IGARSS)•Jul 17, 2022•8 citations
Abstract Linear regression is a data analysis technique that is categorized as supervised learning. By utilizing known data, we can predict unknown data. Recently, researchers have explored the use of quantum annealing (QA) to perform linear regression, where parameters are approximated to discrete values using binary numbers. However, this approach has a limitation: we need to increase the number of qubits to improve the accuracy. Here, we propose a novel linear regression method using QA that leverages continuous variables. In particular, the boson system facilitates the optimization of linear regression without resorting to discrete approximations, as it directly manages continuous variables while engaging in QA. The major benefit of our new approach is that it can ensure accuracy without increasing the number of qubits as long as the adiabatic condition is satisfied.
The recent availability of quantum annealers as cloud-based services has enabled new ways to handle machine learning problems, and several relevant algorithms have been adapted to run on these devices. In a recent work, linear regression was formulated as a quadratic binary optimization problem that can be solved via quantum annealing. Although this approach promises a computational time advantage for large datasets, the quality of the solution is limited by the necessary use of a precision vector, used to approximate the real-numbered regression coefficients in the quantum formulation. In this work, we focus on the practical challenge of improving the precision vector encoding: instead of setting an array of generic values equal for all coefficients, we allow each one to be expressed by its specific precision, which is tuned with a simple adaptive algorithm. This approach is evaluated on synthetic datasets of increasing size, and linear regression is solved using the D-Wave Advantage quantum annealer, as well as classical solvers. To the best of our knowledge, this is the largest dataset ever evaluated for linear regression on a quantum annealer. The results show that our formulation is able to deliver improved solution quality in all instances, and could better exploit the potential of current quantum devices.
Quantum annealers are a class of quantum technologies that have attracted increasing attention due to their natural suitability for solving combinatorial optimization problems.Recent works reformulated the linear regression as a Quadratic Unconstrained Binary Optimization (QUBO) problem, enabling its implementation on quantum annealers and offering potential speed-ups for large datasets.However, this QUBO-based formulation requires the definition of a precision vector to represent the real-valued regression coefficients as integers variables, which introduces limitations related to the quantization accuracy.In this work, we investigate several numerical representations strategies for defining the precision vector.By performing a set of numerical experiments with synthetic datasets, we analyze the performance of these strategies in different configurations.Our results that the strategy usually known as conventional binary representation provides the best trade-off between performance and resource efficiency for quantum-assisted linear regression.
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.
Quantum annealers can solve QUBO problems efficiently but struggle with continuous optimization tasks like regression due to their discrete nature. We introduce Quadratic Continuous Quantum Optimization (QCQO), an anytime algorithm that approximates solutions to unconstrained quadratic programs via a sequence of QUBO instances. Rather than encoding real variables as binary vectors, QCQO implicitly represents them using continuous QUBO weights and iteratively refines the solution by summing sampled vectors. This allows flexible control over the number of binary variables and adapts well to hardware constraints. We prove convergence properties, introduce a step size adaptation scheme, and validate the method on linear regression. Experiments with simulated and real quantum annealers show that QCQO achieves accurate results with fewer qubits, though convergence slows on noisy hardware. Our approach enables quantum annealing to address a wider class of continuous problems.
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.
Regression analysis has a crucial role in many Earth Ob-servation (EO) applications. The increasing availability and recent development of new computing technologies moti-vate further research to expand the capabilities and enhance the performance of data analysis algorithms. In this paper, the biophysical variable estimation problem is addressed. A novel approach is proposed, which consists in a reformulated Support Vector Regression (SVR) and leverages Quantum Annealing (QA). In particular, the SVR optimization prob-lem is reframed to a Quadratic Unconstrained Binary Opti-mization (QUBO) problem. The algorithm is then tested on the D-Wave Advantage quantum annealer. The experiments presented in this paper show good results, despite current hardware limitations, suggesting that this approach is viable and has great potential.