Application of a variational hybrid quantum-classical algorithm to heat conduction equation

• URL: http://arxiv.org/abs/2207.14630v3
• Date: Wed, 10 Aug 2022 14:58:28 GMT
• Title: Application of a variational hybrid quantum-classical algorithm to heat conduction equation
• Authors: Yangyang Liu, Zhen Chen, Chang Shu, Siou Chye Chew, Boo Cheong Khoo, Xiang Zhao
• Abstract summary: This work applies a variational hybrid quantum-classical algorithm, namely the variational quantum linear solver (VQLS) to resolve the heat conduction equation. Details of VQLS implementation are discussed by various test instances of linear systems. The time complexity of the present approach is logarithmically dependent on precision epsilon and linearly dependent on the number of qubits n.
• Score: 8.886131782376246
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The prosperous development of both hardware and algorithms for quantum computing (QC) potentially prompts a paradigm shift in scientific computing in various fields. As an increasingly active topic in QC, the variational quantum algorithm (VQA) leads a promising direction for solving partial differential equations on Noisy Intermediate Scale Quantum (NISQ) devices. Although a clear perspective on the advantages of QC over classical computing techniques for specific mathematical and physical problems exists, applications of QC in computational fluid dynamics to solve practical flow problems, though promising, are still in an early stage of development. To explore QC in practical simulation of flow problems, this work applies a variational hybrid quantum-classical algorithm, namely the variational quantum linear solver (VQLS), to resolve the heat conduction equation through finite difference discretization of the Laplacian operator. Details of VQLS implementation are discussed by various test instances of linear systems. Finally, the successful statevector simulations of the heat conduction equation in one and two dimensions demonstrate the validity of the present algorithm by proof-of-concept results. In addition, the heuristic scaling for the heat conduction problem indicates that the time complexity of the present approach is logarithmically dependent on the precision {\epsilon} and linearly dependent on the number of qubits n.

Related papers

• Demonstration of Scalability and Accuracy of Variational Quantum Linear Solver for Computational Fluid Dynamics [0.0]
  This paper presents an exploration of quantum methodologies aimed at achieving high accuracy in solving such a large system of equations. We consider the 2D, transient, incompressible, viscous, non-linear coupled Burgers equation as a test problem. Our findings demonstrate that our quantum methods yield results comparable in accuracy to traditional approaches.
  arXiv  Detail & Related papers  (2024-09-05T04:42:24Z)
• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
  Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties? We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d. We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Quantum Subroutine for Variance Estimation: Algorithmic Design and Applications [80.04533958880862]
  Quantum computing sets the foundation for new ways of designing algorithms. New challenges arise concerning which field quantum speedup can be achieved. Looking for the design of quantum subroutines that are more efficient than their classical counterpart poses solid pillars to new powerful quantum algorithms.
  arXiv  Detail & Related papers  (2024-02-26T09:32:07Z)
• Two quantum algorithms for solving the one-dimensional advection-diffusion equation [0.0]
  Two quantum algorithms are presented for the numerical solution of a linear one-dimensional advection-diffusion equation with periodic boundary conditions. Their accuracy and performance with increasing qubit number are compared point-by-point with each other.
  arXiv  Detail & Related papers  (2023-12-30T21:23:15Z)
• Real-time error mitigation for variational optimization on quantum hardware [45.935798913942904]
  We define a Real Time Quantum Error Mitigation (RTQEM) algorithm to assist in fitting functions on quantum chips with VQCs. Our RTQEM routine can enhance VQCs' trainability by reducing the corruption of the loss function.
  arXiv  Detail & Related papers  (2023-11-09T19:00:01Z)
• QNEAT: Natural Evolution of Variational Quantum Circuit Architecture [95.29334926638462]
  We focus on variational quantum circuits (VQC), which emerged as the most promising candidates for the quantum counterpart of neural networks. Although showing promising results, VQCs can be hard to train because of different issues, e.g., barren plateau, periodicity of the weights, or choice of architecture. We propose a gradient-free algorithm inspired by natural evolution to optimize both the weights and the architecture of the VQC.
  arXiv  Detail & Related papers  (2023-04-14T08:03:20Z)
• A variational quantum algorithm-based numerical method for solving potential and Stokes flows [5.617248827659296]
  This paper presents a numerical method based on the variational quantum algorithm to solve potential and Stokes flow problems. For the prescribed boundary conditions, the corresponding linear systems of equations can be obtained. This work brings quantum computing to the field of computational fluid dynamics.
  arXiv  Detail & Related papers  (2023-03-03T09:25:15Z)
• Variational Quantum Solutions to the Advection-Diffusion Equation for Applications in Fluid Dynamics [0.0]
  We present one method to perform fluid dynamics calculations that takes advantage of quantum computing. We find that reliable solutions of the equation can be obtained on even the noisy quantum computers available today.
  arXiv  Detail & Related papers  (2022-08-24T21:29:46Z)
• Adiabatic Quantum Computing for Multi Object Tracking [170.8716555363907]
  Multi-Object Tracking (MOT) is most often approached in the tracking-by-detection paradigm, where object detections are associated through time. As these optimization problems are often NP-hard, they can only be solved exactly for small instances on current hardware. We show that our approach is competitive compared with state-of-the-art optimization-based approaches, even when using of-the-shelf integer programming solvers.
  arXiv  Detail & Related papers  (2022-02-17T18:59:20Z)
• Near Term Algorithms for Linear Systems of Equations [0.0]
  This paper makes contributions that include: the first application of the Evolutionary Ansatz to the VQLS (EAVQLS), the first implementation of the Logical Ansatz VQLS (LAVQLS), and the first proof of principle demonstration of the CQS method on real quantum hardware.
  arXiv  Detail & Related papers  (2021-08-25T17:35:52Z)
• Quantum algorithms for quantum dynamics: A performance study on the spin-boson model [68.8204255655161]
  Quantum algorithms for quantum dynamics simulations are traditionally based on implementing a Trotter-approximation of the time-evolution operator. variational quantum algorithms have become an indispensable alternative, enabling small-scale simulations on present-day hardware. We show that, despite providing a clear reduction of quantum gate cost, the variational method in its current implementation is unlikely to lead to a quantum advantage.
  arXiv  Detail & Related papers  (2021-08-09T18:00:05Z)

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.