Investigating the Exchange of Ising Chains on a Digital Quantum Computer
Bassel Heiba Elfeky, Matthieu C. Dartiailh, S. M. Farzaneh, Javad, Shabani

TL;DR
This paper simulates a braiding-like exchange operation in Ising chains on a quantum computer, analyzing fidelity and errors, and discusses the challenges of implementing such operations on current NISQ hardware.
Contribution
It demonstrates a method to simulate Ising chain exchanges on a quantum computer and analyzes the impact of various errors on fidelity, providing insights for future quantum hardware improvements.
Findings
Achieved >99% fidelity for up to 11-site chains.
Quantum gate errors dominate fidelity loss over Trotter and adiabatic errors.
Optimal single braiding operation fidelity requires circuit depth ~1000 with gate errors <10^{-6}.
Abstract
The ferromagnetic state of an Ising chain can represent a two-fold degenerate subspace or equivalently a logical qubit which is protected from excitations by an energy gap. We study a a braiding-like exchange operation through the movement of the state in the qubit subspace which resembles that of the localized edge modes in a Kitaev chain. The system consists of two Ising chains in a 1D geometry where the operation is simulated through the adiabatic time evolution of the ground state. The time evolution is implemented via the Suzuki-Trotter expansion on basic single- and two-qubit quantum gates using IBM's Aer QASM simulator. The fidelity of the system is investigated as a function of the evolution and system parameters to obtain optimum efficiency and accuracy for different system sizes. Various aspects of the implementation including the circuit depth, Trotterization error, and…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
