Highly Versatile FPGA-Implemented Cyber Coherent Ising Machine
arXiv:2406.05377 · doi:10.1109/ACCESS.2024.3504008
Abstract
In recent years, quantum Ising machines have drawn a lot of attention, but due to physical implementation constraints, it has been difficult to achieve dense coupling, such as full coupling with sufficient spins to handle practical large-scale applications. Consequently, classically computable equations have been derived from quantum master equations for these quantum Ising machines. Parallel implementations of these algorithms using FPGAs have been used to rapidly find solutions to these problems on a scale that is difficult to achieve in physical systems. We have developed an FPGA implemented cyber coherent Ising machine (cyber CIM) that is much more versatile than previous implementations using FPGAs. Our architecture is versatile since it can be applied to the open-loop CIM, which was proposed when CIM research began, to the closed-loop CIM, which has been used recently, as well as to Jacobi successive over-relaxation method. By modifying the sequence control code for the calculation control module, other algorithms such as Simulated Bifurcation (SB) can also be implemented. Earlier research on large-scale FPGA implementations of SB and CIM used binary or ternary discrete values for connections, whereas the cyber CIM used FP32 values. Also, the cyber CIM utilized Zeeman terms that were represented as FP32, which were not present in other large-scale FPGA systems. Our implementation with continuous interaction realizes N=4096 on a single FPGA, comparable to the single-FPGA implementation of SB with binary interactions, with N=4096. The cyber CIM enables applications such as CDMA multi-user detector and L0 compressed sensing which were not possible with earlier FPGA systems, while enabling superior calculation speeds, more than ten times faster than a GPU implementation. The calculation speed can be further improved by increasing parallelism, such as through clustering.
20 pages, 9 figures
References in corpus (32)
- 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
- Quantum Annealing and Analog Quantum Computation
- Quantum computing for finance: overview and prospects
- Network of Time-Multiplexed Optical Parametric Oscillators as a Coherent Ising Machine
- A Coherent Ising Machine Based On Degenerate Optical Parametric Oscillators
- Observation of topological phenomena in a programmable lattice of 1,800 qubits
- Experimental investigation of performance differences between Coherent Ising Machines and a quantum annealer
- Bifurcation-based adiabatic quantum computation with a nonlinear oscillator network: Toward quantum soft computing
- Quantum annealing with a network of all-to-all connected, two-photon driven Kerr nonlinear oscillators
- Destabilization of local minima in analog spin systems by correction of amplitude heterogeneity
- Quantum Computation Based on Quantum Adiabatic Bifurcations of Kerr-Nonlinear Parametric Oscillators
- Robust quantum optimizer with full connectivity
- A coherent Ising machine for MAX-CUT problems : Performance evaluation against semidefinite programming relaxation and simulated annealing
- Multilevel Combinatorial Optimization Across Quantum Architectures
- Collective and synchronous dynamics of photonic spiking neurons
- Quantum correlation in degenerate optical parametric oscillators with mutual injections
- A statistical mechanics of an oscillator associative memory with scattered natural frequencies
- Ising Machines' Dynamics and Regularization for Near-Optimal Large and Massive MIMO Detection
- Truncated Wigner function theory of coherent Ising machines based on degenerate optical parametric oscillator network
- High-accuracy Ising machine using Kerr-nonlinear parametric oscillators with local four-body interactions
- Coherent Ising machines with error correction feedback
- Real-time Trading System based on Selections of Potentially Profitable, Uncorrelated, and Balanced Stocks by NP-hard Combinatorial Optimization
- Sparse approximation based on a random overcomplete basis
- Correlation-diversified portfolio construction by finding maximum independent set in large-scale market graph
- Pairs-trading System using Quantum-inspired Combinatorial Optimization Accelerator for Optimal Path Search in Market Graphs
- Uplink MIMO Detection using Ising Machines: A Multi-Stage Ising Approach
- Effective implementation of -Regularised Compressed Sensing with Chaotic-Amplitude-Controlled Coherent Ising Machines
- Mean-field Coherent Ising Machines with artificial Zeeman terms
- Analysis of the Hopfield Model with Discrete Coupling