General simulation method for spontaneous parametric down- and parametric up-conversion experiments

• URL: http://arxiv.org/abs/2112.07243v2
• Date: Wed, 19 Oct 2022 12:40:52 GMT
• Title: General simulation method for spontaneous parametric down- and parametric up-conversion experiments
• Authors: Felix Riexinger, Mirco Kutas, Bj\"orn Haase, Patricia Bickert, Daniel Molter, Michael Bortz, and Georg von Freymann
• Abstract summary: Spontaneous parametric down-conversion (SPDC) sources are an important technology for quantum sensing and imaging. We demonstrate a general simulation method, based on modeling from first principles, reproducing the spectrally and spatially resolved absolute counts of a SPDC experiment.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Spontaneous parametric down-conversion (SPDC) sources are an important technology for quantum sensing and imaging. We demonstrate a general simulation method, based on modeling from first principles, reproducing the spectrally and spatially resolved absolute counts of a SPDC experiment. By simulating additional processes and effects we accomplish good agreement with the experimental results. This method is broadly applicable and allows for the separation of contributing processes, virtual characterization of SPDC sources, and enables the simulation of many quantum based applications.

Related papers

• Cosmological Parameter Estimation with Sequential Linear Simulation-based Inference [0.0]
  We develop a framework for simulation-based inference where the likelihood is approximated by a Gaussian linear function of its parameters. We find that convergence is achieved after four or five rounds of $mathcalO(104)$ simulations, which is competitive with state-of-the-art neural density estimation methods.
  arXiv  Detail & Related papers  (2025-01-07T16:34:47Z)
• Parallel simulation for sampling under isoperimetry and score-based diffusion models [56.39904484784127]
  As data size grows, reducing the iteration cost becomes an important goal. Inspired by the success of the parallel simulation of the initial value problem in scientific computation, we propose parallel Picard methods for sampling tasks. Our work highlights the potential advantages of simulation methods in scientific computation for dynamics-based sampling and diffusion models.
  arXiv  Detail & Related papers  (2024-12-10T11:50:46Z)
• Bayesian Adaptive Calibration and Optimal Design [23.319315014843713]
  Current machine learning approaches mostly rely on rerunning simulations over a fixed set of designs available in the observed data. We propose a data-efficient algorithm to run maximally informative simulations within a batch-sequential process. We show the benefits of our method when compared to related approaches across synthetic and real-data problems.
  arXiv  Detail & Related papers  (2024-05-23T11:14:35Z)
• Diffusion posterior sampling for simulation-based inference in tall data settings [53.17563688225137]
  Simulation-based inference ( SBI) is capable of approximating the posterior distribution that relates input parameters to a given observation. In this work, we consider a tall data extension in which multiple observations are available to better infer the parameters of the model. We compare our method to recently proposed competing approaches on various numerical experiments and demonstrate its superiority in terms of numerical stability and computational cost.
  arXiv  Detail & Related papers  (2024-04-11T09:23:36Z)
• Importance sampling for stochastic quantum simulations [68.8204255655161]
  We introduce the qDrift protocol, which builds random product formulas by sampling from the Hamiltonian according to the coefficients. We show that the simulation cost can be reduced while achieving the same accuracy, by considering the individual simulation cost during the sampling stage. Results are confirmed by numerical simulations performed on a lattice nuclear effective field theory.
  arXiv  Detail & Related papers  (2022-12-12T15:06:32Z)
• General simulation method for quantum-sensing systems [0.0]
  We present a general simulation method that includes experimental imperfections to bridge the gap between theory and experiment. We develop a theoretical approach and demonstrate the capabilities with the simulation of aligned and misaligned quantum-imaging experiments.
  arXiv  Detail & Related papers  (2022-11-21T20:35:37Z)
• Neural Posterior Estimation with Differentiable Simulators [58.720142291102135]
  We present a new method to perform Neural Posterior Estimation (NPE) with a differentiable simulator. We demonstrate how gradient information helps constrain the shape of the posterior and improves sample-efficiency.
  arXiv  Detail & Related papers  (2022-07-12T16:08:04Z)
• AD-NEGF: An End-to-End Differentiable Quantum Transport Simulator for Sensitivity Analysis and Inverse Problems [14.955199623904157]
  We propose AD-NEGF, to our best knowledge the first end-to-end differentiable NEGF model for quantum transport simulations. We implement the entire numerical process in PyTorch, and design customized backward pass with implicit layer techniques. The proposed model is validated with applications in calculating differential physical quantities, empirical parameter fitting, and doping optimization.
  arXiv  Detail & Related papers  (2022-02-10T15:35:48Z)
• Likelihood-Free Inference in State-Space Models with Unknown Dynamics [71.94716503075645]
  We introduce a method for inferring and predicting latent states in state-space models where observations can only be simulated, and transition dynamics are unknown. We propose a way of doing likelihood-free inference (LFI) of states and state prediction with a limited number of simulations.
  arXiv  Detail & Related papers  (2021-11-02T12:33:42Z)
• Hybridized Methods for Quantum Simulation in the Interaction Picture [69.02115180674885]
  We provide a framework that allows different simulation methods to be hybridized and thereby improve performance for interaction picture simulations. Physical applications of these hybridized methods yield a gate complexity scaling as $log2 Lambda$ in the electric cutoff. For the general problem of Hamiltonian simulation subject to dynamical constraints, these methods yield a query complexity independent of the penalty parameter $lambda$ used to impose an energy cost.
  arXiv  Detail & Related papers  (2021-09-07T20:01:22Z)
• Precise Programmable Quantum Simulations with Optical Lattices [6.100524086514004]
  We present an efficient approach to simulate tight binding models with optical lattices, based on programmable digital-micromirror-device (DMD) techniques. We develop classical algorithms to achieve high precision and high efficiency. We expect this approach would pave a way towards large-scale and precise programmable quantum simulations based on optical lattices.
  arXiv  Detail & Related papers  (2020-03-03T18:00:43Z)

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.