Related papers: Alternatives to a nonhomogeneous partial differential equation quantum algorithm

Alternatives to a nonhomogeneous partial differential equation quantum algorithm

URL: http://arxiv.org/abs/2205.05541v1
Date: Wed, 11 May 2022 14:29:39 GMT
Title: Alternatives to a nonhomogeneous partial differential equation quantum algorithm
Authors: Alexandre C. Ricardo, Gabriel P. L. M. Fernandes, Eduardo I. Duzzioni, Vivaldo L. Campo Jr, and Celso J. Villas-B\^oas
Abstract summary: We propose a quantum algorithm for solving nonhomogeneous linear partial differential equations of the form $Apsi(textbfr)=f(textbfr)$. These achievements enable easier experimental implementation of the quantum algorithm based on nowadays technology.
Score: 52.77024349608834
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Abstract: Recently J. M. Arrazola et al. [Phys. Rev. A 100, 032306 (2019)] proposed a quantum algorithm for solving nonhomogeneous linear partial differential equations of the form $A\psi(\textbf{r})=f(\textbf{r})$. Its nonhomogeneous solution is obtained by inverting the operator $A$ along with the preparation and measurement of special ancillary modes. In this work we suggest modifications in its structure to reduce the costs of preparing the initial ancillary states and improve the precision of the algorithm for a specific set of inputs. These achievements enable easier experimental implementation of the quantum algorithm based on nowadays technology.

Related papers

Solving Fractional Differential Equations on a Quantum Computer: A Variational Approach [0.1492582382799606]
We introduce an efficient variational hybrid quantum-classical algorithm designed for solving Caputo time-fractional partial differential equations. Our results indicate that solution fidelity is insensitive to the fractional index and that gradient evaluation cost scales economically with the number of time steps.
arXiv Detail & Related papers (2024-06-13T02:27:16Z)
Preconditioning for a Variational Quantum Linear Solver [0.0]
We numerically demonstrate a notable reduction in the required ansatz depth, demonstrating that preconditioning is useful for quantum algorithms. Our findings suggest that combining classical computing techniques, such as preconditioning, with quantum algorithms can significantly enhance the performance of NISQ algorithms.
arXiv Detail & Related papers (2023-12-25T08:50:22Z)
Linearization Algorithms for Fully Composite Optimization [61.20539085730636]
This paper studies first-order algorithms for solving fully composite optimization problems convex compact sets. We leverage the structure of the objective by handling differentiable and non-differentiable separately, linearizing only the smooth parts.
arXiv Detail & Related papers (2023-02-24T18:41:48Z)
Digital-analog co-design of the Harrow-Hassidim-Lloyd algorithm [0.0]
Harrow-Hassidim-Lloyd quantum algorithm was proposed to solve linear systems of equations $Avecx = vecb$. There is not an explicit quantum circuit for the subroutine which maps the inverse of the problem matrix $A$ into an ancillary qubit. We present a co-designed quantum processor which reduces the depth of the algorithm.
arXiv Detail & Related papers (2022-07-27T13:58:13Z)
Quantum Goemans-Williamson Algorithm with the Hadamard Test and Approximate Amplitude Constraints [62.72309460291971]
We introduce a variational quantum algorithm for Goemans-Williamson algorithm that uses only $n+1$ qubits. Efficient optimization is achieved by encoding the objective matrix as a properly parameterized unitary conditioned on an auxilary qubit. We demonstrate the effectiveness of our protocol by devising an efficient quantum implementation of the Goemans-Williamson algorithm for various NP-hard problems.
arXiv Detail & Related papers (2022-06-30T03:15:23Z)
Automated differential equation solver based on the parametric approximation optimization [77.34726150561087]
The article presents a method that uses an optimization algorithm to obtain a solution using the parameterized approximation. It allows solving the wide class of equations in an automated manner without the algorithm's parameters change.
arXiv Detail & Related papers (2022-05-11T10:06:47Z)
Twisted hybrid algorithms for combinatorial optimization [68.8204255655161]
Proposed hybrid algorithms encode a cost function into a problem Hamiltonian and optimize its energy by varying over a set of states with low circuit complexity. We show that for levels $p=2,ldots, 6$, the level $p$ can be reduced by one while roughly maintaining the expected approximation ratio.
arXiv Detail & Related papers (2022-03-01T19:47:16Z)
A Fully Single Loop Algorithm for Bilevel Optimization without Hessian Inverse [121.54116938140754]
We propose a new Hessian inverse free Fully Single Loop Algorithm for bilevel optimization problems. We show that our algorithm converges with the rate of $O(epsilon-2)$.
arXiv Detail & Related papers (2021-12-09T02:27:52Z)
An efficient adaptive variational quantum solver of the Schrodinger equation based on reduced density matrices [8.24048506727803]
We present an efficient adaptive variational quantum solver of the Schrodinger equation based on ADAPT-VQE. This new algorithm is quite suitable for quantum simulations of chemical systems on near-term noisy intermediate-scale hardware.
arXiv Detail & Related papers (2020-12-13T12:22:41Z)
High-precision quantum algorithms for partial differential equations [1.4050836886292872]
Quantum computers can produce a quantum encoding of the solution of a system of differential equations exponentially faster than a classical algorithm. We develop quantum algorithms based on adaptive-order finite difference methods and spectral methods. Our algorithms apply high-precision quantum linear system algorithms to systems whose condition numbers and approximation errors we bound.
arXiv Detail & Related papers (2020-02-18T20:32:45Z)

This list is automatically generated from the titles and abstracts of the papers in this site.