General solution to nonlinear optical quantum graphs using Dalgarno-Lewis summation techniques
arXiv:1607.06731 · doi:10.1364/JOSAB.33.000E14
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 ten to fifty 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.
References in corpus (10)
- Periodic Orbit Theory and Spectral Statistics for Quantum Graphs
- Chaotic Scattering on Graphs
- On the spectra of carbon nano-structures
- The influence of geometry and topology of quantum graphs on their nonlinear-optical properties
- The static electric polarizability of a particle bound by a finite potential well
- Geometry-Controlled Nonlinear Optical Response of Quantum Graphs
- Dressed quantum graphs with optical nonlinearities approaching the fundamental limit
- The effect of extreme confinement on the nonlinear-optical response of quantum wires
- Optimum topology of quasi-one dimensional nonlinear optical quantum systems
- Optimization of eigenstates and spectra for quasi-linear nonlinear optical systems