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

• URL: http://arxiv.org/abs/2406.03364v1
• Date: Wed, 5 Jun 2024 15:18:22 GMT
• Title: Determination of Optimal Chain Coupling made by Embedding in D-Wave Quantum Annealer
• Authors: Hayun Park, Hunpyo Lee,
• Abstract summary: The qubits in a D-wave quantum annealer (D-wave QA) are designed on a Pegasus graph that is different from structure of an optimization problem. Weak and strong $J_c$ values induce chain breaking and enforcement of chain energy. We present an algorithm howJ_ctextoptimal$ with the maximum probabilityp$ for observing the possible lowest energy is determined.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: 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^{\text{default}}$, it is not an optimal coupling $J_c^{\text{optimal}}$ that maximizes the possible correct rate of QA measurements. In this paper, we present an algorithm how $J_c^{\text{optimal}}$ with the maximum probability $p$ for observing the possible lowest energy is determined. Finally, we confirm that the extracted $J_c^{\text{optimal}}$ show much better $p$ than $J_c^{\text{default}}$ 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}.

Related papers

• Computational Supremacy of Quantum Eigensolver by Extension of Optimized Binary Configurations [0.0]
  We develop a quantum eigensolver based on a D-Wave Quantum Annealer (D-Wave QA) This approach performs iterative QA measurements to optimize the eigenstates $vert psi rangle$ without the derivation of a classical computer. We confirm that the proposed QE algorithm provides exact solutions within the errors of $5 times 10-3$.
  arXiv  Detail & Related papers  (2024-06-05T15:19:53Z)
• Towards large-scale quantum optimization solvers with few qubits [59.63282173947468]
  We introduce a variational quantum solver for optimizations over $m=mathcalO(nk)$ binary variables using only $n$ qubits, with tunable $k>1$. We analytically prove that the specific qubit-efficient encoding brings in a super-polynomial mitigation of barren plateaus as a built-in feature.
  arXiv  Detail & Related papers  (2024-01-17T18:59:38Z)
• An Oblivious Stochastic Composite Optimization Algorithm for Eigenvalue Optimization Problems [76.2042837251496]
  We introduce two oblivious mirror descent algorithms based on a complementary composite setting. Remarkably, both algorithms work without prior knowledge of the Lipschitz constant or smoothness of the objective function. We show how to extend our framework to scale and demonstrate the efficiency and robustness of our methods on large scale semidefinite programs.
  arXiv  Detail & Related papers  (2023-06-30T08:34:29Z)
• $U(N)$ gauge theory in the strong coupling limit on a quantum annealer [6.875312133832079]
  Lattice QCD in the strong coupling regime can be formulated in dual variables which are integer-valued. It can be efficiently simulated for modest finite temperatures and finite densities via the worm, circumventing the finite density sign problem in this regime. As the partition function is solely expressed in terms of integers, it can be cast as a quantum optimization problem that can be solved on a quantum annealer.
  arXiv  Detail & Related papers  (2023-05-29T16:16:30Z)
• ReSQueing Parallel and Private Stochastic Convex Optimization [59.53297063174519]
  We introduce a new tool for BFG convex optimization (SCO): a Reweighted Query (ReSQue) estimator for the gradient of a function convolved with a (Gaussian) probability density. We develop algorithms achieving state-of-the-art complexities for SCO in parallel and private settings.
  arXiv  Detail & Related papers  (2023-01-01T18:51:29Z)
• Determination of Chain Strength induced by Embedding in D-Wave Quantum Annealer [0.0]
  D-wave quantum annealer requires embedding with ferromagnetic (FM) chains connected by several qubits. determination of the chain strength $J_c$ required to sustain FM order of qubits in the chains is crucial for the accuracy of quantum annealing.
  arXiv  Detail & Related papers  (2022-09-25T06:59:10Z)
• QAOA-in-QAOA: solving large-scale MaxCut problems on small quantum machines [81.4597482536073]
  Quantum approximate optimization algorithms (QAOAs) utilize the power of quantum machines and inherit the spirit of adiabatic evolution. We propose QAOA-in-QAOA ($textQAOA2$) to solve arbitrary large-scale MaxCut problems using quantum machines. Our method can be seamlessly embedded into other advanced strategies to enhance the capability of QAOAs in large-scale optimization problems.
  arXiv  Detail & Related papers  (2022-05-24T03:49:10Z)
• Wasserstein Solution Quality and the Quantum Approximate Optimization Algorithm: A Portfolio Optimization Case Study [0.0]
  optimizing a portfolio of financial assets is a critical industrial problem which can be approximately solved using algorithms suitable for quantum processing units (QPUs) We benchmark the success of this approach using the Quantum Approximate Optimization Algorithm (QAOA); an algorithm targeting gate-model QPUs. Our focus is on the quality of solutions achieved as determined by the Normalized and Complementary Wasserstein Distance, $eta$.
  arXiv  Detail & Related papers  (2022-02-14T15:00:28Z)
• Optimal Control for Closed and Open System Quantum Optimization [0.0]
  We provide a rigorous analysis of the quantum optimal control problem in the setting of a linear combination $s(t)B+ (1-s(t))C$ of two noncommuting Hamiltonians. The target is to minimize the energy of the final problem'' Hamiltonian $C$, for a time-dependent and bounded control schedule.
  arXiv  Detail & Related papers  (2021-07-07T22:57:57Z)
• Quantum Differentially Private Sparse Regression Learning [132.1981461292324]
  We devise an efficient quantum differentially private (QDP) Lasso estimator to solve sparse regression tasks. Last, we exhibit that the QDP Lasso attains a near-optimal utility bound $tildeO(N-2/3)$ with privacy guarantees.
  arXiv  Detail & Related papers  (2020-07-23T10:50:42Z)
• Maximizing Determinants under Matroid Constraints [69.25768526213689]
  We study the problem of finding a basis $S$ of $M$ such that $det(sum_i in Sv_i v_i v_itop)$ is maximized. This problem appears in a diverse set of areas such as experimental design, fair allocation of goods, network design, and machine learning.
  arXiv  Detail & Related papers  (2020-04-16T19:16:38Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.