Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2103.05502 · Physical Review Research

Investigating the exchange of Ising chains on a digital quantum computer

Bassel Heiba Elfeky, Matthieu Dartiailh, S. M. Farzaneh, Javad Shabani

Published Aug 2, 2021• 2 citations
arXivHTMLPDF

Abstract

The ferromagnetic state of an Ising chain can represent a twofold degenerate subspace or equivalently a logical qubit that is protected from excitations by an energy gap. Here, we study a braiding-like exchange operation through the movement of the ferromagnetic 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 one-dimensional 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 quantum gate errors pertaining to noisy intermediate-scale quantum (NISQ) hardware, are discussed as well. We demonstrate that the quantum gate errors, i.e., bit-flip, phase errors, are the dominating factor in determining the fidelity of the system as the Trotter error and the adiabatic condition are less restrictive even for modest values of Trotter time steps. We reach an optimum fidelity $>99%$ on systems of up to 11 sites per Ising chain. We show that running such simulations is far beyond the reach of current NISQ hardware with the most efficient implementation of a single braiding-like operation for a fidelity above $90%$ requiring a circuit depth of the order of $\ensuremath{\sim}{10}^{3}$ restricting the individual gate errors to be less than $\ensuremath{\sim}{10}^{\ensuremath{-}6}$.

DOI
10.1103/physrevresearch.3.033108

Related papers

Emulating Quantum Teleportation of a Majorana Zero Mode Qubit

He-Liang Huang, Marek Narożniak, Futian Liang +14 more

Topological quantum computation based on anyons is a promising approach to achieve fault-tolerant quantum computing. The Majorana zero modes in the Kitaev chain are an example of non-Abelian anyons where braiding operations can be used to perform quantum gates. Here we perform a quantum simulation of topological quantum computing, by teleporting a qubit encoded in the Majorana zero modes of a Kitaev chain. The quantum simulation is performed by mapping the Kitaev chain to its equivalent spin version and realizing the ground states in a superconducting quantum processor. The teleportation transfers the quantum state encoded in the spin-mapped version of the Majorana zero mode states between two Kitaev chains. The teleportation circuit is realized using only braiding operations and can be achieved despite being restricted to Clifford gates for the Ising anyons. The Majorana encoding is a quantum error detecting code for phase-flip errors, which is used to improve the average fidelity of the teleportation for six distinct states from 70.76±0.35% to 84.60±0.11%, well beyond the classical bound in either case.

arXiv:2009.07590•Physical Review Letters•Mar 3, 2021•51 citations

Optimal compression of quantum many-body time evolution operators into brickwall circuits

Maurits S. J. Tepaske, Dominik Hahn, David J. Luitz

Near term quantum computers suffer from a degree of decoherence which is prohibitive for high fidelity simulations with deep circuits. An economical use of circuit depth is therefore paramount. For digital quantum simulation of quantum many-body systems, real time evolution is typically achieved by a Trotter decomposition of the time evolution operator into circuits consisting only of two qubit gates. To match the geometry of the physical system and the CNOT connectivity of the quantum processor, additional SWAP gates are needed. We show that optimal fidelity, beyond what is achievable by simple Trotter decompositions for a fixed gate count, can be obtained by compiling the evolution operator into optimal brickwall circuits for the S=1/2 S = 1 / 2 quantum Heisenberg model on chains and ladders, when mapped to one dimensional quantum processors without the need of additional SWAP gates.

arXiv:2205.03445•SciPost Physics•Apr 17, 2023•38 citations

Long-time simulations for fixed input states on quantum hardware

Joe Gibbs, Kaitlin Gili, Zoë Holmes +5 more

Abstract Publicly accessible quantum computers open the exciting possibility of experimental dynamical quantum simulations. While rapidly improving, current devices have short coherence times, restricting the viable circuit depth. Despite these limitations, we demonstrate long-time, high fidelity simulations on current hardware. Specifically, we simulate an XY-model spin chain on Rigetti and IBM quantum computers, maintaining a fidelity over 0.9 for 150 times longer than is possible using the iterated Trotter method. Our simulations use an algorithm we call fixed state Variational Fast Forwarding (fsVFF). Recent work has shown an approximate diagonalization of a short time evolution unitary allows a fixed-depth simulation. fsVFF substantially reduces the required resources by only diagonalizing the energy subspace spanned by the initial state, rather than over the total Hilbert space. We further demonstrate the viability of fsVFF through large numerical simulations, and provide an analysis of the noise resilience and scaling of simulation errors.

arXiv:2102.04313•npj Quantum Information•Nov 19, 2022•95 citations

Trotter Errors and the Emergence of Chaos in Quantum Simulation

Kevin W. Kuper, Jon Pajaud, Karthik Chinni +2 more

As noisy intermediate-scale quantum (NISQ) processors increase in size and complexity, their use as general purpose quantum simulators will rely on algorithms based on the Trotter-Suzuki expansion. We run quantum simulations on a small, highly accurate quantum processor, and show how one can optimize simulation accuracy by balancing algorithmic (Trotter) errors against native errors specific to the quantum hardware at hand. We further study the interplay between native errors, Trotter errors, and the emergence of chaos as seen in measurements of a time averaged fidelity-out-of-time-ordered-correlator

