Tomography of clock signals using the simplest possible reference
- URL: http://arxiv.org/abs/2406.12973v1
- Date: Tue, 18 Jun 2024 18:00:03 GMT
- Title: Tomography of clock signals using the simplest possible reference
- Authors: Nuriya Nurgalieva, Ralph Silva, Renato Renner,
- Abstract summary: We show that every waiting-time distribution generated by a physical process on a system of finite size is guaranteed to be bounded by a decay envelope.
We reconstruct the distribution using only operationally available information.
- Score: 1.5839621757142595
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: We show that finite physical clocks always have well-behaved signals, namely that every waiting-time distribution generated by a physical process on a system of finite size is guaranteed to be bounded by a decay envelope. Following this consideration, we show that one can reconstruct the distribution using only operationally available information, namely, that of the ordering of the ticks of one clock with the respect to those of another clock (which we call the reference), and that the simplest possible reference clock -- a Poisson process -- suffices.
Related papers
- Relational Dynamics with Periodic Clocks [0.0]
We show that a relational dynamics can be established relative to periodic clocks both in the classical and quantum theories.
We show how a system evolving periodically with respect to a periodic clock can evolve monotonically with respect to an aperiodic clock, without inconsistency.
arXiv Detail & Related papers (2024-09-10T13:07:46Z) - A magnetic clock for a harmonic oscillator [89.99666725996975]
We study how the quantum dynamics transforms into a classical-like behaviour when conditions related with macroscopicity are met by the clock alone.
In the description of this emerging behaviour finds its place the classical notion of time, as well as that of phase-space and trajectories on it.
arXiv Detail & Related papers (2023-10-20T09:55:51Z) - Ticking clocks in quantum theory [0.0]
We show that for finite systems a single natural principle serves to distinguish what we understand as ticking clocks from time-keeping systems in general.
We describe the most general form of the dynamics of such a clock, and discuss the additional simplifications to go from a general ticking clock to models encountered in literature.
arXiv Detail & Related papers (2023-06-02T18:00:01Z) - Gated Recurrent Neural Networks with Weighted Time-Delay Feedback [59.125047512495456]
We introduce a novel gated recurrent unit (GRU) with a weighted time-delay feedback mechanism.
We show that $tau$-GRU can converge faster and generalize better than state-of-the-art recurrent units and gated recurrent architectures.
arXiv Detail & Related papers (2022-12-01T02:26:34Z) - Direct Embedding of Temporal Network Edges via Time-Decayed Line Graphs [51.51417735550026]
Methods for machine learning on temporal networks generally exhibit at least one of two limitations.
We present a simple method that avoids both shortcomings: construct the line graph of the network, which includes a node for each interaction, and weigh the edges of this graph based on the difference in time between interactions.
Empirical results on real-world networks demonstrate our method's efficacy and efficiency on both edge classification and temporal link prediction.
arXiv Detail & Related papers (2022-09-30T18:24:13Z) - Continuous quantum clock with high precision and long recurrence time [0.0]
Continuous clocks are regarded as an essential component of sensing technology.
It is shown that quantum clocks based on $n$ two-qubits system can have better precision than quantum clocks based on $2n$ one-qubit system.
arXiv Detail & Related papers (2022-03-01T16:32:24Z) - Quantum Process Tomography of Unitary Maps from Time-Delayed
Measurements [0.0]
Quantum process tomography conventionally uses a multitude of initial quantum states and then performs state tomography on the process output.
Here we propose and study an alternative approach which requires only a single (or few) known initial states together with time-delayed measurements for reconstructing the unitary map and corresponding Hamiltonian of the time dynamics.
We explain in detail how the reconstruction of a single qubit Hamiltonian works in this setting, and provide numerical methods and experiments for general few-qubit and lattice systems with local interactions.
arXiv Detail & Related papers (2021-12-16T17:05:56Z) - It's About Time: Analog Clock Reading in the Wild [93.84801062680786]
We present a framework for reading analog clocks in natural images or videos.
We create a scalable pipeline for generating synthetic clocks, significantly reducing the requirements for the labour-intensive annotations.
We show that the model trained on the proposed synthetic dataset generalises towards real clocks with good accuracy.
arXiv Detail & Related papers (2021-11-17T14:52:02Z) - Relational evolution with oscillating clocks [0.0]
Unitary evolution does not require a monotonic clock variable.
Because the clock and an evolving system have a common conserved energy, the clock is in different cycles for different energy eigenstates of the system state.
Coherence is almost maintained over long time scales provided the clock period is much smaller than the system period.
arXiv Detail & Related papers (2021-10-14T20:26:40Z) - Equivalence of approaches to relational quantum dynamics in relativistic
settings [68.8204255655161]
We show that the trinity' of relational quantum dynamics holds in relativistic settings per frequency superselection sector.
We ascribe the time according to the clock subsystem to a POVM which is covariant with respect to its (quadratic) Hamiltonian.
arXiv Detail & Related papers (2020-07-01T16:12:24Z) - There is only one time [110.83289076967895]
We draw a picture of physical systems that allows us to recognize what is this thing called "time"
We derive the Schr"odinger equation in the first case, and the Hamilton equations of motion in the second one.
arXiv Detail & Related papers (2020-06-22T09:54:46Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.