Nearly optimal time-independent reversal of a spin chain

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 time-independent, non-uniform 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. 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.

7 pages, 2 figures

References in corpus (18)

• The Quantum Internet
• Superconducting Qubits: Current State of Play
• Perfect Transfer of Arbitrary States in Quantum Spin Networks
• Quantum Communication through Spin Chain Dynamics: an Introductory Overview
• An exact chiral spin liquid with non-Abelian anyons
• Mirror Inversion of Quantum States in Linear Registers
• Spin Chains as Perfect Quantum State Mirrors
• Efficient Distributed Quantum Computing
• Perfect state transfer on a spin-chain without state initialization
• Qubit Teleportation and Transfer across Antiferromagnetic Spin Chains
• Perfect state transfer in long-range interacting spin chains
• Non-Perturbative Entangling Gates between Distant Qubits using Uniform Cold Atom Chains
• A computationally universal phase of quantum matter
• Subsystem symmetries, quantum cellular automata, and computational phases of quantum matter
• Universal quantum computation using fractal symmetry-protected cluster phases
• Upper bounds on entangling rates of bipartite Hamiltonians
• Exact bosonization in arbitrary dimensions
• Reversible simulation of bipartite product Hamiltonians

Cited by in corpus (2)

• Advantages and limitations of quantum routing
• A Quantum Simulator Based on Locally Controlled Logical Systems