Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2402.09935

Electrically controlled focusing of de Broglie matter waves by Fresnel zone plate

Sushanta Barman·Sudeep Bhattacharjee
View original source ↗Read source document ↗Export metadata ↓

Abstract

The evolution from classical to quantum matter wave optics has been influenced by transformative optical devices. Fresnel zone plates (FZP), initially designed for light manipulation, have now found expanded applications in matter waves. In this study, focusing of helium atoms by an electrically biased FZP is investigated numerically. The $n$th opaque zone of the FZP is subject to electrostatic biasing using three ways: (i) $V_n=V_1$, where $V_1$ is the biasing voltage applied to the central zone, (ii) $V_n=V_1 \sqrt{n}$, and (iii) $V_n = V_1 \sin (k_E n)$, with $k_E$ being the radial modulation factor. The effect of biasing the FZP on the transmission coefficient ($T_c$), focal length ($f$), size of the focused wave packet ($\sigma_F$), transverse intensity profile, and focusing efficiency ($\eta$) is investigated. The study reveals that the electrical biasing of the FZP modulates the diffractive focusing of neutral atoms by altering the atom-surface interaction with induced polarization potential. It is observed that biasing with $V_n=V_1$ induces multi-focusing of the FZP, reducing wave packet transmission and focusing efficiency. Biasing with $V_n=V_1 \sqrt{n}$ significantly enhances the transmission coefficient by $23.7\%$, increases the focal length $f$ by $103\%$, and improves the focusing efficiency from $10\%$ to $20.17\%$, indicating enhanced focusing performance. Biasing with $V_n=V_1 \sin(k_E n)$ offers increased controllability in focusing matter waves through the parameters $k_E$ and $V_1$. In this case, a highly intense focused wave packet with a better efficiency of $20.3\%$ is observed compared to the other cases. The findings will be helpful in various emerging applications of atom optics, such as improving the performance of helium microscopes, enabling control in cold atom trapping on atom chips, and high-precision atom lithography for quantum electronic devices.

Explore related subjects

quant-ph

Keep this discovery

BibTeXRIS

Sushanta Barman, Sudeep Bhattacharjee. 2024-02-15. Electrically controlled focusing of de Broglie matter waves by Fresnel zone plate. https://doi.org/10.1088/1402-4896/adb91b

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗
arXiv2026

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↗