Related papers: Tomography of clock signals using the simplest pos…

The vast majority of hardware architectures use a carefully timed reference signal to clock their computational logic. However, standard distribution solutions are not fault-tolerant. In this work, we present a simple grid structure as a…

In multiprocessor systems, various problems are treated with Lamport's logical clock and the resultant logical time orders between operations. However, one often needs to face the high complexities caused by the lack of logical time order…

The bloom clock is a space-efficient, probabilistic data structure designed to determine the partial order of events in highly distributed systems. The bloom clock, like the vector clock, can autonomously detect causality violations by…

We develop a general theory of the time distribution of quantum events, applicable to a large class of problems such as arrival time, dwell time and tunneling time. A stopwatch ticks until an awaited event is detected, at which time the…

In this paper we deal with the classical problem of random cover times. We investigate the distribution of the time it takes for a Poisson process of cylinders to cover a set $A \subset \mathbb{R}^d.$ This Poisson process of cylinders is…

We draw a picture of physical systems that allows us to recognize what is this thing called "time" by requiring consistency not only with our notion of time but also with the way time enters the fundamental laws of Physics, independently of…

In earlier papers we showed unpredictability beyond quantum uncertainty in atomic clocks, ensuing from a proven gap between given evidence and explanations of that evidence. Here we reconceive a clock, not as an isolated entity, but as…

For a general renewal process $N$ (allowing delay, defect and multiple simultaneous arrivals) the independence of the first renewal epochs of the marked processes got from $N$ by Bernoulli $0$/$1$ thinning is characterized. This…

We study some limit theorems for the law of a generalized one-dimensional diffusion weighted and normalized by a non-negative function of the local time evaluated at a parametrized family of random times (which we will call a clock). As the…

Physical clocks provide more precision than applications can use. For example, a 64 bit NTP clock allows a precision of 233 picoseconds. In this paper, we focus on whether the least significant bits that are not useful to the applications…

While the microscopic laws of physics are often symmetric under time reversal, most natural processes that we observe are not. The emergent asymmetry between typical and time-reversed processes is referred to as the arrow of time. In…

We consider distributed plurality consensus in a complete graph of size $n$ with $k$ initial opinions. We design an efficient and simple protocol in the asynchronous communication model that ensures that all nodes eventually agree on the…

A driven linear oscillator and a feedback mechanism are two necessary elements of any classical periodic clock. Here, we introduce a novel, fully quantum clock using a driven oscillator in the quantum regime and coherent quantum feedback.…

We present a relatively simple and mostly elementary proof of the L\'evy--Khintchine formula for subordinators. The main idea is to study the Poisson process time-changed by the subordinator. The technical tools used are conditional…

The stability of several clock protocols based on 2 to 20 entangled atoms is evaluated numerically by a simulation that includes the effect of decoherence due to classical oscillator noise. In this context the squeezed states discussed by…

In general relativity, the causal structure between events is dynamical, but it is definite and observer-independent; events are point-like and the membership of an event A in the future or past light-cone of an event B is an…

A simple pseudo-Hamiltonian formulation is proposed for the linear inhomogeneous systems of ODEs. In contrast to the usual Hamiltonian mechanics, our approach is based on the use of non-stationary Poisson brackets, i.e. corresponding…

Typical quantum communication schemes are such that to achieve perfect decoding the receiver must share a reference frame with the sender. Indeed, if the receiver only possesses a bounded-size quantum token of the sender's reference frame,…

The optimal protocols for the irreversible work achieve their maximum usefulness if their work fluctuations are the smallest ones. In this work, for classical and isothermal processes subjected to finite-time and weak drivings, I show that…

Although the laws of classical physics are deterministic, thermodynamics gives rise to an arrow of time through irreversible processes. In quantum mechanics the unitary nature of the time evolution makes it intrinsically reversible, however…