Related papers: Bounded time computation on metric spaces and Bana…
We introduce the notion of cotype of a metric space, and prove that for Banach spaces it coincides with the classical notion of Rademacher cotype. This yields a concrete version of Ribe's theorem, settling a long standing open problem in…
The isometric universality of the spaces $C(K)$ for $K$ a non scattered Hausdorff compact does not take into account the ``quality'' of the representation. Indeed, the existence of an isometric copy of a separable Banach space $X$ into…
We will give an outline of the main results in our recent AMS Memoir, and include some new results, exposition and open problems. In that memoir we developed a general dilation theory for operator valued measures acting on Banach spaces…
Quantum reservoir computing is a computing approach which aims at utilising the complexity and high-dimensionality of small quantum systems, together with the fast trainability of reservoir computing, in order to solve complex tasks. The…
Given a category of objects, it is both useful and important to know if all the objects in the category may be realised as sub-objects -- via morphisms in the given category -- of a single object in that category enjoying some nice…
Binary embeddings provide efficient and powerful ways to perform operations on large scale data. However binary embedding typically requires long codes in order to preserve the discriminative power of the input space. Thus binary coding…
The performance, reliability, cost, size and energy usage of computing systems can be improved by one or more orders of magnitude by the systematic use of modern control and optimization methods. Computing systems rely on the use of…
Motivated by understanding the power of quantum computation with restricted number of qubits, we give two complete characterizations of unitary quantum space bounded computation. First we show that approximating an element of the inverse of…
We provide a concise proof of existence for nonlinear operator equations in separable Banach spaces. Notably, the operator is not assumed to be monotone. Instead, our main hypotheses consist of a continuity assumption and a generalized…
In this paper we study MapReduce computations from a complexity-theoretic perspective. First, we formulate a uniform version of the MRC model of Karloff et al. (2010). We then show that the class of regular languages, and moreover all of…
The difficulty of explaining non-local correlations in a fixed causal structure sheds new light on the old debate on whether space and time are to be seen as fundamental. Refraining from assuming space-time as given a priori has a number of…
We consider the time and space required for quantum computers to solve a wide variety of problems involving matrices, many of which have only been analyzed classically in prior work. Our main results show that for a range of linear algebra…
In this paper, we propose a metric on the space of finite sets of trajectories for assessing multi-target tracking algorithms in a mathematically sound way. The main use of the metric is to compare estimates of trajectories from different…
We investigate different notions of "computable topological base" for represented spaces. We show that several non-equivalent notions of bases become equivalent when we consider computably enumerable bases. This indicates the existence of a…
We present different extensions of the Banach contraction principle in the $G$-metric space setting. More precisely, we consider mappings for which the contractive condition is satisfied by a power of the mapping and for which the power…
For a fixed $K\gg 1$ and $n\in\mathbb{N}$, $n\gg 1$, we study metric spaces which admit embeddings with distortion $\le K$ into each $n$-dimensional Banach space. Classical examples include spaces embeddable into $\log n$-dimensional…
We discuss the interdependence of resource state, measurement setting and temporal order in measurement-based quantum computation. The possible temporal orders of measurement events are constrained by the principle that the randomness…
We extend the Theory of Computation on real numbers, continuous real functions, and bounded closed Euclidean subsets, to compact metric spaces $(X,d)$: thereby generically including computational and optimization problems over higher types,…
Robustness is a property of system analyses, namely monotonic maps from the complete lattice of subsets of a (system's state) space to the two-point lattice. The definition of robustness requires the space to be a metric space. Robust…
We prove that conformal curved spacetime can be encoded into the initial wave function and that curved propagation can be simulated on a two-dimensional regular lattice with a finite set of homogeneous unitary operators. We generalize…