Using a robust photon loss model for photonic quantum experiments, we derive $n-$th order parameter-shift rules for computing gradients of Fock boson sampling transition probabilities where $n$ photons are sent into a lossy interferometer. We also show that in general it is not possible to generalize this gradient recipe to the case of Gaussian boson sampling. Only in the specific case where the transmission matrix of the interferometer can be factorized as a diagonal loss matrix premultiplied by a pure unitary it is possible to obtain parameter-shift rules with a finite order given by twice the total number of photons detected. We demonstrate the efficacy of the proposed method by comparing its performance against finite differences on real hardware.
Using a robust photon loss model for photonic quantum experiments, we derive n−th order parameter-shift rules for computing gradients of Fock boson sampling transition probabilities where n photons are sent into a lossy interferometer. We also show that in general it is not possible to generalize this gradient recipe to the case of Gaussian boson sampling. Only in the specific case where the transmission matrix of the interferometer can be factorized as a diagonal loss matrix premultiplied by a pure unitary it is possible to obtain parameter-shift rules with a finite order given by twice the total number of photons detected. We demonstrate the efficacy of the proposed method by comparing its performance against finite differences on real hardware.
We present a method for gradient computation in quantum algorithms implemented on linear optical quantum computing platforms. While parameter-shift rules have become a staple in qubit gate-based quantum computing for calculating gradients, their direct application to photonic platforms has been hindered by the infinite dimensionality of phase-shift operators in Fock space. We introduce a photonic parameter-shift rule that overcomes this limitation, providing an exact formula for gradient computation in linear optical quantum processors. Our method scales linearly with the number of input photons and utilizes the same parametrized photonic circuit with shifted parameters for each evaluation. This advancement bridges a crucial gap in photonic quantum computing, enabling efficient gradient-based optimization for variational quantum algorithms on near-term photonic quantum processors. We demonstrate the efficacy of our approach through numerical simulations in quantum chemistry and generative modeling tasks, showing superior optimization performance as well as robustness to noise from finite sampling and photon distinguishability compared to other gradient-based and gradient-free methods.
Though parameter shift rules have drastically improved gradient estimation methods for several types of quantum circuits, leading to improved performance in downstream tasks, so far they have not been transferable to linear optics with single photons. In this work, we derive an analytical formula for the gradients in these circuits with respect to phaseshifters via a generalized parameter shift rule, where the number of parameter shifts depends linearly on the total number of photons. Experimentally, this enables access to derivatives in photonic systems without the need for finite difference approximations. Building on this, we propose two strategies through which one can reduce the number of shifts in the expression, and hence reduce the overall sample complexity. Numerically, we show that this generalized parameter-shift rule can converge to the minimum of a cost function with fewer parameter update steps than alternative techniques. We anticipate that this method will open up new avenues to solving optimization problems with photonic systems, as well as provide new techniques for the experimental characterization and control of linear optical systems.
We analyze the impact of photon loss on the photon-number statistics of Gaussian states. Specifically, we propose and carefully evaluate several methods to mitigate deviations in the photon-number distributions of lossy (displaced) squeezed vacuum states from those of their lossless counterparts. These methods rely on appropriately redefining the parameters of Gaussian states when the loss budget is known in order to recover, as closely as possible, the desired photon-number distribution associated with each target state. While it is intrinsically hard to directly optimize the photon-number distribution of high-dimensional, correlated multimode Gaussian states, the proposed methods are instead based on optimizing specific key properties such as fidelity, phase-space functions, low-order moments of the underlying photon-number statistics, or overlap with the vacuum state. In particular, our results show that optimizing the fidelity between a pure Gaussian target state and a modified Gaussian state that has passed through a loss channel does typically not result in closeness of the corresponding photon-number distributions. Furthermore, we show that correcting for the vacuum overlap minimizes the deviation in the photon-number distribution for large parameter ranges which we explicitly prove for single-mode squeezed vacuum and provide numerical evidence for general (displaced) squeezed vacuum states. As photon loss is a key limitation for Gaussian boson sampling, our results provide insights into the feasibility and limitations of such photonic quantum simulations in lossy environments and offer guidelines for mitigating these imperfections.
In the era of noisy intermediate-scale quantum computers, variational quantum algorithms are promising approaches for solving optimization tasks by training parameterized quantum circuits with the aid of classical routines informed by quantum measurements. In this context, photonic platforms based on reconfigurable integrated optics are an ideal candidate for implementing these algorithms. Among various techniques to train variational circuits, the parameter shift rule enables the exact calculation of cost function derivatives efficiently, facilitating gradient descent-based optimization. In this paper, we derive a formulation of the parameter shift rule for computing derivatives and integrals tailored to reconfigurable optical linear circuits and based on the Boson Sampling paradigm. This allows us to naturally embed common types of experimental noise, such as partial distinguishability and mixedness of the states, thus obtaining a resilient approach. Finally, we employ the developed approach to experimentally test variational algorithms with single-photon states processed in a reconfigurable six-mode universal integrated interferometer. Specifically, we apply the photonic parameter shift rules to the variational implementation, on a photonic platform, of both an eigensolver and a Universal- gate.
Photon loss makes Gaussian boson sampling easier to simulate classically. A standard approach replaces the lossy input by classical light, and it stays accurate while the mean number of surviving photons grows no faster than the square root of the number N of squeezed inputs at fixed squeezing and accuracy. We prove that this scale is a limit of replacement by classical light. For explicit interferometers, no state with a nonnegative Glauber--Sudarshan P representation, Gaussian or not and however correlated, keeps the error in the photon count distribution small beyond this scale. We then surpass this limit by approximating the detection instead of the input. The sampler evolves the state exactly between detections and, after each detection, replaces the conditional state by a Gaussian with the same covariance. For every interferometer its total variation error is O(Nη3) at polynomial expected cost, where η is the photon survival probability. The mean surviving photon number can therefore grow as N2/3 at fixed accuracy. A separate pair construction reaches N3/4 when every input mode is equally squeezed.
Quantum generative modeling has emerged as a promising application of quantum computers, aiming to model complex probability distributions beyond the reach of classical methods. In practice, however, training such models often requires costly gradient estimation performed directly on the quantum hardware. Crucially, for certain structured quantum circuits, expectation values of local observables can be efficiently evaluated on a classical computer, enabling classical training without calls to the quantum hardware in the optimization loop. In these models, sampling from the resulting circuits can still be classically hard, so inference must be performed on a quantum device, yielding a potential computational advantage. In this work, we introduce a photonic quantum generative model built on parametrized Gaussian Boson Sampling circuits. The training is based on the efficient classical evaluation of expectation values enabled by the Gaussian structure of the state, allowing scalable optimization of the model parameters through the maximum mean discrepancy loss function. We demonstrate the effectiveness of the approach through numerical experiments on photonic systems with up to 805 modes and over a million trainable parameters, highlighting its scalability and suitability for near-term photonic quantum devices.