Abstract
We develop an algorithm to apply the Dalgarno–Lewis (DL) perturbation theory to quantum graphs with multiple connected edges. We use it to calculate the nonlinear optical hyperpolarizability tensors for graphs and show that it replicates the sum over states computations but executes 10 to 50 times faster. DL requires only knowledge of the ground state of the graph, eliminating the requirement to determine all possible degeneracies of a complex network. The algorithm is general and may be applied to any quantum graph.
© 2016 Optical Society of America
Full Article | PDF ArticleCorrections
15 September 2016: A correction was made to the abstract.
More Like This
Sean Mossman, Rick Lytel, and Mark G. Kuzyk
J. Opt. Soc. Am. B 33(12) E31-E39 (2016)
Rick Lytel
J. Opt. Soc. Am. B 33(12) E66-E82 (2016)
Shoresh Shafei, Rick Lytel, and Mark G. Kuzyk
J. Opt. Soc. Am. B 29(12) 3419-3428 (2012)