Accelerating the measurement of time-resolved emission line shapes with a denoising neural network
Bibliographic record
Abstract
Single coherent photons on demand are essential inputs for many applications of quantum optics, including for linear optical quantum computing. One critical parameter when assessing the potential of a material to emit coherent single photons is the homogeneous linewidth, the measurement of which is often obscured by fast spectral fluctuations. Photon correlation Fourier spectroscopy (PCFS) provides a more accurate measurement of the homogeneous emission linewidth than traditional techniques by probing the system on timescales faster than spectral diffusion. However, PCFS is limited by the long integration times it requires, restricting its use to only the most stable materials and making it difficult to study large numbers of emitters within these select samples. Our group previously developed a machine-learning (ML) algorithm to denoise PCFS signals which showed promise on a single experimental dataset but was difficult to further validate. Here, we demonstrate the use of a similar ML model to accelerate PCFS experiments by an order of magnitude and verify its accuracy on a statistical number of samples. We use 10% of the photon stream from full PCFS experiments to replicate shorter measurements, resulting in data with prohibitively high levels of noise. By employing a denoising autoencoder neural network, we extract the underlying signal from the noisy truncated measurements and unambiguously verify the results of the reconstructions through direct comparison with the original experiments. We confirm the generalization of the ML treatment through application to >80 experiments from multiple samples including $\mathrm{CsPbB}{\mathrm{r}}_{3}$ and InP/ZnSe/ZnS nanocrystals. The large-scale verification of the ML reconstructions enables confident use of ML to accelerate future PCFS experiments up to 10\ifmmode\times\else\texttimes\fi{}, enhancing the practical capabilities of this technique and further promoting the application of ML to other spectroscopic methods.
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.001 | 0.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.001 | 0.001 |
| 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".