Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2107.07059

Lindblad evolution without the sign problem

Tomoya Hayata

Published Jul 15, 2021• 1 citation
arXivHTMLPDF

Abstract

Quantum Monte Carlo is one of the most powerful numerical tools for studying nonpeturbative properties of quantum many-body systems. However, its application to real-time problems is limited since the complex and highly-oscillating path-integral weight of the real-time evolution harms the important sampling. % , which is the notorious sign problem. In this Letter, we show that some real-time problems in open fermion systems can be simulated using the quantum Monte Carlo. To this end, we prescribe a mapping between a real-time problem in open quantum systems and a statistical problem in non-Hermitian quantum systems; for some cases, the latter can be solved without suffering from the complex measure problem. To explain our idea and demonstrate how it works, we compute the real-time evolution of fidelities in open fermion systems under dissipation.

DOI
10.48550/arxiv.2107.07059

Related papers

Lattice Lindblad simulation

Tomoya Hayata, Yoshimasa Hidaka, Arata Yamamoto

Abstract We perform real-time lattice simulation of an open quantum system based on the Schwinger–Keldysh path integral representation of the Lindblad formalism. Although the real-time simulation generally suffers from the sign problem, a few exceptional cases exist. We focus on a sign-problem-free system of a non-relativistic spinless fermion and analyze the time evolution under driving and dissipation.

arXiv:2111.04937•Progress of Theoretical and Experimental Physics•Mar 28, 2022•0 citations

Quantum Monte Carlo simulation of many-body dynamics with mitigated error on noisy quantum computer

Yongdan Yang, Bing-Nan Lu, Ying Li

Quantum Monte Carlo and quantum simulation are both important tools for understanding quantum many-body systems. As a classical algorithm, quantum Monte Carlo suffers from the sign problem, preventing its applications to most fermion systems and real-time dynamics. In contrast, on a quantum computer, we can simulate time evolution of general systems with local interactions, yet such algorithms usually require the development of fault-tolerant quantum technologies. In this paper, we introduce a novel non-variational algorithm using quantum computing as a subroutine to accelerate quantum Monte Carlo. On a fault-tolerant quantum computer, the complexity of our algorithm is polynomial as the same as conventional quantum simulation algorithms. On a noisy quantum computer, our algorithm incorporating error mitigation eases the sign problem. Even when the circuit noise is significant, our algorithm can reduce the Monte Carlo variance by orders of magnitude.

•Jun 18, 2021•0 citations

Computational Complexity and Fundamental Limitations to Fermionic Quantum Monte Carlo Simulations

Matthias Troyer, U.‐J. Wiese

Quantum Monte Carlo simulations, while being efficient for bosons, suffer from the "negative sign problem" when applied to fermions--causing an exponential increase of the computing time with the number of particles. A polynomial time solution to the sign problem is highly desired since it would provide an unbiased and numerically exact method to simulate correlated quantum systems. Here we show that such a solution is almost certainly unattainable by proving that the sign problem is nondeterministic polynomial (NP) hard, implying that a generic solution of the sign problem would also solve all problems in the complexity class NP in polynomial time.

arXiv:cond-mat/0408370•Physical Review Letters•May 4, 2005•1,250 citations

Monte Carlo Study of Real Time Dynamics on the Lattice

Andrei Alexandru, Gökçe Başar, Paulo F. Bedaque +2 more

Monte Carlo studies involving real time dynamics are severely restricted by the sign problem that emerges from a highly oscillatory phase of the path integral. In this Letter, we present a new method to compute real time quantities on the lattice using the Schwinger-Keldysh formalism via Monte Carlo simulations. The key idea is to deform the path integration domain to a complex manifold where the phase oscillations are mild and the sign problem is manageable. We use the previously introduced "contraction algorithm" to create a Markov chain on this alternative manifold. We substantiate our approach by analyzing the quantum mechanical anharmonic oscillator. Our results are in agreement with the exact ones obtained by diagonalization of the Hamiltonian. The method we introduce is generic and, in principle, applicable to quantum field theory albeit very slow. We discuss some possible improvements that should speed up the algorithm.

arXiv:1605.08040•Physical Review Letters•Aug 17, 2016•106 citations

Real-time simulation of large open quantum spin systems driven by dissipation

Debasish Banerjee, Fu-Jiun Jiang, M. Kon +1 more

