Search arXivSearch

arXiv · quant-ph/9508010

More About Tunnelling Times, the Dwell Time, and the ``Hartman Effect"

Abstract

In a recent review paper [{\em Phys. Reports} {\bf 214} (1992) 339] we proposed, within conventional quantum mechanics, new definitions for the sub-barrier tunnelling and reflection times. \ Aims of the present paper are: \ (i) presenting and analysing the results of various numerical calculations (based on our equations) on the penetration and return times $<τ_{\, \rm Pen}>$, $<τ_{\, \rm Ret}>$, during tunnelling {\em inside} a rectangular potential barrier, for various penetration depths $x_{\rm f}$; \ (ii) putting forth and discussing suitable definitions, besides of the mean values, also of the {\em variances} (or dispersions) ${\rm D} \, {τ_{\rm T}}$ and ${\rm D} \, {τ_{\, \rm R}}$ for the time durations of transmission and reflection processes; \ (iii) mentioning, moreover, that our definition $<τ_{\rm T}>$ for the average transmission time results to constitute an {\em improvement} of the ordinary dwell--time ${\ove τ}^{\rm Dw}$ formula: \ (iv) commenting, at last, on the basis of our {\em new} numerical results, upon some recent criticism by C.R.Leavens. \ \ We stress that our numerical evaluations {\em confirm} that our approach implied, and implies, the existence of the {\em Hartman effect}: an effect that in these days (due to the theoretical connections between tunnelling and evanescent--wave propagation) is receiving ---at Cologne, Berkeley, Florence and Vienna--- indirect, but quite interesting, experimental verifications. \ Eventually, we briefly analyze some other definitions of tunnelling times.

Explore related subjects

Keep this discovery

BibTeXRIS

V. S. Olkhovsky, E. Recami, F. Raciti, A. Zaichenko. 1995-08-10. More About Tunnelling Times, the Dwell Time, and the ``Hartman Effect". https://doi.org/10.1051/jp1:1995202

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