arXiv subjects

Sasha Sami

Publications and source records attributed to Sasha Sami.

5 recordsLinked to original sources

arXiv2026

Understanding Robust Catalytic Computing

Catalytic computing concerns space bounded computation which starts with memory full of data that have to be restored by the end of the computation. Lossy catalytic computing, defined by Gupta et al. (2024) and fully characterized by Folkertsma et al. (ITCS 2025), is the study of allowing a small number of errors when resetting the catalytic tape at the end of a computation. Such a notion is useful when considering the robust use of catalytic techniques in the study of ordinary space-bounded algorithms. To that end however, defining and characterizing less strict notions of error was left open by Folkertsma et al. (ITCS 2025) and other works such as Mertz (B. EATCS, 2023). We expand the definition of possible resetting error in three natural ways: 1. randomized catalytic computation which can completely destroy the catalytic tape with some probability over the randomness 2. randomized catalytic computation which makes a bounded number of errors in expectation over the randomness 3. deterministic catalytic computation which makes a bounded number of errors in expectation over the initial catalytic tape itself We show a near complete characterization of the above models, both in the general case and in the logspace polynomial-time regime, by showing equivalences either between one another, to errorless catalytic space models, or to standard time or space complexity classes. Under a derandomization assumption, we show a near full collapse of all existing catalytic classes in the logspace regime.

cs.CC↗

arXiv2025

Collapsing Catalytic Classes

A catalytic machine is a space-bounded Turing machine with additional access to a second, much larger work tape, with the caveat that this tape is full, and its contents must be preserved by the computation. Catalytic machines were defined by Buhrman et al. (STOC 2014), who, alongside many follow-up works, exhibited the power of catalytic space ($CSPACE$) and in particular catalytic logspace machines ($CL$) beyond that of traditional space-bounded machines. Several variants of $CL$ have been proposed, including non-deterministic and co-non-deterministic catalytic computation by Buhrman et al. (STACS 2016) and randomized catalytic computation by Datta et al. (CSR 2020). These and other works proposed several questions, such as catalytic analogues of the theorems of Savitch and Immerman and Szelepcs\'enyi. Catalytic computation was recently derandomized by Cook et al. (STOC 2025), but only in certain parameter regimes. We settle almost all questions regarding randomized and non-deterministic catalytic computation, by giving an optimal reduction from catalytic space with additional resources to the corresponding non-catalytic space classes. With regards to non-determinism, our main result is that \[CL=CNL\] and with regards to randomness we show \[CL=CPrL\] where $CPrL$ denotes randomized catalytic logspace where the accepting probability can be arbitrarily close to $1/2$. We also have a number of near-optimal partial results for non-deterministic and randomized catalytic computation with less catalytic space. We show catalytic versions of Savitch's theorem, Immerman-Szelepsc\'enyi, and the derandomization results of Nisan and Saks and Zhou, all of which are unconditional and hold for all parameter settings. Our results build on the compress-or-compute framework of Cook et al. (STOC 2025). Despite proving broader and stronger results, our framework is simpler and more modular.

cs.CC↗

arXiv2017

Complementarity of genuine multipartite non-locality

We introduce a new feature of no-signaling (Bell) non-local theories, namely, when a system of multiple parties manifests genuine non-local correlation, then there cannot be arbitrarily high non-local correlation among any subset of the parties. We call this feature, \textit{complementarity of genuine multipartite non-locality}. We use Svetlichny's criterion for genuine multipartite non-locality and non-local games to derive the complementarity relations under no-signaling constraints. We find that the complementarity relations are tightened for the much stricter quantum constraints. We compare this notion with the well-known notion of \textit{monogamy of non-locality}. As a consequence, we obtain tighter non-trivial monogamy relations that take into account genuine multipartite non-locality. Furthermore, we provide numerical evidence showcasing this feature using a bipartite measure and several other well-known tripartite measures of non-locality.

quant-ph↗

arXiv2016

A note on superposition of two unknown states using Deutsch CTC model

In a recent work, authors prove a yet another no-go theorem that forbids the existence of a universal probabilistic quantum protocol producing a superposition of two unknown quantum states. In this short note, we show that in the presence of closed time like curves, one can indeed create superposition of unknown quantum states and evade the no-go result.

quant-ph↗

arXiv2015

$Om$ diagnostic applied to scalar field models and slowing down of cosmic acceleration

We apply the $Om$ diagnostic to models for dark energy based on scalar fields. In case of the power law potentials, we demonstrate the possibility of slowing down the expansion of the Universe around the present epoch for a specific range in the parameter space. For these models, we also examine the issues concerning the age of Universe. We use the $Om$ diagnostic to distinguish the $Λ$CDM model from non minimally coupled scalar field, phantom field and generic quintessence models. Our study shows that the $Om$ has zero, positive and negative curvatures for $Λ$CDM, phantom and quintessence models respectively. We use an integrated data base (SN+Hubble+BAO+CMB) for bservational analysis and demonstrate that $Om$ is a useful diagnostic to apply to observational data.

astro-ph.CO↗