arXiv:2212.03843•Dec 7, 2022•5 citations

Success of digital adiabatic simulation with large Trotter step

Changhao Yi

The simulation of adiabatic evolution has deep connections with adiabatic quantum computation, the quantum approximate optimization algorithm, and adiabatic state preparation. Here we address the error analysis problem in quantum simulation of adiabatic process using Trotter formulas. We show that with additional conditions, the circuit depth can be linear in simulation time $T$. The improvement comes from the observation that the fidelity error here can't be estimated by the norm distance between evolution operators. This phenomenon is termed the robustness of discretization in digital adiabatic simulation. It can be explained in three steps, from analytical and numerical evidence: (1) The fidelity error should be estimated by applying adiabatic theorem on the effective Hamiltonian instead. (2) Because of the specialty of Riemann-Lebesgue lemma, most adiabatic process is naturally robust against discretization. (3) As the Trotter step gets larger, the spectral gap of effective Hamiltonian tends to close, which results in the failure of digital adiabatic simulation.

arXiv:2107.06404•Physical Review A•Nov 8, 2021•19 citations

Benchmarking Open-Access Quantum Hardware Through Many-Body Dynamics in the 1D Tilted-Field Ising Model

Samarth Lamba, Aleksandra A. Ziółkowska

Abstract Hamiltonian simulation is one of the main proposed applications of near-term quantum computers, but its practical value depends on whether real hardware can preserve intended Hamiltonian dynamics once sampling limits, gate noise, decoherence, and circuit depth are taken into account. This study investigates whether the IBM quantum backend \texttt{ibm\_marrakesh} can reproduce the many-body dynamics shown by ideal simulation, using a 15-qubit one-dimensional tilted-field Ising chain as the benchmark system. The system was initialized with all qubits spin-up except for a localized spin-down excitation at the central qubit, $q_8$, and evolved using a second-order Trotterized circuit with timestep $\Delta t=0.1$. The reference case, $h_z=0$, was compared with the tilted-field case, $h_z=h_x=0.35625$, across three interaction regimes: $J=0.90h_x$, $J=h_x$, and $J=1.40h_x$. Local magnetization, total magnetization, and connected spin correlations were used to track magnetization memory and finite-speed correlation spreading from the central excitation. The ideal simulation shows clear local and total magnetization evolution, as well as connected-correlation spreading outward from $q_8$, giving a baseline for the intended Hamiltonian dynamics. The IBM hardware results reproduce the broad early-time magnetization trend but show compressed local-magnetization values, reduced separation between qubits, and weaker long-range connected-correlation structure. These differences indicate that the open-access quantum hardware preserves some early-time features of the intended dynamics, while longer-time correlation spreading is increasingly obscured by finite sampling, two-qubit gate errors, readout error, decoherence, and circuit depth. Overall, the study uses this spin-chain system as a direct benchmark for testing how much physically meaningful many-body behavior can still be extracted from noisy open-access quantum hardware.

