Convergence Analysis of Opto-Electronic Oscillator based Coherent Ising Machines

• URL: http://arxiv.org/abs/2312.04290v1
• Date: Thu, 7 Dec 2023 13:18:13 GMT
• Title: Convergence Analysis of Opto-Electronic Oscillator based Coherent Ising Machines
• Abstract summary: We consider an opto-electronic coherent Ising machine, the OEO-CIM. We find and prove bounds on its performance in terms of the expected difference between the objective value at the final iteration and the optimal one. We overcome these limitations by proposing suitable adjustments and prove that the improved architecture is guaranteed to converge optimisation to the optimum.
• Score: 5.678271181959529
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: Ising machines are purported to be better at solving large-scale combinatorial optimisation problems better than conventional von Neumann computers. However, these Ising machines are widely believed to be heuristics, whose promise is observed empirically rather than obtained theoretically. We bridge this gap by considering an opto-electronic oscillator based coherent Ising machine, and providing the first analytical proof that under reasonable assumptions, the OEO-CIM is not a heuristic approach. We find and prove bounds on its performance in terms of the expected difference between the objective value at the final iteration and the optimal one, and on the number of iterations required by it. In the process, we emphasise on some of its limitations such as the inability to handle asymmetric coupling between spins, and the absence of external magnetic field applied on them (both of which are necessary in many optimisation problems), along with some issues in its convergence. We overcome these limitations by proposing suitable adjustments and prove that the improved architecture is guaranteed to converge to the optimum of the relaxed objective function.

Related papers

• Universal Optimization and Tighter Fidelity Bounds for Approximate Quantum Error Correction [5.2107604548805915]
  Approximate quantum error correction (AQEC) dictates the performance of discrete- and continuous-variable quantum error correction codes.<n>Finding the optimal recovery channel to maximize entanglement fidelity via standard semidefinite programming is computationally bottlenecked by the exponentially growing number of Kraus operators.<n>We establish an efficient framework by leveraging the duality between recovery and environment decoupling.
  arXiv  Detail & Related papers  (2026-07-27T18:18:58Z)
• Constraint-Aware Quantum Optimization via Hamming Weight Operators [1.1463843149836523]
  Constrained optimization with strict linear constraints underpins applications in drug discovery, power grids, logistics, and finance.<n>We introduce Hamming Weight Operators, a new class of constraint-aware operators that confine quantum evolution strictly within the feasible subspace.<n>We validate our approach on benchmark tasks from both finance and high-energy physics, specifically portfolio optimization and two-jet clustering with energy balance.
  arXiv  Detail & Related papers  (2026-01-04T12:58:04Z)
• Measurement-driven Quantum Approximate Optimization [2.5514179157254877]
  A recently proposed method makes use of ancilla qubits and controlled unitary operators to implement weak measurements related to imaginary-time evolution.<n>We first generalize the algorithm from exact to approximate optimization, taking advantage of several properties unique to classical problems.<n>We show how to adapt our paradigm to the setting of constrained optimization for a number of important classes of hard problem constraints.
  arXiv  Detail & Related papers  (2025-12-24T08:27:32Z)
• Closing the Quantum-Classical Scaling Gap in Approximate Optimization [0.0]
  We reassess findings with different classical paradigm -- Simulated Bifurcation Machine (SBM)<n>By leveraging chaotic behavior rather than thermal fluctuations, SBM achieves comparable or superior scaling performance.<n>We conclude that it is unlikely that current generation of quantum annealers, can demonstrate supremacy in discrete approximate optimization.
  arXiv  Detail & Related papers  (2025-05-28T16:02:57Z)
• Robust and Computation-Aware Gaussian Processes [18.264598332579748]
  We introduce Robust Computation-aware Gaussian Process (RCaGP), a novel GP model that combines a principled treatment of approximation-induced uncertainty with robust generalized Bayesian updating.<n>Our model ensures more conservative and reliable uncertainty estimates, a property we rigorously demonstrate.<n> Empirical results confirm that solving these challenges jointly leads to superior performance across both clean and outlier-contaminated settings.
  arXiv  Detail & Related papers  (2025-05-27T12:49:14Z)
• A Novel Unified Parametric Assumption for Nonconvex Optimization [53.943470475510196]
  Non optimization is central to machine learning, but the general framework non convexity enables weak convergence guarantees too pessimistic compared to the other hand. We introduce a novel unified assumption in non convex algorithms.
  arXiv  Detail & Related papers  (2025-02-17T21:25:31Z)
• Mechanism design with multi-armed bandit [8.013444110633223]
  A popular approach of automated mechanism design is to formulate a linear program (LP) whose solution gives a mechanism with desired properties. We analytically derive a class of optimal solutions for such an LP that gives mechanisms achieving standard properties of efficiency, incentive compatibility, strong budget balance (SBB), and individual rationality (IR)
  arXiv  Detail & Related papers  (2024-11-30T03:59:36Z)
• MG-Net: Learn to Customize QAOA with Circuit Depth Awareness [51.78425545377329]
  Quantum Approximate Optimization Algorithm (QAOA) and its variants exhibit immense potential in tackling optimization challenges. The requisite circuit depth for satisfactory performance is problem-specific and often exceeds the maximum capability of current quantum devices. We introduce the Mixer Generator Network (MG-Net), a unified deep learning framework adept at dynamically formulating optimal mixer Hamiltonians.
  arXiv  Detail & Related papers  (2024-09-27T12:28:18Z)
