Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2006.13442

High sensitivity multi-axes rotation sensing using large momentum transfer point source atom interferometry

Jinyang Li·Gregório R. M. da Silva·Wayne C. Huang·Mohamed Fouda·Timothy L. Kovachy·Selim M. Shahriar
View original source ↗Read source document ↗Export metadata ↓

Abstract

A point source interferometer (PSI) is a device where atoms are split and recombined by applying a temporal sequence of Raman pulses during the expansion of a cloud of cold atoms behaving approximately as a point source. The PSI can work as a sensitive multi-axes gyroscope that can automatically filter out the signal from accelerations. The phase shift arising from rotations is proportional to the momentum transferred to each atom from the Raman pulses. Therefore, by increasing the momentum transfer, it should be possibly to enhance the sensitivity of the PSI. Here, we investigate the degree of enhancement in sensitivity that could be achieved by augmenting the PSI with large momentum transfer (LMT) employing a sequence of many Raman pulses with alternating directions. Contrary to typical approaches used for describing a PSI, we employ a model under which the motion of the center of mass of each atom is described quantum mechanically. We show how increasing Doppler shifts lead to imperfections, thereby limiting the visibility of the signal fringes, and identify ways to suppress this effect by increasing the effective, two-photon Rabi frequencies of the Raman pulses. Taking into account the effect of spontaneous emission, we show that, for a given value of the one-photon Rabi frequency, there is an optimum value for the number of pulses employed, beyond which the net enhancement in sensitivity begins to decrease. For a one-photon Rabi frequency of 200 MHz, for example, the peak value of the factor of enhancement in sensitivity is ~39, for a momentum transfer that is ~69 times as large as that for a conventional PSI. We also find that this peak value scales as the one-photon Rabi frequency to the power of 4/5.

Explore related subjects

quant-ph

Keep this discovery

BibTeXRIS

Jinyang Li, Gregório R. M. da Silva, Wayne C. Huang, Mohamed Fouda, Timothy L. Kovachy, Selim M. Shahriar. 2020-06-24. High sensitivity multi-axes rotation sensing using large momentum transfer point source atom interferometry. https://arxiv.org/abs/2006.13442

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↗