Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

A faster calculation of Franck-Condon factors and Fock matrix elements of Gaussian unitaries using loop hafnians

Nicolás Quesada

Published Nov 23, 2018• 1 citation
OpenAlex

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.

Related papers

Franck-Condon factors via compressive sensing

Kevin Valson Jacob, Eneet Kaur, Wojciech Roga +1 more

The probabilities of vibronic transitions in molecules are referred to as Franck-Condon factors (FCFs). Although several approaches for calculating FCFs have been developed, such calculations are still challenging. Recently it was shown that there exists a correspondence between the problem of calculating FCFs and boson sampling. However, if the output photon number distribution of boson sampling is sparse, then it can be classically simulated. Exploiting these results, we develop a method to approximately reconstruct the distribution of FCFs of certain molecules. We demonstrate its proof of concept by applying it to formic acid and thymine at 0 K. In our method, we first obtain the marginal photon number distributions for pairs of modes of a Gaussian state associated with the molecular transition. We then apply a compressive sensing method called polynomial-time matching pursuit to recover FCFs.

arXiv:1909.02935•Physical Review A•Sep 8, 2020•6 citations

Photon-number moments and cumulants of Gaussian states

Yanic Cardin, Nicolás Quesada

We develop closed-form expressions for the moments and cumulants of Gaussian states when measured in the photon-number basis. We express the photon-number moments of a Gaussian state in terms of the loop Hafnian, a function that when applied to a ( 0 , 1 ) -matrix representing the adjacency of a graph, counts the number of its perfect matchings. Similarly, we express the photon-number cumulants in terms of the Montrealer, a newly introduced matrix function that when applied to a ( 0 , 1 ) -matrix counts the number of Hamiltonian cycles of that graph. Based on these graph-theoretic connections, we show that the calculation of photon-number moments and cumulants are #P-hard. Moreover, we provide an exponential time algorithm to calculate Montrealers (and thus cumulants), matching well-known results for Hafnians. We then demonstrate that when a uniformly lossy interferometer is fed in every input with identical single-mode Gaussian states with zero displacement, all the odd-order cumulants but the first one are zero. Finally, we employ the expressions we derive to study the distribution of cumulants up to the fourth order for different input states in a Gaussian boson sampling setup where K identical states are fed into an ℓ -mode interferometer. We analyze the dependence of the cumulants as a function of the type of input state, squeezed, lossy squeezed, squashed, or thermal, and as a function of the number of non-vacuum inputs. We find that thermal states perform much worse than other classical states, such as squashed states, at mimicking the photon-number cumulants of lossy or lossless squeezed states.

arXiv:2212.06067•Quantum•Nov 13, 2024•12 citations

Estimating Franck-Condon factors using an NMR quantum processor

Sharad Joshi, Abhishek Shukla, Hemant Katiyar +2 more

The interaction of molecules with light may lead to electronic transitions and simultaneous vibrational excitations. Franck-Condon factors (FCFs) play an important role in quantifying the intensities of such vibronic transitions occurring during molecular photoexcitations. In this article, we describe a general method for estimating FCFs using a quantum information processor. The method involves the application of a translation operator followed by the measurement of certain projections. We also illustrate the method by experimentally estimating FCFs with the help of a three-qubit nuclear magnetic resonance quantum information processor. We describe two methods for the measurement of projections: (i) using the Moussa protocol and (ii) using diagonal tomography. The experimental results agree fairly well with the theory.

arXiv:1405.2400•Physical Review A•Aug 4, 2014•21 citations

Combinatorial Matrix Functions in Ising Models and Quantum Circuit Representation

Minhyeok Kang, Gwonhak Lee, Youngrong Lim +1 more

Permanents, hafnians, and loop-hafnians are combinatorial matrix functions defined on the perfect matchings of graphs. These matrix functions arise in the quantum amplitudes for output photon configurations in linear optical networks, which has led both to sampling hardness results and to a variety of applications. The same matrix functions also appear in Ising models, since Ising models naturally encode graphs, and the matrix functions emerge from quantum interference. However, previous results have been restricted to balanced bipartite graphs, and hence to the permanent. In this paper, we extend the graph structure of the Ising model so that all three matrix functions can be obtained. In particular, self-loops can be encoded by introducing additional spins, and the loop-hafnian is obtained from a superposition of spin states, which we call the loop-hafnian state. We show how to recover the hafnian and permanent cases as the number of self-loops decreases. Moreover, we show that the Ising dynamics we consider can be simulated on a quantum circuit with \(O(n^2)\) gates for a \(2n \times 2n\) real symmetric matrix. Specifically, we propose a quantum circuit that maps the loop-hafnian state to a basis state with \(O(n^2)\) gates, and show that, by an adaptive measurement, the loop-hafnian states for all subsets of vertices can be measured simultaneously.

quant-pharXiv:2602.01868•Feb 3, 2026•0 citations

Exact calculations of Franck–Condon overlaps and of matrix elements of some potentials by means of the coherent state representation

Kiyoshi Nishikawa

Abstract Franck–Condon overlaps are described as the matrix elements of unitary operators related to the spatial displacement and the frequency shift. They are calculated exactly by means of the coherent state representation. Furthermore, the generalized matrix elements of xj, e−αx, and e−βx2 between two states with different equilibrium coordinates and frequency are evaluated in the same way.

International Journal of Quantum Chemistry•Nov 1, 1977•19 citations

Gaussian boson sampling for perfect matchings of arbitrary graphs

Kamil Brádler, Pierre-Luc Dallaire-Demers, Patrick Rebentrost +2 more

