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:2003.02843 · Physical Review Research

Nearly optimal time-independent reversal of a spin chain

Aniruddha Bapat, Eddie Schoute, Alexey Vyacheslavovich Gorshkov, Andrew M. Childs

Published Feb 22, 2022• 8 citations
arXivHTMLPDF

Abstract

We propose a time-independent Hamiltonian protocol for the reversal of qubit ordering in a chain of N spins.Our protocol has an easily implementable nearest-neighbor, transverse-field Ising model Hamiltonian with timeindependent, nonuniform couplings.Under appropriate normalization, we implement this state reversal three times faster than a naive approach using SWAP gates, in time comparable to a protocol of Raussendorf [Phys. Rev. A 72, 052301 (2005)] that requires dynamical control. We also prove lower bounds on state reversal by using results on the entanglement capacity of Hamiltonians and show that we are within a factor 1.502(1 + 1/N ) of the shortest time possible.Our lower bound holds for all nearest-neighbor qubit protocols with arbitrary finite ancilla spaces and local operations and classical communication.We give numerical evidence that the fast reversal protocols are more robust to noise than a SWAP-based reversal.Finally, we extend our protocol to an infinite family of nearest-neighbor, time-independent Hamiltonian protocols for state reversal.This includes chains with nearly uniform coupling that may be especially feasible for experimental implementation.

DOI
10.1103/physrevresearch.4.l012023

Related papers

Quantum routing with fast reversals

Aniruddha Bapat, Andrew M. Childs, Alexey Vyacheslavovich Gorshkov +3 more

We present methods for implementing arbitrary permutations of qubits under interaction constraints. Our protocols make use of previous methods for rapidly reversing the order of qubits along a path. Given nearest-neighbor interactions on a path of length n , we show that there exists a constant ϵ≈0.034 such that the quantum routing time is at most (1−ϵ)n , whereas any swap-based protocol needs at least time n−1 . This represents the first known quantum advantage over swap-based routing methods and also gives improved quantum routing times for realistic architectures such as grids. Furthermore, we show that our algorithm approaches a quantum routing time of 2n/3 in expectation for uniformly random permutations, whereas swap-based protocols require time n asymptotically. Additionally, we consider sparse permutations that route k≤n qubits and give algorithms with quantum routing time at most n/3+O(k2) on paths and at most 2r/3+O(k2) on general graphs with radius r .

arXiv:2103.03264•Quantum•Aug 31, 2021•18 citations

Parity-based mirror inversion for efficient quantum state transfer and computation in nearest-neighbor arrays

Preethika Kumar, Sahar Daraeizadeh

We introduce an efficient scheme for quantum state transfer that uses a parity-based mirror inversion technique. We design efficient circuits for implementing mirror inversion in Ising ${\mathbit{\ensuremath{\sigma}}}_{\mathbf{X}}{\mathbit{\ensuremath{\sigma}}}_{\mathbf{X}}$ and ${\mathbit{\ensuremath{\sigma}}}_{\mathbf{Y}}{\mathbit{\ensuremath{\sigma}}}_{\mathbf{Y}}$ coupled systems and show how to analytically solve for system parameters to implement the operation in these systems. The key feature of our scheme is a three-qubit parity gate, which we design as a two-control one-target qubit gate. The parity gate operation is implemented by only varying a single control parameter of the system Hamiltonian and the difficulty of implementing this gate is equivalent to that of a controlled-not gate in a two-qubit system. By applying a sequence of $N+1$ parity-based controlled-unitary operations between nearest-neighbor qubits, where all qubits in an $N$-qubit chain function either as controls or targets, we are able to reverse the order of all qubits along the array. These operations are accomplished by varying only a single control parameter per data qubit. The control parameter depends on the physical system under consideration and on the choice of the designer. Since every qubit participates in the mirror-inversion process functioning either as a control or target, all nearest-neighbor couplings are used. Therefore, we do not need additional measures to cancel the effect of any unwanted interactions and the quantum cost of our scheme does not increase in systems that do not have the ability shut off couplings. Moreover, our scheme does not require additional ancillas, nor does it use a pre-engineered mirror-periodic Hamiltonian to govern the evolution of the system. Using our mirror inversion scheme, we also show how to implement a swap gate between two arbitrary remote qubits, move a block of qubits, and implement efficient computing between two remote qubits in nearest-neighbor layouts.

Physical Review A•Apr 9, 2015•5 citations

Barenco gate implementation using driven two- and three-qubit spin chains

Rafael Vieira, Edgard P. M. Amorim