•Jul 1, 2026•0 citations
The ferromagnetic state of an Ising chain can represent a twofold degenerate subspace or equivalently a logical qubit that is protected from excitations by an energy gap. Here, we study a braiding-like exchange operation through the movement of the ferromagnetic 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 one-dimensional 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 quantum gate errors pertaining to noisy intermediate-scale quantum (NISQ) hardware, are discussed as well. We demonstrate that the quantum gate errors, i.e., bit-flip, phase errors, are the dominating factor in determining the fidelity of the system as the Trotter error and the adiabatic condition are less restrictive even for modest values of Trotter time steps. We reach an optimum fidelity >99>99%>99 on systems of up to 11 sites per Ising chain. We show that running such simulations is far beyond the reach of current NISQ hardware with the most efficient implementation of a single braiding-like operation for a fidelity above 9090%90 requiring a circuit depth of the order of \ensuremath∼103\ensuremath{\sim}{10}^{3}\ensuremath∼103 restricting the individual gate errors to be less than \ensuremath∼10\ensuremath−6\ensuremath{\sim}{10}^{\ensuremath{-}6}\ensuremath∼10\ensuremath−6.
Topological quantum computation based on anyons is a promising approach to achieve fault-tolerant quantum computing. The Majorana zero modes in the Kitaev chain are an example of non-Abelian anyons where braiding operations can be used to perform quantum gates. Here we perform a quantum simulation of topological quantum computing, by teleporting a qubit encoded in the Majorana zero modes of a Kitaev chain. The quantum simulation is performed by mapping the Kitaev chain to its equivalent spin version and realizing the ground states in a superconducting quantum processor. The teleportation transfers the quantum state encoded in the spin-mapped version of the Majorana zero mode states between two Kitaev chains. The teleportation circuit is realized using only braiding operations and can be achieved despite being restricted to Clifford gates for the Ising anyons. The Majorana encoding is a quantum error detecting code for phase-flip errors, which is used to improve the average fidelity of the teleportation for six distinct states from 70.76±0.35% to 84.60±0.11%, well beyond the classical bound in either case.
Near term quantum computers suffer from a degree of decoherence which is prohibitive for high fidelity simulations with deep circuits. An economical use of circuit depth is therefore paramount. For digital quantum simulation of quantum many-body systems, real time evolution is typically achieved by a Trotter decomposition of the time evolution operator into circuits consisting only of two qubit gates. To match the geometry of the physical system and the CNOT connectivity of the quantum processor, additional SWAP gates are needed. We show that optimal fidelity, beyond what is achievable by simple Trotter decompositions for a fixed gate count, can be obtained by compiling the evolution operator into optimal brickwall circuits for the S=1/2 S = 1 / 2 quantum Heisenberg model on chains and ladders, when mapped to one dimensional quantum processors without the need of additional SWAP gates.
Abstract Publicly accessible quantum computers open the exciting possibility of experimental dynamical quantum simulations. While rapidly improving, current devices have short coherence times, restricting the viable circuit depth. Despite these limitations, we demonstrate long-time, high fidelity simulations on current hardware. Specifically, we simulate an XY-model spin chain on Rigetti and IBM quantum computers, maintaining a fidelity over 0.9 for 150 times longer than is possible using the iterated Trotter method. Our simulations use an algorithm we call fixed state Variational Fast Forwarding (fsVFF). Recent work has shown an approximate diagonalization of a short time evolution unitary allows a fixed-depth simulation. fsVFF substantially reduces the required resources by only diagonalizing the energy subspace spanned by the initial state, rather than over the total Hilbert space. We further demonstrate the viability of fsVFF through large numerical simulations, and provide an analysis of the noise resilience and scaling of simulation errors.
As noisy intermediate-scale quantum (NISQ) processors increase in size and complexity, their use as general purpose quantum simulators will rely on algorithms based on the Trotter-Suzuki expansion. We run quantum simulations on a small, highly accurate quantum processor, and show how one can optimize simulation accuracy by balancing algorithmic (Trotter) errors against native errors specific to the quantum hardware at hand. We further study the interplay between native errors, Trotter errors, and the emergence of chaos as seen in measurements of a time averaged fidelity-out-of-time-ordered-correlator
The simulation of adiabatic evolution has deep connections with adiabatic quantum computation, the quantum approximate optimization algorithm, and adiabatic state preparation. Here we address the error analysis problem in quantum simulation of adiabatic process using Trotter formulas. We show that with additional conditions, the circuit depth can be linear in simulation time TTT. The improvement comes from the observation that the fidelity error here can't be estimated by the norm distance between evolution operators. This phenomenon is termed the robustness of discretization in digital adiabatic simulation. It can be explained in three steps, from analytical and numerical evidence: (1) The fidelity error should be estimated by applying adiabatic theorem on the effective Hamiltonian instead. (2) Because of the specialty of Riemann-Lebesgue lemma, most adiabatic process is naturally robust against discretization. (3) As the Trotter step gets larger, the spectral gap of effective Hamiltonian tends to close, which results in the failure of digital adiabatic simulation.
Abstract Hamiltonian simulation is one of the main proposed applications of near-term quantum computers, but its practical value depends on whether real hardware can preserve intended Hamiltonian dynamics once sampling limits, gate noise, decoherence, and circuit depth are taken into account. This study investigates whether the IBM quantum backend \texttt{ibm\_marrakesh} can reproduce the many-body dynamics shown by ideal simulation, using a 15-qubit one-dimensional tilted-field Ising chain as the benchmark system. The system was initialized with all qubits spin-up except for a localized spin-down excitation at the central qubit, q8q_8q8​, and evolved using a second-order Trotterized circuit with timestep Δt=0.1\Delta t=0.1Δt=0.1. The reference case, hz=0h_z=0hz​=0, was compared with the tilted-field case, hz=hx=0.35625h_z=h_x=0.35625hz​=hx​=0.35625, across three interaction regimes: J=0.90hxJ=0.90h_xJ=0.90hx​, J=hxJ=h_xJ=hx​, and J=1.40hxJ=1.40h_xJ=1.40hx​. Local magnetization, total magnetization, and connected spin correlations were used to track magnetization memory and finite-speed correlation spreading from the central excitation. The ideal simulation shows clear local and total magnetization evolution, as well as connected-correlation spreading outward from q8q_8q8​, giving a baseline for the intended Hamiltonian dynamics. The IBM hardware results reproduce the broad early-time magnetization trend but show compressed local-magnetization values, reduced separation between qubits, and weaker long-range connected-correlation structure. These differences indicate that the open-access quantum hardware preserves some early-time features of the intended dynamics, while longer-time correlation spreading is increasingly obscured by finite sampling, two-qubit gate errors, readout error, decoherence, and circuit depth. Overall, the study uses this spin-chain system as a direct benchmark for testing how much physically meaningful many-body behavior can still be extracted from noisy open-access quantum hardware.