Related papers: On the Holographic Geometry of Deterministic Compu…
Writing concurrent programs is notoriously hard due to scheduling non-determinism. The most common concurrency bugs are data races, which are accesses to a shared resource that can be executed concurrently. Dynamic data-race prediction is…
Determining the degree of inherent parallelism in classical sequential algorithms and leveraging it for fast parallel execution is a key topic in parallel computing, and detailed analyses are known for a wide range of classical algorithms.…
The holographic duality conjectures a relation between strongly coupled quantum systems and quantum gravity in higher-dimensional spacetimes. Gravitational theories in two and three dimensions are meaningful examples for classical and…
Reservoir computing is a machine learning paradigm that uses a structure called a reservoir, which has nonlinearities and short-term memory. In recent years, reservoir computing has expanded to new functions such as the autonomous…
In a temporal graph, each edge is available at specific points in time. Such an availability point is often represented by a ''temporal edge'' that can be traversed from its tail only at a specific departure time, for arriving in its head…
Holographic quantum error correcting codes (HQECC) have been proposed as toy models for the AdS/CFT correspondence, and exhibit many of the features of the duality. HQECC give a mapping of states and observables. However, they do not map…
We provide a background-independent formulation of the holographic principle. It permits the construction of embedded hypersurfaces (screens) on which the entire bulk information can be stored at a density of no more than one bit per Planck…
Given $n$ points in the plane, we propose algorithms to compile connected crossing-free geometric graphs into directed acyclic graphs (DAGs). The DAGs allow efficient counting, enumeration, random sampling, and optimization. Our algorithms…
Gantt charts are frequently used to explore execution traces of large-scale parallel programs found in high-performance computing (HPC). In these visualizations, each parallel processor is assigned a row showing the computation state of a…
We elaborate the idea of quantum computation through measuring the correlation of a gapped ground state, while the bulk Hamiltonian is utilized to stabilize the resource. A simple computational primitive, by pulling out a single spin…
Topological data analysis (TDA) aims to extract noise-robust features from a data set by examining the number and persistence of holes in its topology. We show that a computational problem closely related to a core task in TDA --…
In a previous work a procedure was decribed for dividing the $3 \times N$-dimensional conformational space of a molecular system into a number of discrete cells, this partition allowed the building of a combinatorial structure from data…
Large-scale simulations of time-dependent problems generate a massive amount of data and with the explosive increase in computational resources the size of the data generated by these simulations has increased significantly. This has…
Consider a graph problem that is locally checkable but not locally solvable: given a solution we can check that it is feasible by verifying all constant-radius neighborhoods, but to find a solution each node needs to explore the input graph…
In the conventional formalism of physics, with 1-time, systems with different Hamiltonians or Lagrangians have different physical interpretations and are considered to be independent systems unrelated to each other. However, in this paper…
An important conjecture within the AdS/CFT correspondence relates holographic spacetime to the quantum computational complexity of the dual quantum field theory. However, the quantitative understanding of this relation is still an open…
We show that holography imposes strong and general constraints on scalar field potentials in the string landscape, determined by the asymptotic structure of the underlying spacetime. Applying these holographic consistency conditions, we…
The power of real-time Turing machines using sublinear space is investigated. In contrast to a claim appearing in the literature, such machines can accept non-regular languages, even if working in deterministic mode. While maintaining a…
Parallel real-time systems (e.g., autonomous driving systems) often contain functionalities with complex dependencies and execution uncertainties, leading to significant timing variability which can be represented as a probabilistic…
In the distributed setting, the only existing constructions of \textit{sparse skeletons}, (i.e., subgraphs with $O(n)$ edges) either use randomization or large messages, or require $\Omega(D)$ time, where $D$ is the hop-diameter of the…