In short-range interacting systems, the speed at which entanglement can be established between two separated points is limited by a constant Lieb-Robinson velocity. Long-range interacting systems are capable of faster entanglement generation, but the degree of the speedup possible is an open question. In this Letter, we present a protocol capable of transferring a quantum state across a distance L in d dimensions using long-range interactions with a strength bounded by 1/r^{α}. If α<d, the state transfer time is asymptotically independent of L; if α=d, the time scales logarithmically with the distance L; if d<α<d+1, the transfer occurs in a time proportional to L^{α-d}; and if α≥d+1, it occurs in a time proportional to L. We then use this protocol to upper bound the time required to create a state specified by a multiscale entanglement renormalization ansatz (MERA) tensor network and show that if the linear size of the MERA state is L, then it can be created in a time that scales with L identically to the state transfer up to logarithmic corrections. This protocol realizes an exponential speedup in cases of α=d, which could be useful in creating large entangled states for dipole-dipole (1/r^{3}) interactions in three dimensions.
In short-range interacting systems, the speed at which entanglement can be established between two separated points is limited by a constant Lieb-Robinson velocity. Long-range interacting systems are capable of faster entanglement generation, but the degree of the speedup possible is an open question. In this Letter, we present a protocol capable of transferring a quantum state across a distance L in d dimensions using long-range interactions with a strength bounded by 1/r^{α}. If α<d, the state transfer time is asymptotically independent of L; if α=d, the time scales logarithmically with the distance L; if d<α<d+1, the transfer occurs in a time proportional to L^{α-d}; and if α≥d+1, it occurs in a time proportional to L. We then use this protocol to upper bound the time required to create a state specified by a multiscale entanglement renormalization ansatz (MERA) tensor network and show that if the linear size of the MERA state is L, then it can be created in a time that scales with L identically to the state transfer up to logarithmic corrections. This protocol realizes an exponential speedup in cases of α=d, which could be useful in creating large entangled states for dipole-dipole (1/r^{3}) interactions in three dimensions.
We present an optimal protocol for encoding an unknown qubit state into a multiqubit Greenberger-Horne-Zeilinger-like state and, consequently, transferring quantum information in large systems exhibiting power-law (1=r α ) interactions.For all power-law exponents α between d and 2d þ 1, where d is the dimension of the system, the protocol yields a polynomial speed-up for α > 2d and a superpolynomial speed-up for α ≤ 2d, compared to the state of the art.For all α > d, the protocol saturates the Lieb-Robinson bounds (up to subpolynomial corrections), thereby establishing the optimality of the protocol and the tightness of the bounds in this regime.The protocol has a wide range of applications, including in quantum sensing, quantum computing, and preparation of topologically ordered states.In addition, the protocol provides a lower bound on the gate count in digital simulations of power-law interacting systems.
We investigate the fundamental time complexity, as constrained by Lieb-Robinson bounds, for preparing entangled states useful in quantum metrology. We relate the minimum time to the Quantum Fisher Information (FQ) for a system of N quantum spins on a d-dimensional lattice with 1/rα interactions with r being the distance between two interacting spins. We focus on states with FQ∼N1+γ where γ∈(0,1], i.e., scaling from the standard quantum limit to the Heisenberg limit. For short-range interactions (α>2d+1), we prove the minimum time t scales as t≳Lγ, where L∼N1/d. For long-range interactions, we find a hierarchy of possible speedups: t≳Lγ(α−2d) for 2d<α<2d+1, t≳logL for (2−γ)d<α<2d, and t may even vanish algebraically in 1/L for α<(2−γ)d. These bounds extend to the minimum circuit depth required for state preparation, assuming two-qubit gate speeds scale as 1/rα. We further show that these bounds are saturable, up to sub-polynomial corrections, for all α at the Heisenberg limit (γ=1) and for α>(2−γ)d when γ<1. Our results establish a benchmark for the time-optimality of protocols that prepare metrologically useful quantum states.
We describe an efficient protocol to perform quantum state transfer using Hamiltonian dynamics with long-range interactions. The time to transfer n qubits a sufficiently large distance is proportional to n. Even without error correction, the fidelity of this multiqubit state transfer process remains finite for arbitrarily-well-separated qubits in the presence of uncorrelated random errors in coupling constants.
The speed of information propagation in long-range interacting quantum systems is limited by Lieb-Robinson-type bounds, whose tightness can be established by finding specific quantum state-transfer protocols. Previous works have given quantum state-transfer protocols that saturate the corresponding Lieb-Robinson bounds using time-dependent Hamiltonians. Are speed limits for quantum information propagation different for time-independent Hamiltonians? In a step towards addressing this question, we present and analyze two optimal time-independent state-transfer protocols for free-particle systems, which utilize continuous-time single-particle quantum walks with hopping strength decaying as a power law. We rigorously prove and numerically confirm that our protocols achieve quantum state transfer, with controllable error over an arbitrarily long distance in any spatial dimension, at the speed limits set by the free-particle Lieb-Robinson bounds. This shows that time independence does not limit information flow for long-range free-particle Hamiltonians.
In this thesis, we focus on the questions of how quantum entanglement can be generated between two or more spatially separated systems and, once generated, how it can be applied in quantum technology. First we will discuss a protocol, which we conjecture to be optimal in some regimes, that quickly creates entangled states across long distances in systems with power-law interactions. We will discuss how this protocol compares with currently known bounds on entangled state generation and how it might be implemented in a three-dimensional lattice of Rydberg atoms. Next, we will turn our attention to more general questions of how the Lieb-Robinson bound and other limitations on entanglement can be used to inform the design of quantum computers. Quantum computers will be required to create entanglement if they are to realize significant advantages over classical computers, meaning that the generation of entanglement is an important question. First, we will discuss the implications of the Lieb-Robinson bound on graph descriptions of quantum computer architectures, and how the relevant graph parameter (diameter) compares to likely cost functions for architectures, such as maximum graph degree and total number of necessary connections. We will present a proposed graph architecture, the hierarchical product, which we believe provides excellent balance between these considerations. We will then introduce new methods of evaluating graphs that allow us to include quantum architectures capable of measurement and feedback operations. After doing so, we will show that the generation of entanglement entropy becomes a limit on computation. We will show that, for several possible physical models of computation, the generation of entanglement can be bounded by simple graph properties. We demonstrate a connection between worst-case scenarios for entanglement generation and a graph quantity called the Cheeger constant or isoperimetric number, which we evaluate for several proposed quantum computing architectures. Finally, we will look at the scenario of quantum sensing. In particular, we will examine protocols for quantum function estimation, where quantum sensors are available to measure all of the inputs to the function. We will demonstrate that entangled sensors are more capable than non-entangled ones by first deriving a new lower bound on measurement error and then presenting protocols that saturate these bounds. We will first do so for linear functions of the measured quantities and then extend this to general functions using a two-step linearizing protocol.
The dynamics of quantum systems strongly depends on the local structure of the Hamiltonian. For short-range interacting systems, the well-known Lieb–Robinson bound defines the effective light cone with an exponentially small error with respect to the spatial distance, whereas we can obtain only polynomially small errors for distance in long-range interacting systems. In this paper, we derive a qualitatively new bound for quantum dynamics by considering how many spins can correlate with each other after time evolution. Our bound characterizes the number of spins which support the many-body entanglement with exponentially small errors and is valid for a large class of Hamiltonians including long-range interacting systems. To demonstrate the advantage of our approach in quantum many-body systems, we apply our bound to prove several fundamental properties which have not been derived from the Lieb–Robinson bound.