Related papers: Computing Functional and Relational Box Consistenc…

The fundamental tension between availability and consistency shapes the design of distributed storage systems. Classical results capture extreme points of this trade-off: the CAP theorem shows that strong models like linearizability…

We show within the framework of relativistic quantum tasks that the doability of any task is fully determined by a small subset of its parameters that we call its "coarse causal structure", as well as the distributed computation it aims to…

Spatial constraint systems (scs) are semantic structures for reasoning about spatial and epistemic information in concurrent systems. We develop the theory of scs to reason about the distributed information of potentially infinite groups.…

While linearizability is a fundamental correctness condition for distributed systems, ensuring the linearizability of implementations can be quite complex. An essential aspect of linearizable implementations of concurrent objects is the…

Atomic scale simulations are a key element of modern science in that they allow to understand, and even predict, complex physical or chemical phenomena on the basis of the fundamental laws of nature. Among the different existing atomic…

Quantum three box paradox is a prototypical example of some bizarre predictions for intermediate measurements made on pre- and post-selected systems. Although in principle those effects can be explained by measurement disturbance, it is not…

The development of distributed systems requires developers to balance the need for consistency, availability, and partition tolerance. Conflict-free replicated data types (CRDTs) are widely used in eventually consistent systems to reduce…

Communication scenarios between two parties can be implemented by first encoding messages into some states of a physical system which acts as the physical medium of the communication and then decoding the messages by measuring the state of…

Causal consistency is one of the most adopted consistency criteria for distributed implementations of data structures. It ensures that operations are executed at all sites according to their causal precedence. We address the issue of…

Quantum theory is in principle compatible with scenarios where physical processes occur in an indefinite order, potentially yielding advantages in a broad range of information processing tasks. However, advantages in communication, the most…

To improve the utility of learning applications and render machine learning solutions feasible for complex applications, a substantial amount of heavy computations is needed. Thus, it is essential to delegate the computations among several…

Compressed sensing has become a widely accepted paradigm to construct high dimensional cluster expansion models used for statistical mechanical studies of atomic configuration in complex multicomponent crystalline materials. However, strict…

In large scale systems such as the Internet, replicating data is an essential feature in order to provide availability and fault-tolerance. Attiya and Welch proved that using strong consistency criteria such as atomicity is costly as each…

The stationary distribution of a fully chaotic system typically exhibits a fractal structure, which dramatically changes if the dynamical equations are even slightly modified. Perturbative techniques are not expected to work in this…

Computer systems can be found everywhere: in space, in our homes, in our cars, in our pockets, and sometimes even in our own bodies. For concerns of safety, economy, and convenience, it is important that such systems work correctly.…

Bosonic quantum systems operate in an infinite-dimensional Hilbert space, unlike discrete-variable quantum systems. This distinct mathematical structure leads to fundamental differences in quantum information processing, such as an…

This paper studies peek arc consistency, a reasoning technique that extends the well-known arc consistency technique for constraint satisfaction. In contrast to other more costly extensions of arc consistency that have been studied in the…

Quantum algorithms for simulation of Hamiltonian evolution are often based on product formulae. The fractal methods give a systematic way to find arbitrarily high-order product formulae, but result in a large number of exponentials. On the…

The well-posedness and regularity properties of diffusion-aggregation equations, emerging from interacting particle systems, are established on the whole space for bounded interaction force kernels by utilizing a compactness convergence…

Cloud storage systems have been introduced to provide a scalable, secure, reliable, and highly available data storage environment for the organizations and end-users. Therefore, the service provider should grow in a geographical extent.…