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:2010.02930 · Physical Review X

Optimal State Transfer and Entanglement Generation in Power-Law Interacting Systems

Minh C. Tran, Andrew Y. Guo, Abhinav Deshpande, Andrew Lucas, Alexey Vyacheslavovich Gorshkov

Published Jul 21, 2021• 51 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1103/physrevx.11.031016

Related papers

Lieb-Robinson Light Cone for Power-Law Interactions

Minh C. Tran, Andrew Y. Guo, Christopher L. Baldwin +3 more

The Lieb-Robinson theorem states that information propagates with a finite velocity in quantum systems on a lattice with nearest-neighbor interactions. What are the speed limits on information propagation in quantum systems with power-law interactions, which decay as 1/r^{α} at distance r? Here, we present a definitive answer to this question for all exponents α>2d and all spatial dimensions d. Schematically, information takes time at least r^{min{1,α-2d}} to propagate a distance r. As recent state transfer protocols saturate this bound, our work closes a decades-long hunt for optimal Lieb-Robinson bounds on quantum information dynamics with power-law interactions.

arXiv:2103.15828•Physical Review Letters•Oct 11, 2021•116 citations

Fast Quantum State Transfer and Entanglement Renormalization Using Long-Range Interactions

Zachary Eldredge, Zhexuan Gong, Jeremy T. Young +3 more

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.

arXiv:1612.02442•Physical Review Letters•Oct 25, 2017•81 citations

Time complexity in preparing metrologically useful quantum states

