Papers › Fast generation of entanglement between coupled spins using optimization and deep...

Fast generation of entanglement between coupled spins using optimization and deep learning methods

23 Dec 2024arXiv:2412.17489links table onlyarchive 2025-07-28

Dimitris Koutromanos, Dionisis Stefanatos, Emmanuel Paspalakis

The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.

Coupled spins form composite quantum systems which play an important role in many quantum technology applications, with an essential task often being the efficient generation of entanglement between two constituent qubits. The simplest such system is a pair of spins-1/2 coupled with Ising interaction, and in previous works various quantum control methods such as adiabatic processes, shortcuts to adiabaticity and optimal control have been employed to quickly generate there one of the maximally entangled Bell states. In this study, we use machine learning and optimization methods to produce maximally entangled states in minimum time, with the Rabi frequency and the detuning used as bounded control functions. We do not target a specific maximally entangled state, like the preceding studies, but rather find the controls which maximize the concurrence, leading thus automatically the system to the closest such state in shorter time. By increasing the bounds of the control functions we observe that the corresponding optimally selected maximally entangled state also changes and the necessary time to reach it is reduced. The present work demonstrates also that machine learning and optimization offer efficient and flexible techniques for the fast generation of entanglement in coupled spin systems, and we plan to extent it to systems involving more spins, for example spin chains.

PaperPDFCode

Code

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

Not run by Syntology. Nothing on this page verifies that the listed code works.

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections