Professor Andrew Daley

Abstract:

Capturing non-Markovian dynamics of open quantum systems is generally a challenging problem, especially for strongly interacting many-body systems. In this Letter, we combine recently developed non-Markovian quantum state diffusion techniques with tensor network methods to address this challenge. As a first example, we explore a Hubbard-Holstein model with dissipative phonon modes, where this new approach allows us to quantitatively assess how correlations spread in the presence of non-Markovian dissipation in a 1D many-body system. We find regimes where correlation growth can be enhanced by these effects, offering new routes for dissipatively enhancing transport and correlation spreading, relevant for both solid state and cold atom experiments.

Abstract:

We explore the relationship between symmetrization and entanglement through measurements on few-particle systems in a multiwell potential. In particular, considering two or three trapped atoms, we measure and distinguish correlations arising from two different physical origins: antisymmetrization of the fermionic wave function and interaction between particles. We quantify this through the entanglement negativity of states, and the introduction of an antisymmetric negativity, which allows us to understand the role that symmetrization plays in the measured entanglement properties. We apply this concept both to pure theoretical states and to experimentally reconstructed density matrices of two or three mobile particles in an array of optical tweezers.

Abstract:

Neutral atom arrays provide a versatile platform to implement coherent quantum annealing as an approach to solving hard combinatorial optimization problems. Here we present and experimentally demonstrate an efficient encoding scheme based on chains of Rydberg-blockaded atoms, which we call quantum wires, to natively embed maximum weighted independent set (MWIS) and quadratic unconstrained binary optimization (QUBO) problems on a neutral atom architecture. For graphs with quasi-unit-disk connectivity, in which only a few long-range edges are required, our approach requires a significantly lower overhead in the number of ancilla qubits than previous proposals, facilitating the implementation on currently available hardware. To demonstrate the approach, we perform annealing of weighted graphs on a programmable atom array using local light shifts to encode problem-specific weights across graphs of varying sizes. This approach successfully identifies the solutions to the original MWIS and QUBO graph instances. Our work expands the operational toolkit of near-term neutral atom arrays, enhancing their potential for scalable quantum optimization.