Generalized Quantum Assisted Simulator
- URL: http://arxiv.org/abs/2011.14737v2
- Date: Wed, 3 Aug 2022 18:02:51 GMT
- Title: Generalized Quantum Assisted Simulator
- Authors: Tobias Haug, Kishor Bharti
- Abstract summary: We introduce the notion of the hybrid density matrix, which allows us to disentangle the different steps of our algorithm.
Our algorithm has potential applications in solving the Navier-Stokes equation, plasma hydrodynamics, quantum Boltzmann training, quantum signal processing and linear systems.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: We provide a noisy intermediate-scale quantum framework for simulating the
dynamics of open quantum systems, generalized time evolution, non-linear
differential equations and Gibbs state preparation. Our algorithm does not
require any classical-quantum feedback loop, bypass the barren plateau problem
and does not necessitate any complicated measurements such as the Hadamard
test. We introduce the notion of the hybrid density matrix, which allows us to
disentangle the different steps of our algorithm and delegate classically
demanding tasks to the quantum computer. Our algorithm proceeds in three
disjoint steps. First, we select the ansatz, followed by measuring overlap
matrices on a quantum computer. The final step involves classical
post-processing data from the second step. Our algorithm has potential
applications in solving the Navier-Stokes equation, plasma hydrodynamics,
quantum Boltzmann training, quantum signal processing and linear systems. Our
entire framework is compatible with current experiments and can be implemented
immediately.
Related papers
- Incompressible Navier-Stokes solve on noisy quantum hardware via a hybrid quantum-classical scheme [2.3624125155742064]
Partial differential equation solvers are required to solve the Navier-Stokes equations for fluid flow.
This work presents a hybrid quantum-classical algorithm for the incompressible Navier-Stokes equations.
arXiv Detail & Related papers (2024-06-01T03:12:36Z) - The Algorithm for Solving Quantum Linear Systems of Equations With Coherent Superposition and Its Extended Applications [8.8400072344375]
We propose two quantum algorithms for solving quantum linear systems of equations with coherent superposition.
The two quantum algorithms can both compute the rank and general solution by one measurement.
Our analysis indicates that the proposed algorithms are mainly suitable for conducting attacks against lightweight symmetric ciphers.
arXiv Detail & Related papers (2024-05-11T03:03:14Z) - Nonlinear dynamics as a ground-state solution on quantum computers [39.58317527488534]
We present variational quantum algorithms (VQAs) that encode both space and time in qubit registers.
The spacetime encoding enables us to obtain the entire time evolution from a single ground-state computation.
arXiv Detail & Related papers (2024-03-25T14:06:18Z) - Quantum Worst-Case to Average-Case Reductions for All Linear Problems [66.65497337069792]
We study the problem of designing worst-case to average-case reductions for quantum algorithms.
We provide an explicit and efficient transformation of quantum algorithms that are only correct on a small fraction of their inputs into ones that are correct on all inputs.
arXiv Detail & Related papers (2022-12-06T22:01:49Z) - Anticipative measurements in hybrid quantum-classical computation [68.8204255655161]
We present an approach where the quantum computation is supplemented by a classical result.
Taking advantage of its anticipation also leads to a new type of quantum measurements, which we call anticipative.
In an anticipative quantum measurement the combination of the results from classical and quantum computations happens only in the end.
arXiv Detail & Related papers (2022-09-12T15:47:44Z) - Quantum algorithms for grid-based variational time evolution [36.136619420474766]
We propose a variational quantum algorithm for performing quantum dynamics in first quantization.
Our simulations exhibit the previously observed numerical instabilities of variational time propagation approaches.
arXiv Detail & Related papers (2022-03-04T19:00:45Z) - Quantum Optimization of Maximum Independent Set using Rydberg Atom
Arrays [39.76254807200083]
We experimentally investigate quantum algorithms for solving the Maximum Independent Set problem.
We find the problem hardness is controlled by the solution degeneracy and number of local minima.
On the hardest graphs, we observe a superlinear quantum speedup in finding exact solutions.
arXiv Detail & Related papers (2022-02-18T19:00:01Z) - 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) - Quantum Algorithms for Solving Ordinary Differential Equations via
Classical Integration Methods [1.802439717192088]
We explore utilizing quantum computers for the purpose of solving differential equations.
We devise and simulate corresponding digital quantum circuits, and implement and run a 6$mathrmth$ order Gauss-Legendre collocation method.
As promising future scenario, the digital arithmetic method could be employed as an "oracle" within quantum search algorithms for inverse problems.
arXiv Detail & Related papers (2020-12-17T09:49:35Z) - Quantum Assisted Simulator [0.0]
We provide a novel hybrid quantum-classical algorithm for simulating the dynamics of quantum systems.
Unlike existing variational quantum simulation algorithms, our algorithm does not require any classical-quantum feedback loop.
arXiv Detail & Related papers (2020-11-12T13:52:44Z) - Iterative Quantum Assisted Eigensolver [0.0]
We provide a hybrid quantum-classical algorithm for approximating the ground state of a Hamiltonian.
Our algorithm builds on the powerful Krylov subspace method in a way that is suitable for current quantum computers.
arXiv Detail & Related papers (2020-10-12T12:25:16Z)
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.