We propose a protocol for implementing Barenco-type multi-qubit controlled gates using short driven spin chains. Starting from an Ising interaction with a transverse drive on the last spin, we construct an effective two-qubit Hamiltonian whose time evolution implements the Barenco gate $V_2(\varphi,ω,φ)$ and, in particular, a CNOT gate. We then embed this construction into a three-qubit $XXZ$ chain to realize the three-qubit Barenco gate $V_3(\varphi,ω,φ)$, which includes the Toffoli gate as a special case. The derivation is fully analytical: we perform a sequence of unitary transformations, identify decoupled subspaces, and apply a rotating-wave approximation to obtain simple effective Hamiltonians. We derive explicit conditions on the coupling strengths and driving parameters, provide closed-form expressions for the time-evolution operators in each relevant subspace, and characterize the quality of the implementation using the operator fidelity. Numerical simulations show that the protocol achieves high fidelities over broad parameter ranges, demonstrating its robustness and suitability for quantum information processing in spin-chain platforms.

quant-pharXiv:2603.02387•International Journal of Theoretical Physics•Mar 4, 2026•1 citation

Time-optimal CNOT between indirectly coupled qubits in a linear Ising chain

A. Carlini, Akio Hosoya, Tatsuhiko Koike +1 more

We give analytical solutions for the time-optimal synthesis of entangling gates between indirectly coupled qubits 1 and 3 in a linear spin chain of three qubits subject to an Ising Hamiltonian interaction with a symmetric coupling J plus a local magnetic field acting on the intermediate qubit. The energy available is fixed, but we relax the standard assumption of instantaneous unitary operations acting on single qubits. The time required for performing an entangling gate which is equivalent, modulo local unitary operations, to the CNOT(1, 3) between the indirectly coupled qubits 1 and 3 is , i.e. faster than a previous estimate based on a similar Hamiltonian and the assumption of local unitaries with zero time cost. Furthermore, performing a simple Walsh–Hadamard rotation in the Hilbert space of qubit 3 shows that the time-optimal synthesis of the CNOT ± (1, 3) (which acts as the identity when the control qubit 1 is in the state |0⟩, while if the control qubit is in the state |1⟩, the target qubit 3 is flipped as | ± ⟩ → |∓⟩) also requires the same time T .

arXiv:1009.5968•Journal of Physics A Mathematical and Theoretical•Mar 8, 2011•28 citations

Fidelity of a sequence of SWAP operations on a spin chain

Robert E. Throckmorton, S. Das Sarma

We consider the ``transport'' of the state of a spin across a Heisenberg-coupled spin chain via the use of repeated SWAP gates, starting with one of two states---one in which the leftmost spin is down and the others up, and one in which the leftmost two spins are in a singlet state (i.e., they are entangled), and the others are again all up. More specifically, we transport the state of the leftmost spin in the first case and the next-to-leftmost spin in the second to the other end of the chain, and then back again. We accomplish our SWAP operations here by increasing the exchange coupling between the two spins that we operate on from a base value $J$ to a larger value ${J}_{\text{SWAP}}$ for a time $t=\ensuremath{\pi}\ensuremath{\hbar}/4{J}_{\text{SWAP}}$. We determine the fidelity of this sequence of operations in a number of situations---one in which only nearest-neighbor coupling exists between spins and there is no magnetic dipole-dipole coupling or noise (the most ideal case), one in which we introduce next-nearest-neighbor coupling, but none of the other effects, and one in which all of these effects are present. In the last case, the noise is assumed to be quasistatic, i.e., the exchange couplings are each drawn from a Gaussian distribution, truncated to only nonnegative values. We plot the fidelity as a function of ${J}_{\text{SWAP}}$ to illustrate various effects, namely crosstalk due to coupling to other spins, as well as noise, that are detrimental to our ability to perform a SWAP operation. Our theory should be useful to the ongoing experimental efforts in building semiconductor-based spin quantum computer architectures.

arXiv:2004.04746•Physical review. B./Physical review. B•Jul 27, 2020•6 citations

Quantum simulation of one-dimensional fermionic systems with Ising Hamiltonians

Matthias Werner, Artur García-Sáez, Marta P. Estarellas

