Related papers: Time and Space Bounds for Reversible Simulation

Given a set of numbers, the $k$-SUM problem asks for a subset of $k$ numbers that sums to zero. When the numbers are integers, the time and space complexity of $k$-SUM is generally studied in the word-RAM model; when the numbers are reals,…

Frauchiger and Renner recently cast doubt on the universal applicability of Quantum Mechanics [1]. In the following, it is pointed out that their conclusion of one of three common-sense conditions, demanded for Quantum Mechanics, being…

Conventional vector-based simulators for quantum computers are quite limited in the size of the quantum circuits they can handle, due to the worst-case exponential growth of even sparse representations of the full quantum state vector as a…

We investigate the existence of solutions of reversible and irreversible port-Hamiltonian systems. To this end, we utilize the associated exergy, a function that is composed of the system's Hamiltonian and entropy, to prove global existence…

We study contextual bandits in the presence of a stage-wise constraint when the constraint must be satisfied both with high probability and in expectation. We start with the linear case where both the reward function and the stage-wise…

In this paper, we prove the first Bayesian regret bounds for Thompson Sampling in reinforcement learning in a multitude of settings. We simplify the learning problem using a discrete set of surrogate environments, and present a refined…

Motivated by the success of bounded model checking framework for finite state machines, Ouaknine and Worrell proposed a time-bounded theory of real-time verification by claiming that restriction to bounded-time recovers decidability for…

We study the possibility to undo the quantum mechanical evolution in a time reversal experiment. The naive expectation, as reflected in the common terminology ("Loschmidt echo"), is that maximum compensation results if the reversed dynamics…

Framing computation as the transformation of metastable memories, we explore its fundamental thermodynamic limits. The true power of information follows from a novel decomposition of nonequilibrium free energy derived here, which provides a…

We explore bounds of {\em time-space tradeoffs} in language recognition on {\em two-way finite automata} for some special languages. We prove: (1) a time-space tradeoff upper bound for recognition of the languages $L_{EQ}(n)$ on {\em…

We review the superspace technique to determine supersymmetric spacetimes in the framework of off-shell formulations for supergravity in diverse dimensions using the case of 3D N=2 supergravity theories as an illustrative example. This…

In function inversion, we are given a function $f: [N] \mapsto [N]$, and want to prepare some advice of size $S$, such that we can efficiently invert any image in time $T$. This is a well studied problem with profound connections to…

We give a bound on the mixing time of a uniformly ergodic, reversible Markov chain in terms of the spectral radius of the transition operator. This bound has been established previously in finite state spaces, and is widely believed to hold…

Policy evaluation in reinforcement learning is often conducted using two-timescale stochastic approximation, which results in various gradient temporal difference methods such as GTD(0), GTD2, and TDC. Here, we provide convergence rate…

We consider a MapReduce-like distributed computing system. We derive a lower bound on the communication cost for any given storage and computation costs. This lower bound matches the achievable bound we proposed recently. As a result, we…

Various quantum thermodynamic bounds are shown to stem from a single tighter and more general inequality, consequence of the operator concavity of the logarithmic function. Such an inequality, which we call the "thermodynamic reverse…

The upper bound on the capacity of a 3-node discrete memoryless relay channel is considered, where a source X wants to send information to destination Y with the help of a relay Z. Y and Z are independent given X, and the link from Z to Y…

Motivated by an influential result of Bourgain and Tzafriri, we consider continuous matrix functions $A:\mathbb{R}\to M_{n\times n}$ and lower $\ell_2$-norm bounds associated with their restriction to certain subspaces. We prove that for…

A general formal definition of a theory of space and time compatible with the inertia principle is given. The formal definition of reference frame and inertial equivalence between reference frames are used to construct the class of inertial…

We present an efficient reduction from the Bounded integer programming (BIP) to the Subspace avoiding problem (SAP) in lattice theory. The reduction has some special properties with some interesting consequences. The first is the new upper…