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

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.

arXiv comment7 pages and 4 figures. Comments are welcome

References in corpus (20)

• Quantum algorithm for solving linear systems of equations
• Quantum Annealing in the Transverse Ising Model
• Adiabatic Quantum Computing
• Quantum Search by Local Adiabatic Evolution
• Bounds for the adiabatic approximation with applications to quantum computation
• Preconditioned quantum linear system algorithm
• High-order quantum algorithm for solving linear differential equations
• Quantum algorithm for linear differential equations with exponentially improved dependence on precision
• Quantum algorithms and the finite element method
• Quantum algorithm and circuit design solving the Poisson equation
• A Tutorial on Formulating and Using QUBO Models
• Quantum Algorithm for Simulating the Wave Equation
• First Order Quantum Phase Transition in Adiabatic Quantum Computation
• Concrete resource analysis of the quantum linear system algorithm used to compute the electromagnetic scattering cross section of a 2D target
• Quantum Fast Poisson Solver: the algorithm and modular circuit design
• Benchmarking Hamiltonian Noise in the D-Wave Quantum Annealer
• Adiabatic Quantum Computation and Deutsch's Algorithm
• Box algorithm for the solution of differential equations on a quantum annealer
• Quantum annealing for systems of polynomial equations
• Quantum vs. classical algorithms for solving the heat equation

Cited by in corpus (5)

• Application of a variational hybrid quantum-classical algorithm to heat conduction equation
• A novel design update framework for topology optimization with quantum annealing: Application to truss and continuum structures
• Alternatives to a nonhomogeneous partial differential equation quantum algorithm
• A Hybrid Quantum-Classical Particle-in-Cell Method for Plasma Simulations
• Improving the convergence of an iterative algorithm for solving arbitrary linear equation systems using classical or quantum binary optimization