arXiv:2505.18254

Time Independence Does Not Limit Information Flow. II. The Case with Ancillas

T. C. Mooney, Yuan Dong, Adam Ehrenberg, Christopher L. Baldwin, Alexey Vyacheslavovich Gorshkov, Andrew M. Childs

Published May 23, 2025• 0 citations

Abstract

While the impact of locality restrictions on quantum dynamics and algorithmic complexity has been well studied in the general case of time-dependent Hamiltonians, the capabilities of time-independent protocols are less well understood. Using clock constructions, we show that the light cone for time-independent Hamiltonians, as captured by Lieb-Robinson bounds, is the same as that for time-dependent systems when local ancillas are allowed. More specifically, we develop time-independent protocols for approximate quantum state transfer with the same run-times as their corresponding time-dependent protocols. Given any piecewise-continuous Hamiltonian, our construction gives a time-independent Hamiltonian that implements its dynamics in the same time, up to error $\varepsilon$, at the cost of introducing a number of local ancilla qubits for each data qubit that is polylogarithmic in the number of qubits, the norm of the Hamiltonian and its derivative (if it exists), the run time, and $1/\varepsilon$. We apply this construction to state transfer for systems with power-law-decaying interactions and one-dimensional nearest-neighbor systems with disordered interaction strengths. In both cases, this gives time-independent protocols with the same optimal light-cone-saturating run-times as their time-dependent counterparts.

DOI: 10.48550/arxiv.2505.18254

Related papers

Time Independence Does Not Limit Information Flow. I. The Free-Particle Case

Yuan, Dong, Yin Chao, T. C. Mooney +3 more

arXiv:2505.18249May 23, 20250 citations

Robustness-Runtime Tradeoff for Quantum State Transfer

Twesh Upadhyaya, Yifan Hong, T. C. Mooney +1 more

quant-pharXiv:2602.22312Feb 27, 20260 citations

Lieb-Robinson Light Cone for Power-Law Interactions

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

arXiv:2103.15828Physical Review LettersOct 11, 202188 citations

Locality and Digital Quantum Simulation of Power-Law Interactions

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

arXiv:1808.05225Physical Review XJul 10, 201999 citations

Time-Dependent Hamiltonian Simulation with Optimal Query Complexity

Boyang Chen, Minbo Gao, Xinzhao Wang +1 more

quant-pharXiv:2608.06094Aug 7, 20260 citations

Optimal Frobenius light cone in spin chains with power-law interactions

Chi-Fang Chen, Andrew Lucas

arXiv:2105.09960Physical Review ADec 13, 202118 citations

arXiv:2505.18254

Time Independence Does Not Limit Information Flow. II. The Case with Ancillas

T. C. Mooney, Yuan Dong, Adam Ehrenberg, Christopher L. Baldwin, Alexey Vyacheslavovich Gorshkov, Andrew M. Childs

Published May 23, 2025• 0 citations

arXiv HTML PDF

Abstract

\varepsilon

, at the cost of introducing a number of local ancilla qubits for each data qubit that is polylogarithmic in the number of qubits, the norm of the Hamiltonian and its derivative (if it exists), the run time, and

1/\varepsilon

. We apply this construction to state transfer for systems with power-law-decaying interactions and one-dimensional nearest-neighbor systems with disordered interaction strengths. In both cases, this gives time-independent protocols with the same optimal light-cone-saturating run-times as their time-dependent counterparts.

DOI: 10.48550/arxiv.2505.18254

Related papers

Time Independence Does Not Limit Information Flow. I. The Free-Particle Case

Yuan, Dong, Yin Chao, T. C. Mooney +3 more

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.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.

arXiv:2505.18249May 23, 20250 citations

Robustness-Runtime Tradeoff for Quantum State Transfer

Twesh Upadhyaya, Yifan Hong, T. C. Mooney +1 more

