The reviewed record of science sign in
Pith

arxiv: 2405.20712 · v2 · pith:7PDD5ELE · submitted 2024-05-31 · quant-ph

Simulation of open quantum systems on universal quantum computers

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:7PDD5ELErecord.jsonopen to challenge →

classification quant-ph
keywords quantumcomputersdynamicsdensitymatrixsystemsadjointadvantages
0
0 comments X
read the original abstract

The rapid development of quantum computers has enabled demonstrations of quantum advantages on various tasks. However, real quantum systems are always dissipative due to their inevitable interaction with the environment, and the resulting non-unitary dynamics make quantum simulation challenging with only unitary quantum gates. In this work, we present an innovative and scalable method to simulate open quantum systems using quantum computers. We define an adjoint density matrix as a counterpart of the true density matrix, which reduces to a mixed-unitary quantum channel and thus can be effectively sampled using quantum computers. This method has several benefits, including no need for auxiliary qubits and noteworthy scalability. Moreover, some long-time properties like steady states and the thermal equilibrium can also be investigated as the adjoint density matrix and the true dissipated one converge to the same state. Finally, we present deployments of this theory in the dissipative quantum $XY$ model for the evolution of correlation and entropy with short-time dynamics and the disordered Heisenberg model for many-body localization with long-time dynamics. This work promotes the study of real-world many-body dynamics with quantum computers, highlighting the potential to demonstrate practical quantum advantages.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Quantum algorithms based on quantum trajectories

    quant-ph 2025-09 unverdicted novelty 6.0

    Quantum trajectory algorithm achieves additive O(T + log(1/ε)) query complexity for simulating dissipative Lindbladians.