• $i$Trust: Trust-Region Optimisation with Ising Machines [4.961502498941637]
  We present an application of Ising machines to perform trust region-based optimisation with box constraints. The modified Ising machine has been shown under the reasonable assumptions of convexity or invexity. The proposition is useful for both classical and quantum-classical hybrid scenarios.
  arXiv  Detail & Related papers  (2024-06-06T14:25:59Z)
• An Inexact Halpern Iteration with Application to Distributionally Robust Optimization [9.529117276663431]
  We investigate the inexact variants of the scheme in both deterministic and deterministic convergence settings. We show that by choosing the inexactness appropriately, the inexact schemes admit an $O(k-1) convergence rate in terms of the (expected) residue norm.
  arXiv  Detail & Related papers  (2024-02-08T20:12:47Z)
• Pseudo-Bayesian Optimization [7.556071491014536]
  We study an axiomatic framework that elicits the minimal requirements to guarantee black-box optimization convergence. We show how using simple local regression, and a suitable "randomized prior" construction to quantify uncertainty, not only guarantees convergence but also consistently outperforms state-of-the-art benchmarks.
  arXiv  Detail & Related papers  (2023-10-15T07:55:28Z)
• Prog-QAOA: Framework for resource-efficient quantum optimization through classical programs [0.0]
  Current quantum optimization algorithms require representing the original problem as a binary optimization problem, which is then converted into an equivalent Ising model suitable for the quantum device. We propose to design classical programs for computing the objective function and certifying the constraints, and later compile them to quantum circuits. This results in a new variant of the Quantum Approximate Optimization Algorithm (QAOA), which we name the Prog-QAOA.
  arXiv  Detail & Related papers  (2022-09-07T18:01:01Z)
• The Probabilistic Normal Epipolar Constraint for Frame-To-Frame Rotation Optimization under Uncertain Feature Positions [53.478856119297284]
  We introduce the probabilistic normal epipolar constraint (PNEC) that overcomes the limitation by accounting for anisotropic and inhomogeneous uncertainties in the feature positions. In experiments on synthetic data, we demonstrate that the novel PNEC yields more accurate rotation estimates than the original NEC. We integrate the proposed method into a state-of-the-art monocular rotation-only odometry system and achieve consistently improved results for the real-world KITTI dataset.
  arXiv  Detail & Related papers  (2022-04-05T14:47:11Z)
• Faster Algorithm and Sharper Analysis for Constrained Markov Decision Process [56.55075925645864]
  The problem of constrained decision process (CMDP) is investigated, where an agent aims to maximize the expected accumulated discounted reward subject to multiple constraints. A new utilities-dual convex approach is proposed with novel integration of three ingredients: regularized policy, dual regularizer, and Nesterov's gradient descent dual. This is the first demonstration that nonconcave CMDP problems can attain the lower bound of $mathcal O (1/epsilon)$ for all complexity optimization subject to convex constraints.
  arXiv  Detail & Related papers  (2021-10-20T02:57:21Z)
• Parent Hamiltonian as a benchmark problem for variational quantum eigensolvers [0.6946929968559495]
  Variational quantum eigensolver (VQE) finds a ground state of a given Hamiltonian by variationally optimizing the parameters of quantum circuits called ansatz. This work provides a systematic way to analyze energies for VQE and contribute to the design of ansatz and its initial parameters.
  arXiv  Detail & Related papers  (2021-09-24T06:09:10Z)
• Stochastic Gradient Descent-Ascent and Consensus Optimization for Smooth Games: Convergence Analysis under Expected Co-coercivity [49.66890309455787]
  We introduce the expected co-coercivity condition, explain its benefits, and provide the first last-iterate convergence guarantees of SGDA and SCO. We prove linear convergence of both methods to a neighborhood of the solution when they use constant step-size. Our convergence guarantees hold under the arbitrary sampling paradigm, and we give insights into the complexity of minibatching.
  arXiv  Detail & Related papers  (2021-06-30T18:32:46Z)
• A Dynamical Systems Approach for Convergence of the Bayesian EM Algorithm [59.99439951055238]
  We show how (discrete-time) Lyapunov stability theory can serve as a powerful tool to aid, or even lead, in the analysis (and potential design) of optimization algorithms that are not necessarily gradient-based. The particular ML problem that this paper focuses on is that of parameter estimation in an incomplete-data Bayesian framework via the popular optimization algorithm known as maximum a posteriori expectation-maximization (MAP-EM) We show that fast convergence (linear or quadratic) is achieved, which could have been difficult to unveil without our adopted S&C approach.
  arXiv  Detail & Related papers  (2020-06-23T01:34:18Z)
• Fast Objective & Duality Gap Convergence for Non-Convex Strongly-Concave Min-Max Problems with PL Condition [52.08417569774822]
  This paper focuses on methods for solving smooth non-concave min-max problems, which have received increasing attention due to deep learning (e.g., deep AUC)
  arXiv  Detail & Related papers  (2020-06-12T00:32:21Z)

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.