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:1904.03581 · Lecture notes in computer science

Quantum Speedup for the Minimum Steiner Tree Problem

Masayuki Miyamoto, Masakazu Iwamura, Koichi Kise, François Le Gall

Published Jan 1, 2020• 14 citations
arXivHTMLPDF
DOI
10.1007/978-3-030-58150-3_19

Related papers

A Quantum Algorithm for Minimum Steiner Tree Problem

Masayuki Miyamoto, Masakazu Iwamura, Koichi Kise

•Apr 7, 2019•0 citations

Quantum speedup for solving the minimum vertex cover problem based on Grover search algorithm

Zhaocai Wang, Kun Liang, Xiaoguang Bao +1 more

Quantum Information Processing•Jul 1, 2023•8 citations

Solving Optimization Problems Using Adiabatic Quantum Computing

Liu, Kai

The commercial D-Waves quantum annealer has given rise to plenty of interests due to the reported quantum speedup against classical annealing. In order to make use of this new technology, a problem must be formulated into a form of quadratic unconstrained binary optimization (QUBO) or Ising model. This thesis reports on case studies using a D-Wave quantum annealer to solve several optimization problems and providing results validation using classical exact approaches. In our thesis, we briefly introduce several classical techniques designed for QUBO problems and implement two exact approaches. With the proper tools, a D-Wave 2X computer consisted of 1098 active qubits is then evaluated for the Degree-Constrained Minimum Spanning Tree and the Steiner Tree problems, establishing their QUBO formulations are suitable for adiabatic quantum computers. Motivated by the remarkable performance, two more optimization problems are studied—the Bounded-Depth Steiner Tree problem and the Chromatic Sum problem. We propose a new formulation for each problem. The numbers of qubits (dimension of QUBO matrices) required by our formulations are O(|V|3) and O(|V|2) respectively, where |V| represents the number of vertices.

•Jan 1, 2018•0 citations

Quantum Computing for Graph Optimization: An Approach to the Shortest Path Problem

Aniket Bembale, Nagendra Singh, P. Vinayaka +1 more

Lecture notes in networks and systems•Dec 1, 2025•0 citations

Tree search and quantum computation

Luís Tarrataca, Andreas Wichert

arXiv:1502.01951•Quantum Information Processing•Nov 20, 2010•15 citations

The Steiner Tree Problem: Novel QUBO Formulation and Quantum Annealing Implementation

Dan Li, Xiang-Hui Wu, Ji-Rong Liu

The Steiner Tree Problem (STP) is a well-known NP-hard combinatorial optimization problem, which has wide applications in network design, integrated circuit layout, bioinformatics, and other fields. However, traditional algorithms often struggle to balance efficiency and solution quality when dealing with large-scale STP instances. In this paper, we propose a new quantum annealing-based algorithm for solving the STP: we first model the STP into a quadratic unconstrained binary optimization (QUBO) form suitable for quantum annealing, then design a corresponding encoding strategy, and finally verify the algorithm through experimental tests. The results show that our quantum annealing-based method can obtain high-quality solutions with relatively low computational overhead for moderate-scale STP instances, providing a new feasible path for handling this intractable combinatorial optimization problem.

quant-pharXiv:2603.04089•Mar 5, 2026•0 citations
The commercial D-Waves quantum annealer has given rise to plenty of interests due to the reported quantum speedup against classical annealing. In order to make use of this new technology, a problem must be formulated into a form of quadratic unconstrained binary optimization (QUBO) or Ising model. This thesis reports on case studies using a D-Wave quantum annealer to solve several optimization problems and providing results validation using classical exact approaches. In our thesis, we briefly introduce several classical techniques designed for QUBO problems and implement two exact approaches. With the proper tools, a D-Wave 2X computer consisted of 1098 active qubits is then evaluated for the Degree-Constrained Minimum Spanning Tree and the Steiner Tree problems, establishing their QUBO formulations are suitable for adiabatic quantum computers. Motivated by the remarkable performance, two more optimization problems are studied—the Bounded-Depth Steiner Tree problem and the Chromatic Sum problem. We propose a new formulation for each problem. The numbers of qubits (dimension of QUBO matrices) required by our formulations are O(|V|3) and O(|V|2) respectively, where |V| represents the number of vertices.
The Steiner Tree Problem (STP) is a well-known NP-hard combinatorial optimization problem, which has wide applications in network design, integrated circuit layout, bioinformatics, and other fields. However, traditional algorithms often struggle to balance efficiency and solution quality when dealing with large-scale STP instances. In this paper, we propose a new quantum annealing-based algorithm for solving the STP: we first model the STP into a quadratic unconstrained binary optimization (QUBO) form suitable for quantum annealing, then design a corresponding encoding strategy, and finally verify the algorithm through experimental tests. The results show that our quantum annealing-based method can obtain high-quality solutions with relatively low computational overhead for moderate-scale STP instances, providing a new feasible path for handling this intractable combinatorial optimization problem.