Papers › Determination of Optimal Chain Coupling made by Embedding in D-Wave Quantum Annealer

Determination of Optimal Chain Coupling made by Embedding in D-Wave Quantum Annealer

5 Jun 2024arXiv:2406.03364links table onlyarchive 2025-07-28

Hayun Park, Hunpyo Lee

The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.

The qubits in a D-wave quantum annealer (D-wave QA) are designed on a Pegasus graph that is different from structure of a combinatorial optimization problem. This situation requires embedding with the chains connected by ferromagnetic (FM) coupling J_c between the qubits. Weak and strong J_c values induce chain breaking and enforcement of chain energy, which reduce the accuracy of quantum annealing (QA) measurements, respectively. In addition, we confirmed that even though the D-Wave Ocean package provides a default coupling J_cᵈᵉᶠᵃᵘˡᵗ, it is not an optimal coupling J_cᵒᵖᵗⁱᵐᵃˡ that maximizes the possible correct rate of QA measurements. In this paper, we present an algorithm how J_cᵒᵖᵗⁱᵐᵃˡ with the maximum probability p for observing the possible lowest energy is determined. Finally, we confirm that the extracted J_cᵒᵖᵗⁱᵐᵃˡ show much better p than J_cᵈᵉᶠᵃᵘˡᵗ in QA measurements of various parameters of frustrated and fully connected combinatorial optimization problems. The open code is available in \textit{https://github.com/HunpyoLee/OptimizeChainStrength}.

PaperPDFCode

Code

hunpyolee/optimizechainstrength officialmentioned in paper report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

Not run by Syntology. Nothing on this page verifies that the listed code works.

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections