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:1305.4325 · Neurocomputing

Quantum annealing for Dirichlet process mixture models with applications to network clustering

Issei Sato, Shu Tanaka, Kenichi Kurihara, Seiji Miyashita, Hiroshi Nakagawa

Published Jun 19, 2013• 12 citations
arXivHTMLPDF
DOI
10.1016/j.neucom.2013.05.019

Related papers

Quantum annealing for combinatorial clustering

Vaibhaw Kumar, Gideon Bass, Casey Tomlin +1 more

arXiv:1708.05753•Quantum Information Processing•Jan 12, 2018•106 citations

Solving the Minimum Spanning Tree Problem with a Quantum Annealer

Wesley O'Quinn, Shiwen Mao

Quantum annealing (QA) is a different technology from gate-model quantum computing. This research proposes a novel technique for solving the Minimum Spanning Tree (MST) (or, the minimum weight spanning tree) problem on a quantum annealer. The problem is of interest due to its applications in clustering, unsupervised learning, network design, and image processing to name a few. The advent of quantum cloud computing has provided access to quantum computing tools, previously unavailable to the general community. D-Wave systems recently released cloud access to their quantum annealer type hardware, which this project leverages to provide a novel solution method to the MST problem.

IEEE Globecom Workshops (GC Wkshps)•Dec 1, 2020•8 citations

A Quantum Annealing-Based Approach to Extreme Clustering

Tim Jaschek, Marko Bucyk, Jaspreet S. Oberoi

arXiv:1903.08256•Advances in intelligent systems and computing•Jan 1, 2020•5 citations

Quantum Annealing for Combinatorial Optimization in Large-Scale Network Routing

Jincheng Zhang

This paper investigates the application of quantum annealing to address the challenges of combinatorial optimization within large-scale network routing. Traditional classical algorithms frequently encounter significant computational bottlenecks when attempting to determine optimal routes across complex networks, often failing to scale effectively with increasing network size and complexity. Quantum annealing offers a potentially transformative approach by leveraging quantum mechanical effects to explore solution spaces more efficiently. This work outlines a methodology for mapping network routing problems – characterized by a vast number of possible routes – onto the quantum annealing hardware. We present a model for representing the problem, formulating it as an Ising model, and then detail the annealing process. The core claim is that quantum annealing can provide a viable solution for optimizing network routes, particularly in scenarios where classical methods are computationally intractable. We explore the underlying principles of quantum annealing, focusing on its ability to escape local minima and achieve a lower energy state, representing the optimal solution. The research aims to demonstrate the feasibility and potential advantages of employing quantum annealing in practical network routing applications, paving the way for more efficient and robust network designs.

•Sep 7, 2026•0 citations

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

Bayesian network structure learning using quantum annealing

Bryan O’Gorman, Ryan Babbush, Alejandro Perdomo‐Ortiz +2 more

arXiv:1407.3897•The European Physical Journal Special Topics•Feb 1, 2015•92 citations
Quantum annealing (QA) is a different technology from gate-model quantum computing. This research proposes a novel technique for solving the Minimum Spanning Tree (MST) (or, the minimum weight spanning tree) problem on a quantum annealer. The problem is of interest due to its applications in clustering, unsupervised learning, network design, and image processing to name a few. The advent of quantum cloud computing has provided access to quantum computing tools, previously unavailable to the general community. D-Wave systems recently released cloud access to their quantum annealer type hardware, which this project leverages to provide a novel solution method to the MST problem.
This paper investigates the application of quantum annealing to address the challenges of combinatorial optimization within large-scale network routing. Traditional classical algorithms frequently encounter significant computational bottlenecks when attempting to determine optimal routes across complex networks, often failing to scale effectively with increasing network size and complexity. Quantum annealing offers a potentially transformative approach by leveraging quantum mechanical effects to explore solution spaces more efficiently. This work outlines a methodology for mapping network routing problems – characterized by a vast number of possible routes – onto the quantum annealing hardware. We present a model for representing the problem, formulating it as an Ising model, and then detail the annealing process. The core claim is that quantum annealing can provide a viable solution for optimizing network routes, particularly in scenarios where classical methods are computationally intractable. We explore the underlying principles of quantum annealing, focusing on its ability to escape local minima and achieve a lower energy state, representing the optimal solution. The research aims to demonstrate the feasibility and potential advantages of employing quantum annealing in practical network routing applications, paving the way for more efficient and robust network designs.
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.