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:1704.05822 · Journal of Statistical Mechanics Theory and Experiment

Deterministic quantum annealing expectation-maximization algorithm

Hideyuki Miyahara, Koji Tsumura, Yuki Sughiyama

Published Nov 1, 2017• 10 citations
arXivHTMLPDF

Abstract

Abstract Maximum likelihood estimation (MLE) is one of the most important methods in machine learning, and the expectation-maximization (EM) algorithm is often used to obtain maximum likelihood estimates. However, EM heavily depends on initial configurations and fails to find the global optimum. On the other hand, in the field of physics, quantum annealing (QA) was proposed as a novel optimization approach. Motivated by QA, we propose a quantum annealing extension of EM, which we call the deterministic quantum annealing expectation-maximization (DQAEM) algorithm. We also discuss its advantage in terms of the path integral formulation. Furthermore, by employing numerical simulations, we illustrate how DQAEM works in MLE and show that DQAEM moderate the problem of local optima in EM.

DOI
10.1088/1742-5468/aa967e

Related papers

Relaxation of the EM algorithm via quantum annealing for Gaussian mixture models

Hideyuki Miyahara, Koji Tsumura, Yuki Sughiyama

We propose a modified expectation-maximization algorithm by introducing the concept of quantum annealing, which we call the deterministic quantum annealing expectation-maximization algorithm (DQAEM). The expectation-maximization algorithm (EM) is an established algorithm to compute maximum likelihood estimates and applied to many practical applications. However, it is known that EM heavily depends on initial values and its estimates are sometimes trapped by local optima. To solve such a problem, quantum annealing (QA) was proposed as a novel optimization approach motivated by quantum mechanics. By employing QA, we then formulate DQAEM and present a theorem that supports its stability. Finally, we demonstrate numerical simulations to confirm its efficiency.

arXiv:1701.03268•IEEE Conference on Decision and Control (CDC)•Dec 1, 2016•2 citations

Relaxation of the EM algorithm via quantum annealing

Hideyuki Miyahara, Koji Tsumura

The EM algorithm is a novel numerical method to obtain maximum likelihood estimates and is often used for practical calculations. However, many of maximum likelihood estimation problems are nonconvex, and it is known that the EM algorithm fails to give the optimal estimates by being trapped by local optima. In order to deal with this difficulty, we propose a deterministic quantum annealing EM algorithm by introducing the mathematical mechanism of quantum fluctuations into the conventional EM algorithm because quantum fluctuations induce the tunnel effect and are expected to relax the difficulty of nonconvex optimization problems in the maximum likelihood estimation problems. We show a theorem that guarantees its convergence and give numerical experiments to verify its efficiency.

arXiv:1606.01484•Proceedings of the ... American Control Conference/Proceedings of the American Control Conference•Jul 1, 2016•3 citations

Quantum extension of variational Bayes inference

Hideyuki Miyahara, Yuki Sughiyama

Variational Bayes (VB) inference is one of the most important algorithms in machine learning and is widely used in engineering and industry. However, VB is known to suffer from the problem of local optima. In this paper, we generalize VB by using quantum mechanics and propose an algorithm, which we call quantum annealing variational Bayes (QAVB) inference. We then show that QAVB drastically improves the performance of VB in a clustering problem described by a Gaussian mixture model, which is essentially important from the viewpoint of optimization. Finally, we discuss an intuitive understanding of how QAVB works well.

arXiv:1712.04709•Physical Review A•Aug 29, 2018•13 citations

基于量子退火算法的复杂优化问题求解

Jincheng Zhang

This paper investigates the application of the Quantum Annealing (QA) algorithm to solve complex optimization problems. The core claim is that simulating a complex optimization problem's local search process through the QA's annealing process can effectively locate global optimal solutions. The mechanism involves mapping the solution space of an optimization problem onto the annealing path of QA, controlling the annealing rate and path to guide the solution towards the optimal point. This research leverages QA's inherent ability to mimic physical annealing, aiming to enhance optimization efficiency and accuracy. We present a framework for formulating and applying QA to various complex problems, highlighting its potential advantages over traditional optimization methods. This work contributes to the growing field of quantum computing by demonstrating a practical approach to tackling challenging optimization tasks. The results suggest that QA can be a viable alternative for achieving superior performance in specific optimization scenarios.

•Sep 6, 2026•0 citations

Optimization through quantum annealing: theory and some applications

Demian A. Battaglia, Lorenzo Stella

Quantum annealing is a promising tool for solving optimization problems, similar in some ways to the traditional (classical) simulated annealing of Kirkpatrick et al. Simulated annealing takes advantage of thermal fluctuations in order to explore the optimization landscape of the problem at hand, whereas quantum annealing employs quantum fluctuations. Intriguingly, quantum annealing has been proved to be more effective than its classical counterpart in many applications. We illustrate the theory and the practical implementation of both classical and quantum annealing – highlighting the crucial differences between these two methods – by means of results recently obtained in experiments, in simple toy-models, and more challenging combinatorial optimization problems (namely, Random Ising model and Travelling Salesman Problem). The techniques used to implement quantum and classical annealing are either deterministic evolutions, for the simplest models, or Monte Carlo approaches, for harder optimization tasks. We discuss the pro and cons of these approaches and their possible connections to the landscape of the problem addressed.

Contemporary Physics•Jul 1, 2006•9 citations

Theories and applications of quantum annealing: A literature survey

BaoNan Wang, HengHua SHUI, Sumin Wang +2 more