Carla M. Quispe Flores, Raphael Kaubruegger, Minh C. Tran +3 more

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 ($F_Q$) 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 $F_Q \sim N^{1+γ}$ where $γ\in (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 \gtrsim L^γ$, where $L \sim N^{1/d}$. For long-range interactions, we find a hierarchy of possible speedups: $t \gtrsim L^{γ(α-2d)}$ for $2d < α< 2d+1$, $t \gtrsim \log L$ 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.

quant-pharXiv:2511.14855•Nov 20, 2025•3 citations

Locality and Digital Quantum Simulation of Power-Law Interactions

Minh C. Tran, Andrew Y. Guo, Yuan Su +5 more

The propagation of information in nonrelativistic quantum systems obeys a speed limit known as a Lieb-Robinson bound.We derive a new Lieb-Robinson bound for systems with interactions that decay with distance r as a power law, 1=r α .The bound implies an effective light cone tighter than all previous bounds.Our approach is based on a technique for approximating the time evolution of a system, which was first introduced as part of a quantum simulation algorithm by Haah et al., FOCS'18.To bound the error of the approximation, we use a known Lieb-Robinson bound that is weaker than the bound we establish.This result brings the analysis full circle, suggesting a deep connection between Lieb-Robinson bounds and digital quantum simulation.In addition to the new Lieb-Robinson bound, our analysis also gives an error bound for the Haah et al. quantum simulation algorithm when used to simulate power-law decaying interactions.In particular, we show that the gate count of the algorithm scales with the system size better than existing algorithms when α > 3D (where D is the number of dimensions).

arXiv:1808.05225•Physical Review X•Jul 10, 2019•113 citations

Fast and Accurate Greenberger-Horne-Zeilinger Encoding Using All-to-All Interactions

Chao Yin

The N-qubit Greenberger-Horne-Zeilinger (GHZ) state is an important resource for quantum technologies. We consider the task of GHZ encoding using all-to-all interactions, which prepares the GHZ state in a special case, and is furthermore useful for quantum error correction, interaction-rate enhancement, and transmitting information using power-law interactions. The naive protocol based on parallelizing cnot gates takes O(1)-time of Hamiltonian evolution. In this work, we propose a fast protocol that achieves GHZ encoding with high accuracy. The evolution time O(log^{2}N/N) almost saturates the theoretical limit Ω(logN/N). Moreover, the final state is close to the ideal encoded one with high fidelity >1-10^{-3}, up to large system sizes N≲2000. The protocol only requires a few stages of time-independent Hamiltonian evolution; the key idea is to use the data qubit as control, and to use fast spin-squeezing dynamics generated by e.g., two-axis twisting.

arXiv:2406.10336•Physical Review Letters•Apr 4, 2025•11 citations

Experimental roadmap for optimal state transfer and entanglement generation in power-law systems

Andrew Y. Guo, Jeremy T. Young, Ron Belyansky +2 more

Experimental systems with power-law interactions have recently garnered interest as promising platforms for quantum information processing. Such systems are capable of spreading entanglement superballistically and achieving an asymptotic speed-up over locally interacting systems. Recently, protocols developed by Eldredge et al. [Phys. Rev. Lett. 119, 170503 (2017)] and Tran et al. [Phys. Rev. X 11, 031016 (2021)] for the task of transferring a quantum state between distant particles quickly were shown to be optimal and saturate theoretical bounds. However, the implementation of these protocols in physical systems with long-range interactions remains to be fully realized. In this work, we provide an experimental roadmap towards realizing fast state-transfer protocols in three classes of atomic and molecular systems with dipolar interactions: polar molecules composed of alkali-metal dimers, neutral atoms in excited Rydberg states, and atoms with strong magnetic moments (e.g. dysprosium). As a guide to near-term experimental implementation, we numerically evaluate the tradeoffs between the two protocols for small system sizes and develop methods to address potential crosstalk errors that may arise during the execution of the protocols.

arXiv:2402.07974•Feb 12, 2024•2 citations
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.
The Lieb-Robinson theorem states that information propagates with a finite velocity in quantum systems on a lattice with nearest-neighbor interactions. What are the speed limits on information propagation in quantum systems with power-law interactions, which decay as 1/r^{α} at distance r? Here, we present a definitive answer to this question for all exponents α>2d and all spatial dimensions d. Schematically, information takes time at least r^{min{1,α-2d}} to propagate a distance r. As recent state transfer protocols saturate this bound, our work closes a decades-long hunt for optimal Lieb-Robinson bounds on quantum information dynamics with power-law interactions.
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 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 (FQF_QFQ​) for a system of NNN quantum spins on a ddd-dimensional lattice with 1/rα1/r^α1/rα interactions with rrr being the distance between two interacting spins. We focus on states with FQ∼N1+γF_Q \sim N^{1+γ}FQ​∼N1+γ where γ∈(0,1]γ\in (0,1]γ∈(0,1], i.e., scaling from the standard quantum limit to the Heisenberg limit. For short-range interactions (α>2d+1α> 2d+1α>2d+1), we prove the minimum time ttt scales as t≳Lγt \gtrsim L^γt≳Lγ, where L∼N1/dL \sim N^{1/d}L∼N1/d. For long-range interactions, we find a hierarchy of possible speedups: t≳Lγ(α−2d)t \gtrsim L^{γ(α-2d)}t≳Lγ(α−2d) for 2d<α<2d+12d < α< 2d+12d<α<2d+1, t≳log⁡Lt \gtrsim \log Lt≳logL for (2−γ)d<α<2d(2-γ)d < α< 2d(2−γ)d<α<2d, and ttt may even vanish algebraically in 1/L1/L1/L for α<(2−γ)dα< (2-γ)dα<(2−γ)d. These bounds extend to the minimum circuit depth required for state preparation, assuming two-qubit gate speeds scale as 1/rα1/r^α1/rα. We further show that these bounds are saturable, up to sub-polynomial corrections, for all ααα at the Heisenberg limit (γ=1γ=1γ=1) and for α>(2−γ)dα> (2-γ)dα>(2−γ)d when γ<1γ<1γ<1. Our results establish a benchmark for the time-optimality of protocols that prepare metrologically useful quantum states.
The propagation of information in nonrelativistic quantum systems obeys a speed limit known as a Lieb-Robinson bound.We derive a new Lieb-Robinson bound for systems with interactions that decay with distance r as a power law, 1=r α .The bound implies an effective light cone tighter than all previous bounds.Our approach is based on a technique for approximating the time evolution of a system, which was first introduced as part of a quantum simulation algorithm by Haah et al., FOCS'18.To bound the error of the approximation, we use a known Lieb-Robinson bound that is weaker than the bound we establish.This result brings the analysis full circle, suggesting a deep connection between Lieb-Robinson bounds and digital quantum simulation.In addition to the new Lieb-Robinson bound, our analysis also gives an error bound for the Haah et al. quantum simulation algorithm when used to simulate power-law decaying interactions.In particular, we show that the gate count of the algorithm scales with the system size better than existing algorithms when α > 3D (where D is the number of dimensions).
The N-qubit Greenberger-Horne-Zeilinger (GHZ) state is an important resource for quantum technologies. We consider the task of GHZ encoding using all-to-all interactions, which prepares the GHZ state in a special case, and is furthermore useful for quantum error correction, interaction-rate enhancement, and transmitting information using power-law interactions. The naive protocol based on parallelizing cnot gates takes O(1)-time of Hamiltonian evolution. In this work, we propose a fast protocol that achieves GHZ encoding with high accuracy. The evolution time O(log^{2}N/N) almost saturates the theoretical limit Ω(logN/N). Moreover, the final state is close to the ideal encoded one with high fidelity >1-10^{-3}, up to large system sizes N≲2000. The protocol only requires a few stages of time-independent Hamiltonian evolution; the key idea is to use the data qubit as control, and to use fast spin-squeezing dynamics generated by e.g., two-axis twisting.
Experimental systems with power-law interactions have recently garnered interest as promising platforms for quantum information processing. Such systems are capable of spreading entanglement superballistically and achieving an asymptotic speed-up over locally interacting systems. Recently, protocols developed by Eldredge et al. [Phys. Rev. Lett. 119, 170503 (2017)] and Tran et al. [Phys. Rev. X 11, 031016 (2021)] for the task of transferring a quantum state between distant particles quickly were shown to be optimal and saturate theoretical bounds. However, the implementation of these protocols in physical systems with long-range interactions remains to be fully realized. In this work, we provide an experimental roadmap towards realizing fast state-transfer protocols in three classes of atomic and molecular systems with dipolar interactions: polar molecules composed of alkali-metal dimers, neutral atoms in excited Rydberg states, and atoms with strong magnetic moments (e.g. dysprosium). As a guide to near-term experimental implementation, we numerically evaluate the tradeoffs between the two protocols for small system sizes and develop methods to address potential crosstalk errors that may arise during the execution of the protocols.