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

arXiv:2410.02726 · Physical Review A

Photonic parameter-shift rule: Enabling gradient computation for photonic quantum computers

Axel Pappalardo, Pierre-Emmanuel Emeriau, Giovanni de Felice, Brian Ventura, Hugo Jaunin, Richie Wai Kit Yeung, Bob Coecke, Shane Mansfield

Published Mar 25, 2025• 11 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1103/physreva.111.032429

Related papers

Variational approach to photonic quantum circuits via the parameter shift rule

Francesco Hoch, Giovanni Rodari, Taira Giordani +9 more

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.

arXiv:2410.06966•Physical Review Research•Jun 4, 2025•14 citations

Parameter Shift Rule for Variational Photonic Quantum Circuit

Francesco Hoch, Giovanni Rodari, Taira Giordani +9 more

In recent years, variational quantum algorithms (VQA) have been receiving a great deal of attention, demonstrating their applicability in a wide range of tasks and implementable even in the noisy quantum processors currently available [1]. A VQA is a hybrid quantum-classical algorithm where a problem is encoded in a cost function that can be efficiently evaluated on a parametric quantum device and the minimum represents the desired solution. A classical optimizer can then be used to tune the parameters of the quantum device in order to minimize the loss function and find the optimal solution (Fig. 1). In the field of quantum computing, one of the main promising platforms is based on the use of single photons and integrated photonic circuits since photons are a natural choice for transferring information and have different degree of freedom that can be to encode the information. Moreover the use of integrated photonic allow the realization of compact and table complex interferometers with a high number of control parameters. Even if there are few applications [2], [3], VQA with photonic platforms remains a relatively unexplored subject. One of the main problems is the application of the classical optimizer to the photonic platform since most of the algorithms are based on the estimation of the gradient of the cost function with the finite difference method but that can not be applied to a noisy apparatus.

Conference on Lasers and Electro-Optics Europe & European Quantum Electronics Conference (CLEO/Europe-EQEC)•Jun 23, 2025•0 citations

Exact gradients for linear optics with single photons

Giorgio Facelli, Roberts, David D., Hugo Wallner +3 more

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.

arXiv:2409.16369•Sep 24, 2024•3 citations

Parameter-Shift Rules for Gradients in Boson Sampling Experiments

Marius Trudeau, Pierre-Emmanuel Emeriau, Nicolás Quesada

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.

quant-pharXiv:2607.15160•Jul 17, 2026•0 citations

Single-component gradient rules for variational quantum algorithms

Thomas Hubregtsen, Frederik Wilde, Shozab Qasim +1 more

Abstract Many near-term quantum computing algorithms are conceived as variational quantum algorithms, in which parameterized quantum circuits are optimized in a hybrid quantum–classical setup. Examples are variational quantum eigensolvers, quantum approximate optimization algorithms as well as various algorithms in the context of quantum-assisted machine learning. A common bottleneck of any such algorithm is constituted by the optimization of the variational parameters. A popular set of optimization methods work on the estimate of the gradient, obtained by means of circuit evaluations. We will refer to the way in which one can combine these circuit evaluations as gradient rules. This work provides a comprehensive picture of the family of gradient rules that vary parameters of quantum gates individually. The most prominent known members of this family are the parameter shift rule (PSR) and the finite differences method. To unite this family, we propose a generalized PSR that expresses all members of the aforementioned family as special cases, and discuss how all of these can be seen as providing access to a linear combination of exact first- and second-order derivatives. We further prove that a PSR with one non-shifted evaluation and only one shifted circuit evaluation does not exist, and introduce a novel perspective for approaching new gradient rules.

arXiv:2106.01388•Quantum Science and Technology•Apr 19, 2022•11 citations

Overshifted parameter-shift rules: optimizing complex quantum systems with few measurements

Leonardo Banchi, Dominic Branford, Chetan Waghela

