Infinite towers of supertranslation and superrotation memories

A framework that structures the gravitational memory effects and which is consistent with gravitational electric-magnetic duality is presented. A correspondence is described between memory observables, particular subleading residual gauge transformations, associated overleading gauge transformations and their canonical surface charges. It is shown that matter-induced transitions can generate infinite towers of independent memory effects at null infinity. These memories are associated with an infinite number of conservation laws at spatial infinity which lead to degenerate towers of subleading soft graviton theorems. It is shown that the leading order mutually commuting supertranslations and (novel) superrotations are both associated with a leading displacement memory effect, which suggests the existence of new boundary conditions.Comment: 5 pages. Proof of existence of towers of memories added. To be published in PR

String Memory Effect

In systems with local gauge symmetries, the memory effect corresponds to traces inscribed on a suitable probe when a pure gauge configuration at infinite past dynamically evolves to another pure gauge configuration at infinite future. In this work, we study the memory effect of 2-form gauge fields which is probed by strings. We discuss the "string memory effect" for closed and open strings at classical and quantum levels. The closed string memory is encoded in the internal excited modes of the string, and in the open string case, it is encoded in the relative position of the two endpoints and the noncommutativity parameter associated with the D-brane where the open string endpoints are attached. We also discuss 2-form memory with D-brane probes using boundary state formulation and, the relation between string memory and 2-form soft charges analyzed in [1]

Mixing Probabilistic and non-Probabilistic Objectives in Markov Decision Processes

In this paper, we consider algorithms to decide the existence of strategies in MDPs for Boolean combinations of objectives. These objectives are omega-regular properties that need to be enforced either surely, almost surely, existentially, or with non-zero probability. In this setting, relevant strategies are randomized infinite memory strategies: both infinite memory and randomization may be needed to play optimally. We provide algorithms to solve the general case of Boolean combinations and we also investigate relevant subcases. We further report on complexity bounds for these problems.Comment: Paper accepted to LICS 2020 - Full versio

Processes with Long Memory: Regenerative Construction and Perfect Simulation

We present a perfect simulation algorithm for stationary processes indexed by Z, with summable memory decay. Depending on the decay, we construct the process on finite or semi-infinite intervals, explicitly from an i.i.d. uniform sequence. Even though the process has infinite memory, its value at time 0 depends only on a finite, but random, number of these uniform variables. The algorithm is based on a recent regenerative construction of these measures by Ferrari, Maass, Mart{\'\i}nez and Ney. As applications, we discuss the perfect simulation of binary autoregressions and Markov chains on the unit interval.Comment: 27 pages, one figure. Version accepted by Annals of Applied Probability. Small changes with respect to version

Exploring an Infinite Space with Finite Memory Scouts

Consider a small number of scouts exploring the infinite $d$-dimensional grid with the aim of hitting a hidden target point. Each scout is controlled by a probabilistic finite automaton that determines its movement (to a neighboring grid point) based on its current state. The scouts, that operate under a fully synchronous schedule, communicate with each other (in a way that affects their respective states) when they share the same grid point and operate independently otherwise. Our main research question is: How many scouts are required to guarantee that the target admits a finite mean hitting time? Recently, it was shown that $d + 1$ is an upper bound on the answer to this question for any dimension $d \geq 1$ and the main contribution of this paper comes in the form of proving that this bound is tight for $d \in \{ 1, 2 \}$.Comment: Added (forgotten) acknowledgement

Improved transfer of quantum information using a local memory

We demonstrate that the quantum communication between two parties can be significantly improved if the receiver is allowed to store the received signals in a quantum memory before decoding them. In the limit of an infinite memory, the transfer is perfect. We prove that this scheme allows the transfer of arbitrary multipartite states along Heisenberg chains of spin-1/2 particles with random coupling strengths.Comment: 4 pages, 1 figure; added references to homogenization and asymptotic completenes