Analysis of the Hopfield Model with Discrete Coupling
arXiv:2005.05174 · doi:10.7566/JPSJ.90.094602
Abstract
Growing demand for high-speed Ising-computing-specific hardware has prompted a need for determining how the accuracy depends on a hardware implementation with physically limited resources. For instance, in digital hardware such as field-programmable gate arrays, as the number of bits representing the coupling strength is reduced, the density of integrated Ising spins and the speed of computing can be increased while the calculation accuracy becomes lower. To optimize the accuracy-efficiency trade-off, we have to estimate the change in performance of the Ising computing machine depending on the number of bits representing the coupling strength. In this study, we tackle this issue by focusing on the Hopfield model with discrete coupling. The Hopfield model is a canonical Ising computing model. Previous studies have analyzed the effect of a few nonlinear functions (e.g. sign) for mapping the coupling strength on the Hopfield model with statistical mechanics methods, but not the effect of discretization of the coupling strength in detail. Here, we derived the order parameter equations of the Hopfield model with discrete coupling by using the replica method and clarified the relationship between the number of bits representing the coupling strength and the critical memory capacity. In this paper, we used the replica method for the Hopfield model with general nonlinear coupling (Sompolinsky (1986)) to analyze the model with a multi-bit discrete coupling strength, and we novelly derived the de Almeida-Thouless line of the model with general nonlinear coupling.
arXiv comment11 pages, 14 figures
References in corpus (24)
- Ising formulations of many NP problems
- Quantum Annealing in the Transverse Ising Model
- A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
- Adiabatic Quantum Computing
- Neuromorphic Silicon Photonic Networks
- Theory of Quantum Annealing of an Ising Spin Glass
- Quantum Annealing and Analog Quantum Computation
- Network of Time-Multiplexed Optical Parametric Oscillators as a Coherent Ising Machine
- Physics-Inspired Optimization for Quadratic Unconstrained Problems Using a Digital Annealer
- A Coherent Ising Machine Based On Degenerate Optical Parametric Oscillators
- Experimental investigation of performance differences between Coherent Ising Machines and a quantum annealer
- Architectural considerations in the design of a superconducting quantum annealing processor
- Minor-embedding in adiabatic quantum computation: II. Minor-universal graph design
- Bifurcation-based adiabatic quantum computation with a nonlinear oscillator network: Toward quantum soft computing
- Intrinsic optimization using stochastic nanomagnets
- A case study in programming a quantum annealer for hard operational planning problems
- Solving the Optimal Trading Trajectory Problem Using a Quantum Annealer
- Quantum annealing with a network of all-to-all connected, two-photon driven Kerr nonlinear oscillators
- Quantum Variational Autoencoder
- An electromechanical Ising machine
- Vertex coloring of graphs via phase dynamics of coupled oscillatory networks
- Quantum Computation Based on Quantum Adiabatic Bifurcations of Kerr-Nonlinear Parametric Oscillators
- Robust quantum optimizer with full connectivity
- Simulated Quantum Annealing with Two All-to-All Connectivity Schemes