Understanding how information spreads in non-relativistic many-body systems is a central issue for quantum information processing. While short-range interactions confine information within a local light cone, long-range interactions typically lead to uncontrolled nonlocal spread across the entire system. Here, we demonstrate that this apparent dichotomy is not fundamental and that nonlocality in systems with long-range interactions can be deterministically controlled. By mapping spin dynamics to a hard-core boson chain, we identify a regime in which the causal space-time landscape can be precisely shaped. We show that placing spin excitations in a polarized background allows a local perturbation to trigger nonlocal signals exactly at the positions of these excitations. These pre-selected sites act as seeds for new, effective light cones, allowing information to bypass the bulk and re-emerge at distant, programmable locations. This mechanism avoids uncontrollable global nonlocality while circumventing the speed limits associated with local transport. By engineering these nonlocal communication channels, our findings offer a versatile framework for information distribution relevant to quantum memories, error correction, and programmable platforms such as trapped ions.Understanding how information spreads in non-relativistic many-body systems is a central issue for quantum information processing. While short-range interactions confine information within a local light cone, long-range interactions typically lead to uncontrolled nonlocal spread across the entire system. Here, we demonstrate that this apparent dichotomy is not fundamental and that nonlocality in systems with long-range interactions can be deterministically controlled. By mapping spin dynamics to a hard-core boson chain, we identify a regime in which the causal space-time landscape can be precisely shaped. We show that placing spin excitations in a polarized background allows a local perturbation to trigger nonlocal signals exactly at the positions of these excitations. These pre-selected sites act as seeds for new, effective light cones, allowing information to bypass the bulk and re-emerge at distant, programmable locations. This mechanism avoids uncontrollable global nonlocality while circumventing the speed limits associated with local transport. By engineering these nonlocal communication channels, our findings offer a versatile framework for information distribution relevant to quantum memories, error correction, and programmable platforms such as trapped ions.

cond-mat.stat-mechCross-listedarXiv:2511.22020Nov 28, 20250 citations

Temporal Non-locality

Thomas Filk A

Foundations of PhysicsJul 5, 201222 citations

Steered towards non-locality

Nicolas Brunner

Nature PhysicsSep 19, 20102 citations

Non-locality

WORLD SCIENTIFIC eBooksMar 1, 20250 citations

Controlization Schemes Based on Orthogonal Arrays

Anirban Ch Narayan Chowdhury, E. van den Berg, Paweł Wocjan

Realizing controlled operations is fundamental to the design and execution of quantum algorithms. In quantum simulation and learning of quantum many-body systems, an important subroutine consists of implementing a controlled Hamiltonian time-evolution. Given only black-box access to the uncontrolled evolution $e^{-iHt}$ , controlizing it, i.e., implementing $\mathrm{ctrl}(e^{-iHt}) = |0\rangle\langle 0|\otimes I + |1\rangle\langle 1 |\otimes e^{-iHt}$ is non-trivial. Controlization has been recently used in quantum algorithms for transforming unknown Hamiltonian dynamics [OKTM24] leveraging a scheme introduced in Refs. [NSM15, DNSM21]. The main idea behind the scheme is to intersperse the uncontrolled evolution with suitable operations such that the overall dynamics approximates the desired controlled evolution. Although efficient, this scheme uses operations randomly sampled from an exponentially large set. In the present work, we show that more efficient controlization schemes can be constructed with the help of orthogonal arrays for unknown 2-local Hamiltonians. We conduct a detailed analysis of their performance and demonstrate the resulting improvements through numerical experiments. This construction can also be generalized to $k$ -local Hamiltonians. Moreover, our controlization schemes based on orthogonal arrays can take advantage of the interaction graph's structure and be made more efficient.Realizing controlled operations is fundamental to the design and execution of quantum algorithms. In quantum simulation and learning of quantum many-body systems, an important subroutine consists of implementing a controlled Hamiltonian time-evolution. Given only black-box access to the uncontrolled evolution $e^{-iHt}$, controlizing it, i.e., implementing $\mathrm{ctrl}(e^{-iHt}) = |0\rangle\langle 0|\otimes I + |1\rangle\langle 1 |\otimes e^{-iHt}$ is non-trivial. Controlization has been recently used in quantum algorithms for transforming unknown Hamiltonian dynamics [OKTM24] leveraging a scheme introduced in Refs. [NSM15, DNSM21]. The main idea behind the scheme is to intersperse the uncontrolled evolution with suitable operations such that the overall dynamics approximates the desired controlled evolution. Although efficient, this scheme uses operations randomly sampled from an exponentially large set. In the present work, we show that more efficient controlization schemes can be constructed with the help of orthogonal arrays for unknown 2-local Hamiltonians. We conduct a detailed analysis of their performance and demonstrate the resulting improvements through numerical experiments. This construction can also be generalized to $k$-local Hamiltonians. Moreover, our controlization schemes based on orthogonal arrays can take advantage of the interaction graph's structure and be made more efficient.

arXiv:2407.09382Jul 12, 20240 citations

e^{-iHt}

, controlizing it, i.e., implementing

\mathrm{ctrl}(e^{-iHt}) = |0\rangle\langle 0|\otimes I + |1\rangle\langle 1 |\otimes e^{-iHt}

is non-trivial. Controlization has been recently used in quantum algorithms for transforming unknown Hamiltonian dynamics [OKTM24] leveraging a scheme introduced in Refs. [NSM15, DNSM21]. The main idea behind the scheme is to intersperse the uncontrolled evolution with suitable operations such that the overall dynamics approximates the desired controlled evolution. Although efficient, this scheme uses operations randomly sampled from an exponentially large set. In the present work, we show that more efficient controlization schemes can be constructed with the help of orthogonal arrays for unknown 2-local Hamiltonians. We conduct a detailed analysis of their performance and demonstrate the resulting improvements through numerical experiments. This construction can also be generalized to

k

-local Hamiltonians. Moreover, our controlization schemes based on orthogonal arrays can take advantage of the interaction graph's structure and be made more efficient.