Quantum annealing (QA) algorithm is a new quantum optimization algorithm based on the classical simulated annealing (SA) algorithm. Unlike classical SA algorithm, which uses the thermal waves to search for the optimal solution, the QA algorithm uses the quantum tunneling effect to allow a quantum to penetrate a potential barrier with a higher energy than itself. Therefore, the algorithm can get rid of the local extreme values and is more likely to approach the global optimal with higher probability. In the literature, the QA algorithm has shown perfect optimization effects on combinatorial optimization problems. In this paper, the basic concepts and application fields of QA algorithm, which is the core principle of D-Wave quantum computer, are systematically reviewed. The applications of QA algorithm in cryptography, traveling salesman problem, graph coloring problem, and traffic path are discussed in detail. In addition, the direction of future research for QA algorithm is explored.

Zhongguo kexue. Wulixue Lixue Tianwenxue•May 21, 2021•8 citations
Abstract Maximum likelihood estimation (MLE) is one of the most important methods in machine learning, and the expectation-maximization (EM) algorithm is often used to obtain maximum likelihood estimates. However, EM heavily depends on initial configurations and fails to find the global optimum. On the other hand, in the field of physics, quantum annealing (QA) was proposed as a novel optimization approach. Motivated by QA, we propose a quantum annealing extension of EM, which we call the deterministic quantum annealing expectation-maximization (DQAEM) algorithm. We also discuss its advantage in terms of the path integral formulation. Furthermore, by employing numerical simulations, we illustrate how DQAEM works in MLE and show that DQAEM moderate the problem of local optima in EM.
We propose a modified expectation-maximization algorithm by introducing the concept of quantum annealing, which we call the deterministic quantum annealing expectation-maximization algorithm (DQAEM). The expectation-maximization algorithm (EM) is an established algorithm to compute maximum likelihood estimates and applied to many practical applications. However, it is known that EM heavily depends on initial values and its estimates are sometimes trapped by local optima. To solve such a problem, quantum annealing (QA) was proposed as a novel optimization approach motivated by quantum mechanics. By employing QA, we then formulate DQAEM and present a theorem that supports its stability. Finally, we demonstrate numerical simulations to confirm its efficiency.
The EM algorithm is a novel numerical method to obtain maximum likelihood estimates and is often used for practical calculations. However, many of maximum likelihood estimation problems are nonconvex, and it is known that the EM algorithm fails to give the optimal estimates by being trapped by local optima. In order to deal with this difficulty, we propose a deterministic quantum annealing EM algorithm by introducing the mathematical mechanism of quantum fluctuations into the conventional EM algorithm because quantum fluctuations induce the tunnel effect and are expected to relax the difficulty of nonconvex optimization problems in the maximum likelihood estimation problems. We show a theorem that guarantees its convergence and give numerical experiments to verify its efficiency.
Variational Bayes (VB) inference is one of the most important algorithms in machine learning and is widely used in engineering and industry. However, VB is known to suffer from the problem of local optima. In this paper, we generalize VB by using quantum mechanics and propose an algorithm, which we call quantum annealing variational Bayes (QAVB) inference. We then show that QAVB drastically improves the performance of VB in a clustering problem described by a Gaussian mixture model, which is essentially important from the viewpoint of optimization. Finally, we discuss an intuitive understanding of how QAVB works well.
This paper investigates the application of the Quantum Annealing (QA) algorithm to solve complex optimization problems. The core claim is that simulating a complex optimization problem's local search process through the QA's annealing process can effectively locate global optimal solutions. The mechanism involves mapping the solution space of an optimization problem onto the annealing path of QA, controlling the annealing rate and path to guide the solution towards the optimal point. This research leverages QA's inherent ability to mimic physical annealing, aiming to enhance optimization efficiency and accuracy. We present a framework for formulating and applying QA to various complex problems, highlighting its potential advantages over traditional optimization methods. This work contributes to the growing field of quantum computing by demonstrating a practical approach to tackling challenging optimization tasks. The results suggest that QA can be a viable alternative for achieving superior performance in specific optimization scenarios.
Quantum annealing is a promising tool for solving optimization problems, similar in some ways to the traditional (classical) simulated annealing of Kirkpatrick et al. Simulated annealing takes advantage of thermal fluctuations in order to explore the optimization landscape of the problem at hand, whereas quantum annealing employs quantum fluctuations. Intriguingly, quantum annealing has been proved to be more effective than its classical counterpart in many applications. We illustrate the theory and the practical implementation of both classical and quantum annealing – highlighting the crucial differences between these two methods – by means of results recently obtained in experiments, in simple toy-models, and more challenging combinatorial optimization problems (namely, Random Ising model and Travelling Salesman Problem). The techniques used to implement quantum and classical annealing are either deterministic evolutions, for the simplest models, or Monte Carlo approaches, for harder optimization tasks. We discuss the pro and cons of these approaches and their possible connections to the landscape of the problem addressed.
Quantum annealing (QA) algorithm is a new quantum optimization algorithm based on the classical simulated annealing (SA) algorithm. Unlike classical SA algorithm, which uses the thermal waves to search for the optimal solution, the QA algorithm uses the quantum tunneling effect to allow a quantum to penetrate a potential barrier with a higher energy than itself. Therefore, the algorithm can get rid of the local extreme values and is more likely to approach the global optimal with higher probability. In the literature, the QA algorithm has shown perfect optimization effects on combinatorial optimization problems. In this paper, the basic concepts and application fields of QA algorithm, which is the core principle of D-Wave quantum computer, are systematically reviewed. The applications of QA algorithm in cryptography, traveling salesman problem, graph coloring problem, and traffic path are discussed in detail. In addition, the direction of future research for QA algorithm is explored.