Simulating Time-dependent Hamiltonian Based On High Order Runge-Kutta and Forward Euler Method

• URL: http://arxiv.org/abs/2410.14418v1
• Date: Fri, 18 Oct 2024 12:31:57 GMT
• Title: Simulating Time-dependent Hamiltonian Based On High Order Runge-Kutta and Forward Euler Method
• Authors: Nhat A. Nghiem,
• Abstract summary: We propose a new method for simulating certain type of time-dependent Hamiltonian $H(t) = sum_i=1m gamma_i(t) H_i$ where $gamma_i(t)$ is bounded, computable function of time $t$, and each $H_i$ is time-independent. Our quantum algorithms are based on high-order Runge-Kutta method and forward Euler method, where the time interval is divided into subintervals.
• Score: 0.0
• License:
• Abstract: We propose a new method for simulating certain type of time-dependent Hamiltonian $H(t) = \sum_{i=1}^m \gamma_i(t) H_i$ where $\gamma_i(t)$ (and its higher order derivatives) is bounded, computable function of time $t$, and each $H_i$ is time-independent, and could be efficiently simulated. Our quantum algorithms are based on high-order Runge-Kutta method and forward Euler method, where the time interval is divided into subintervals. Then in an iterative manner, the evolution operator at given time step is built upon the evolution operator at previous time step, utilizing algorithmic operations from the recently introduced quantum singular value transformation framework.

Related papers

• Improved Time-independent Hamiltonian Simulation [0.0]
  We describe a simple method for simulating time-independent Hamiltonian $H$ that could be decomposed as $H = sum_i=1m H_i$. We employ the recently introduced quantum singular value transformation framework to utilize the ability to simulate $H_i$ in an alternative way.
  arXiv  Detail & Related papers  (2024-10-20T02:49:14Z)
• Fast-forwarding quantum algorithms for linear dissipative differential equations [2.5677613431426978]
  We show that a quantum algorithm based on truncated Dyson series can prepare history states of dissipative ODEs up to time $T$ with cost $widetildemathcalO(log(T) (log (1/epsilon))2 )$. As applications, we show that quantum algorithms can simulate dissipative non-Hermitian quantum dynamics and heat process with fast-forwarded complexity sub-linear in time.
  arXiv  Detail & Related papers  (2024-10-17T03:33:47Z)
• Accelerated First-Order Optimization under Nonlinear Constraints [73.2273449996098]
  We exploit between first-order algorithms for constrained optimization and non-smooth systems to design a new class of accelerated first-order algorithms. An important property of these algorithms is that constraints are expressed in terms of velocities instead of sparse variables.
  arXiv  Detail & Related papers  (2023-02-01T08:50:48Z)
• Unbiased random circuit compiler for time-dependent Hamiltonian simulation [8.694056486825318]
  Time-dependent Hamiltonian simulation is a critical task in quantum computing. We develop an unbiased random compiler for TDHS. We perform numerical simulations for a spin model under the interaction picture and the adiabatic ground state preparation for molecular systems.
  arXiv  Detail & Related papers  (2022-12-19T13:40:05Z)
• Quantum Goemans-Williamson Algorithm with the Hadamard Test and Approximate Amplitude Constraints [62.72309460291971]
  We introduce a variational quantum algorithm for Goemans-Williamson algorithm that uses only $n+1$ qubits. Efficient optimization is achieved by encoding the objective matrix as a properly parameterized unitary conditioned on an auxilary qubit. We demonstrate the effectiveness of our protocol by devising an efficient quantum implementation of the Goemans-Williamson algorithm for various NP-hard problems.
  arXiv  Detail & Related papers  (2022-06-30T03:15:23Z)
• Time Dependent Hamiltonian Simulation Using Discrete Clock Constructions [42.3779227963298]
  We provide a framework for encoding time dependent dynamics as time independent systems. First, we create a time dependent simulation algorithm based on performing qubitization on the augmented clock system. Second, we define a natural generalization of multiproduct formulas for time-ordered exponentials.
  arXiv  Detail & Related papers  (2022-03-21T21:29:22Z)
• Higher-order Derivatives of Weighted Finite-state Machines [68.43084108204741]
  This work examines the computation of higher-order derivatives with respect to the normalization constant for weighted finite-state machines. We provide a general algorithm for evaluating derivatives of all orders, which has not been previously described in the literature. Our algorithm is significantly faster than prior algorithms.
  arXiv  Detail & Related papers  (2021-06-01T19:51:55Z)
• Quantum algorithm for time-dependent Hamiltonian simulation by permutation expansion [6.338178373376447]
  We present a quantum algorithm for the dynamical simulation of time-dependent Hamiltonians. We demonstrate that the cost of the algorithm is independent of the Hamiltonian's frequencies.
  arXiv  Detail & Related papers  (2021-03-29T05:02:02Z)
• 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)
• Single-Timescale Stochastic Nonconvex-Concave Optimization for Smooth Nonlinear TD Learning [145.54544979467872]
  We propose two single-timescale single-loop algorithms that require only one data point each step. Our results are expressed in a form of simultaneous primal and dual side convergence.
  arXiv  Detail & Related papers  (2020-08-23T20:36:49Z)

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.