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

Combinatorial optimization using quantum or classical driven systems

Hayato Goto

Published Mar 16, 2021• 0 citations
OpenAlex

Related papers

Combinatorial Optimization and Quantum Computers

Alexandre Gondran, Michel Gondran

•Feb 7, 2020•0 citations

A data-driven system for combinatorial optimization problems (本文)

カズヒロ サイトウ, Kazuhiro Saito, 和広 斉藤

In recent years, data-driven systems such as machine learning are expected to solve social problems.the data-driven systems need to connect to various databases to collect the necessary data.In addition, when the problem of utilizing the predicted results from machine learning involves combinatorial optimization, it is difficult to achieve the desired performance using existing classical optimization methods due to the large scale of the problem.To solve these issues, this thesis proposes a data-driven system for combinatorial optimization problems with a virtual integrated data platform by data virtualization and a high-performance optimization environment by quantum annealing.This system integrates multiple data sources into a single virtual database system through data virtualization and provides a unified interface to users without modifying existing data sources.Furthermore, quantum annealing, a metaheuristic for combinatorial optimization based on quantum effects, enables fast solution of combinatorial optimization problems that are difficult to solve with conventional classical computers.We have implemented the proposed data-driven system for several data sources and used an actual quantum annealing machine, in order to evaluate the impact of communication between the data virtualization system and data sources on the system performance and to quantitatively compare quantum annealing and classical methods.The evaluation results show that the proposed data-driven system is effective for large-scale data in data infrastructure environments where a single query processing engine shares multiple data sources, as well as when a single data source is partitioned into multiple data sources.We also show that quantum annealing is effective in the vehicle routing problem and the grouping problem as specific combinatorial optimization problems, and discuss the overall performance of the proposed data-driven system from data collection to solving these optimization problems.

•Jan 1, 2023•0 citations

Direct comparison of stochastic driven nonlinear dynamical systems for combinatorial optimization

Junpeng Hou, Amin Barzegar, Helmut G. Katzgraber

Combinatorial optimization problems are ubiquitous in industrial applications. However, finding optimal or close-to-optimal solutions can often be extremely hard. Because some of these problems can be mapped to the ground-state search of the Ising model, tremendous effort has been devoted to developing solvers for Ising-type problems over the past decades. Recent advances in controlling and manipulating both quantum and classical systems have enabled novel computing paradigms such as quantum simulators and coherent Ising machines to tackle hard optimization problems. Here, we examine and benchmark several physics-inspired optimization algorithms, including coherent Ising machines, gain-dissipative algorithms, simulated bifurcation machines, and Hopfield neural networks, which we collectively refer to as stochastic driven nonlinear dynamical systems. Most importantly, we benchmark these algorithms against random Ising problems with planted solutions and compare them to simulated annealing as a baseline leveraging the same software stack for all solvers. We further study how different numerical integration techniques and graph connectivity affect performance. This work provides an overview of a diverse set of new optimization paradigms.

arXiv:2503.15427•Physical review. E•Jul 1, 2025•4 citations

Solving Combinatorial Optimization Problems using the Quantum Approximation Optimization Algorithm

Nicholas J. Guerrero

•Mar 26, 2020•3 citations

QiSA: A Parameter-free Quantum-inspired Search Algorithm – A Preliminary Study on Combinatorial Optimization

Kuo-Chun Tseng, Wei-Chieh Lai, Chen-Hsin Lu +3 more

This study is inspired by quantum algorithms and proposes the Quantum-inspired Search Algorithm (QiSA), an entropy-driven quantum-inspired metaheuristic for parameter-free combinatorial optimization. Guided by Occam’s razor, QiSA simplifies the search process and reduces parameter dependence as much as possible in this preliminary study. It uses entropy as the core signal to unify parameter control, overcoming the traditional dilemma of balancing exploration and exploitation, and maps it to a confidence-like level to define an interpretable closed-loop termination criterion. QiSA also exhibits several observable quantum-like behaviors during the search, reflecting characteristic phenomena associated with quantum algorithms. Experiments on classic combinatorial optimization benchmarks show that QiSA delivers robust, consistent, and competitive performance, with the potential to stand alongside Differential Evolution in combinatorial optimization.

IEEE Congress on Evolutionary Computation (CEC)•Jun 1, 2026•0 citations

Combinatorial optimization through variational quantum power method

Ammar Daskin

arXiv:2007.01004•Quantum Information Processing•Oct 1, 2021•5 citations
In recent years, data-driven systems such as machine learning are expected to solve social problems.the data-driven systems need to connect to various databases to collect the necessary data.In addition, when the problem of utilizing the predicted results from machine learning involves combinatorial optimization, it is difficult to achieve the desired performance using existing classical optimization methods due to the large scale of the problem.To solve these issues, this thesis proposes a data-driven system for combinatorial optimization problems with a virtual integrated data platform by data virtualization and a high-performance optimization environment by quantum annealing.This system integrates multiple data sources into a single virtual database system through data virtualization and provides a unified interface to users without modifying existing data sources.Furthermore, quantum annealing, a metaheuristic for combinatorial optimization based on quantum effects, enables fast solution of combinatorial optimization problems that are difficult to solve with conventional classical computers.We have implemented the proposed data-driven system for several data sources and used an actual quantum annealing machine, in order to evaluate the impact of communication between the data virtualization system and data sources on the system performance and to quantitatively compare quantum annealing and classical methods.The evaluation results show that the proposed data-driven system is effective for large-scale data in data infrastructure environments where a single query processing engine shares multiple data sources, as well as when a single data source is partitioned into multiple data sources.We also show that quantum annealing is effective in the vehicle routing problem and the grouping problem as specific combinatorial optimization problems, and discuss the overall performance of the proposed data-driven system from data collection to solving these optimization problems.
Combinatorial optimization problems are ubiquitous in industrial applications. However, finding optimal or close-to-optimal solutions can often be extremely hard. Because some of these problems can be mapped to the ground-state search of the Ising model, tremendous effort has been devoted to developing solvers for Ising-type problems over the past decades. Recent advances in controlling and manipulating both quantum and classical systems have enabled novel computing paradigms such as quantum simulators and coherent Ising machines to tackle hard optimization problems. Here, we examine and benchmark several physics-inspired optimization algorithms, including coherent Ising machines, gain-dissipative algorithms, simulated bifurcation machines, and Hopfield neural networks, which we collectively refer to as stochastic driven nonlinear dynamical systems. Most importantly, we benchmark these algorithms against random Ising problems with planted solutions and compare them to simulated annealing as a baseline leveraging the same software stack for all solvers. We further study how different numerical integration techniques and graph connectivity affect performance. This work provides an overview of a diverse set of new optimization paradigms.
This study is inspired by quantum algorithms and proposes the Quantum-inspired Search Algorithm (QiSA), an entropy-driven quantum-inspired metaheuristic for parameter-free combinatorial optimization. Guided by Occam’s razor, QiSA simplifies the search process and reduces parameter dependence as much as possible in this preliminary study. It uses entropy as the core signal to unify parameter control, overcoming the traditional dilemma of balancing exploration and exploitation, and maps it to a confidence-like level to define an interpretable closed-loop termination criterion. QiSA also exhibits several observable quantum-like behaviors during the search, reflecting characteristic phenomena associated with quantum algorithms. Experiments on classic combinatorial optimization benchmarks show that QiSA delivers robust, consistent, and competitive performance, with the potential to stand alongside Differential Evolution in combinatorial optimization.