SearcharxivSearch

arXiv · 2509.15833

Single-shot sorting of M\"ossbauer time-domain data at X-ray free-electron lasers

Abstract

M\"ossbauer spectroscopy is widely used to study structure and dynamics of matter with remarkably high energy resolution, provided by the narrow nuclear resonance line widths. However, the narrow width implies low count rates, such that experiments commonly average over extended measurement times or many x-ray pulses (``shots''). This averaging impedes the study of non-equilibrium phenomena. It has been suggested that X-ray free-electron lasers (XFELs) could enable M\"ossbauer single-shot measurements without averaging, and a proof-of-principle demonstration has been reported. However, so far, only a tiny fraction of all shots resulted in signal-photon numbers which are sufficiently high for a single-shot analysis. Here, we demonstrate coherent nuclear-forward-scattering of self-seeded XFEL radiation, with up to 900 signal-photons per shot. We develop a sorting approach which allows us to include all data on a single-shot level, independent of the signal content of the individual shots. It utilizes the presence of different dynamics classes, i.e. different nuclear evolutions after each excitation. Each shot is assigned to one of the classes, which can then be analyzed separately. Our approach determines the classes from the data without requiring theory modeling nor prior knowledge on the dynamics, making it also applicable to unknown phenomena. We envision that our approach opens up new grounds for M\"ossbauer science, enabling the study of out-of-equilibrium transient dynamics of the nuclei or their environment.

Explore related subjects

Keep this discovery

BibTeXRIS

Miriam Gerharz, Willi Hippler, Berit Marx-Glowna, Sakshath Sadashivaiah, Kai S. Schulze, Ingo Uschmann, Robert Loetzsch, Kai Schlage, Sven Velten, Dominik Lentrodt, Lukas Wolff, Olaf Leupold, Ilya Sergeev, Hans-Christian Wille, Cornelius Strohm, Marc Guetg, Shan Liu, Gianluca Aldo Geloni, Ulrike Boesenberg, Jörg Hallmann, Alexey Zozulya, Jan-Etienne Pudell, Angel Rodriguez-Fernandez, Mohamed Youssef, Anders Madsen, Lars Bocklage, Gerhard G. Paulus, Christoph H. Keitel, Thomas Pfeifer, Ralf Röhlsberger, Jörg Evers. 2025-09-19. Single-shot sorting of M\"ossbauer time-domain data at X-ray free-electron lasers. https://arxiv.org/abs/2509.15833

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