Saved in:
| Main Authors: | , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2505.18254 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866909832802467840 |
|---|---|
| author | Mooney, T. C. Yuan, Dong Ehrenberg, Adam Baldwin, Christopher L. Gorshkov, Alexey V. Childs, Andrew M. |
| author_facet | Mooney, T. C. Yuan, Dong Ehrenberg, Adam Baldwin, Christopher L. Gorshkov, Alexey V. Childs, Andrew M. |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2505_18254 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Time Independence Does Not Limit Information Flow. II. The Case with Ancillas Mooney, T. C. Yuan, Dong Ehrenberg, Adam Baldwin, Christopher L. Gorshkov, Alexey V. Childs, Andrew M. Quantum Physics 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. |
| title | Time Independence Does Not Limit Information Flow. II. The Case with Ancillas |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2505.18254 |