Feynman path sum approach for simulation of linear optics

• URL: http://arxiv.org/abs/2510.26408v1
• Date: Thu, 30 Oct 2025 11:56:41 GMT
• Title: Feynman path sum approach for simulation of linear optics
• Authors: Wagner F. Balthazar, Quinn M. B. Palmer, Alex. E. Jones, Jake F. F. Bulmer, Ernesto. F. Galvão,
• Abstract summary: We adapt the Feynman path integral formalism for the calculation of probability amplitudes of linear-optical boson sampling experiments.<n>We implement a Linear-Optical Feynman Path simulator in open-source C code, enhancing its performance.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The Feynman path integral formalism has inspired the development of memory-efficient and parallelizable classical algorithms for simulating quantum computers. We adapt this approach for the calculation of probability amplitudes of linear-optical boson sampling experiments, which involve Fock-state inputs, linear optical circuits, and photo-detection at the output. We describe this simulation method and compare it with alternative approaches. Additionally, we implement a Linear-Optical Feynman Path simulator in open-source C code, enhancing its performance using tensor contraction techniques. Our method is benchmarked for low-depth linear optical circuits, where it offers advantages in runtime and memory efficiency.

Related papers

• Practical Application of the Quantum Carleman Lattice Boltzmann Method in Industrial CFD Simulations [44.99833362998488]
  This work presents a practical numerical assessment of a hybrid quantum-classical approach to CFD based on the Lattice Boltzmann Method (LBM)<n>We evaluate this method on three benchmark cases featuring different boundary conditions, periodic, bounceback, and moving wall.<n>Our results confirm the validity of the approach, achieving median error fidelities on the order of $10-3$ and success probabilities sufficient for practical quantum state sampling.
  arXiv  Detail & Related papers  (2025-04-17T15:41:48Z)
• Fast and memory efficient strong simulation of noisy adaptive linear optical circuits [0.0]
  We propose an algorithm that models the output amplitudes as partial derivatives of a multivariate.<n>In terms of memory, storing one path from the root to the leaves is sufficient to iterate over all amplitudes and requires only $2n$ elements, as opposed to $binomn+m-1n$ for the fastest state of the art method.<n>This approach effectively balances the time-memory trade-off while extending to both noisy and feedforward scenarios with negligible cost.
  arXiv  Detail & Related papers  (2025-03-07T18:59:16Z)
• Fast Expectation Value Calculation Speedup of Quantum Approximate Optimization Algorithm: HoLCUs QAOA [55.2480439325792]
  We present a new method for calculating expectation values of operators that can be expressed as a linear combination of unitary (LCU) operators.<n>This method is general for any quantum algorithm and is of particular interest in the acceleration of variational quantum algorithms.
  arXiv  Detail & Related papers  (2025-03-03T17:15:23Z)
• Efficient classical algorithms for linear optical circuits [0.0]
  We present efficient classical algorithms to approximate expectation values and probability amplitudes in linear optical circuits.<n>This result suggests that certain applications of linear optical circuits relying on expectation value estimation, such as photonic variational algorithms, may face challenges in achieving quantum advantage.
  arXiv  Detail & Related papers  (2025-02-18T14:13:24Z)
• Variational approach to photonic quantum circuits via the parameter shift rule [0.0]
  variational quantum algorithms are promising approaches for solving optimization tasks.<n>In this paper, we derive a formulation of the parameter shift rule for computing derivatives and integrals tailored to reconfigurable optical linear circuits.<n>We employ the developed approach to experimentally test variational algorithms with single-photon states processed in a reconfigurable 6-mode universal interferometer.
  arXiv  Detail & Related papers  (2024-10-09T15:06:17Z)
• Verification of Geometric Robustness of Neural Networks via Piecewise Linear Approximation and Lipschitz Optimisation [57.10353686244835]
  We address the problem of verifying neural networks against geometric transformations of the input image, including rotation, scaling, shearing, and translation. The proposed method computes provably sound piecewise linear constraints for the pixel values by using sampling and linear approximations in combination with branch-and-bound Lipschitz. We show that our proposed implementation resolves up to 32% more verification cases than present approaches.
  arXiv  Detail & Related papers  (2024-08-23T15:02:09Z)
• Differentiation of Linear Optical Circuits [0.0]
  This paper develops classical and quantum algorithms for evaluating the analytic gradients of linear optical circuits.<n>We show how to compute the gradients of the expectation values of a special class of non-interacting'' observables arising in full-counting-statistics.
  arXiv  Detail & Related papers  (2024-01-15T22:43:22Z)
• Stochastic Gradient Descent for Gaussian Processes Done Right [86.83678041846971]
  We show that when emphdone right -- by which we mean using specific insights from optimisation and kernel communities -- gradient descent is highly effective. We introduce a emphstochastic dual descent algorithm, explain its design in an intuitive manner and illustrate the design choices. Our method places Gaussian process regression on par with state-of-the-art graph neural networks for molecular binding affinity prediction.
  arXiv  Detail & Related papers  (2023-10-31T16:15:13Z)
• D4FT: A Deep Learning Approach to Kohn-Sham Density Functional Theory [79.50644650795012]
  We propose a deep learning approach to solve Kohn-Sham Density Functional Theory (KS-DFT) We prove that such an approach has the same expressivity as the SCF method, yet reduces the computational complexity. In addition, we show that our approach enables us to explore more complex neural-based wave functions.
  arXiv  Detail & Related papers  (2023-03-01T10:38:10Z)
• Optimal Algorithms for the Inhomogeneous Spiked Wigner Model [89.1371983413931]
  We derive an approximate message-passing algorithm (AMP) for the inhomogeneous problem. We identify in particular the existence of a statistical-to-computational gap where known algorithms require a signal-to-noise ratio bigger than the information-theoretic threshold to perform better than random.
  arXiv  Detail & Related papers  (2023-02-13T19:57:17Z)
• Automatic and effective discovery of quantum kernels [41.61572387137452]
  Quantum computing can empower machine learning models by enabling kernel machines to leverage quantum kernels for representing similarity measures between data.<n>We present an approach to this problem, which employs optimization techniques, similar to those used in neural architecture search and AutoML.<n>The results obtained by testing our approach on a high-energy physics problem demonstrate that, in the best-case scenario, we can either match or improve testing accuracy with respect to the manual design approach.
  arXiv  Detail & Related papers  (2022-09-22T16:42:14Z)
• Classical simulation of bosonic linear-optical random circuits beyond linear light cone [2.5496329090462626]
  We examine classical simulability of sampling from the output photon-number distribution of linear-optical circuits. We show that the algorithms' error is exponentially small up to a depth less than quadratic in the distance between sources.
  arXiv  Detail & Related papers  (2021-02-19T18:33:31Z)
• 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)

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.