Related papers: A hybrid classical-quantum approach to solve the heat equation using quantum annealers

A hybrid classical-quantum approach to solve the heat equation using quantum annealers

URL: http://arxiv.org/abs/2106.04305v1
Date: Tue, 8 Jun 2021 13:04:34 GMT
Title: A hybrid classical-quantum approach to solve the heat equation using quantum annealers
Authors: Giovani G. Pollachini, Juan P. L. C. Salazar, Caio B. D. Goes, Thiago O. Maciel, and Eduardo I. Duzzioni
Abstract summary: We show that the errors and chain break fraction are, on average, greater on the 2000Q system. Unlike the classical Gauss-Seidel method, the errors of the quantum solutions level off after a few iterations. This is partly a result of the span of the real number line available from the mapping of the chosen size of the set of qubit states.
Score: 0.0
License: http://creativecommons.org/licenses/by/4.0/
Abstract: The numerical solution of partial differential equations by discretization techniques is ubiquitous in computational physics. In this work we benchmark this approach in the quantum realm by solving the heat equation for a square plate subject to fixed temperatures at the edges and random heat sources and sinks within the domain. The hybrid classical-quantum approach consists in the solution on a quantum computer of the coupled linear system of equations that result from the discretization step. Owing to the limitations in the number of qubits and their connectivity, we use the Gauss-Seidel method to divide the full system of linear equations into subsystems, which are solved iteratively in block fashion. Each of the linear subsystems were solved using 2000Q and Advantage quantum computers developed by D-Wave Systems Inc. By comparing classical numerical and quantum solutions, we observe that the errors and chain break fraction are, on average, greater on the 2000Q system. Unlike the classical Gauss-Seidel method, the errors of the quantum solutions level off after a few iterations of our algorithm. This is partly a result of the span of the real number line available from the mapping of the chosen size of the set of qubit states. We verified this by using techniques to progressively shrink the range mapped by the set of qubit states at each iteration (increasing floating-point accuracy). As a result, no leveling off is observed. However, an increase in qubits does not translate to an overall lower error. This is believed to be indicative of the increasing length of chains required for the mapping to real numbers and the ensuing limitations of hardware.

Related papers

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)
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)
GRAPE optimization for open quantum systems with time-dependent decoherence rates driven by coherent and incoherent controls [77.34726150561087]
The GRadient Ascent Pulse Engineering (GRAPE) method is widely used for optimization in quantum control. We adopt GRAPE method for optimizing objective functionals for open quantum systems driven by both coherent and incoherent controls. The efficiency of the algorithm is demonstrated through numerical simulations for the state-to-state transition problem.
arXiv Detail & Related papers (2023-07-17T13:37:18Z)
Wasserstein Quantum Monte Carlo: A Novel Approach for Solving the Quantum Many-Body Schr\"odinger Equation [56.9919517199927]
"Wasserstein Quantum Monte Carlo" (WQMC) uses the gradient flow induced by the Wasserstein metric, rather than Fisher-Rao metric, and corresponds to transporting the probability mass, rather than teleporting it. We demonstrate empirically that the dynamics of WQMC results in faster convergence to the ground state of molecular systems.
arXiv Detail & Related papers (2023-07-06T17:54:08Z)
Quantum Gate Generation in Two-Level Open Quantum Systems by Coherent and Incoherent Photons Found with Gradient Search [77.34726150561087]
We consider an environment formed by incoherent photons as a resource for controlling open quantum systems via an incoherent control. We exploit a coherent control in the Hamiltonian and an incoherent control in the dissipator which induces the time-dependent decoherence rates.
arXiv Detail & Related papers (2023-02-28T07:36:02Z)
Depth analysis of variational quantum algorithms for heat equation [0.0]
We consider three approaches to solve the heat equation on a quantum computer. An exponential number of Pauli products in the Hamiltonian decomposition does not allow for the quantum speed up to be achieved. The ansatz tree approach exploits an explicit form of the matrix what makes it possible to achieve an advantage over classical algorithms.
arXiv Detail & Related papers (2022-12-23T14:46:33Z)
Quantum Worst-Case to Average-Case Reductions for All Linear Problems [66.65497337069792]
We study the problem of designing worst-case to average-case reductions for quantum algorithms. We provide an explicit and efficient transformation of quantum algorithms that are only correct on a small fraction of their inputs into ones that are correct on all inputs.
arXiv Detail & Related papers (2022-12-06T22:01:49Z)
Solving partial differential equations on near-term quantum computers [0.0]
We obtain the numerical temperature field to a thermally developing fluid flow inside parallel plates problem with a quantum computing method. The work advances the state of the art of solutions of differential equations with noisy quantum devices and could be used for useful applications when quantum computers with thousands of qubits become available.
arXiv Detail & Related papers (2022-08-11T13:07:55Z)
Canonically consistent quantum master equation [68.8204255655161]
We put forth a new class of quantum master equations that correctly reproduce the state of an open quantum system beyond the infinitesimally weak system-bath coupling limit. Our method is based on incorporating the knowledge of the reduced steady state into its dynamics.
arXiv Detail & Related papers (2022-05-25T15:22:52Z)
Adiabatic Quantum Graph Matching with Permutation Matrix Constraints [75.88678895180189]
Matching problems on 3D shapes and images are frequently formulated as quadratic assignment problems (QAPs) with permutation matrix constraints, which are NP-hard. We propose several reformulations of QAPs as unconstrained problems suitable for efficient execution on quantum hardware. The proposed algorithm has the potential to scale to higher dimensions on future quantum computing architectures.
arXiv Detail & Related papers (2021-07-08T17:59:55Z)
Solving nonlinear differential equations with differentiable quantum circuits [21.24186888129542]
We propose a quantum algorithm to solve systems of nonlinear differential equations. We use automatic differentiation to represent function derivatives in an analytical form as differentiable quantum circuits. We show how this approach can implement a spectral method for solving differential equations in a high-dimensional feature space.
arXiv Detail & Related papers (2020-11-20T13:21:11Z)

This list is automatically generated from the titles and abstracts of the papers in this site.