Real-time Sign-Problem-Suppressed Quantum Monte Carlo Algorithm For Noisy Quantum Circuit Simulations

Abstract

We present a real-time quantum Monte Carlo algorithm that simulates the dynamics of open quantum systems by stochastically compressing and evolving the density matrix under both Markovian and non-Markovian master equations. Our algorithm uses population dynamics to continuously suppress the sign problem, preventing its accumulation throughout the evolution. We apply it to a variety of quantum circuits and demonstrate significant speedups over state-of-art quantum trajectory methods and convergence to exact solutions even in non-Markovian regimes where trajectory methods fail. Our approach improves the efficiency of classical simulation of gate-based quantum computing, quantum annealing, and general open system dynamics.

References in corpus (12)

• Charge insensitive qubit design derived from the Cooper pair box
• Quantum States and Phases in Driven Open Quantum Systems with Cold Atoms
• Computational complexity and fundamental limitations to fermionic quantum Monte Carlo simulations
• Matrix Product Density Operators: Simulation of finite-T and dissipative systems
• Quantum Non-Markovianity: Characterization, Quantification and Detection
• Quantum trajectories and open many-body quantum systems
• Modeling heat transport through completely positive maps
• Gradient-based optimal control of open quantum systems using quantum trajectories and automatic differentiation
• Unbiasing the initiator approximation in Full Configuration Interaction Quantum Monte Carlo
• A self-consistent quantum master equation approach to molecular transport
• Exponentially reduced circuit depths in Lindbladian simulation
• Efficient Chromatic-Number-Based Multi-Qubit Decoherence and Crosstalk Suppression