SearcharxivSearch

arXiv · 2107.07504

Strong inelastic scattering of slow electrons by optical near fields of small nanoparticles

Abstract

The interaction of swift, free-space electrons with confined optical near fields has recently sparked much interest. It enables a new type of photon-induced near-field electron microscopy, mapping local optical near fields around nanoparticles with exquisite spatial and spectral resolution and lies at the heart of quantum state manipulation and attosecond pulse shaping of free electrons. The corresponding interaction of optical near fields with slow electrons has achieved much less attention, even though the lower electron velocity may enhance electron-near-field coupling for small nanoparticles. A first-principle theoretical study of such interactions has been reported very recently [N. Talebi, Phys. Rev. Lett. 125, 080401 (2020)]. Building up on this work, we investigate, both analytically and numerically, the inelastic scattering of slow electrons by near fields of small nanostructures. For weak fields, this results in distinct angular diffraction patterns that represent, to first order, the Fourier transform of the transverse variation of the scalar near-field potential along the direction perpendicular to the electron propagation. For stronger fields, scattering by the near-field component along the electron trajectory results in a break-up of the energy spectrum into multiple photon orders. Their angular diffraction patterns are given by integer powers of the Fourier transform of the transverse potential variation and are shifting in phase with photon order. Our analytical model offers an efficient approach for studying the effects of electron kinetic energy, near field shape and strength on the diffraction and thus may facilitate the experimental observation of these phenomena by, e.g., ultrafast low-energy point-projection microscopy or related techniques. This could provide simultaneous access to different vectorial components of the optical near fields of small nanoparticles.

Explore related subjects

Keep this discovery

BibTeXRIS

Germann Hergert, Andreas Woeste, Petra Gross, Christoph Lienau. 2021-07-15. Strong inelastic scattering of slow electrons by optical near fields of small nanoparticles. https://doi.org/10.1088/1361-6455/ac2471

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