Related papers: How to Obtain Computational Completeness in P Syst…
There are many evaluation strategies for term rewrite systems, but automatically proving termination or analyzing complexity is usually easiest for innermost rewriting. Several syntactic criteria exist when innermost termination implies…
There are various physical scenarios in which one can only implement operations with a certain symmetry. Under such restriction, a system in a symmetry-breaking state can be used as a catalyst, e.g. to prepare another system in a desired…
Sequential hypothesis testing asks for decision rules that update as data arrive. A natural goal is \emph{eventual correctness}: the rule may change its mind early on, but it should make only finitely many wrong decisions almost surely.…
Catalytic coherence transformations allow the otherwise impossible state transformations using only incoherent operations with the aid of an auxiliary system with finite coherence which is not being consumed in anyway. Here we find the…
Membrane systems represent a computational model that operates in a distributed and parallel manner, inspired by the behavior of biological cells. These systems feature objects that transform within a nested membrane structure. This…
Quantum computing is a promising paradigm that may overcome the current computational power bottlenecks. The increasing maturity of quantum processors provides more possibilities for the development and implementation of quantum algorithms.…
We present photonic quantum computing architectures that can deal with both probabilistic (heralded) generation of single photons and probabilistic gates without making use of coherent switching. The only required dynamical element is the…
In this paper, we propose two new methods for solving Set Constraint Problems, as well as a potential polynomial solution for NP-Complete problems using quantum computation. While current methods of solving Set Constraint Problems focus on…
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…
Matrix completion aims to reconstruct a data matrix based on observations of a small number of its entries. Usually in matrix completion a single matrix is considered, which can be, for example, a rating matrix in recommendation system.…
Matrix completion problem has been previously studied under various adaptive and passive settings. Previously, researchers have proposed passive, two-phase and single-phase algorithms using coherence parameter, and multi phase algorithm…
The computing paradigm invented for processing a small amount of data on a single segregated processor cannot meet the challenges set by the present-day computing demands. The paper proposes a new computing paradigm (extending the old one…
Computational memory (CM) is a promising approach for accelerating inference on neural networks (NN) by using enhanced memories that, in addition to storing data, allow computations on them. One of the main challenges of this approach is…
Background: A classical problem in metabolic design is to maximize the production of desired compound in a given chemical reaction network by appropriately directing the mass flow through the network. Computationally, this problem is…
The resource theory of quantum coherence is an important topic in quantum information science. Standard coherence distillation and dilution problems have been thoroughly studied. In this paper, we introduce and study the problem of one-shot…
Membrane system computations proceed in a synchronous fashion: at each step all the applicable rules are actually applied. Hence each step depends on the previous one. This coarse view can be refined by looking at the dependencies among…
We prove a maximality theorem for one-parameter dynamical systems including multiplier one-parameter dynamical systems. Our main result is new even for one-parameter actions on commutative multiplier algebras including the algebra of…
This paper considers the problem of matrix completion when some number of the columns are completely and arbitrarily corrupted, potentially by a malicious adversary. It is well-known that standard algorithms for matrix completion can return…
In model predictive control (MPC) an optimization problem has to be solved at each time step, which in real-time applications makes it important to solve these optimization problems efficiently and to have good upper bounds on worst-case…
Polymorphic circuits are a special kind of circuits which possess some different build-in functions and these functions are activated by environment parameters, like light and VDD. Some theories have been proposed to guide the design of…