Efficient classical simulation of open bosonic quantum systems

• URL: http://arxiv.org/abs/2203.05526v2
• Date: Fri, 11 Mar 2022 13:46:30 GMT
• Title: Efficient classical simulation of open bosonic quantum systems
• Authors: Akseli M\"akinen, Joni Ikonen, Takaaki Aoki, Jani Tuorila, Yuichiro Matsuzaki, and Mikko M\"ott\"onen
• Abstract summary: We propose a method to solve the dynamics of operators of bosonic quantum systems coupled to their environments. The method maps the operator under interest to a set of complex-valued functions, and its adjoint master equation to a set of partial differential equations. We foresee the method to prove useful, e.g., for the verification of the operation of superconducting quantum processors.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: We propose a computationally efficient method to solve the dynamics of operators of bosonic quantum systems coupled to their environments. The method maps the operator under interest to a set of complex-valued functions, and its adjoint master equation to a set of partial differential equations for these functions, which are subsequently solved numerically. In the limit of weak coupling to the environment, the mapping of the operator enables storing the operator efficiently during the simulation, leading to approximately quadratic improvement in the memory consumption compared with the direct approach of solving the adjoint master equation in the number basis, while retaining the computation time comparable. Moreover, the method enables efficient parallelization which allows to optimize for the actual computational time to reach an approximately quadratic speed up, while retaining the memory consumption comparable to the direct approach. We foresee the method to prove useful, e.g., for the verification of the operation of superconducting quantum processors.

Related papers

• Quantum Algorithm for the Advection-Diffusion Equation with Optimal Success Probability [0.0]
  The explicit time-marching operator is separated into an advection-like component and a corrective shift operator. The result is an unscaled block encoding of the time-marching operator with an optimal success probability.
  arXiv  Detail & Related papers  (2024-10-10T13:37:08Z)
• A Physics-Informed Machine Learning Approach for Solving Distributed Order Fractional Differential Equations [0.0]
  This paper introduces a novel methodology for solving distributed-order fractional differential equations using a physics-informed machine learning framework. By embedding the distributed-order functional equation into the SVR framework, we incorporate physical laws directly into the learning process. The effectiveness of the proposed approach is validated through a series of numerical experiments on Caputo-based distributed-order fractional differential equations.
  arXiv  Detail & Related papers  (2024-09-05T13:20:10Z)
• Solving Fractional Differential Equations on a Quantum Computer: A Variational Approach [0.1492582382799606]
  We introduce an efficient variational hybrid quantum-classical algorithm designed for solving Caputo time-fractional partial differential equations. Our results indicate that solution fidelity is insensitive to the fractional index and that gradient evaluation cost scales economically with the number of time steps.
  arXiv  Detail & Related papers  (2024-06-13T02:27:16Z)
• Boundary Treatment for Variational Quantum Simulations of Partial Differential Equations on Quantum Computers [1.6318838452579472]
  The paper presents a variational quantum algorithm to solve initial-boundary value problems described by partial differential equations. The approach uses classical/quantum hardware that is well suited for quantum computers of the current noisy intermediate-scale quantum era.
  arXiv  Detail & Related papers  (2024-02-28T18:19:33Z)
• Fast Computation of Optimal Transport via Entropy-Regularized Extragradient Methods [75.34939761152587]
  Efficient computation of the optimal transport distance between two distributions serves as an algorithm that empowers various applications. This paper develops a scalable first-order optimization-based method that computes optimal transport to within $varepsilon$ additive accuracy.
  arXiv  Detail & Related papers  (2023-01-30T15:46:39Z)
• Exploring the role of parameters in variational quantum algorithms [59.20947681019466]
  We introduce a quantum-control-inspired method for the characterization of variational quantum circuits using the rank of the dynamical Lie algebra. A promising connection is found between the Lie rank, the accuracy of calculated energies, and the requisite depth to attain target states via a given circuit architecture.
  arXiv  Detail & Related papers  (2022-09-28T20:24:53Z)
• Semi-supervised Learning of Partial Differential Operators and Dynamical Flows [68.77595310155365]
  We present a novel method that combines a hyper-network solver with a Fourier Neural Operator architecture. We test our method on various time evolution PDEs, including nonlinear fluid flows in one, two, and three spatial dimensions. The results show that the new method improves the learning accuracy at the time point of supervision point, and is able to interpolate and the solutions to any intermediate time.
  arXiv  Detail & Related papers  (2022-07-28T19:59:14Z)
• Accelerating Real-Time Coupled Cluster Methods with Single-Precision Arithmetic and Adaptive Numerical Integration [3.469636229370366]
  We show that single-precision arithmetic reduces both the storage and multiplicative costs of the real-time simulation by approximately a factor of two. Additional speedups of up to a factor of 14 in test simulations of water clusters are obtained via a straightforward-based implementation.
  arXiv  Detail & Related papers  (2022-05-10T21:21:49Z)
• Fast and differentiable simulation of driven quantum systems [58.720142291102135]
  We introduce a semi-analytic method based on the Dyson expansion that allows us to time-evolve driven quantum systems much faster than standard numerical methods. We show results of the optimization of a two-qubit gate using transmon qubits in the circuit QED architecture.
  arXiv  Detail & Related papers  (2020-12-16T21:43:38Z)
• Coded Distributed Computing with Partial Recovery [56.08535873173518]
  We introduce a novel coded matrix-vector multiplication scheme, called coded computation with partial recovery (CCPR) CCPR reduces both the computation time and the decoding complexity by allowing a trade-off between the accuracy and the speed of computation. We then extend this approach to distributed implementation of more general computation tasks by proposing a coded communication scheme with partial recovery.
  arXiv  Detail & Related papers  (2020-07-04T21:34:49Z)
• Accelerating Feedforward Computation via Parallel Nonlinear Equation Solving [106.63673243937492]
  Feedforward computation, such as evaluating a neural network or sampling from an autoregressive model, is ubiquitous in machine learning. We frame the task of feedforward computation as solving a system of nonlinear equations. We then propose to find the solution using a Jacobi or Gauss-Seidel fixed-point method, as well as hybrid methods of both. Our method is guaranteed to give exactly the same values as the original feedforward computation with a reduced (or equal) number of parallelizable iterations, and hence reduced time given sufficient parallel computing power.
  arXiv  Detail & Related papers  (2020-02-10T10:11:31Z)

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.