Quantum algorithms based on quantum trajectories

Abstract

Quantum simulation has emerged as a key application of quantum computing, with significant progress made in algorithms for simulating both closed and open quantum systems. The simulation of open quantum systems, particularly those governed by the Lindblad master equation, has received attention recently with the current state-of-the-art algorithms having an input model query complexity of $O(T\mathrm{polylog}(T/\epsilon ))$, where $T$ and $\epsilon$ are the desired time and precision of the simulation respectively. For the Hamiltonian simulation problem it has been show that the optimal Hamiltonian query complexity is $O(T+\log (1/\epsilon ))$, which is additive in the two parameters, but for Lindbladian simulation this question remains open. In this work we show that the additive complexity of $O(T+\log (1/\epsilon ))$ is reachable for the simulation of a large class of dissipative Lindbladians by constructing a novel quantum algorithm based on quantum trajectories.

comments welcome

References in corpus (32)

• Hamiltonian Simulation by Qubitization
• Optimal Hamiltonian Simulation by Quantum Signal Processing
• Simulating Hamiltonian dynamics with a truncated Taylor series
• Efficient quantum algorithms for simulating sparse Hamiltonians
• Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics
• A Theory of Trotter Error
• Hamiltonian simulation with nearly optimal dependence on all parameters
• A random compiler for fast Hamiltonian simulation
• Quantum simulation of time-dependent Hamiltonians and the convenient illusion of Hilbert space
• Exponential improvement in precision for simulating sparse Hamiltonians
• Faster quantum simulation by randomization
• A dissipative quantum Church-Turing theorem
• Suppression of crosstalk in superconducting qubits using dynamical decoupling
• Quantum Simulation of Open Quantum Systems Using a Unitary Decomposition of Operators
• Noise-assisted digital quantum simulation of open systems
• Two-Unitary Decomposition Algorithm and Open Quantum System Simulation
• Efficient simulation of sparse Markovian quantum dynamics
• Efficient Quantum Algorithms for Simulating Lindblad Evolution
• Superdiffusive quantum stochastic walk definable of arbitrary directed graph
• qSWIFT: High-order randomized compiler for Hamiltonian simulation
• Quantum Thermal State Preparation
• Efficient quantum algorithm to simulate open systems through a single environmental qubit
• Optimized noise-assisted simulation of the Lindblad equation with time-dependent coefficients on a noisy quantum processor
• An efficient and exact noncommutative quantum Gibbs sampler
• Succinct Description and Efficient Simulation of Non-Markovian Open Quantum Systems
• Lower bound for simulation cost of open quantum systems: Lipschitz continuity approach
• Commutation simulator for open quantum dynamics
• Quantum-Dynamical Semigroups and the Church of the Larger Hilbert Space
• Simulation of open quantum systems on universal quantum computers
• Gate-efficient discrete simulations of continuous-time quantum query algorithms
• Faster Quantum Simulation Of Markovian Open Quantum Systems Via Randomisation
• Lévy-Khintchine Structure Enables Fast-Forwardable Lindbladian Simulation

Cited by in corpus (1)

• Non-normality and dissipation in Markovian quantum dynamics: Implications for quantum simulation