2021
DOI: 10.48550/arxiv.2109.06956
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

A fast, high-order numerical method for the simulation of single-excitation states in quantum optics

Abstract: We consider the numerical solution of a nonlocal partial differential equation which models the process of collective spontaneous emission in a two-level atomic system containing a single photon. We reformulate the problem as an integro-differential equation for the atomic degrees of freedom, and describe an efficient solver for the case of a Gaussian atomic density. The problem of history dependence arising from the integral formulation is addressed using sumof-exponentials history compression. We demonstrate… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
3
0

Year Published

2021
2021
2022
2022

Publication Types

Select...
3

Relationship

2
1

Authors

Journals

citations
Cited by 3 publications
(3 citation statements)
references
References 29 publications
0
3
0
Order By: Relevance
“…This analysis therefore provides a reasonable approximation for a system of atoms and the dynamics of the atomic amplitudes can be computed in O(N 4 ) operations independent of the final time horizon T , where N is the number of atoms in the system (see Remark 4). For moderately-sized systems, say N < 1000, for example, this approach may provide a good alternative to the direct numerical solution of (5), which typically scales like O(N 2 T 2 ) even after using fast algorithms [19]. A detailed comparison of our asymptotics to the numerical solution of (5) will be presented in an forthcoming paper.…”
Section: Discussionmentioning
confidence: 99%
“…This analysis therefore provides a reasonable approximation for a system of atoms and the dynamics of the atomic amplitudes can be computed in O(N 4 ) operations independent of the final time horizon T , where N is the number of atoms in the system (see Remark 4). For moderately-sized systems, say N < 1000, for example, this approach may provide a good alternative to the direct numerical solution of (5), which typically scales like O(N 2 T 2 ) even after using fast algorithms [19]. A detailed comparison of our asymptotics to the numerical solution of (5) will be presented in an forthcoming paper.…”
Section: Discussionmentioning
confidence: 99%
“…The problem of efficient Volterra history integration is well known in the scientific computing literature, and several techniques have been proposed, particularly in the context of solving Volterra integral equations and computing nonlocal transparent boundary conditions. We mention fast Fourier transform (FFT)-based methods [27], methods based on sum-of-exponentials projections of the history [28][29][30][31][32][33][34][35], convolution quadrature [36,37], and hierarchical low-rank or butterfly matrix compression [22,38,39]. Of the methods mentioned above, several have been applied to the efficient numerical solution of convolutional nonlinear Volterra integral equations [27,37,38].…”
Section: Introductionmentioning
confidence: 99%
“…The numerical solution of such a large number of coupled and time-delayed nonlinear equations in a random medium is challenging [11,12], and our methods presented in detail in [13] amortize computational cost and convergence. In this approach, the nonlinear dynamics of each emitter and the field generated by the emitters' polarization are self-consistently computed, showing a rich phenomenology of short-and long-lived excitations and synchronized oscillations.…”
mentioning
confidence: 99%