SearcharxivSearch

arXiv · 2307.15081

Position as an independent variable and the emergence of the $1/2$-time fractional derivative in quantum mechanics

Abstract

Using the position as an independent variable, and time as the dependent variable, we derive the function ${\cal P}^{(\pm)}$, which generates the space evolution under the potential ${\cal V}(q)$ and Hamiltonian ${\cal H}$. Canonically conjugated variables are the time and minus the Hamiltonian. While the classical dynamics do not change, the corresponding quantum operator naturally leads to a $1/2-$fractional time evolution, consistent with a recently proposed spacetime symmetric formalism of quantum mechanics. Using Dirac's procedure, separation of variables is possible, and while the coupled position-independent Dirac equations depend on the $1/2$-fractional derivative, the coupled time-independent Dirac equations (TIDE) lead to positive and negative shifts in the potential, proportional to the force. Both equations couple the ($\pm$) solutions of ${\cal \hat P}^{(\pm)}$ and the kinetic energy ${\cal K}_0$ is the coupling strength. We obtain a pair of coupled states for systems with finite forces. The potential shifts for the harmonic oscillator (HO) are $\pm\hbar\omega/2$, and the corresponding pair of states are coupled for ${\cal K}_0\ne 0$. No time evolution is present for ${\cal K}_0=0$, and the ground state with energy $\hbar\omega/2$ is stable. For ${\cal K}_0>0$, the ground state becomes coupled to the state with energy $-\hbar\omega/2$, and \textit{this coupling} allows to describe higher excited states. Energy quantization of the HO leads to quantization of ${\cal K}_0=k\hbar\omega$ ($k=1,2,\ldots$). For the one-dimensional Hydrogen atom, the potential shifts become imaginary and position-dependent. Decoupled case ${\cal K}_0=0$ leads to plane-waves-like solutions at the threshold. Above the threshold, we obtain a plane-wave-like solution, and for the bounded states the wave-function becomes similar to the exact solutions but squeezed closer to the nucleus.

Explore related subjects

Keep this discovery

BibTeXRIS

Marcus W Beims, Arlans JS Lara. 2023-07-25. Position as an independent variable and the emergence of the $1/2$-time fractional derivative in quantum mechanics. https://arxiv.org/abs/2307.15081

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