SearcharxivSearch

arXiv · 2604.21805

The clock ambiguity problem: extended or extinguished?

Abstract

I show that the clock ambiguity cannot be solved by a purely relational condition like the noninteraction condition, and it is even stronger, extending to evolution laws. The ambiguity is solved by specifying the physical meaning of observables. Page and Wootters (1983) showed how time and dynamics can emerge from entanglement within a stationary quantum system containing a clock. The clock ambiguity problem is that, from a purely relational stance and without fixing a clock-world split, the emergence is ambiguous, resulting in any possible history (Albrecht 1995). I show that the ambiguity is stronger than previously recognized. Under the relational stance, it extends from histories to the evolution laws themselves. The spectrum of any ideal clock uniformizes the spectra of the world's evolution operators, leaving only the dimension of the Hilbert spaces as invariant information. Fixing the clock-world split can solve the ambiguity, but this would block spacetime symmetries. One might want to remove the ambiguity up to a unitary equivalence by imposing noninteraction, as in Marletto and Vedral (2017). But once the clock spectrum uniformizes the world spectrum, unitary equivalence becomes too coarse to distinguish any two possible world dynamics, which is the result proved here. Thus a purely relational condition such as noninteraction is insufficient. Nor can all different decompositions be regarded as equally valid perspectives, since then records would not be correlated with the events they record, and empirical knowledge would be impossible. The resolution is therefore not to embrace the ambiguity, but to recognize what a bare reading of the Page-Wootters structure omits: the physical meaning of the operators.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ovidiu Cristinel Stoica. 2026-04-23. The clock ambiguity problem: extended or extinguished?. https://arxiv.org/abs/2604.21805

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Probing the Error-Mitigation Threshold with Matrix Product States

Quantum error mitigation relies on accurate noise characterization, but mismatches between the actual and characterized noise can be amplified and drive a sharp threshold between successful and failed mitigation. In random circuits, this threshold maps onto a random-field Ising transition, but previous exact numerics were limited to small one-dimensional and all-to-all systems, leaving explicit two-dimensional architectures unresolved. We develop a fixed-bond-dimension matrix-product-state method for the replicated transfer dynamics that extends threshold calculations beyond exact propagation while retaining the finite-size signatures of the transition. At system sizes beyond previous exact studies, we recover the predicted absence of a threshold for quenched disorder in 1D, obtain a sharper annealed all-to-all critical point, and resolve architecture-dependent finite-depth thresholds in 2D square and heavy-hex circuits. These results establish replicated tensor-network dynamics as a practical tool for probing error-mitigation thresholds in large and higher-dimensional noisy circuits.

quant-ph

Low-cost algorithm-to-execution framework for surface-code quantum computing

The execution of useful quantum algorithms on fault-tolerant processors requires more than a mapping from logical gates to encoded operations: the spatial organization, non-Clifford resource supply, and execution schedule must also be determined while keeping physical overhead within practical limits. Although the theoretical hierarchy from logical circuits to fault-tolerant operations is well established, these implementation choices are often specified and optimized separately. Here we develop a low-cost algorithm-to-execution framework for surface-code quantum computing. From hierarchical algorithm descriptions, it constructs dependency-preserving logical schedules and an executable workload capturing logical interactions, operation parallelism, and time-resolved non-Clifford demand, thereby linking logical computation to surface-code organization, resource-state preparation, and fault-tolerant execution in a traceable workflow. We apply the framework to twenty benchmark circuits across seven algorithm families and a hierarchically composed application-scale elliptic-curve discrete-logarithm workload. Physical costs vary substantially even for circuits with similar logical resource counts. Under our direct-rotation calibration, non-Clifford implementation selection reduces space-time volume by up to 241.5 times versus an all-synthesis baseline for the QAOA amplitude-amplification workload. Circuit-specific surface-code layouts reduce routed-latency estimates for all twenty benchmarks; thirteen also reduce space-time volume because communication savings outweigh added spatial overhead. These results show that low-cost fault-tolerant execution depends on computation scheduling and organization, not aggregate logical resource counts alone.

quant-ph

Sample-optimal learning of stabilizer states

It is well-known that learning a pure $n$-qubit stabilizer state $|\psi\rangle$ both requires, and can be accomplished with, access to a number of copies of $|\psi\rangle$ linear in $n$. However, the precise constant coefficient of this scaling does not appear to have been determined. Here we prove that $L_\delta(n)$, the smallest number of copies from which a quantum procedure can identify any stabilizer state with failure probability at most $0<\delta<1/8$, satisfies $n+\lceil\log_2(1/\delta)\rceil-3\leq L_\delta(n)\leq n+\left\lceil\log_2(1/\delta)\right\rceil+4$. We present a polynomial-time quantum learning algorithm that saturates this bound, achieving a constant factor improvement in sample-complexity over previously known approaches. As an immediate corollary, we obtain via the Choi-Jamiolkowski isomorphism an algorithm for learning an unknown $n$-qubit Clifford unitary from $2n+\left\lceil\log_2(1/\delta)\right\rceil+4$ queries, the $n$-dependence of which we show to be optimal. Our proof technique, which involves Fourier analysis on the abelian group $\mathbb{Z}_4^n \times \mathbb{F}_2^{n(n-1)/2}$, seems to be qualitatively different to previous approaches to stabilizer state learning, and may be of some independent interest; in particular, it admits natural generalisations to further problems in quantum learning theory.

quant-ph