Essentially exact numerical modelling of flux qubit chains subject to charge and flux noise

• URL: http://arxiv.org/abs/2110.01647v1
• Date: Mon, 4 Oct 2021 18:20:07 GMT
• Title: Essentially exact numerical modelling of flux qubit chains subject to charge and flux noise
• Authors: Matthew R.C. Fitzpatrick, Jack Raymond, Malcolm P. Kennett
• Abstract summary: We present an essentially exact numerical method for modelling flux qubit chains subject to charge and flux noise. The method adopts the quasi-adiabatic path integral formalism to express the system's reduced density matrix as a time-discretized path integral. We have implemented our method in an open-sourced Python library called "spinbosonchain"
• Score: 0.45119235878273
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We present an essentially exact numerical method for modelling flux qubit chains subject to charge and flux noise. We define an essentially exact method as one that introduces errors that are completely controlled such that they can be made arbitrarily small by tuning the simulation parameters. The method adopts the quasi-adiabatic path integral formalism to express the system's reduced density matrix as a time-discretized path integral, comprising a series of influence functionals that encode the non-Markovian dynamics of the system. We present a detailed derivation of the path integral expression for the system's reduced density matrix and describe in detail the tensor network algorithm used to evaluate the path integral expression. We have implemented our method in an open-sourced Python library called "spinbosonchain". When appropriate, we draw connections between concepts covered in this manuscript and the library's code.

Related papers

• Modular Distributed Nonconvex Learning with Error Feedback [1.3198143828338362]
  We design a novel distributed learning algorithm using compressed communications. In detail, we pursue a modular approach, ADMM and a gradient-based approach.
  arXiv  Detail & Related papers  (2025-03-18T09:16:51Z)
• Neural Control Variates with Automatic Integration [49.91408797261987]
  This paper proposes a novel approach to construct learnable parametric control variates functions from arbitrary neural network architectures. We use the network to approximate the anti-derivative of the integrand. We apply our method to solve partial differential equations using the Walk-on-sphere algorithm.
  arXiv  Detail & Related papers  (2024-09-23T06:04:28Z)
• Information limits and Thouless-Anderson-Palmer equations for spiked matrix models with structured noise [19.496063739638924]
  We consider a saturate problem of Bayesian inference for a structured spiked model. We show how to predict the statistical limits using an efficient algorithm inspired by the theory of adaptive Thouless-Anderson-Palmer equations.
  arXiv  Detail & Related papers  (2024-05-31T16:38:35Z)
• Low-rank extended Kalman filtering for online learning of neural networks from streaming data [71.97861600347959]
  We propose an efficient online approximate Bayesian inference algorithm for estimating the parameters of a nonlinear function from a potentially non-stationary data stream. The method is based on the extended Kalman filter (EKF), but uses a novel low-rank plus diagonal decomposition of the posterior matrix. In contrast to methods based on variational inference, our method is fully deterministic, and does not require step-size tuning.
  arXiv  Detail & Related papers  (2023-05-31T03:48:49Z)
• Dealing with Collinearity in Large-Scale Linear System Identification Using Gaussian Regression [3.04585143845864]
  We consider estimation of networks consisting of several interconnected dynamic systems. We develop a strategy cast in a Bayesian regularization framework where any impulse response is seen as realization of a zero-mean Gaussian process. We design a novel Markov chain Monte Carlo scheme able to reconstruct the impulse responses posterior by efficiently dealing with collinearity.
  arXiv  Detail & Related papers  (2023-02-21T19:35:47Z)
• Bayesian Spline Learning for Equation Discovery of Nonlinear Dynamics with Quantified Uncertainty [8.815974147041048]
  We develop a novel framework to identify parsimonious governing equations of nonlinear (spatiotemporal) dynamics from sparse, noisy data with quantified uncertainty. The proposed algorithm is evaluated on multiple nonlinear dynamical systems governed by canonical ordinary and partial differential equations.
  arXiv  Detail & Related papers  (2022-10-14T20:37:36Z)
• Inverting brain grey matter models with likelihood-free inference: a tool for trustable cytoarchitecture measurements [62.997667081978825]
  characterisation of the brain grey matter cytoarchitecture with quantitative sensitivity to soma density and volume remains an unsolved challenge in dMRI. We propose a new forward model, specifically a new system of equations, requiring a few relatively sparse b-shells. We then apply modern tools from Bayesian analysis known as likelihood-free inference (LFI) to invert our proposed model.
  arXiv  Detail & Related papers  (2021-11-15T09:08:27Z)
• Deep Learning Approximation of Diffeomorphisms via Linear-Control Systems [91.3755431537592]
  We consider a control system of the form $dot x = sum_i=1lF_i(x)u_i$, with linear dependence in the controls. We use the corresponding flow to approximate the action of a diffeomorphism on a compact ensemble of points.
  arXiv  Detail & Related papers  (2021-10-24T08:57:46Z)
• Learning Linearized Assignment Flows for Image Labeling [70.540936204654]
  We introduce a novel algorithm for estimating optimal parameters of linearized assignment flows for image labeling. We show how to efficiently evaluate this formula using a Krylov subspace and a low-rank approximation.
  arXiv  Detail & Related papers  (2021-08-02T13:38:09Z)
• Learning Optical Flow from a Few Matches [67.83633948984954]
  We show that the dense correlation volume representation is redundant and accurate flow estimation can be achieved with only a fraction of elements in it. Experiments show that our method can reduce computational cost and memory use significantly, while maintaining high accuracy.
  arXiv  Detail & Related papers  (2021-04-05T21:44:00Z)
• The Boomerang Sampler [4.588028371034406]
  This paper introduces the Boomerang Sampler as a novel class of continuous-time non-reversible Markov chain Monte Carlo algorithms. We demonstrate that the method is easy to implement and demonstrate empirically that it can out-perform existing benchmark piecewise deterministic Markov processes.
  arXiv  Detail & Related papers  (2020-06-24T14:52:22Z)
• Nonparametric Bayesian volatility learning under microstructure noise [2.812395851874055]
  We study the problem of learning the volatility under market microstructure noise. Specifically, we consider noisy discrete time observations from a differential equation. We develop a novel computational method to learn the diffusion coefficient of the equation.
  arXiv  Detail & Related papers  (2018-05-15T07:32:18Z)

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.