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

Springer eBooks

Convex Analysis–Statistical Theory of Decisions and of Machine Learning: Classical and Quantum

Kalyan B. Sinha

Published Dec 14, 2025• 0 citations
Publisher
DOI
10.1007/978-981-95-6152-0_2

Related papers

Quantum Decision Theory: Analysis and Optimization

Gianfranco Cariolaro

Signals and communication technology•Jan 1, 2015•0 citations

A Quantum Statistical Model of Decision Making in a Single-Cell Eukaryote

Cognitive Science Society 2025, Jad Soucar, Francis Steen

The single-celled protist Stentor roselii has long been observed to exhibit complex decision-making behaviors, yet existing machine learning and classical computational models have struggled to replicate its actions. In this paper, we propose a novel quantum-statistical framework to model S. roselii’s behavioral responses to environmental stimuli. By leveraging quantum circuits with amplitude dampening and memory effects, we construct a quantum behavioral model that captures the probabilistic and hierarchical nature of S. roselii’s decision making. Our results suggest that quantum statistical theory provides a powerful tool for representing and simulating biological decision processes.

•Jun 18, 2025•0 citations

Quantum algorithms for machine learning and optimization

Tongyang Li

The theories of optimization and machine learning answer foundational questions in computer science and lead to new algorithms for practical applications. While these topics have been extensively studied in the context of classical computing, their quantum counterparts are far from well-understood. In this thesis, we explore algorithms that bridge the gap between the fields of quantum computing and machine learning. First, we consider general optimization problems with only function evaluations. For two core problems, namely general convex optimization and volume estimation of convex bodies, we give quantum algorithms as well as quantum lower bounds that constitute the quantum speedups of both problems to be polynomial compared to their classical counterparts. We then consider machine learning and optimization problems with input data stored explicitly as matrices. We first look at semidefinite programs and provide quantum algorithms with polynomial speedup compared to the classical state-of-the-art. We then move to machine learning and give the optimal quantum algorithms for linear and kernel-based classifications. To complement with our quantum algorithms, we also introduce a framework for quantum-inspired classical algorithms, showing that for low-rank matrix arithmetics there can only be polynomial quantum speedup. Finally, we study statistical problems on quantum computers, with the focus on testing properties of probability distributions. We show that for testing various properties including L1-distance, L2-distance, Shannon and Renyi entropies, etc., there are polynomial quantum speedups compared to their classical counterparts. We also extend these results to testing properties of quantum states.

•Jan 1, 2020•2 citations

Geometrical approach to classical and quantum Bayesian prediction

冬彦 田中

•Jan 1, 2007•1 citation

Quantum Machine Learning: Concepts, Algorithms, and Applications

Syed Nisar Bukhari

Auerbach Publications eBooks•Feb 24, 2026•1 citation

Quantum speedup, circuit decoupling, and stochastic modelling: on how quantum theory improves machine-learning, and how machine-learning helps to process quantum information

Ximing Wang

In today's data-driven society, the importance of data is ever-increasing. The ability to discern patterns and trends in this data allows us to make predictive and informed decisions. This quest for enhanced data analysis has fueled the evolution of machine learning. Quantum Machine Learning (QML) is an emerging field that seeks to amalgamate the power of quantum computing with machine learning. Despite the term quantum in its name, QML is a hybrid approach incorporating both classical and quantum processing. This fusion of classical and quantum processing enables QML to capitalize on the advantages of both. However, this integration also introduces a novel set of challenges. Here we will explore QML from computer science and physics perspectives. In the first part, the mathematical tools for machine learning and quantum theory are introduced. Then the second part will investigate how quantum computation enhances classical machine learning algorithms, with a demonstration of quantum advantages in computational complexity. The third part explores the learning of quantum models through classical optimization methods. We will find how the features of a quantum model can be learned by optimization, and how a quantum model can be trained to generate target stochastic data.

•Jan 1, 2024•0 citations
The single-celled protist Stentor roselii has long been observed to exhibit complex decision-making behaviors, yet existing machine learning and classical computational models have struggled to replicate its actions. In this paper, we propose a novel quantum-statistical framework to model S. roselii’s behavioral responses to environmental stimuli. By leveraging quantum circuits with amplitude dampening and memory effects, we construct a quantum behavioral model that captures the probabilistic and hierarchical nature of S. roselii’s decision making. Our results suggest that quantum statistical theory provides a powerful tool for representing and simulating biological decision processes.
The theories of optimization and machine learning answer foundational questions in computer science and lead to new algorithms for practical applications. While these topics have been extensively studied in the context of classical computing, their quantum counterparts are far from well-understood. In this thesis, we explore algorithms that bridge the gap between the fields of quantum computing and machine learning. First, we consider general optimization problems with only function evaluations. For two core problems, namely general convex optimization and volume estimation of convex bodies, we give quantum algorithms as well as quantum lower bounds that constitute the quantum speedups of both problems to be polynomial compared to their classical counterparts. We then consider machine learning and optimization problems with input data stored explicitly as matrices. We first look at semidefinite programs and provide quantum algorithms with polynomial speedup compared to the classical state-of-the-art. We then move to machine learning and give the optimal quantum algorithms for linear and kernel-based classifications. To complement with our quantum algorithms, we also introduce a framework for quantum-inspired classical algorithms, showing that for low-rank matrix arithmetics there can only be polynomial quantum speedup. Finally, we study statistical problems on quantum computers, with the focus on testing properties of probability distributions. We show that for testing various properties including L1-distance, L2-distance, Shannon and Renyi entropies, etc., there are polynomial quantum speedups compared to their classical counterparts. We also extend these results to testing properties of quantum states.
In today's data-driven society, the importance of data is ever-increasing. The ability to discern patterns and trends in this data allows us to make predictive and informed decisions. This quest for enhanced data analysis has fueled the evolution of machine learning. Quantum Machine Learning (QML) is an emerging field that seeks to amalgamate the power of quantum computing with machine learning. Despite the term quantum in its name, QML is a hybrid approach incorporating both classical and quantum processing. This fusion of classical and quantum processing enables QML to capitalize on the advantages of both. However, this integration also introduces a novel set of challenges. Here we will explore QML from computer science and physics perspectives. In the first part, the mathematical tools for machine learning and quantum theory are introduced. Then the second part will investigate how quantum computation enhances classical machine learning algorithms, with a demonstration of quantum advantages in computational complexity. The third part explores the learning of quantum models through classical optimization methods. We will find how the features of a quantum model can be learned by optimization, and how a quantum model can be trained to generate target stochastic data.