Quantum simulation and circuit design for solving multidimensional Poisson equations

• URL: http://arxiv.org/abs/2006.09127v1
• Date: Tue, 16 Jun 2020 13:17:31 GMT
• Title: Quantum simulation and circuit design for solving multidimensional Poisson equations
• Authors: Michael Holzmann and Harald Koestler
• Abstract summary: A quantum algorithm is shown running in polylog time to produce a quantum state representing the solution of the Poisson equation. Our purpose is to test an efficient circuit design which can break the curse of dimensionality on a quantum computer.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Many methods solve Poisson equations by using grid techniques which discretize the problem in each dimension. Most of these algorithms are subject to the curse of dimensionality, so that they need exponential runtime. In the paper "Quantum algorithm and circuit design solving the Poisson equation" a quantum algorithm is shown running in polylog time to produce a quantum state representing the solution of the Poisson equation. In this paper a quantum simulation of an extended circuit design based on this algorithm is made on a classical computer. Our purpose is to test an efficient circuit design which can break the curse of dimensionality on a quantum computer. Due to the exponential rise of the Hilbert space this design is optimized on a small number of qubits. We use Microsoft's Quantum Development Kit and its simulator of an ideal quantum computer to validate the correctness of this algorithm.

Related papers

• 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)
• Efficient Quantum Algorithms for Quantum Optimal Control [2.9370710299422607]
  We present efficient quantum algorithms for solving the quantum optimal control problem. Our algorithms are based on a time-dependent Hamiltonian simulation method and a fast gradient-estimation algorithm. Our quantum algorithms require fault-tolerant quantum computers.
  arXiv  Detail & Related papers  (2023-04-05T17:33:57Z)
• Efficient estimation of trainability for variational quantum circuits [43.028111013960206]
  We find an efficient method to compute the cost function and its variance for a wide class of variational quantum circuits. This method can be used to certify trainability for variational quantum circuits and explore design strategies that can overcome the barren plateau problem.
  arXiv  Detail & Related papers  (2023-02-09T14:05:18Z)
• 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 based on the minimum potential energy for solving the Poisson equation [7.620967781722716]
  We present a variational quantum algorithm for solving the Poisson equation. The proposed method defines the total potential energy of the Poisson equation as a Hamiltonian. Because the number of terms is independent of the size of the problem, this method requires relatively few quantum measurements.
  arXiv  Detail & Related papers  (2021-06-17T09:01:53Z)
• Synthesis of Quantum Circuits with an Island Genetic Algorithm [44.99833362998488]
  Given a unitary matrix that performs certain operation, obtaining the equivalent quantum circuit is a non-trivial task. Three problems are explored: the coin for the quantum walker, the Toffoli gate and the Fredkin gate. The algorithm proposed proved to be efficient in decomposition of quantum circuits, and as a generic approach, it is limited only by the available computational power.
  arXiv  Detail & Related papers  (2021-06-06T13:15:25Z)
• Fixed Depth Hamiltonian Simulation via Cartan Decomposition [59.20417091220753]
  We present a constructive algorithm for generating quantum circuits with time-independent depth. We highlight our algorithm for special classes of models, including Anderson localization in one dimensional transverse field XY model. In addition to providing exact circuits for a broad set of spin and fermionic models, our algorithm provides broad analytic and numerical insight into optimal Hamiltonian simulations.
  arXiv  Detail & Related papers  (2021-04-01T19:06:00Z)
• 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)
• Quantum Solver of Contracted Eigenvalue Equations for Scalable Molecular Simulations on Quantum Computing Devices [0.0]
  We introduce a quantum solver of contracted eigenvalue equations, the quantum analogue of classical methods for the energies. We demonstrate the algorithm though computations on both a quantum simulator and two IBM quantum processing units.
  arXiv  Detail & Related papers  (2020-04-23T18:35:26Z)
• Practical Quantum Computing: solving the wave equation using a quantum approach [0.0]
  We show that our implementation of the quantum wave equation solver agrees with the theoretical big-O complexity of the algorithm. Our implementation proves experimentally that some PDE can be solved on a quantum computer.
  arXiv  Detail & Related papers  (2020-03-27T15:05:31Z)

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.