A famously hard graph problem with a broad range of applications is computing the number of perfect matchings, that is, the number of unique and complete pairings of the vertices of a graph. We propose a method to estimate the number of perfect matchings of undirected graphs based on the relation between Gaussian boson sampling and graph theory. The probability of measuring zero or one photons in each output mode is directly related to the hafnian of the adjacency matrix, and thus to the number of perfect matchings of a graph. We present encodings of the adjacency matrix of a graph into a Gaussian state and show strategies to boost the sampling success probability for the studied graphs. With our method, a Gaussian boson sampling device can be used to estimate the number of perfect matchings significantly faster and with lower-energy consumption compared to a classical computer.

arXiv:1712.06729•Physical Review A•Sep 10, 2018•105 citations
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 NNN and MMM vibrational quanta, respectively, is equivalent to calculating the number of perfect matchings of a weighted graph with loops that has P=N+MP = N+MP=N+M vertices. This last quantity is the loop hafnian of the (symmetric) adjacency matrix of the graph which can be calculated in O(P32P/2)O(P^3 2^{P/2})O(P32P/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 NNN and MMM photons in total and provide a useful link between certain calculations of quantum chemistry, quantum optics and graph theory.
The probabilities of vibronic transitions in molecules are referred to as Franck-Condon factors (FCFs). Although several approaches for calculating FCFs have been developed, such calculations are still challenging. Recently it was shown that there exists a correspondence between the problem of calculating FCFs and boson sampling. However, if the output photon number distribution of boson sampling is sparse, then it can be classically simulated. Exploiting these results, we develop a method to approximately reconstruct the distribution of FCFs of certain molecules. We demonstrate its proof of concept by applying it to formic acid and thymine at 0 K. In our method, we first obtain the marginal photon number distributions for pairs of modes of a Gaussian state associated with the molecular transition. We then apply a compressive sensing method called polynomial-time matching pursuit to recover FCFs.
We develop closed-form expressions for the moments and cumulants of Gaussian states when measured in the photon-number basis. We express the photon-number moments of a Gaussian state in terms of the loop Hafnian, a function that when applied to a ( 0 , 1 ) -matrix representing the adjacency of a graph, counts the number of its perfect matchings. Similarly, we express the photon-number cumulants in terms of the Montrealer, a newly introduced matrix function that when applied to a ( 0 , 1 ) -matrix counts the number of Hamiltonian cycles of that graph. Based on these graph-theoretic connections, we show that the calculation of photon-number moments and cumulants are #P-hard. Moreover, we provide an exponential time algorithm to calculate Montrealers (and thus cumulants), matching well-known results for Hafnians. We then demonstrate that when a uniformly lossy interferometer is fed in every input with identical single-mode Gaussian states with zero displacement, all the odd-order cumulants but the first one are zero. Finally, we employ the expressions we derive to study the distribution of cumulants up to the fourth order for different input states in a Gaussian boson sampling setup where K identical states are fed into an ℓ -mode interferometer. We analyze the dependence of the cumulants as a function of the type of input state, squeezed, lossy squeezed, squashed, or thermal, and as a function of the number of non-vacuum inputs. We find that thermal states perform much worse than other classical states, such as squashed states, at mimicking the photon-number cumulants of lossy or lossless squeezed states.
The interaction of molecules with light may lead to electronic transitions and simultaneous vibrational excitations. Franck-Condon factors (FCFs) play an important role in quantifying the intensities of such vibronic transitions occurring during molecular photoexcitations. In this article, we describe a general method for estimating FCFs using a quantum information processor. The method involves the application of a translation operator followed by the measurement of certain projections. We also illustrate the method by experimentally estimating FCFs with the help of a three-qubit nuclear magnetic resonance quantum information processor. We describe two methods for the measurement of projections: (i) using the Moussa protocol and (ii) using diagonal tomography. The experimental results agree fairly well with the theory.
Permanents, hafnians, and loop-hafnians are combinatorial matrix functions defined on the perfect matchings of graphs. These matrix functions arise in the quantum amplitudes for output photon configurations in linear optical networks, which has led both to sampling hardness results and to a variety of applications. The same matrix functions also appear in Ising models, since Ising models naturally encode graphs, and the matrix functions emerge from quantum interference. However, previous results have been restricted to balanced bipartite graphs, and hence to the permanent. In this paper, we extend the graph structure of the Ising model so that all three matrix functions can be obtained. In particular, self-loops can be encoded by introducing additional spins, and the loop-hafnian is obtained from a superposition of spin states, which we call the loop-hafnian state. We show how to recover the hafnian and permanent cases as the number of self-loops decreases. Moreover, we show that the Ising dynamics we consider can be simulated on a quantum circuit with O(n2)O(n^2)O(n2) gates for a 2n×2n2n \times 2n2n×2n real symmetric matrix. Specifically, we propose a quantum circuit that maps the loop-hafnian state to a basis state with O(n2)O(n^2)O(n2) gates, and show that, by an adaptive measurement, the loop-hafnian states for all subsets of vertices can be measured simultaneously.
A famously hard graph problem with a broad range of applications is computing the number of perfect matchings, that is, the number of unique and complete pairings of the vertices of a graph. We propose a method to estimate the number of perfect matchings of undirected graphs based on the relation between Gaussian boson sampling and graph theory. The probability of measuring zero or one photons in each output mode is directly related to the hafnian of the adjacency matrix, and thus to the number of perfect matchings of a graph. We present encodings of the adjacency matrix of a graph into a Gaussian state and show strategies to boost the sampling success probability for the studied graphs. With our method, a Gaussian boson sampling device can be used to estimate the number of perfect matchings significantly faster and with lower-energy consumption compared to a classical computer.