Optimized trajectory unraveling for classical simulation of noisy quantum dynamics

• URL: http://arxiv.org/abs/2306.17161v2
• Date: Tue, 25 Mar 2025 05:30:46 GMT
• Title: Optimized trajectory unraveling for classical simulation of noisy quantum dynamics
• Authors: Zhuo Chen, Yimu Bao, Soonwon Choi,
• Abstract summary: We show that for an arbitrary decoherence channel, one can optimize the unraveling scheme to lower the threshold for entanglement phase transition.<n>We also present a algorithm that adaptively optimize the unraveling basis for given noise channels.<n>We assess the possibility of using a quasi-local unraveling to efficiently simulate open systems with an arbitrarily small but finite decoherence rate.
• Score: 5.373460541429617
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The dynamics of open quantum systems can be simulated by unraveling it into an ensemble of pure state trajectories undergoing non-unitary monitored evolution, which has recently been shown to undergo measurement-induced entanglement phase transition. Here, we show that, for an arbitrary decoherence channel, one can optimize the unraveling scheme to lower the threshold for entanglement phase transition, thereby enabling efficient classical simulation of the open dynamics for a broader range of decoherence rates. Taking noisy random unitary circuits as a paradigmatic example, we analytically derive the optimum unraveling basis that on average minimizes the threshold. Moreover, we present a heuristic algorithm that adaptively optimizes the unraveling basis for given noise channels, also significantly extending the simulatable regime. When applied to noisy Hamiltonian dynamics, the heuristic approach indeed extends the regime of efficient classical simulation based on matrix product states beyond conventional quantum trajectory methods. Finally, we assess the possibility of using a quasi-local unraveling, which involves multiple qubits and time steps, to efficiently simulate open systems with an arbitrarily small but finite decoherence rate.

Related papers

• Classical Simulation of Noiseless Quantum Dynamics without Randomness [11.577653273297345]
  Low-weight Pauli Dynamics (LPD) algorithm efficiently approximates local observables for short-time dynamics in the absence of noise.<n>We prove that the truncation error admits an average-case bound without assuming randomness, provided that the state is sufficiently entangled.<n>Our results establish a rigorous synergy between existing classical simulation methods and provide a complementary route to quantum simulation.
  arXiv  Detail & Related papers  (2026-01-22T08:59:57Z)
• Simulation of noisy quantum circuits using frame representations [0.0]
  We introduce a unified framework for the classical simulation of quantum circuits based on frame theory.<n>Within this framework, the computational cost of a simulation algorithm is determined by the one-norm of an associated quasi-probability distribution.
  arXiv  Detail & Related papers  (2026-01-08T17:20:49Z)
• Matrix product state approach to lossy boson sampling and noisy IQP sampling [0.7066293026438526]
  We develop classical algorithms for lossy boson sampling and noisy instantaneous quantum-time sampling.<n>Our algorithm offers significantly improved control over the accuracy-efficiency trade-off.<n>It further extends the applicability of MPS simulation to broader classes of noisy quantum sampling models.
  arXiv  Detail & Related papers  (2025-10-28T07:23:10Z)
• Classical Simulations of Low Magic Quantum Dynamics [0.1666604949258699]
  We develop algorithms for adaptive quantum circuits that produce states with low levels of magic.<n>These algorithms are particularly well-suited to circuits with high rates of Pauli measurements.<n>We study the dynamics of all-to-all monitored quantum circuits with a sub-extensive rate of T-gates per unit of circuit depth.
  arXiv  Detail & Related papers  (2025-08-27T20:17:15Z)
• Error mitigation of shot-to-shot fluctuations in analog quantum simulators [46.54051337735883]
  We introduce an error mitigation technique that addresses shot-to-shot fluctuations in the parameters for the Hamiltonian governing the system dynamics.<n>We rigorously prove that amplifying this shot-to-shot noise and extrapolating to the zero-noise limit recovers noiseless results for realistic noise distributions.<n> Numerically, we predict a significant enhancement in the effective many-body coherence time for Rydberg atom arrays under realistic conditions.
  arXiv  Detail & Related papers  (2025-06-19T18:00:00Z)
• Practical Application of the Quantum Carleman Lattice Boltzmann Method in Industrial CFD Simulations [44.99833362998488]
  This work presents a practical numerical assessment of a hybrid quantum-classical approach to CFD based on the Lattice Boltzmann Method (LBM) We evaluate this method on three benchmark cases featuring different boundary conditions, periodic, bounceback, and moving wall. Our results confirm the validity of the approach, achieving median error fidelities on the order of $10-3$ and success probabilities sufficient for practical quantum state sampling.
  arXiv  Detail & Related papers  (2025-04-17T15:41:48Z)
• (Nearly) Optimal Time-dependent Hamiltonian Simulation [0.0]
  We describe a simple quantum algorithm to simulate time-dependent Hamiltonian, extending the methodology of quantum signal processing. The framework achieves optimal scaling up to some factor with respect to other parameters, and nearly optimal in inverse of error tolerance, which could be improved to optimal scaling under certain input models.
  arXiv  Detail & Related papers  (2024-10-18T10:51:46Z)
