A hybrid quantum solver for the Lorenz system

• URL: http://arxiv.org/abs/2410.15417v2
• Date: Sun, 27 Oct 2024 03:05:47 GMT
• Title: A hybrid quantum solver for the Lorenz system
• Authors: Sajad Fathi Hafshejani, Daya Gaur, Arundhati Dasgupta, Robert Benkoczi, Narasimha Gosala, Alfredo Iorio,
• Abstract summary: We develop a hybrid classical-quantum method for solving the Lorenz system. We use the forward Euler method to discretize the system in time, transforming it into a system of equations. We present numerical results comparing the hybrid method with the classical approach for solving the Lorenz system.
• Score: 0.2770822269241974
• License:
• Abstract: We develop a hybrid classical-quantum method for solving the Lorenz system. We use the forward Euler method to discretize the system in time, transforming it into a system of equations. This set of equations is solved using the Variational Quantum Linear Solver (VQLS) algorithm. We present numerical results comparing the hybrid method with the classical approach for solving the Lorenz system. The simulation results demonstrate that the VQLS method can effectively compute solutions comparable to classical methods. The method is easily extended to solving similar nonlinear differential equations.

Related papers

• H-DES: a Quantum-Classical Hybrid Differential Equation Solver [0.0]
  We introduce an original hybrid quantum-classical algorithm for solving systems of differential equations. The algorithm relies on a spectral method, which involves encoding the solution functions in the amplitudes of the quantum states generated by different parametrized circuits.
  arXiv  Detail & Related papers  (2024-10-01T23:47:41Z)
• 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)
• Hybrid quantum-classical and quantum-inspired classical algorithms for solving banded circulant linear systems [0.8192907805418583]
  We present an efficient algorithm based on convex optimization of combinations of quantum states to solve for banded circulant linear systems. By decomposing banded circulant matrices into cyclic permutations, our approach produces approximate solutions to such systems with a combination of quantum states linear to $K$. We validate our methods with classical simulations and actual IBM quantum computer implementation, showcasing their applicability for solving physical problems such as heat transfer.
  arXiv  Detail & Related papers  (2023-09-20T16:27:16Z)
• Solving Systems of Linear Equations: HHL from a Tensor Networks Perspective [39.58317527488534]
  We present an algorithm for solving systems of linear equations based on the HHL algorithm with a novel qudits methodology. We perform a quantum-inspired version on tensor networks, taking advantage of their ability to perform non-unitary operations such as projection.
  arXiv  Detail & Related papers  (2023-09-11T08:18:41Z)
• An Optimization-based Deep Equilibrium Model for Hyperspectral Image Deconvolution with Convergence Guarantees [71.57324258813675]
  We propose a novel methodology for addressing the hyperspectral image deconvolution problem. A new optimization problem is formulated, leveraging a learnable regularizer in the form of a neural network. The derived iterative solver is then expressed as a fixed-point calculation problem within the Deep Equilibrium framework.
  arXiv  Detail & Related papers  (2023-06-10T08:25:16Z)
• Quantum algorithm for time-dependent differential equations using Dyson series [0.0]
  We provide a quantum algorithm for solving time-dependent linear differential equations with logarithmic dependence of the complexity on the error and derivative. Our method is to encode the Dyson series in a system of linear equations, then solve via the optimal quantum linear equation solver.
  arXiv  Detail & Related papers  (2022-12-07T09:50:40Z)
• Symbolic Recovery of Differential Equations: The Identifiability Problem [52.158782751264205]
  Symbolic recovery of differential equations is the ambitious attempt at automating the derivation of governing equations. We provide both necessary and sufficient conditions for a function to uniquely determine the corresponding differential equation. We then use our results to devise numerical algorithms aiming to determine whether a function solves a differential equation uniquely.
  arXiv  Detail & Related papers  (2022-10-15T17:32:49Z)
• Automated differential equation solver based on the parametric approximation optimization [77.34726150561087]
  The article presents a method that uses an optimization algorithm to obtain a solution using the parameterized approximation. It allows solving the wide class of equations in an automated manner without the algorithm's parameters change.
  arXiv  Detail & Related papers  (2022-05-11T10:06:47Z)
• Twisted hybrid algorithms for combinatorial optimization [68.8204255655161]
  Proposed hybrid algorithms encode a cost function into a problem Hamiltonian and optimize its energy by varying over a set of states with low circuit complexity. We show that for levels $p=2,ldots, 6$, the level $p$ can be reduced by one while roughly maintaining the expected approximation ratio.
  arXiv  Detail & Related papers  (2022-03-01T19:47:16Z)
• QBoost for regression problems: solving partial differential equations [0.0]
  The hybrid algorithm is capable of finding a solution to a partial differential equation with good precision and favorable scaling in the required number of qubits. The classical part is composed by training several regressors, capable of solving a partial differential equation using machine learning. The quantum part consists of adapting the QBoost algorithm to solve regression problems.
  arXiv  Detail & Related papers  (2021-08-30T16:13:04Z)
• Scalable Gradients for Stochastic Differential Equations [40.70998833051251]
  adjoint sensitivity method scalably computes gradients of ordinary differential equations. We generalize this method to differential equations, allowing time-efficient and constant-memory computation. We use our method to fit neural dynamics defined by networks, achieving competitive performance on a 50-dimensional motion capture dataset.
  arXiv  Detail & Related papers  (2020-01-05T23:05:55Z)

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.