Advancing Algorithm to Scale and Accurately Solve Quantum Poisson Equation on Near-term Quantum Hardware

• URL: http://arxiv.org/abs/2210.16668v2
• Date: Sun, 23 Apr 2023 19:07:31 GMT
• Title: Advancing Algorithm to Scale and Accurately Solve Quantum Poisson Equation on Near-term Quantum Hardware
• Authors: Kamal K. Saha, Walter Robson, Connor Howington, In-Saeng Suh, Zhimin Wang, and Jaroslaw Nabrzyski
• Abstract summary: We present an advanced quantum algorithm for solving the Poisson equation with high accuracy and dynamically tunable problem size. Particularly, 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.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The Poisson equation has many applications across the broad areas of science and engineering. Most quantum algorithms for the Poisson solver presented so far either suffer from lack of accuracy and/or are limited to very small sizes of the problem, and thus have no practical usage. Here we present an advanced quantum algorithm for solving the Poisson equation with high accuracy and dynamically tunable problem size. After converting the Poisson equation to a linear system through the finite difference method, we adopt the HHL algorithm as the basic framework. Particularly, in this work we present an advanced circuit that ensures the accuracy of the solution by implementing non-truncated eigenvalues through eigenvalue amplification, as well as by increasing the accuracy of the controlled rotation angular coefficients, which are the critical factors in the HHL algorithm. Consequently, we are able to drastically reduce the relative error in the solution while achieving higher success probability as the amplification level is increased. We show that our algorithm not only increases the accuracy of the solutions but also composes more practical and scalable circuits by dynamically controlling problem size in NISQ devices. We present both simulated and experimental results and discuss the sources of errors. Finally, we conclude that though overall results on the existing NISQ hardware are dominated by the error in the CNOT gates, this work opens a path to realizing a multidimensional Poisson solver on near-term quantum hardware.

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)
• Solving Poisson Equations using Neural Walk-on-Spheres [80.1675792181381]
  We propose Neural Walk-on-Spheres (NWoS), a novel neural PDE solver for the efficient solution of high-dimensional Poisson equations. We demonstrate the superiority of NWoS in accuracy, speed, and computational costs.
  arXiv  Detail & Related papers  (2024-06-05T17:59:22Z)
• 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)
• 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)
• 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)
• Scaling Quantum Approximate Optimization on Near-term Hardware [49.94954584453379]
  We quantify scaling of the expected resource requirements by optimized circuits for hardware architectures with varying levels of connectivity. We show the number of measurements, and hence total time to synthesizing solution, grows exponentially in problem size and problem graph degree. These problems may be alleviated by increasing hardware connectivity or by recently proposed modifications to the QAOA that achieve higher performance with fewer circuit layers.
  arXiv  Detail & Related papers  (2022-01-06T21:02:30Z)
• Optimization and Noise Analysis of the Quantum Algorithm for Solving One-Dimensional Poisson Equation [17.65730040410185]
  We propose an efficient quantum algorithm for solving one-dimensional Poisson equation. We further develop this algorithm to make it closer to the real application on the noisy intermediate-scale quantum (NISQ) devices. We analyze the effect of common noise existing in the real quantum devices on our algorithm using the IBM Qiskit toolkit.
  arXiv  Detail & Related papers  (2021-08-27T09:44:41Z)
• 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)
• Variational Quantum algorithm for Poisson equation [4.045204834863644]
  We propose a Variational Quantum Algorithm (VQA) to solve the Poisson equation. VQA can be executed on Noise Intermediate-Scale Quantum (NISQ) devices. Numerical experiments demonstrate that our algorithm can effectively solve the Poisson equation.
  arXiv  Detail & Related papers  (2020-12-13T09:28:04Z)
• A quantum Poisson solver implementable on NISQ devices (improved version) [23.69613801851615]
  We propose a compact quantum algorithm for solving one-dimensional Poisson equation based on simple Ry rotation. The solution error comes only from the finite difference approximation of the Poisson equation. Our quantum Poisson solver (QPS) has gate-complexity of 3n in qubits and 4n3 in one- and two-qubit gates, where n is the logarithmic of the dimension of the linear system of equations.
  arXiv  Detail & Related papers  (2020-05-01T07:38:07Z)

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.