A quantum Poisson solver implementable on NISQ devices (improved version)

• URL: http://arxiv.org/abs/2005.00256v3
• Date: Thu, 25 May 2023 02:52:37 GMT
• Title: A quantum Poisson solver implementable on NISQ devices (improved version)
• Authors: Shengbin Wang, Zhimin Wang, Wendong Li, Lixin Fan, Guolong Cui, Zhiqiang Wei, Yongjian Gu
• Abstract summary: 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.
• Score: 23.69613801851615
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Solving differential equations is one of the most compelling applications of quantum computing. Most existing quantum algorithms addressing general ordinary and partial differential equations are thought to be too expensive to execute successfully on Noisy Intermediate-Scale Quantum (NISQ) devices. Here we propose a compact quantum algorithm for solving one-dimensional Poisson equation based on simple Ry rotation. The major operations are performed on probability amplitudes. Therefore, the present algorithm avoids the need to do phase estimation, Hamiltonian simulation and arithmetic. 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 4n^3 in one- and two-qubit gates, where n is the logarithmic of the dimension of the linear system of equations. In terms of solution error {\epsilon}, the complexity is log(1/{\epsilon}) in qubits and poly(log(1/{\epsilon})) in operations, which is consist with the best known results. The present QPS may represent a potential application on NISQ devices.

Related papers

• High-Entanglement Capabilities for Variational Quantum Algorithms: The Poisson Equation Case [0.07366405857677226]
  This research attempts to resolve problems by utilizing the IonQ Aria quantum computer capabilities. We propose a decomposition of the discretized equation matrix (DPEM) based on 2- or 3-qubit entanglement gates and is shown to have $O(1)$ terms with respect to system size. We also introduce the Globally-Entangling Ansatz which reduces the parameter space of the quantum ansatz while maintaining enough expressibility to find the solution.
  arXiv  Detail & Related papers  (2024-06-14T16:16:50Z)
• Calculating response functions of coupled oscillators using quantum phase estimation [40.31060267062305]
  We study the problem of estimating frequency response functions of systems of coupled, classical harmonic oscillators using a quantum computer. Our proposed quantum algorithm operates in the standard $s-sparse, oracle-based query access model. We show that a simple adaptation of our algorithm solves the random glued-trees problem in time.
  arXiv  Detail & Related papers  (2024-05-14T15:28:37Z)
• A two-circuit approach to reducing quantum resources for the quantum lattice Boltzmann method [41.66129197681683]
  Current quantum algorithms for solving CFD problems use a single quantum circuit and, in some cases, lattice-based methods. We introduce the a novel multiple circuits algorithm that makes use of a quantum lattice Boltzmann method (QLBM) The problem is cast as a stream function--vorticity formulation of the 2D Navier-Stokes equations and verified and tested on a 2D lid-driven cavity flow.
  arXiv  Detail & Related papers  (2024-01-20T15:32:01Z)
• A hybrid quantum-classical algorithm for multichannel quantum scattering of atoms and molecules [62.997667081978825]
  We propose a hybrid quantum-classical algorithm for solving the Schr"odinger equation for atomic and molecular collisions. The algorithm is based on the $S$-matrix version of the Kohn variational principle, which computes the fundamental scattering $S$-matrix. We show how the algorithm could be scaled up to simulate collisions of large polyatomic molecules.
  arXiv  Detail & Related papers  (2023-04-12T18:10:47Z)
• Advancing Algorithm to Scale and Accurately Solve Quantum Poisson Equation on Near-term Quantum Hardware [0.0]
  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.
  arXiv  Detail & Related papers  (2022-10-29T18:50:40Z)
• 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)
• Quantum State Preparation with Optimal Circuit Depth: Implementations and Applications [10.436969366019015]
  We show that any $Theta(n)$-depth circuit can be prepared with a $Theta(log(nd)) with $O(ndlog d)$ ancillary qubits. We discuss applications of the results in different quantum computing tasks, such as Hamiltonian simulation, solving linear systems of equations, and realizing quantum random access memories.
  arXiv  Detail & Related papers  (2022-01-27T13:16:30Z)
• An Algebraic Quantum Circuit Compression Algorithm for Hamiltonian Simulation [55.41644538483948]
  Current generation noisy intermediate-scale quantum (NISQ) computers are severely limited in chip size and error rates. We derive localized circuit transformations to efficiently compress quantum circuits for simulation of certain spin Hamiltonians known as free fermions. The proposed numerical circuit compression algorithm behaves backward stable and scales cubically in the number of spins enabling circuit synthesis beyond $mathcalO(103)$ spins.
  arXiv  Detail & Related papers  (2021-08-06T19:38:03Z)
• 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)
• 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)

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.