Continuous Approximation of the Ising Hamiltonian: Exact Ground States and Applications to Fidelity Assessment in Ising Machines

Abstract

In this study, we present a novel analytical approach to solving large-scale Ising problems by reformulating the discrete Ising Hamiltonian into a continuous framework. This transformation enables us to derive exact solutions for a non-trivial class of fully connected Ising models. To validate our method, we conducted numerical experiments comparing our analytical solutions with those obtained from a quantum-inspired Ising algorithm and a quantum Ising machine. The results demonstrate that the quantum-inspired algorithm and brute-force method successfully align with our solutions, while the quantum Ising machine exhibits notable deviations. Our method offers promising avenues for analytically solving diverse Ising problem instances, while the class of Ising problems addressed here provides a robust framework for assessing the fidelity of Ising machines.

References in corpus (10)

• Network of Time-Multiplexed Optical Parametric Oscillators as a Coherent Ising Machine
• Large-scale Ising spin network based on degenerate optical parametric oscillators
• Quantum critical dynamics in a 5000-qubit programmable spin glass
• Bifurcation-based adiabatic quantum computation with a nonlinear oscillator network: Toward quantum soft computing
• Optimization hardness as transient chaos in an analog approach to constraint satisfaction
• Johann Faulhaber and sums of powers
• Ground States of the Ising Model on the Shastry-Sutherland Lattice and the Origin of the Fractional Magnetization Plateaus in Rare-Earth Tetraborides
• Finding and proving the exact ground state of a generalized Ising model by convex optimization and MAX-SAT
• The Wishart planted ensemble: A tunably-rugged pairwise Ising model with a first-order phase transition
• Equation Planting: A Tool for Benchmarking Ising Machines