Searching for Possible Spin Configurations of Ferrum Chain via Quantum Approximate Optimization Algorithm

Abstract

Calculating the expected spin configuration of the chain consisting of Ferrum atoms interacting with each other through exchange interaction is fundamentally a configuration optimization problem. Quantum Approximate Optimization Algorithm is a suitable candidate to configure such systems on a quantum device. In this work we have considered Ferrum chains of three different lengths and calculated their most-probable spin configurations using Quantum Approximate Optimization Algorithm. We employed a Quantum Feed Forward Neural Network as the optimizer of Quantum Approximate Optimization Algorithm. We have successfully obtained the expected spin configuration for the longest Ferrum Chain.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…