Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2006.11673

Time resolved multi-photon effects in the fluorescence spectra of two-level systems at rest and in motion

Emil Viñas Boström·Andrea D'Andrea·Michele Cini·Claudio Verdozzi
View original source ↗Read source document ↗Export metadata ↓

Abstract

We study the time-resolved fluorescence spectrum in two-level systems interacting with an incident coherent field, both in the weak and intermediate coupling regimes. For a single two-level system in the intermediate coupling case, as time flows, the spectrum develops distinct features, that are not captured by a semi-classical treatment of the incident field. Specifically, for a field on resonance with the atomic transition energy, the usual Mollow spectrum is replaced by a four peak structure, and for a frequency that is half of the atomic transition energy, the time-dependent spectrum develops a second harmonic peak with a superimposed Mollow triplet. In the long-time limit, our description recovers results previously found in the literature. After analyzing why a different behavior is observed in the quantum and classical dynamics, the reason for the occurrence of a second harmonic signal in a two-level system is explained via a symmetry analysis of the total (electron and photon) system, and in terms of a three level system operating in limiting regimes. We find an increased second harmonic signal in an array of two-level systems, suggesting a superradiance-like enhancement for multiple two-level systems in cavity setups. Finally, initial explorative results are presented for two-level model atoms entering and exiting a cavity, which hint at an interesting interplay between cavity-photon screening and atomic dynamics effects.

Explore related subjects

quant-phcond-mat.mes-hallphysics.atom-phphysics.optics

Keep this discovery

BibTeXRIS

Emil Viñas Boström, Andrea D'Andrea, Michele Cini, Claudio Verdozzi. 2020-06-20. Time resolved multi-photon effects in the fluorescence spectra of two-level systems at rest and in motion. https://doi.org/10.1103/physreva.102.013719

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↗