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:2011.00719 · Communications in computer and information science

Optimizing Embedding-Related Quantum Annealing Parameters for Reducing Hardware Bias

Aaron Barbosa, Elijah Pelofske, Georg Hahn, Hristo N. Djidjev

Published Jan 1, 2021• 15 citations
arXivHTMLPDF
DOI
10.1007/978-981-16-0010-4_15

Related papers

Embedding parameters for Quantum Annealing

Davide Venturelli

Bulletin of the American Physical Society•Mar 15, 2016•0 citations

Quantum annealing speedup of embedded problems via suppression of Griffiths singularities

Sergey Knysh, Eugeniu Plamadeala, Davide Venturelli

Optimal parameter settings for application problems embedded into hardware graphs is key to practical quantum annealers (QAs). Embedding chains typically crop up as harmful Griffiths phases but can be used as a resource as we show here: to balance out singularities in the logical problem, changing its universality class. A smart choice of embedding parameters reduces annealing times for random Ising chain from $O(exp[c\sqrt{N}])$ to $O({N}^{2})$. Dramatic reduction in time-to-solution for QAs is confirmed by numerics, for which we developed a custom integrator to overcome convergence issues.

arXiv:2006.12731•Physical review. B./Physical review. B•Dec 10, 2020•7 citations

Optimization algorithms for Quantum Annealing

E. Arvidsson

•Jan 1, 2020•0 citations

Optimal sufficient requirements on the embedded Ising problem in polynomial time

Elisabeth Lobe, Volker Kaibel

Abstract One of the central applications for quantum annealers is to find the solutions of Ising problems. Suitable Ising problems, however, need to be formulated such that they, on the one hand, respect the specific restrictions of the hardware and, on the other hand, represent the original problems which shall actually be solved. We evaluate sufficient requirements on such an embedded Ising problem analytically and transform them into a linear optimization problem. With an objective function aiming to minimize the maximal absolute problem parameter, the precision issues of the annealers are addressed. Due to the redundancy of several constraints, we can show that the formally exponentially large optimization problem can be reduced and finally solved in polynomial time for the standard embedding setting where the embedded vertices induce trees. This allows to formulate provably equivalent embedded Ising problems in a practical setup.

arXiv:2302.04162•Quantum Information Processing•Aug 8, 2023•1 citation

Parameter setting for quantum annealing

Andrea Di Gioacchino, Salvatore Mandrà, Eleanor Gilbert Rieffel

Bulletin of the American Physical Society•Mar 7, 2019•0 citations

Mitigating Precision Errors in Quantum Annealing via Coefficient Reduction of Embedded Hamiltonians

Kentaro Ohno, Nozomu Togawa

Quantum annealing is a quantum algorithm to solve combinatorial optimization problems. In the current quantum annealing devices, the dynamic range of the input Ising Hamiltonian, defined as the ratio of the largest to the smallest coefficient, significantly affects the quality of the output solution due to limited hardware precision. Several methods have been proposed to reduce the dynamic range by reducing large coefficients in the Ising Hamiltonian. However, existing studies do not take into account minor-embedding, which is an essential process in current quantum annealers. In this study, we revisit three existing coefficient-reduction methods under the constraints of minor-embedding. We evaluate to what extent these methods reduce the dynamic range of the minor-embedded Hamiltonian and improve the sample quality obtained from the D-Wave Advantage quantum annealer. The results show that, on the set of problems tested in this study, the interaction-extension method effectively improves the sample quality by reducing the dynamic range, while the bounded-coefficient integer encoding and the augmented Lagrangian method have only limited effects. Furthermore, we empirically show that reducing external field coefficients at the logical Hamiltonian level is not required in practice, since minor-embedding automatically has the role of reducing them. These findings suggest future directions for enhancing the sample quality of quantum annealers by suppressing hardware errors through preprocessing of the input problem.

quant-pharXiv:2604.03546•IEEE Transactions on Quantum Engineering•Apr 7, 2026•1 citation
Optimal parameter settings for application problems embedded into hardware graphs is key to practical quantum annealers (QAs). Embedding chains typically crop up as harmful Griffiths phases but can be used as a resource as we show here: to balance out singularities in the logical problem, changing its universality class. A smart choice of embedding parameters reduces annealing times for random Ising chain from O(exp[cN])O(exp[c\sqrt{N}])O(exp[cN​]) to O(N2)O({N}^{2})O(N2). Dramatic reduction in time-to-solution for QAs is confirmed by numerics, for which we developed a custom integrator to overcome convergence issues.
Abstract One of the central applications for quantum annealers is to find the solutions of Ising problems. Suitable Ising problems, however, need to be formulated such that they, on the one hand, respect the specific restrictions of the hardware and, on the other hand, represent the original problems which shall actually be solved. We evaluate sufficient requirements on such an embedded Ising problem analytically and transform them into a linear optimization problem. With an objective function aiming to minimize the maximal absolute problem parameter, the precision issues of the annealers are addressed. Due to the redundancy of several constraints, we can show that the formally exponentially large optimization problem can be reduced and finally solved in polynomial time for the standard embedding setting where the embedded vertices induce trees. This allows to formulate provably equivalent embedded Ising problems in a practical setup.
Quantum annealing is a quantum algorithm to solve combinatorial optimization problems. In the current quantum annealing devices, the dynamic range of the input Ising Hamiltonian, defined as the ratio of the largest to the smallest coefficient, significantly affects the quality of the output solution due to limited hardware precision. Several methods have been proposed to reduce the dynamic range by reducing large coefficients in the Ising Hamiltonian. However, existing studies do not take into account minor-embedding, which is an essential process in current quantum annealers. In this study, we revisit three existing coefficient-reduction methods under the constraints of minor-embedding. We evaluate to what extent these methods reduce the dynamic range of the minor-embedded Hamiltonian and improve the sample quality obtained from the D-Wave Advantage quantum annealer. The results show that, on the set of problems tested in this study, the interaction-extension method effectively improves the sample quality by reducing the dynamic range, while the bounded-coefficient integer encoding and the augmented Lagrangian method have only limited effects. Furthermore, we empirically show that reducing external field coefficients at the logical Hamiltonian level is not required in practice, since minor-embedding automatically has the role of reducing them. These findings suggest future directions for enhancing the sample quality of quantum annealers by suppressing hardware errors through preprocessing of the input problem.