Papers › Robust Quantum Entanglement Generation and Generation-plus-Storage Protocols with Spin Chains
Robust Quantum Entanglement Generation and Generation-plus-Storage Protocols with Spin Chains
Marta P. Estarellas, Irene D'Amico, Timothy P. Spiller
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.
Reliable quantum communication/processing links between modules are a necessary building block for various quantum processing architectures. Here we consider a spin chain system with alternating strength couplings and containing three defects, that impose three domain walls between topologically distinct regions of the chain. We show that -- in addition to its useful, high fidelity, quantum state transfer properties -- an entangling protocol can be implemented in this system, with optional localisation and storage of the entangled states. We demonstrate both numerically and analytically that, given a suitable initial product-state injection, the natural dynamics of the system produces a maximally entangled state at a given time. We present detailed investigations of the effects of fabrication errors, analyzing random static disorder both in the diagonal and off-diagonal terms of the system Hamiltonian. Our results show that the entangled state formation is very robust against perturbations of up to ∼10% the weaker chain coupling, and also robust against timing injection errors. We propose a further protocol which manipulates the chain in order to localise and store each of the entangled qubits. The engineering of a system with such characteristics would thus provide a useful device for quantum information processing tasks involving the creation and storage of entangled resources.
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