Solving the Hele-Shaw flow using the Harrow-Hassidim-Lloyd algorithm on superconducting devices: A study of efficiency and challenges

• URL: http://arxiv.org/abs/2409.10857v1
• Date: Tue, 17 Sep 2024 02:44:08 GMT
• Title: Solving the Hele-Shaw flow using the Harrow-Hassidim-Lloyd algorithm on superconducting devices: A study of efficiency and challenges
• Authors: Muralikrishnan Gopalakrishnan Meena, Kalyana C. Gottiparthi, Justin G. Lietz, Antigoni Georgiadou, Eduardo Antonio Coello Pérez,
• Abstract summary: Development of quantum processors capable of handling practical fluid flow problems represents a distant yet promising frontier. Recent strides in quantum algorithms, particularly linear solvers, have illuminated the path toward quantum solutions for classical fluid flow solvers. In this study, we examine the capability of a canonical QLSA, the Harrow-Hassidim-Lloyd (HHL) algorithm, in accurately solving the system of linear equations governing an idealized fluid flow problem.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: The development of quantum processors capable of handling practical fluid flow problems represents a distant yet promising frontier. Recent strides in quantum algorithms, particularly linear solvers, have illuminated the path toward quantum solutions for classical fluid flow solvers. However, assessing the capability of these quantum linear systems algorithms (QLSAs) in solving ideal flow equations on real hardware is crucial for their future development in practical fluid flow applications. In this study, we examine the capability of a canonical QLSA, the Harrow-Hassidim-Lloyd (HHL) algorithm, in accurately solving the system of linear equations governing an idealized fluid flow problem, specifically the Hele-Shaw flow. Our investigation focuses on analyzing the accuracy and computational cost of the HHL solver. To gauge the stability and convergence of the solver, we conduct shots-based simulations on quantum simulators. Furthermore, we share insights gained from executing the HHL solver on superconducting quantum devices. To mitigate errors arising from qubit measurement, gate operations, and qubit decoherence inherent in quantum devices, we employ various error suppression and mitigation techniques. Our preliminary assessments serve as a foundational step towards enabling more complex quantum utility scale evaluation of using QLSA for solving fluid flow problems.

Related papers

• Resource-adaptive quantum flow algorithms for quantum simulations of many-body systems: sub-flow embedding procedures [0.20462238493547852]
  We utilize the quantum flow (QFlow) method to perform quantum simulations of correlated systems. Our research demonstrates that the circuits for evaluating the low dimensionality subproblems are significantly less complex than the parent problem. Our findings shed light on the potential of QFlow in efficiently handling correlated systems via quantum simulations.
  arXiv  Detail & Related papers  (2024-10-15T19:00:33Z)
• 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)
• Enabling Large-Scale and High-Precision Fluid Simulations on Near-Term Quantum Computers [17.27937804402152]
  Quantum computational fluid dynamics (QCFD) offers a promising alternative to classical computational fluid dynamics (CFD) This paper introduces a comprehensive QCFD method, including an iterative method "Iterative-QLS" that suppresses error in quantum linear solver. We implement our method on a superconducting quantum computer, demonstrating successful simulations of steady Poiseuille flow and unsteady acoustic wave propagation.
  arXiv  Detail & Related papers  (2024-06-10T07:21:23Z)
• 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)
• Hybrid quantum algorithms for flow problems [0.0]
  We debut here a high performance quantum simulator which we term QFlowS (Quantum Flow Simulator) We first choose to simulate two well known flows using QFlowS and demonstrate a previously unseen, full gate-level implementation of a hybrid and high precision Quantum Linear Systems Algorithms (QLSA) This work suggests a path towards quantum simulation of fluid flows, and highlights the special considerations needed at the gate level implementation of QC.
  arXiv  Detail & Related papers  (2023-07-01T17:39:21Z)
• Accelerating the training of single-layer binary neural networks using the HHL quantum algorithm [58.720142291102135]
  We show that useful information can be extracted from the quantum-mechanical implementation of Harrow-Hassidim-Lloyd (HHL) This paper shows, however, that useful information can be extracted from the quantum-mechanical implementation of HHL, and used to reduce the complexity of finding the solution on the classical side.
  arXiv  Detail & Related papers  (2022-10-23T11:58:05Z)
• Advanced Quantum Poisson Solver in the NISQ era [0.0]
  We present an advanced quantum algorithm for solving the Poisson equation with high accuracy and dynamically tunable problem size. In this work we present an advanced circuit that ensures the accuracy of the solution by implementing non-truncated eigenvalues. We show that our algorithm not only increases the accuracy of the solutions, but also composes more practical and scalable circuits.
  arXiv  Detail & Related papers  (2022-09-19T22:17:21Z)
• Synergy Between Quantum Circuits and Tensor Networks: Short-cutting the Race to Practical Quantum Advantage [43.3054117987806]
  We introduce a scalable procedure for harnessing classical computing resources to provide pre-optimized initializations for quantum circuits. We show this method significantly improves the trainability and performance of PQCs on a variety of problems. By demonstrating a means of boosting limited quantum resources using classical computers, our approach illustrates the promise of this synergy between quantum and quantum-inspired models in quantum computing.
  arXiv  Detail & Related papers  (2022-08-29T15:24:03Z)
• 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)
• A Hybrid Quantum-Classical Algorithm for Robust Fitting [47.42391857319388]
  We propose a hybrid quantum-classical algorithm for robust fitting. Our core contribution is a novel robust fitting formulation that solves a sequence of integer programs. We present results obtained using an actual quantum computer.
  arXiv  Detail & Related papers  (2022-01-25T05:59:24Z)
• Error mitigation and quantum-assisted simulation in the error corrected regime [77.34726150561087]
  A standard approach to quantum computing is based on the idea of promoting a classically simulable and fault-tolerant set of operations. We show how the addition of noisy magic resources allows one to boost classical quasiprobability simulations of a quantum circuit.
  arXiv  Detail & Related papers  (2021-03-12T20:58:41Z)

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.