In recent years, analog quantum simulators have reached unprecedented quality, both in qubit numbers and coherence times. Most of these simulators natively implement Ising-type Hamiltonians, which limits the class of models that can be simulated efficiently. We propose a method to overcome this limitation and simulate the time evolution of a large class of spinless fermionic systems in one dimension (1D) using simple Ising-type Hamiltonians with local transverse fields. Our method is based on domain wall encoding, which is implemented via strong (anti)ferromagnetic couplings $|J|$. We show that in the limit of strong $|J|$, the domain walls behave like spinless fermions in 1D. The Ising Hamiltonians are one-dimensional chains with nearest-neighbor and, optionally, next-nearest-neighbor interactions. As a proof of concept, we perform numerical simulations of various 1D fermionic systems using domain wall evolution and accurately reproduce the systems' properties, such as topological edge states, Anderson localization, quantum chaotic time evolution, and time-reversal symmetry breaking via Floquet engineering. Our approach makes the simulation of a large class of fermionic many-body systems feasible on analog quantum hardware that natively implements Ising-type Hamiltonians with transverse fields.

arXiv:2406.06378•Physical review. B./Physical review. B•Apr 25, 2025•5 citations
We propose a time-independent Hamiltonian protocol for the reversal of qubit ordering in a chain of N spins.Our protocol has an easily implementable nearest-neighbor, transverse-field Ising model Hamiltonian with timeindependent, nonuniform couplings.Under appropriate normalization, we implement this state reversal three times faster than a naive approach using SWAP gates, in time comparable to a protocol of Raussendorf [Phys. Rev. A 72, 052301 (2005)] that requires dynamical control. We also prove lower bounds on state reversal by using results on the entanglement capacity of Hamiltonians and show that we are within a factor 1.502(1 + 1/N ) of the shortest time possible.Our lower bound holds for all nearest-neighbor qubit protocols with arbitrary finite ancilla spaces and local operations and classical communication.We give numerical evidence that the fast reversal protocols are more robust to noise than a SWAP-based reversal.Finally, we extend our protocol to an infinite family of nearest-neighbor, time-independent Hamiltonian protocols for state reversal.This includes chains with nearly uniform coupling that may be especially feasible for experimental implementation.
We present methods for implementing arbitrary permutations of qubits under interaction constraints. Our protocols make use of previous methods for rapidly reversing the order of qubits along a path. Given nearest-neighbor interactions on a path of length n , we show that there exists a constant ϵ≈0.034 such that the quantum routing time is at most (1−ϵ)n , whereas any swap-based protocol needs at least time n−1 . This represents the first known quantum advantage over swap-based routing methods and also gives improved quantum routing times for realistic architectures such as grids. Furthermore, we show that our algorithm approaches a quantum routing time of 2n/3 in expectation for uniformly random permutations, whereas swap-based protocols require time n asymptotically. Additionally, we consider sparse permutations that route k≤n qubits and give algorithms with quantum routing time at most n/3+O(k2) on paths and at most 2r/3+O(k2) on general graphs with radius r .
We introduce an efficient scheme for quantum state transfer that uses a parity-based mirror inversion technique. We design efficient circuits for implementing mirror inversion in Ising ${\mathbit{\ensuremath{\sigma}}}_{\mathbf{X}}{\mathbit{\ensuremath{\sigma}}}_{\mathbf{X}}$ and ${\mathbit{\ensuremath{\sigma}}}_{\mathbf{Y}}{\mathbit{\ensuremath{\sigma}}}_{\mathbf{Y}}$ coupled systems and show how to analytically solve for system parameters to implement the operation in these systems. The key feature of our scheme is a three-qubit parity gate, which we design as a two-control one-target qubit gate. The parity gate operation is implemented by only varying a single control parameter of the system Hamiltonian and the difficulty of implementing this gate is equivalent to that of a controlled-not gate in a two-qubit system. By applying a sequence of N+1N+1N+1 parity-based controlled-unitary operations between nearest-neighbor qubits, where all qubits in an NNN-qubit chain function either as controls or targets, we are able to reverse the order of all qubits along the array. These operations are accomplished by varying only a single control parameter per data qubit. The control parameter depends on the physical system under consideration and on the choice of the designer. Since every qubit participates in the mirror-inversion process functioning either as a control or target, all nearest-neighbor couplings are used. Therefore, we do not need additional measures to cancel the effect of any unwanted interactions and the quantum cost of our scheme does not increase in systems that do not have the ability shut off couplings. Moreover, our scheme does not require additional ancillas, nor does it use a pre-engineered mirror-periodic Hamiltonian to govern the evolution of the system. Using our mirror inversion scheme, we also show how to implement a swap gate between two arbitrary remote qubits, move a block of qubits, and implement efficient computing between two remote qubits in nearest-neighbor layouts.
We propose a protocol for implementing Barenco-type multi-qubit controlled gates using short driven spin chains. Starting from an Ising interaction with a transverse drive on the last spin, we construct an effective two-qubit Hamiltonian whose time evolution implements the Barenco gate V2(φ,ω,φ)V_2(\varphi,ω,φ)V2​(φ,ω,φ) and, in particular, a CNOT gate. We then embed this construction into a three-qubit XXZXXZXXZ chain to realize the three-qubit Barenco gate V3(φ,ω,φ)V_3(\varphi,ω,φ)V3​(φ,ω,φ), which includes the Toffoli gate as a special case. The derivation is fully analytical: we perform a sequence of unitary transformations, identify decoupled subspaces, and apply a rotating-wave approximation to obtain simple effective Hamiltonians. We derive explicit conditions on the coupling strengths and driving parameters, provide closed-form expressions for the time-evolution operators in each relevant subspace, and characterize the quality of the implementation using the operator fidelity. Numerical simulations show that the protocol achieves high fidelities over broad parameter ranges, demonstrating its robustness and suitability for quantum information processing in spin-chain platforms.
We give analytical solutions for the time-optimal synthesis of entangling gates between indirectly coupled qubits 1 and 3 in a linear spin chain of three qubits subject to an Ising Hamiltonian interaction with a symmetric coupling J plus a local magnetic field acting on the intermediate qubit. The energy available is fixed, but we relax the standard assumption of instantaneous unitary operations acting on single qubits. The time required for performing an entangling gate which is equivalent, modulo local unitary operations, to the CNOT(1, 3) between the indirectly coupled qubits 1 and 3 is , i.e. faster than a previous estimate based on a similar Hamiltonian and the assumption of local unitaries with zero time cost. Furthermore, performing a simple Walsh–Hadamard rotation in the Hilbert space of qubit 3 shows that the time-optimal synthesis of the CNOT ± (1, 3) (which acts as the identity when the control qubit 1 is in the state |0⟩, while if the control qubit is in the state |1⟩, the target qubit 3 is flipped as | ± ⟩ → |∓⟩) also requires the same time T .
We consider the ``transport'' of the state of a spin across a Heisenberg-coupled spin chain via the use of repeated SWAP gates, starting with one of two states---one in which the leftmost spin is down and the others up, and one in which the leftmost two spins are in a singlet state (i.e., they are entangled), and the others are again all up. More specifically, we transport the state of the leftmost spin in the first case and the next-to-leftmost spin in the second to the other end of the chain, and then back again. We accomplish our SWAP operations here by increasing the exchange coupling between the two spins that we operate on from a base value JJJ to a larger value JSWAP{J}_{\text{SWAP}}JSWAP​ for a time $t=\ensuremath{\pi}\ensuremath{\hbar}/4{J}_{\text{SWAP}}$. We determine the fidelity of this sequence of operations in a number of situations---one in which only nearest-neighbor coupling exists between spins and there is no magnetic dipole-dipole coupling or noise (the most ideal case), one in which we introduce next-nearest-neighbor coupling, but none of the other effects, and one in which all of these effects are present. In the last case, the noise is assumed to be quasistatic, i.e., the exchange couplings are each drawn from a Gaussian distribution, truncated to only nonnegative values. We plot the fidelity as a function of JSWAP{J}_{\text{SWAP}}JSWAP​ to illustrate various effects, namely crosstalk due to coupling to other spins, as well as noise, that are detrimental to our ability to perform a SWAP operation. Our theory should be useful to the ongoing experimental efforts in building semiconductor-based spin quantum computer architectures.
In recent years, analog quantum simulators have reached unprecedented quality, both in qubit numbers and coherence times. Most of these simulators natively implement Ising-type Hamiltonians, which limits the class of models that can be simulated efficiently. We propose a method to overcome this limitation and simulate the time evolution of a large class of spinless fermionic systems in one dimension (1D) using simple Ising-type Hamiltonians with local transverse fields. Our method is based on domain wall encoding, which is implemented via strong (anti)ferromagnetic couplings ∣J∣|J|∣J∣. We show that in the limit of strong ∣J∣|J|∣J∣, the domain walls behave like spinless fermions in 1D. The Ising Hamiltonians are one-dimensional chains with nearest-neighbor and, optionally, next-nearest-neighbor interactions. As a proof of concept, we perform numerical simulations of various 1D fermionic systems using domain wall evolution and accurately reproduce the systems' properties, such as topological edge states, Anderson localization, quantum chaotic time evolution, and time-reversal symmetry breaking via Floquet engineering. Our approach makes the simulation of a large class of fermionic many-body systems feasible on analog quantum hardware that natively implements Ising-type Hamiltonians with transverse fields.