Abstract Gradient-based optimization is a key ingredient of variational quantum algorithms, with applications ranging from quantum machine learning to quantum chemistry and simulation. The parameter-shift rule provides a hardware-friendly method for evaluating gradients of expectation values with respect to circuit parameters, but its applicability is limited to circuits whose gate generators have a particular spectral structure. In this work, we present a generalized framework that, with optimal minimum measurement overhead, extends parameter shift rules beyond this restrictive setting to encompass basically arbitrary gate generator, possibly made of complicated multi-qubit interactions with unknown spectrum and, in some settings, even infinite dimensional systems such as those describing photonic devices or qubit-oscillator systems. Our generalization enables the use of more expressive quantum circuits in variational quantum optimization and enlarges its scope by harnessing all the available hardware degrees of freedom.

arXiv:2510.05289•Quantum Science and Technology•May 27, 2026•0 citations
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.
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.
In recent years, variational quantum algorithms (VQA) have been receiving a great deal of attention, demonstrating their applicability in a wide range of tasks and implementable even in the noisy quantum processors currently available [1]. A VQA is a hybrid quantum-classical algorithm where a problem is encoded in a cost function that can be efficiently evaluated on a parametric quantum device and the minimum represents the desired solution. A classical optimizer can then be used to tune the parameters of the quantum device in order to minimize the loss function and find the optimal solution (Fig. 1). In the field of quantum computing, one of the main promising platforms is based on the use of single photons and integrated photonic circuits since photons are a natural choice for transferring information and have different degree of freedom that can be to encode the information. Moreover the use of integrated photonic allow the realization of compact and table complex interferometers with a high number of control parameters. Even if there are few applications [2], [3], VQA with photonic platforms remains a relatively unexplored subject. One of the main problems is the application of the classical optimizer to the photonic platform since most of the algorithms are based on the estimation of the gradient of the cost function with the finite difference method but that can not be applied to a noisy apparatus.
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.
Using a robust photon loss model for photonic quantum experiments, we derive n−n-n−th order parameter-shift rules for computing gradients of Fock boson sampling transition probabilities where nnn 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.
Abstract Many near-term quantum computing algorithms are conceived as variational quantum algorithms, in which parameterized quantum circuits are optimized in a hybrid quantum–classical setup. Examples are variational quantum eigensolvers, quantum approximate optimization algorithms as well as various algorithms in the context of quantum-assisted machine learning. A common bottleneck of any such algorithm is constituted by the optimization of the variational parameters. A popular set of optimization methods work on the estimate of the gradient, obtained by means of circuit evaluations. We will refer to the way in which one can combine these circuit evaluations as gradient rules. This work provides a comprehensive picture of the family of gradient rules that vary parameters of quantum gates individually. The most prominent known members of this family are the parameter shift rule (PSR) and the finite differences method. To unite this family, we propose a generalized PSR that expresses all members of the aforementioned family as special cases, and discuss how all of these can be seen as providing access to a linear combination of exact first- and second-order derivatives. We further prove that a PSR with one non-shifted evaluation and only one shifted circuit evaluation does not exist, and introduce a novel perspective for approaching new gradient rules.
Abstract Gradient-based optimization is a key ingredient of variational quantum algorithms, with applications ranging from quantum machine learning to quantum chemistry and simulation. The parameter-shift rule provides a hardware-friendly method for evaluating gradients of expectation values with respect to circuit parameters, but its applicability is limited to circuits whose gate generators have a particular spectral structure. In this work, we present a generalized framework that, with optimal minimum measurement overhead, extends parameter shift rules beyond this restrictive setting to encompass basically arbitrary gate generator, possibly made of complicated multi-qubit interactions with unknown spectrum and, in some settings, even infinite dimensional systems such as those describing photonic devices or qubit-oscillator systems. Our generalization enables the use of more expressive quantum circuits in variational quantum optimization and enlarges its scope by harnessing all the available hardware degrees of freedom.