Pith. sign in

REVIEW

Franck-Condon factors by counting perfect matchings of graphs with loops

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1811.09597 v2 pith:UOKBWHXH submitted 2018-11-23 quant-ph physics.chem-ph

Franck-Condon factors by counting perfect matchings of graphs with loops

classification quant-ph physics.chem-ph
keywords graphvibrationalcalculatedfranck-condonhafnianhavinglooploops
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
Share X Bluesky LinkedIn Reddit HN
abstract

We show that the Franck-Condon Factor (FCF) associated to a transition between initial and final vibrational states in two different potential energy surfaces, having $N$ and $M$ vibrational quanta, respectively, is equivalent to calculating the number of perfect matchings of a weighted graph with loops that has $P = N+M$ vertices. This last quantity is the loop hafnian of the (symmetric) adjacency matrix of the graph which can be calculated in $O(P^3 2^{P/2})$ steps. In the limit of small numbers of vibrational quanta per normal mode our loop hafnian formula significantly improves the speed at which FCFs can be calculated. Our results more generally apply to the calculation of the matrix elements of a bosonic Gaussian unitary between two multimode Fock states having $N$ and $M$ photons in total and provide a useful link between certain calculations of quantum chemistry, quantum optics and graph theory.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.