Mitigating source and detection noises in autocorrelative weak-value amplification
Bibliographic record
Abstract
Weak-value amplification (WVA), a postselection-based technique that amplifies weak physical signals by preparing nearly orthogonal pre- and postselected quantum states, is intrinsically limited by various kinds of technical noise, which distorts amplified weak values, especially when discarding photons in postselection. While prior work established the efficacy of autocorrelative weak-value amplification (AWVA) under Gaussian noise, practical implementations face challenges from band-limited laser-source noise and detection noise (including shot noise and electrical noise). Here, we demonstrate that the AWVA protocol robustly suppresses both laser-power fluctuations and detection noise. Numerical experiments in Simulink further reveal AWVA's dual advantage: under high-power conditions, the noise-reduction superiority of AWVA over WVA becomes in- creasingly pronounced as input laser power increases, whereas in detection-limited regimes AWVA achieves an order-of-magnitude lower uncertainty, closely approaching the Cram\'er-Rao bound. Crucially, this work demonstrates that AWVA improves precision in both high-power (laser-noise-dominated) and photon-starved (detector-noise-dominated) regimes, thereby bridging these operating extremes and advancing precision in applications from gravitational-wave detection to hybrid quantum systems.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.002 | 0.006 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.000 | 0.002 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.001 | 0.002 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".