Quantum-Trajectory-Inspired Lindbladian Simulation
- URL: http://arxiv.org/abs/2408.10505v1
- Date: Tue, 20 Aug 2024 03:08:27 GMT
- Title: Quantum-Trajectory-Inspired Lindbladian Simulation
- Authors: Sirui Peng, Xiaoming Sun, Qi Zhao, Hongyi Zhou,
- Abstract summary: We propose two quantum algorithms for simulating the dynamics of open quantum systems governed by Lindbladians.
The first algorithm achieves a gate complexity independent of the number of jump operators, $m$, marking a significant improvement in efficiency.
The second algorithm achieves near-optimal dependence on the evolution time $t$ and precision $epsilon$ and introduces only an additional $tildeO(m)$ factor.
- Score: 15.006625290843187
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Simulating the dynamics of open quantum systems is a crucial task in quantum computing, offering wide-ranging applications but remaining computationally challenging. In this paper, we propose two quantum algorithms for simulating the dynamics of open quantum systems governed by Lindbladians. We introduce a new approximation channel for short-time evolution, inspired by the quantum trajectory method, which underpins the efficiency of our algorithms. The first algorithm achieves a gate complexity independent of the number of jump operators, $m$, marking a significant improvement in efficiency. The second algorithm achieves near-optimal dependence on the evolution time $t$ and precision $\epsilon$ and introduces only an additional $\tilde{O}(m)$ factor, which strictly improves upon state-of-the-art gate-based quantum algorithm that has an $\tilde O(m^2)$ factor. In both our algorithms, the reduction of dependence on $m$ significantly enhances the efficiency of simulating practical dissipative processes characterized by a large number of jump operators.
Related papers
- Improved Quantum Algorithms for Eigenvalues Finding and Gradient Descent [0.0]
Block encoding is a key ingredient in the recently developed quantum signal processing that forms a unifying framework for quantum algorithms.
In this article, we utilize block encoding to substantially enhance two previously proposed quantum algorithms.
We show how to extend our proposed method to different contexts, including matrix inversion and multiple eigenvalues estimation.
arXiv Detail & Related papers (2023-12-22T15:59:03Z) - Efficient quantum algorithm to simulate open systems through a single environmental qubit [0.0]
We present an efficient algorithm for simulating open quantum systems dynamics described by the Lindblad master equation on quantum computers.
Under fixed accuracy conditions, our algorithm enables a reduction in the number of trotter steps compared to other approaches.
arXiv Detail & Related papers (2023-11-16T16:45:30Z) - Hamiltonian Encoding for Quantum Approximate Time Evolution of Kinetic
Energy Operator [2.184775414778289]
The time evolution operator plays a crucial role in the precise computation of chemical experiments on quantum computers.
We have proposed a new encoding method, namely quantum approximate time evolution (QATE) for the quantum implementation of the kinetic energy operator.
arXiv Detail & Related papers (2023-10-05T05:25:38Z) - Quantum Annealing for Single Image Super-Resolution [86.69338893753886]
We propose a quantum computing-based algorithm to solve the single image super-resolution (SISR) problem.
The proposed AQC-based algorithm is demonstrated to achieve improved speed-up over a classical analog while maintaining comparable SISR accuracy.
arXiv Detail & Related papers (2023-04-18T11:57:15Z) - A single $T$-gate makes distribution learning hard [56.045224655472865]
This work provides an extensive characterization of the learnability of the output distributions of local quantum circuits.
We show that for a wide variety of the most practically relevant learning algorithms -- including hybrid-quantum classical algorithms -- even the generative modelling problem associated with depth $d=omega(log(n))$ Clifford circuits is hard.
arXiv Detail & Related papers (2022-07-07T08:04:15Z) - Quantum algorithms for approximate function loading [0.0]
We introduce two approximate quantum-state preparation methods for the NISQ era inspired by the Grover-Rudolph algorithm.
A variational algorithm capable of loading functions beyond the aforementioned smoothness conditions is proposed.
arXiv Detail & Related papers (2021-11-15T17:36:13Z) - Variational Quantum Optimization with Multi-Basis Encodings [62.72309460291971]
We introduce a new variational quantum algorithm that benefits from two innovations: multi-basis graph complexity and nonlinear activation functions.
Our results in increased optimization performance, two increase in effective landscapes and a reduction in measurement progress.
arXiv Detail & Related papers (2021-06-24T20:16:02Z) - 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) - Preparation of excited states for nuclear dynamics on a quantum computer [117.44028458220427]
We study two different methods to prepare excited states on a quantum computer.
We benchmark these techniques on emulated and real quantum devices.
These findings show that quantum techniques designed to achieve good scaling on fault tolerant devices might also provide practical benefits on devices with limited connectivity and gate fidelity.
arXiv Detail & Related papers (2020-09-28T17:21:25Z) - Space-efficient binary optimization for variational computing [68.8204255655161]
We show that it is possible to greatly reduce the number of qubits needed for the Traveling Salesman Problem.
We also propose encoding schemes which smoothly interpolate between the qubit-efficient and the circuit depth-efficient models.
arXiv Detail & Related papers (2020-09-15T18:17:27Z)
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.