Photon-number moments and cumulants of Gaussian states

Abstract

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 $\ell$-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.

To appear in Quantum

References in corpus (24)

• PyTorch: An Imperative Style, High-Performance Deep Learning Library
• Quantum computational advantage using photons
• Boson sampling with 20 input photons in 60-mode interferometers at $10^{14}$ state spaces
• Phase-Programmable Gaussian Boson Sampling Using Stimulated Squeezed Light
• Gaussian states in continuous variable quantum information
• Computational advantage of quantum random sampling
• Gaussian Boson Sampling with Pseudo-Photon-Number Resolving Detectors and Quantum Computational Advantage
• Quantum Computational Advantage via High-Dimensional Gaussian Boson Sampling
• What can quantum optics say about computational complexity theory?
• The Boundary for Quantum Advantage in Gaussian Boson Sampling
• Combinatorics and Boson normal ordering: A gentle introduction
• Beyond photon pairs: Nonlinear quantum photonics in the high-gain regime
• A universal programmable Gaussian Boson Sampler for drug discovery
• Franck-Condon factors by counting perfect matchings of graphs with loops
• The Complexity of Bipartite Gaussian Boson Sampling
• Fully Relativistic Entanglement Harvesting
• Relativistic quantum communication between harmonic oscillator detectors
• Classical models may be a better explanation of the Jiuzhang 1.0 Gaussian Boson Sampler than its targeted squeezed light model
• Experimental demonstration of Gaussian boson sampling with displacement
• Threshold detection statistics of bosonic states
• Riemannian optimization of photonic quantum circuits in phase and Fock space
• A general framework for multimode Gaussian quantum optics and photo-detection: application to Hong-Ou-Mandel interference with filtered heralded single photon sources
• Particle detector models from path integrals of localized quantum fields
• Simulating the Photon Statistics of Multimode Gaussian States by Automatic Differentiation of Generating Functions

Cited by in corpus (3)

• What's my phase again? Computing the vacuum-to-vacuum amplitude of quadratic bosonic evolution
• A Quantum Non-Gaussianity Criterion Based on Photon Correlations $g^{(2)}$ and $g^{(3)}$
• Unified boson sampling