SearcharxivSearch

arXiv · 2412.15409

Perturbative study of wave function evolution from source to detection of a single particle and the measurement

Abstract

We analyze the evolution of a particle wave function when it propagates through free space in the longitudinal z-direction from a thin entrance slit to a detector behind a thin exit slit parallel to the horizontal y-axis. We consider an extra aperture slit between the two slits to probe the evolution of the wave function and close the aperture slit starting from wide open until the detection counting rate in a repeated experiment drops to half. When all the slits are long and thin, the 1D Schroedinger equation gives the wave function evolution until the final detection. The width of the aperture slit in the vertical x-direction depends on the z-position of the slit providing an approximate description of the wave function evolution. The width of the function characterizing this dependence starts from the entrance slit. It grows wider until it reaches a maximum and then shrinks narrower and finally collapses into the exit slit where the particle is detected. Thus the envelope of this function has a spindle shape with its pointed ends at the two slits. Hence it is very different from the well-known wave function of the Schroedinger equation with the initial condition at the entrance slit, which is narrow only at the beginning, then grows wider until it reaches the exit slit, where it is much larger than the slit width. However, the phase information is lost because the aperture slit distorts the wave function. To keep the phase information, we replace the aperture slit with a thin pin (parallel to the y-axis) that blocks the wave function. We then study its perturbative effect on the counting rate of the detector. This analysis provides a function to probe the process of the wave function collapse right before the detection. We show this function is real-valued, with amplitude and phase information, and is closely related to the wave function.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Li Hua Yu. 2024-12-19. Perturbative study of wave function evolution from source to detection of a single particle and the measurement. https://arxiv.org/abs/2412.15409

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