SearcharxivSearch

arXiv · 2409.06479

Relational Dynamics with Periodic Clocks

Abstract

We discuss a systematic way in which a relational dynamics can be established relative to periodic clocks both in the classical and quantum theories, emphasising the parallels between them. We show that: (1) classical and quantum relational observables that encode the value of a quantity relative to a periodic clock are only invariant along the gauge orbits generated by the Hamiltonian constraint if the quantity itself is periodic, and otherwise the observables are only transiently invariant per clock cycle (this implies, in particular, that counting winding numbers does not lead to invariant observables relative to the periodic clock); (2) the quantum relational observables can be obtained from a partial group averaging procedure over a single clock cycle; (3) there is an equivalence ('trinity') between the quantum theories based on the quantum relational observables of the clock-neutral picture of Dirac quantisation, the relational Schr\"odinger picture of the Page-Wootters formalism, and the relational Heisenberg picture that follows from quantum deparametrisation, all three taken relative to periodic clocks (implying that the dynamics in all three is necessarily periodic); (4) in the context of periodic clocks, the original Page-Wootters definition of conditional probabilities fails for systems that have a continuous energy spectrum and, using the equivalence between the Page-Wootters and the clock-neutral, gauge-invariant formalism, must be suitably updated. Finally, we show how a system evolving periodically with respect to a periodic clock can evolve monotonically with respect to an aperiodic clock, without inconsistency. The presentation is illustrated by several examples, and we conclude with a brief comparison to other approaches in the literature that also deal with relational descriptions of periodic clocks.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Leonardo Chataignier, Philipp A. Hoehn, Maximilian P. E. Lock, Fabio M. Mele. 2024-09-10. Relational Dynamics with Periodic Clocks. https://doi.org/10.1088/1367-2630%2Fae46d0

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