We consider a large quantum system with spins $\frac{1}{2}$ whose dynamics is driven entirely by measurements of the total spin of spin pairs. This gives rise to a dissipative coupling to the environment. When one averages over the measurement results, the corresponding real-time path integral does not suffer from a sign problem. Using an efficient cluster algorithm, we study the real-time evolution from an initial antiferromagnetic state of the two-dimensional Heisenberg model, which is driven to a disordered phase, not by a Hamiltonian, but by sporadic measurements or by continuous Lindblad evolution.

arXiv:1405.7882•Physical Review B•Dec 2, 2014•10 citations

Solving the sign problem in quantum Monte Carlo dynamics

Chi H. Mak, David Chandler

A method of solving the sign problem in the Monte Carlo path-integral simulations of quantum dynamics is presented. Our method is based on the distortion of integration contours in conjunction with a stationary-phase-filtering method. Using this importance sampling, correlation functions for the spin-boson model have been computed for real times much longer than \ensuremath{\beta}\ensuremath{\Elzxh}.

Physical Review A•May 1, 1990•90 citations
Quantum Monte Carlo is one of the most powerful numerical tools for studying nonpeturbative properties of quantum many-body systems. However, its application to real-time problems is limited since the complex and highly-oscillating path-integral weight of the real-time evolution harms the important sampling. % , which is the notorious sign problem. In this Letter, we show that some real-time problems in open fermion systems can be simulated using the quantum Monte Carlo. To this end, we prescribe a mapping between a real-time problem in open quantum systems and a statistical problem in non-Hermitian quantum systems; for some cases, the latter can be solved without suffering from the complex measure problem. To explain our idea and demonstrate how it works, we compute the real-time evolution of fidelities in open fermion systems under dissipation.
Quantum Monte Carlo and quantum simulation are both important tools for understanding quantum many-body systems. As a classical algorithm, quantum Monte Carlo suffers from the sign problem, preventing its applications to most fermion systems and real-time dynamics. In contrast, on a quantum computer, we can simulate time evolution of general systems with local interactions, yet such algorithms usually require the development of fault-tolerant quantum technologies. In this paper, we introduce a novel non-variational algorithm using quantum computing as a subroutine to accelerate quantum Monte Carlo. On a fault-tolerant quantum computer, the complexity of our algorithm is polynomial as the same as conventional quantum simulation algorithms. On a noisy quantum computer, our algorithm incorporating error mitigation eases the sign problem. Even when the circuit noise is significant, our algorithm can reduce the Monte Carlo variance by orders of magnitude.
Quantum Monte Carlo simulations, while being efficient for bosons, suffer from the "negative sign problem" when applied to fermions--causing an exponential increase of the computing time with the number of particles. A polynomial time solution to the sign problem is highly desired since it would provide an unbiased and numerically exact method to simulate correlated quantum systems. Here we show that such a solution is almost certainly unattainable by proving that the sign problem is nondeterministic polynomial (NP) hard, implying that a generic solution of the sign problem would also solve all problems in the complexity class NP in polynomial time.
Monte Carlo studies involving real time dynamics are severely restricted by the sign problem that emerges from a highly oscillatory phase of the path integral. In this Letter, we present a new method to compute real time quantities on the lattice using the Schwinger-Keldysh formalism via Monte Carlo simulations. The key idea is to deform the path integration domain to a complex manifold where the phase oscillations are mild and the sign problem is manageable. We use the previously introduced "contraction algorithm" to create a Markov chain on this alternative manifold. We substantiate our approach by analyzing the quantum mechanical anharmonic oscillator. Our results are in agreement with the exact ones obtained by diagonalization of the Hamiltonian. The method we introduce is generic and, in principle, applicable to quantum field theory albeit very slow. We discuss some possible improvements that should speed up the algorithm.
We consider a large quantum system with spins 12\frac{1}{2}21​ whose dynamics is driven entirely by measurements of the total spin of spin pairs. This gives rise to a dissipative coupling to the environment. When one averages over the measurement results, the corresponding real-time path integral does not suffer from a sign problem. Using an efficient cluster algorithm, we study the real-time evolution from an initial antiferromagnetic state of the two-dimensional Heisenberg model, which is driven to a disordered phase, not by a Hamiltonian, but by sporadic measurements or by continuous Lindblad evolution.