SearcharxivSearch

arXiv · 1801.03396

Evolution equations from an epistemic treatment of time

Abstract

Relativistically, time $t$ is an observable just like position $r$. In quantum theory, $t$ is a parameter, in contrast to the observable $r$. This discrepancy suggests that there exists a more elaborate formalization of time, which encapsulates both perspectives. Such a formalization is proposed in this paper. The evolution is described in terms of sequential time $n\in \mathbf{\mathbb{N}}$, which is updated each time an event occurs. Sequential time $n$ is separated from relational time $t$, which describes distances between events in space-time. There is a space-time associated with each $n$, in which $t$ represents the knowledge at time $n$ about temporal relations. The evolution of the wave function is described in terms of the parameter $\sigma$ that interpolates between sequential times $n$. For a free object we obtain a Stueckelberg equation $\frac{d}{d\sigma}\Psi(r_{4},\sigma)=\frac{ic^{2}\hbar}{2\langle \epsilon\rangle}\Box\Psi(r_{4},\sigma)$, where $r_{4}=(r,ict)$. Here $\sigma$ describes the time $m$ passed between the start of the experiment at time $n$ and the observation at time $n+m$. The parametrization is assumed to be natural, meaning that $\frac{d}{d\sigma}\langle t\rangle=1$, where $\langle t\rangle$ is the expected temporal distance between the events that define $n$ and $n+m$. The squared rest energy $\epsilon_{0}^{2}$ is proportional to the eigenvalue $\tilde{\sigma}$ that describes a 'stationary state' $\Psi(r_{4},\sigma)=\psi(r_{4},\tilde{\sigma})e^{i\tilde{\sigma}\sigma}$. The Dirac equation follows as a `square root' of the stationary state equation from the condition that $\tilde{\sigma}>0$, which follows from the directed nature of $n$. The formalism thus implies that all observable objects have non-zero rest mass, including elementary fermions. The introduction of $n$ releases $t$, so that it can be treated as an observable with uncertainty $\Delta t$.

Explore related subjects

Keep this discovery

BibTeXRIS

Per Östborn. 2018-01-10. Evolution equations from an epistemic treatment of time. https://arxiv.org/abs/1801.03396

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