• Non-unitarity maximizing unraveling of open quantum dynamics [0.0]
  We introduce a new unraveling strategy that can adaptively minimize the averaged entanglement in the trajectory states. We show that for the quantum circuits considered here, unraveling methods are much less efficient than full matrix product density operator simulations.
  arXiv  Detail & Related papers  (2024-10-15T15:25:39Z)
• Application of Langevin Dynamics to Advance the Quantum Natural Gradient Optimization Algorithm [47.47843839099175]
  A Quantum Natural Gradient (QNG) algorithm for optimization of variational quantum circuits has been proposed recently. In this study, we employ the Langevin equation with a QNG force to demonstrate that its discrete-time solution gives a generalized form, which we call Momentum-QNG.
  arXiv  Detail & Related papers  (2024-09-03T15:21:16Z)
• Simulation of a feedback-based algorithm for quantum optimization for a realistic neutral atom system with an optimized small-angle controlled-phase gate [0.0]
  We present a scheme to implement an optimally tuned small-angle controlled-phase gate. We show that the performance of FALQON implemented with small-angle controlled-phase gates exceeds that of FALQON utilizing CZ gates.
  arXiv  Detail & Related papers  (2024-05-16T21:36:50Z)
• Locally Optimal Descent for Dynamic Stepsize Scheduling [45.6809308002043]
  We introduce a novel dynamic learning scheduling scheme grounded in theory with the goal of simplifying the manual and time-consuming tuning of schedules in phases. Our approach is based on estimating a locally-optimal practice tuning-rate in the direction of a smooth gradient. Our findings indicate that our method needs minimal tuning when compared to existing approaches.
  arXiv  Detail & Related papers  (2023-11-23T09:57:35Z)
• Hybrid discrete-continuous compilation of trapped-ion quantum circuits with deep reinforcement learning [1.7087507417780985]
  We show that we can significantly reduce the size of relevant quantum circuits for trapped-ion computing. Our framework can also be applied to an experimental setup whose goal is to reproduce an unknown unitary process.
  arXiv  Detail & Related papers  (2023-07-12T14:55:28Z)
• Nonadiabatic Holonomic Quantum Computation via Path Optimization [3.0726135239588164]
  We present a path-optimized NHQC scheme based on the non-Abelian geometric phase. We show that a geometric gate can be constructed by different evolution paths, which have different responses to systematic noises. In addition, we propose to implement our strategy on superconducting quantum circuits with decoherence-free subspace encoding.
  arXiv  Detail & Related papers  (2022-05-19T02:39:42Z)
• Simulating the Mott transition on a noisy digital quantum computer via Cartan-based fast-forwarding circuits [62.73367618671969]
  Dynamical mean-field theory (DMFT) maps the local Green's function of the Hubbard model to that of the Anderson impurity model. Quantum and hybrid quantum-classical algorithms have been proposed to efficiently solve impurity models. This work presents the first computation of the Mott phase transition using noisy digital quantum hardware.
  arXiv  Detail & Related papers  (2021-12-10T17:32:15Z)
• Quantum algorithms for quantum dynamics: A performance study on the spin-boson model [68.8204255655161]
  Quantum algorithms for quantum dynamics simulations are traditionally based on implementing a Trotter-approximation of the time-evolution operator. variational quantum algorithms have become an indispensable alternative, enabling small-scale simulations on present-day hardware. We show that, despite providing a clear reduction of quantum gate cost, the variational method in its current implementation is unlikely to lead to a quantum advantage.
  arXiv  Detail & Related papers  (2021-08-09T18:00:05Z)
• Importance Sampling Scheme for the Stochastic Simulation of Quantum Spin Dynamics [0.0]
  We develop an importance sampling scheme for the simulation of quantum spin dynamics. An exact transformation is then carried out to preferentially sample trajectories that are close to the dominant one. We demonstrate that this approach is capable of reducing the temporal growth of fluctuations in the quantities.
  arXiv  Detail & Related papers  (2021-03-30T16:18:28Z)
• Fast and differentiable simulation of driven quantum systems [58.720142291102135]
  We introduce a semi-analytic method based on the Dyson expansion that allows us to time-evolve driven quantum systems much faster than standard numerical methods. We show results of the optimization of a two-qubit gate using transmon qubits in the circuit QED architecture.
  arXiv  Detail & Related papers  (2020-12-16T21:43:38Z)
• Stochastic Optimization with Heavy-Tailed Noise via Accelerated Gradient Clipping [69.9674326582747]
  We propose a new accelerated first-order method called clipped-SSTM for smooth convex optimization with heavy-tailed distributed noise in gradients. We prove new complexity that outperform state-of-the-art results in this case. We derive the first non-trivial high-probability complexity bounds for SGD with clipping without light-tails assumption on the noise.
  arXiv  Detail & Related papers  (2020-05-21T17:05:27Z)
• Efficient classical simulation of random shallow 2D quantum circuits [104.50546079040298]
  Random quantum circuits are commonly viewed as hard to simulate classically. We show that approximate simulation of typical instances is almost as hard as exact simulation. We also conjecture that sufficiently shallow random circuits are efficiently simulable more generally.
  arXiv  Detail & Related papers  (2019-12-31T19:00:00Z)

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.