Computational Characteristics of Random Field Ising Model with Long-Range Interaction
arXiv:2205.13782 · doi:10.1103/PhysRevA.108.012415
Abstract
Ising model is a widely studied class of models in quantum computation. In this paper we investigate the computational characteristics of the random field Ising model (RFIM) with long-range interactions that decays as an inverse polynomial of distance, which can be achieved in current ion trap system. We prove that for an RFIM with long-range interaction embedded on a 2-dimensional plane, solving its ground state is NP-complete for all diminishing exponent, and prove that the 1-dimensional RFIM with long-range interaction can be efficiently approximated when the interaction decays fast enough.
References in corpus (6)
- Variational Quantum Algorithms
- Many-Body Physics with Individually-Controlled Rydberg Atoms
- Quantum computing with neutral atoms
- Quantum simulation and computing with Rydberg-interacting qubits
- Computational complexity of spin-glass three-dimensional (3D) Ising model
- Analogue Quantum Simulation: A New Instrument for Scientific Understanding