SearcharxivSearch

arXiv · 1807.07990

Intermediate scattering function and quantum recoil in non-Markovian quantum diffusion

Abstract

Exact expressions are derived for the intermediate scattering function (ISF) of a quantum particle diffusing in a harmonic potential and linearly coupled to a harmonic bath. The results are valid for arbitrary strength and spectral density of the coupling. The general, exact non-Markovian result is expressed in terms of the classical velocity autocorrelation function, which represents an accumulated phase during a scattering event. The imaginary part of the exponent of the ISF is proportional to the accumulated phase, which is an antisymmetric function of the correlation time $t$. The expressions extend previous results given in the quantum Langevin framework where the classical response of the bath was taken as Markovian. For a special case of non-Markovian friction, where the friction kernel decays exponentially in time rather than instantaneously, we provide exact results relating to unconfined quantum diffusion, and identify general features that allow insight to be exported to more complex examples. The accumulated phase as a function of the t has a universal gradient at the origin, depending only on the mass of the diffusing system particle. At large t the accumulated phase reaches a constant limit that depends only on the classical diffusion coefficient and is therefore independent of the detailed memory properties of the friction kernel. Non-Markovian properties of the friction kernel are encoded in the details of how the accumulated phase switches from its $t\rightarrow -\infty$ to its $t\rightarrow -\infty$ limit, subject to the constraint of the universal gradient. When memory effects are significant, the transition from one limit to the other becomes non-monotonic, owing to oscillations in the classical velocity autocorrelation. The result is interpreted in terms of a solvent caging effect, in which slowly fluctuating bath modes create transient wells for the system particle.

Explore related subjects

Keep this discovery

BibTeXRIS

Peter S. M. Townsend, Alex W. Chin. 2018-07-20. Intermediate scattering function and quantum recoil in non-Markovian quantum diffusion. https://doi.org/10.1103/physreva.98.022106

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