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

Bulletin of the American Physical Society

Quantum Linear Regression With Regularization

Xiaokai Hou, Xi He, Chufan Lv, Dingding Wen, Xiaoting Wang

Published Mar 5, 2019• 0 citations
OpenAlex

Related papers

Quantum tomography by regularized linear regressions

Biqiang Mu, Hongsheng Qi, Ian R. Petersen +1 more

arXiv:1904.11839•Automatica•Jan 31, 2020•16 citations

Linear Regression Using Quantum Annealing with Continuous Variables

Asuka Koura, Takashi Imoto, Katsuki Ura +1 more

International Conference on Solid State Devices and Materials (SSDM)•Sep 3, 2024•2 citations

Quantum-assisted support vector regression

Archismita Dalal, Mohsen Bagherimehrab, Barry C. Sanders

arXiv:2111.09304•Quantum Information Processing•Mar 10, 2025•10 citations

Quantum regularized least squares solver with parameter estimate

Changpeng Shao, Hua Xiang

Quantum Information Processing•Feb 14, 2020•8 citations

Quantum Communication Complexity of Regularized Linear Regression Protocols

Sayaki Matsushita

Linear regression is fundamental to statistical analysis and machine learning, but its application to large-scale datasets necessitates distributed computing. The problem also arises in quantum computing, where handling extensive data requires distributed approaches. This paper investigates distributed linear regression in the quantum coordinator model. Building upon the distributed quantum least squares protocol developed by Montanaro and Shao, I propose improved and extended quantum protocols for solving both ordinary (unregularized) and L2-regularized (Tikhonov) least squares problems. For ordinary least squares methods, my protocol reduces the quantum communication complexity compared to the previous protocol. In particular, this yields a quadratic improvement in the number of digits of precision required for the generated quantum states. This improvement is achieved by incorporating advanced techniques such as branch marking and branch-marked gapped phase estimation developed by Low and Su. Furthermore, I establish a setting for the$\ell _{2}$-regularized least squares problem specifically in the quantum coordinator model and derive its quantum communication complexity. I analyze the effect of regularization parameters on the quantum communication complexity.

arXiv:2508.16141•IEEE Transactions on Quantum Engineering•Jan 1, 2026•0 citations

Mathematical Foundations of Quantum Linear Regression: A Proof of Concept via Variational Hamiltonian Formulation

Methanon Kaeokrachang

We present a rigorous mathematical proof of concept demonstrating the theoretical feasibility of quantum linear regression through variational Hamiltonian formulation. Our framework systematically transforms classical linear regression into a quantum optimization problem by encoding regression weights as expectation values of Pauli-Z operators and reformulating the loss function as a quantum Hamiltonian. We provide explicit mathematical constructions, matrix representations, and convergence analysis to establish the theoretical foundation for quantum machine learning applications. Unlike previous quantum linear regression approaches that focus on exponential speedups through quantum linear systems solvers, our variational approach is designed for near-term quantum devices and naturally incorporates regularization through quantum parameter constraints. The mathematical framework demonstrates computational equivalence between classical and quantum approaches while revealing inherent advantages in constrained optimization scenarios. This work provides the theoretical groundwork for future empirical applications to financial time series prediction, including potential implementation on Thai SET Index forecasting using data from Yahoo Finance and quantum computing platforms. Our key contributions include: (1) complete mathematical mapping from classical to quantum regression formulation, (2) explicit Hamiltonian constructions with matrix representations, (3) theoretical convergence analysis for quantum gradient descent, and (4) identification of quantumspecific regularization properties that distinguish this approach from classical methods.

•Jun 27, 2025•0 citations
Linear regression is fundamental to statistical analysis and machine learning, but its application to large-scale datasets necessitates distributed computing. The problem also arises in quantum computing, where handling extensive data requires distributed approaches. This paper investigates distributed linear regression in the quantum coordinator model. Building upon the distributed quantum least squares protocol developed by Montanaro and Shao, I propose improved and extended quantum protocols for solving both ordinary (unregularized) and L2-regularized (Tikhonov) least squares problems. For ordinary least squares methods, my protocol reduces the quantum communication complexity compared to the previous protocol. In particular, this yields a quadratic improvement in the number of digits of precision required for the generated quantum states. This improvement is achieved by incorporating advanced techniques such as branch marking and branch-marked gapped phase estimation developed by Low and Su. Furthermore, I establish a setting for theℓ2\ell _{2}ℓ2​-regularized least squares problem specifically in the quantum coordinator model and derive its quantum communication complexity. I analyze the effect of regularization parameters on the quantum communication complexity.
We present a rigorous mathematical proof of concept demonstrating the theoretical feasibility of quantum linear regression through variational Hamiltonian formulation. Our framework systematically transforms classical linear regression into a quantum optimization problem by encoding regression weights as expectation values of Pauli-Z operators and reformulating the loss function as a quantum Hamiltonian. We provide explicit mathematical constructions, matrix representations, and convergence analysis to establish the theoretical foundation for quantum machine learning applications. Unlike previous quantum linear regression approaches that focus on exponential speedups through quantum linear systems solvers, our variational approach is designed for near-term quantum devices and naturally incorporates regularization through quantum parameter constraints. The mathematical framework demonstrates computational equivalence between classical and quantum approaches while revealing inherent advantages in constrained optimization scenarios. This work provides the theoretical groundwork for future empirical applications to financial time series prediction, including potential implementation on Thai SET Index forecasting using data from Yahoo Finance and quantum computing platforms. Our key contributions include: (1) complete mathematical mapping from classical to quantum regression formulation, (2) explicit Hamiltonian constructions with matrix representations, (3) theoretical convergence analysis for quantum gradient descent, and (4) identification of quantumspecific regularization properties that distinguish this approach from classical methods.