Disturbance Insertion for Improving Quantum and GPU Annealer Performance

This paper investigates the impact of introducing disturbances into quadratic unconstrained binary optimization (QUBO) formulas to enhance the performance of both the quantum annealer (QA) and the GPU annealer (GPUA). We propose a disturbance insertion method to insert into QUBO formula coefficients some disturbances that are parameterized by the insertion ratio, Gaussian distribution mean, and standard deviation. By applying the proposed method to a QA (viz., the D-Wave Advantage annealer) and a GPUA (viz., the Compal Quantix solver) for solving two well-known combinatorial optimization problems, the traveling salesperson problem and the 0/1 knapsack problem, we identify appropriate disturbance parameters that facilitate the annealing process for better solving the two problems.

Authors

Institutions

Publication Details

Published
2024-10-24
DOI
https://doi.org/10.1109/ics64339.2024.00024
Primary Topic
Quantum Computing Algorithms and Architecture
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Disturbance Insertion for Improving Quantum and GPU Annealer Performance

Kevin Chou, Jehn‐Ruey Jiang
Quantum Computing Algorithms and Architecture
article

Disturbance Insertion for Improving Quantum and GPU Annealer Performance

Kevin Chou, Jehn‐Ruey Jiang
article en

Abstract

This paper investigates the impact of introducing disturbances into quadratic unconstrained binary optimization (QUBO) formulas to enhance the performance of both the quantum annealer (QA) and the GPU annealer (GPUA). We propose a disturbance insertion method to insert into QUBO formula coefficients some disturbances that are parameterized by the insertion ratio, Gaussian distribution mean, and standard deviation. By applying the proposed method to a QA (viz., the D-Wave Advantage annealer) and a GPUA (viz., the Compal Quantix solver) for solving two well-known combinatorial optimization problems, the traveling salesperson problem and the 0/1 knapsack problem, we identify appropriate disturbance parameters that facilitate the annealing process for better solving the two problems.

National Central University (TW)
National Central University, National Science and Technology Council
Affordable and clean energy
Openalex Percentile: Top 73%
Quantum Computing Algorithms and Architecture
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.