A Photonic Parameter-shift Rule: Enabling Gradient Computation for Photonic Quantum Computers

• URL: http://arxiv.org/abs/2410.02726v1
• Date: Thu, 3 Oct 2024 17:47:38 GMT
• Title: A Photonic Parameter-shift Rule: Enabling Gradient Computation for Photonic Quantum Computers
• Authors: Axel Pappalardo, Pierre-Emmanuel Emeriau, Giovanni de Felice, Brian Ventura, Hugo Jaunin, Richie Yeung, Bob Coecke, Shane Mansfield,
• Abstract summary: We present a method for gradient computation in quantum computation algorithms implemented on linear optical quantum computing platforms. Our method scales linearly with the number of input photons and utilizes the same parameterized photonic circuit with shifted parameters for each evaluation.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• 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 non-unitary nature of differentiated 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 parameterized 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.

Related papers

• Photonic Quantum Receiver Attaining the Helstrom Bound [0.9674145073701151]
  We propose an efficient decomposition scheme for a quantum receiver that attains the Helstrom bound in the low-photon regime for discriminating binary coherent states. We account for realistic conditions by examining the impact of photon loss and imperfect photon detection, including the presence of dark counts. Our scheme motivates testing quantum advantages with cubic-phase gates and designing photonic quantum computers to optimize symbol-by-symbol measurements in optical communication.
  arXiv  Detail & Related papers  (2024-10-29T07:08:39Z)
• Variational approach to photonic quantum circuits via the parameter shift rule [0.0]
  We derive a formulation of the parameter shift rule for reconfigurable optical linear circuits based on the Boson Sampling paradigm. We also present similar rules for the computations of integrals over the variational parameters. We employ the developed approach to experimentally test variational algorithms with single-photon states processed in a reconfigurable 6-mode universal integrated interferometer.
  arXiv  Detail & Related papers  (2024-10-09T15:06:17Z)
• Experimental quantum natural gradient optimization in photonics [11.72584828456107]
  Variational quantum algorithms (VQAs) promise practical quantum applications in the Noisy Intermediate-Scale Quantum era. The quantum natural gradient (QNG) can achieve faster convergence and avoid local minima more easily. We utilize a fully programmable photonic chip to experimentally estimate the QNG in photonics for the first time.
  arXiv  Detail & Related papers  (2023-10-11T10:41:51Z)
• Efficient estimation of trainability for variational quantum circuits [43.028111013960206]
  We find an efficient method to compute the cost function and its variance for a wide class of variational quantum circuits. This method can be used to certify trainability for variational quantum circuits and explore design strategies that can overcome the barren plateau problem.
  arXiv  Detail & Related papers  (2023-02-09T14:05:18Z)
• Retrieving space-dependent polarization transformations via near-optimal quantum process tomography [55.41644538483948]
  We investigate the application of genetic and machine learning approaches to tomographic problems. We find that the neural network-based scheme provides a significant speed-up, that may be critical in applications requiring a characterization in real-time. We expect these results to lay the groundwork for the optimization of tomographic approaches in more general quantum processes.
  arXiv  Detail & Related papers  (2022-10-27T11:37:14Z)
• Implementation of photon partial distinguishability in a quantum optical circuit simulation [0.0]
  Photonic quantum states are represented by wavepackets which contain information on their time and frequency distributions. In order to account for the partial photon distinguishability, we expand the number of degrees of freedom associated with the circuit operation. This strategy allows to define delay operations in the same footing as the linear optical elements.
  arXiv  Detail & Related papers  (2022-08-05T16:01:39Z)
• Numerical Simulations of Noisy Quantum Circuits for Computational Chemistry [51.827942608832025]
  Near-term quantum computers can calculate the ground-state properties of small molecules. We show how the structure of the computational ansatz as well as the errors induced by device noise affect the calculation.
  arXiv  Detail & Related papers  (2021-12-31T16:33:10Z)
• Circuit Symmetry Verification Mitigates Quantum-Domain Impairments [69.33243249411113]
  We propose circuit-oriented symmetry verification that are capable of verifying the commutativity of quantum circuits without the knowledge of the quantum state. In particular, we propose the Fourier-temporal stabilizer (STS) technique, which generalizes the conventional quantum-domain formalism to circuit-oriented stabilizers.
  arXiv  Detail & Related papers  (2021-12-27T21:15:35Z)
• Variational Quantum Optimization with Multi-Basis Encodings [62.72309460291971]
  We introduce a new variational quantum algorithm that benefits from two innovations: multi-basis graph complexity and nonlinear activation functions. Our results in increased optimization performance, two increase in effective landscapes and a reduction in measurement progress.
  arXiv  Detail & Related papers  (2021-06-24T20:16:02Z)
• Rapid characterisation of linear-optical networks via PhaseLift [51.03305009278831]
  Integrated photonics offers great phase-stability and can rely on the large scale manufacturability provided by the semiconductor industry. New devices, based on such optical circuits, hold the promise of faster and energy-efficient computations in machine learning applications. We present a novel technique to reconstruct the transfer matrix of linear optical networks.
  arXiv  Detail & Related papers  (2020-10-01T16:04:22Z)
• Fast optimization of parametrized quantum optical circuits [0.0]
  Parametrized quantum optical circuits are a class of quantum circuits in which the carriers of quantum information are photons and the gates are optical transformations. We present an algorithm that is orders of magnitude faster than the current state of the art to compute the exact matrix elements of Gaussian operators and their gradient. Our results will find applications in quantum optical hardware research, quantum machine learning, optical data processing, device discovery and device design.
  arXiv  Detail & Related papers  (2020-04-23T07:02:45Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.