SearcharxivSearch

arXiv · 1602.08645

Quantum Lock-in Force Sensing using Optical Clock Doppler Velocimetry

Abstract

Force sensors are at the heart of different technologies such as atomic force microscopy or inertial sensing \cite{RMPforce2003, Rugar2004, YazdiIEEE}. These sensors often rely on the measurement of the displacement amplitude of mechanical oscillators under applied force. Examples for such mechanical oscillators include micro-fabricated cantilevers \cite{YazdiIEEE}, carbon nanotubes \cite{NanotubeForce} as well as single trapped ions \cite{Bollinger, Udem} . The best sensitivity is typically achieved when the force is alternating at the mechanical resonance frequency of the oscillator thus increasing its response by the mechanical quality factor. The measurement of low-frequency forces, that are below resonance, is a more difficult task as the resulting oscillation amplitudes are significantly lower. Here we use a single trapped $^{88}Sr^{+}$ ion as a force sensor. The ion is trapped in a linear harmonic trap, and is electrically driven at a frequency much lower than the trap resonance frequency. To be able to measure the small amplitude of motion we combine two powerful techniques. The force magnitude is determined by the measured periodic Doppler shift of an atomic optical clock transition and the Quantum Lock-in technique is used to coherently accumulate the phases acquired during different force half-cycles. We demonstrate force detection both when the oscillating force is phase-synchronized with the quantum lock-in sequence and when it is asynchronous and report frequency force detection sensitivity as low as $5.3\times10^{-19}\frac{\mathrm{N}}{\sqrt{\mathrm{Hz}}}$ .

Explore related subjects

Keep this discovery

BibTeXRIS

Ravid Shaniv, Roee Ozeri. 2016-02-27. Quantum Lock-in Force Sensing using Optical Clock Doppler Velocimetry. https://doi.org/10.1038/ncomms14157

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