SearcharxivSearch

arXiv · 2605.20443

Interpreting Bohm-like quantum potentials in "Computing quantum waves exactly from classical action"

Abstract

In contrast to his earlier posting arXiv260502621 [6] commenting on the article rspa20250413 [5] and answered in arXiv260520443 [3] the same author of the new posting arXiv260605197 [7] does not seem to dispute any longer the following points i Assuming in [5] that along each extremal action path the action Laplacian or more generally the propagated density is space independent implies that the Bohm like potential terms are exactly zero a condition which is directly verified in all examples of [5] as well as in its relativistic Dirac and Maxwell extensions ii Just as in Feynmans well known results the standard polynomials in the treatment in [5] of the harmonic oscillator appear naturally from the Taylor expansion of the kernel and thus there is no circularity. He does not appear to dispute either that Bohm like terms along individual stationary action paths are indeed very different from the standard Bohm Madelung potential on the overall wave. This is illustrated e.g. in the detailed double slit example in [3] whose Bohm like terms are exactly zero while the usual Bohm Madelung potential can be very large. Also in that example the action behind the slits is a conic function so that exact Feynman or Van Vleck computations based on quadratic actions do not apply. His new posting [7] therefore concentrates on the claim in [3] that the space independence assumption on the Laplacian of the action if not directly verified can be achieved through time rescaling which is a fair discussion topic We all agree that the Schrodinger equation has to be fulfilled in the original x t coordinates. To this effect as in the hydrogen atom example of the original paper [5] we use a general result of Duru and Kleinert which the author of [6] and [7] may be unaware of. There independence of the constructed eigenwave on the rescaled time is key to the exact backmapping to the original x t coordinates.

Explore related subjects

Keep this discovery

BibTeXRIS

Winfried Lohmiller, Jean-Jacques Slotine. 2026-05-19. Interpreting Bohm-like quantum potentials in "Computing quantum waves exactly from classical action". https://doi.org/10.1098/rspa.2025.0413

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