Quantum state transfer is the primitive of transporting an unknown state on one site of a lattice to another. Using power-law interactions, recent state transfer protocols achieve speedup by utilizing the intermediate ancilla sites. However, these protocols require the ancillas to be in a perfectly initialized state, which, due to noise or imperfect control, may not be the case. In this work we introduce the $\textit{robustness}$ of a state transfer protocol, which quantifies the protocol's tolerance to error in the initial ancilla state. In the Heisenberg picture, state transfer grows operators supported on the final site such that they no longer commute with all operators on the starting site. We prove that this robustness tightly bounds the Schatten $p$ -norms of these commutators between initial and final-site operators. This generalizes the known cases of $p=\infty$ and $p=2$ , which govern completely state-dependent and state-independent state transfer respectively, demonstrating that intermediate values of $p$ govern partially state-dependent state transfer. In conjunction with existing power-law light cones, our result gives new minimum runtimes for partially state-dependent protocols which, in certain regimes, are parametrically better than existing bounds. We introduce new robust state transfer protocols, charting the landscape between complete state-dependence and state-independence.Quantum state transfer is the primitive of transporting an unknown state on one site of a lattice to another. Using power-law interactions, recent state transfer protocols achieve speedup by utilizing the intermediate ancilla sites. However, these protocols require the ancillas to be in a perfectly initialized state, which, due to noise or imperfect control, may not be the case. In this work we introduce the $\textit{robustness}$ of a state transfer protocol, which quantifies the protocol's tolerance to error in the initial ancilla state. In the Heisenberg picture, state transfer grows operators supported on the final site such that they no longer commute with all operators on the starting site. We prove that this robustness tightly bounds the Schatten $p$-norms of these commutators between initial and final-site operators. This generalizes the known cases of $p=\infty$ and $p=2$, which govern completely state-dependent and state-independent state transfer respectively, demonstrating that intermediate values of $p$ govern partially state-dependent state transfer. In conjunction with existing power-law light cones, our result gives new minimum runtimes for partially state-dependent protocols which, in certain regimes, are parametrically better than existing bounds. We introduce new robust state transfer protocols, charting the landscape between complete state-dependence and state-independence.

quant-pharXiv:2602.22312Feb 27, 20260 citations

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.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.15828Physical Review LettersOct 11, 202188 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).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.05225Physical Review XJul 10, 201999 citations

Time-Dependent Hamiltonian Simulation with Optimal Query Complexity

Boyang Chen, Minbo Gao, Xinzhao Wang +1 more

We give a query-optimal algorithm for simulating a general $n$ -qubit time-dependent Hamiltonian $H(t)$ on $[0,T]$ , assuming that $H$ is Lipschitz continuous and $\|H(t)\|\leqα$ . In the standard $\mathrm{HAM\mbox{-}T}$ access model, the algorithm approximates the time-ordered propagator $U_H(T)$ to error $\varepsilon$ using $O\left( αT+\frac{\log(1/\varepsilon)} {\log(e+\log(1/\varepsilon)/(αT))} \right)$ $\mathrm{HAM\mbox{-}T}$ queries. This matches the known query lower bound for time-independent Hamiltonians, showing that time dependence incurs no asymptotic query overhead. Our method first constructs a one-query transducer that, given an auxiliary state, implements an approximation to $U_H(T)$ and returns the state unchanged. A weighted combination of circuits that apply the transducer different numbers of times makes the error caused by omitting this state decay factorially, yielding the stated optimal precision dependence. For time-independent Hamiltonians, the same method also gives a query-optimal alternative to qubitization.We give a query-optimal algorithm for simulating a general $n$-qubit time-dependent Hamiltonian $H(t)$ on $[0,T]$, assuming that $H$ is Lipschitz continuous and $\|H(t)\|\leqα$. In the standard $\mathrm{HAM\mbox{-}T}$ access model, the algorithm approximates the time-ordered propagator $U_H(T)$ to error $\varepsilon$ using $$ O\left( αT+\frac{\log(1/\varepsilon)} {\log(e+\log(1/\varepsilon)/(αT))} \right) $$ $\mathrm{HAM\mbox{-}T}$ queries. This matches the known query lower bound for time-independent Hamiltonians, showing that time dependence incurs no asymptotic query overhead. Our method first constructs a one-query transducer that, given an auxiliary state, implements an approximation to $U_H(T)$ and returns the state unchanged. A weighted combination of circuits that apply the transducer different numbers of times makes the error caused by omitting this state decay factorially, yielding the stated optimal precision dependence. For time-independent Hamiltonians, the same method also gives a query-optimal alternative to qubitization.

quant-pharXiv:2608.06094Aug 7, 20260 citations

Optimal Frobenius light cone in spin chains with power-law interactions

Chi-Fang Chen, Andrew Lucas

