A quantum algorithm to simulate Lindblad master equations
- URL: http://arxiv.org/abs/2406.12748v2
- Date: Mon, 1 Jul 2024 16:41:46 GMT
- Title: A quantum algorithm to simulate Lindblad master equations
- Authors: Evan Borras, Milad Marvian,
- Abstract summary: We present a quantum algorithm for simulating a family of Markovian master equations.
Our approach employs a second-order product formula for the Lindblad master equation.
- Score: 1.104960878651584
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: We present a quantum algorithm for simulating a family of Markovian master equations that can be realized through a probabilistic application of unitary channels and state preparation. Our approach employs a second-order product formula for the Lindblad master equation, achieved by decomposing the dynamics into dissipative and Hamiltonian components and replacing the dissipative segments with randomly compiled, easily implementable elements. The sampling approach eliminates the need for ancillary qubits to simulate the dissipation process and reduces the gate complexity in terms of the number of jump operators. We provide a rigorous performance analysis of the algorithm. We also extend the algorithm to time-dependent Lindblad equations, generalize the noise model when there is access to limited ancillary systems, and explore applications beyond the Markovian noise model. A new error bound, in terms of the diamond norm, for second-order product formulas for time-dependent Liouvillians is provided that might be of independent interest.
Related papers
- Quantum algorithm for the advection-diffusion equation and the Koopman-von Neumann approach to nonlinear dynamical systems [0.0]
We propose an explicit algorithm to simulate both the advection-diffusion equation and a nonunitary discretized version of the Koopman-von Neumann formulation of nonlinear dynamics.
The proposed algorithm is universal and can be used for modeling a broad class of linear and nonlinear differential equations.
arXiv Detail & Related papers (2024-10-04T23:58:12Z) - Lindbladian reverse engineering for general non-equilibrium steady states: A scalable null-space approach [49.1574468325115]
We introduce a method for reconstructing the corresponding Lindbaldian master equation given any target NESS.
The kernel (null-space) of the correlation matrix corresponds to Lindbladian solutions.
We illustrate the method in different systems, ranging from bosonic Gaussian to dissipative-driven collective spins.
arXiv Detail & Related papers (2024-08-09T19:00:18Z) - Quantum Dissipative Search via Lindbladians [0.0]
We analyze the convergence criteria and the convergence speed of a Markovian, purely dissipative quantum random walk on an unstructured search space.
We map the results onto an actual implementation to correctly estimate the potential and show that it is no more efficient than classical search.
arXiv Detail & Related papers (2024-07-16T14:39:18Z) - Lindblad-like quantum tomography for non-Markovian quantum dynamical maps [46.350147604946095]
We introduce Lindblad-like quantum tomography (L$ell$QT) as a quantum characterization technique of time-correlated noise in quantum information processors.
We discuss L$ell$QT for the dephasing dynamics of single qubits in detail, which allows for a neat understanding of the importance of including multiple snapshots of the quantum evolution in the likelihood function.
arXiv Detail & Related papers (2024-03-28T19:29:12Z) - 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) - Formal Controller Synthesis for Markov Jump Linear Systems with
Uncertain Dynamics [64.72260320446158]
We propose a method for synthesising controllers for Markov jump linear systems.
Our method is based on a finite-state abstraction that captures both the discrete (mode-jumping) and continuous (stochastic linear) behaviour of the MJLS.
We apply our method to multiple realistic benchmark problems, in particular, a temperature control and an aerial vehicle delivery problem.
arXiv Detail & Related papers (2022-12-01T17:36:30Z) - A stochastic quantum Krylov protocol with double factorized Hamiltonians [0.0]
We propose a class of randomized quantum Krylov diagonalization (rQKD) algorithms capable of solving the eigenstate estimation problem with modest quantum resource requirements.
Compared to previous real-time evolution quantum Krylov subspace methods, our approach expresses the time evolution operator, $e-ihatH tau$, as a linear combination of unitaries and subsequently uses a sampling procedure to reduce circuit depth requirements.
arXiv Detail & Related papers (2022-11-15T16:27:41Z) - 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) - Fast and differentiable simulation of driven quantum systems [58.720142291102135]
We introduce a semi-analytic method based on the Dyson expansion that allows us to time-evolve driven quantum systems much faster than standard numerical methods.
We show results of the optimization of a two-qubit gate using transmon qubits in the circuit QED architecture.
arXiv Detail & Related papers (2020-12-16T21:43:38Z) - Low-depth Hamiltonian Simulation by Adaptive Product Formula [3.050399782773013]
Various Hamiltonian simulation algorithms have been proposed to efficiently study the dynamics of quantum systems on a quantum computer.
Here, we propose an adaptive approach to construct a low-depth time evolution circuit.
Our work sheds light on practical Hamiltonian simulation with noisy-intermediate-scale-quantum devices.
arXiv Detail & Related papers (2020-11-10T18:00:42Z) - Efficient classical simulation and benchmarking of quantum processes in
the Weyl basis [0.0]
We develop a randomized benchmarking algorithm which uses Weyl unitaries to efficiently identify and learn a mixture of error models.
We apply our methods to ansatz circuits that appear in the Variational Quantum Eigensolver.
arXiv Detail & Related papers (2020-08-27T16:46:12Z)
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.