Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2112.00186

Quantum-enhanced rubidium atomic magnetometer based on Faraday rotation via 795-nm Stokes operator squeezed light

Lele Bai·Xin Wen·Yulin Yang·Lulu Zhang·Jun He·Yanhua Wang·Junmin Wang
View original source ↗Read source document ↗Export metadata ↓

Abstract

With the help of Stokes operator S2 squeezed state (also called polarization squeezed state (PSS)) of 795-nm light, rubidium-87 (87Rb) atomic magnetometer based on Faraday rotation has been implemented and characterized.The PSS of Stokes operator S2 of 795-nm light has been prepared by means of coherently combining the polarization coherent state (PCS) of a linearly p-polarized bright 795-nm light beam and a linearly s-polarized squeezed vacuum state (SVS) generated by a 397.5-nm ultraviolet laser pumped sub-threshold optical parametric oscillator (OPO) with a PPKTP bulk crystal inside the OPO cavity.PSS with a squeezing level of -3.7 has been achieved around the analysis frequency of 10 kHz. At different transitions of D1 line, various frequency detuning, and reasonable atomic vapor cells temperature, Faraday rotation has been measured and compared.To decrease absorption (scattering) losses and the back-action from atomic spin noise to the probe beams polarization noise for maintaining the quantum properties of PSS of Stokes operator S2 of 795-nm light, we had to run our magnetometer with 87Rb vapor cells temperature below 60, at which the PSS was almost destroyed.The sensitivities of magnetic field measurement were characterized via measuring signal-to-noise ratio of the alternating current (AC) calibrated magnetic field signal with a balanced polarimeter. Under the conditions of the atomic number density of 5.8*1010 /cm3 and the probe beam with a detuning of - 400 MHz relative to the 5S1/2 (Fg=2) - 5P1/2 (Fe=1) transition of 87Rb D1 line, a typical sensitivity of 19.5 pT/Hz1/2 has been achieved employing PSS of Stokes operator S2 as the probe, compared with a sensitivity of 28.3 pT/Hz1/2 using PCS as the probe.We preliminarily demonstrated that the quantum-enhanced sensitivity in a Faraday-rotation-based 87Rb atomic magnetometer with the help of PSS of 795-nm light.

Explore related subjects

quant-phphysics.atom-ph

Keep this discovery

BibTeXRIS

Lele Bai, Xin Wen, Yulin Yang, Lulu Zhang, Jun He, Yanhua Wang, Junmin Wang. 2021-12-01. Quantum-enhanced rubidium atomic magnetometer based on Faraday rotation via 795-nm Stokes operator squeezed light. https://doi.org/10.1088/2040-8986%2Fac1b7c

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↗