In many-body quantum systems with spatially local interactions, quantum information propagates with a finite velocity, reminiscent of the ``light cone'' of relativity. In systems with long-range interactions which decay with distance $r$ as $1/{r}^{\ensuremath{\alpha}}$, however, there are multiple light cones which control different information theoretic tasks. We show an optimal (up to logarithms) ``Frobenius light cone'' obeying $t\ensuremath{\sim}{r}^{min(\ensuremath{\alpha}\ensuremath{-}1,1)}$ for $\ensuremath{\alpha}>1$ in one-dimensional power-law interacting systems with finite local dimension: this controls, among other physical properties, the butterfly velocity characterizing many-body chaos and operator growth. We construct an explicit random Hamiltonian protocol that saturates the bound and settles the optimal Frobenius light cone in one dimension. We partially extend our constraints on the Frobenius light cone to a several operator $p$ -norms, and show that Lieb-Robinson bounds can be saturated in at most an exponentially small ${e}^{\ensuremath{-}\mathrm{\ensuremath{\Omega}}(r)}$ fraction of the many-body Hilbert space.In many-body quantum systems with spatially local interactions, quantum information propagates with a finite velocity, reminiscent of the ``light cone'' of relativity. In systems with long-range interactions which decay with distance $r$ as $1/{r}^{\ensuremath{\alpha}}$, however, there are multiple light cones which control different information theoretic tasks. We show an optimal (up to logarithms) ``Frobenius light cone'' obeying $t\ensuremath{\sim}{r}^{min(\ensuremath{\alpha}\ensuremath{-}1,1)}$ for $\ensuremath{\alpha}>1$ in one-dimensional power-law interacting systems with finite local dimension: this controls, among other physical properties, the butterfly velocity characterizing many-body chaos and operator growth. We construct an explicit random Hamiltonian protocol that saturates the bound and settles the optimal Frobenius light cone in one dimension. We partially extend our constraints on the Frobenius light cone to a several operator $p$-norms, and show that Lieb-Robinson bounds can be saturated in at most an exponentially small ${e}^{\ensuremath{-}\mathrm{\ensuremath{\Omega}}(r)}$ fraction of the many-body Hilbert space.

arXiv:2105.09960Physical Review ADec 13, 202118 citations

\varepsilon

1/\varepsilon

\textit{robustness}

of a state transfer protocol, which quantifies the protocol's tolerance to error in the initial ancilla state. In the Heisenberg picture, state transfer grows operators supported on the final site such that they no longer commute with all operators on the starting site. We prove that this robustness tightly bounds the Schatten

p

-norms of these commutators between initial and final-site operators. This generalizes the known cases of

p=\infty

and

p=2

, which govern completely state-dependent and state-independent state transfer respectively, demonstrating that intermediate values of

p

govern partially state-dependent state transfer. In conjunction with existing power-law light cones, our result gives new minimum runtimes for partially state-dependent protocols which, in certain regimes, are parametrically better than existing bounds. We introduce new robust state transfer protocols, charting the landscape between complete state-dependence and state-independence.

We give a query-optimal algorithm for simulating a general

n

-qubit time-dependent Hamiltonian

H(t)

[0,T]

, assuming that

H

is Lipschitz continuous and

\|H(t)\|\leqα

. In the standard $\mathrm{HAM\mbox{-}T}$ access model, the algorithm approximates the time-ordered propagator

U_H(T)

to error

\varepsilon

using

O\left( αT+\frac{\log(1/\varepsilon)} {\log(e+\log(1/\varepsilon)/(αT))} \right)

$\mathrm{HAM\mbox{-}T}$ queries. This matches the known query lower bound for time-independent Hamiltonians, showing that time dependence incurs no asymptotic query overhead. Our method first constructs a one-query transducer that, given an auxiliary state, implements an approximation to

U_H(T)

and returns the state unchanged. A weighted combination of circuits that apply the transducer different numbers of times makes the error caused by omitting this state decay factorially, yielding the stated optimal precision dependence. For time-independent Hamiltonians, the same method also gives a query-optimal alternative to qubitization.

r

as $1/{r}^{\ensuremath{\alpha}}$, however, there are multiple light cones which control different information theoretic tasks. We show an optimal (up to logarithms) ``Frobenius light cone'' obeying $t\ensuremath{\sim}{r}^{min(\ensuremath{\alpha}\ensuremath{-}1,1)}$ for $\ensuremath{\alpha}>1$ in one-dimensional power-law interacting systems with finite local dimension: this controls, among other physical properties, the butterfly velocity characterizing many-body chaos and operator growth. We construct an explicit random Hamiltonian protocol that saturates the bound and settles the optimal Frobenius light cone in one dimension. We partially extend our constraints on the Frobenius light cone to a several operator

p

-norms, and show that Lieb-Robinson bounds can be saturated in at most an exponentially small ${e}^{\ensuremath{-}\mathrm{\ensuremath{\Omega}}(r)}$ fraction of the many-body Hilbert space.