Simulation of Lindbladian dynamics via adaptive variational quantum trajectory compression
- URL: http://arxiv.org/abs/2607.09051v1
- Date: Fri, 10 Jul 2026 02:48:39 GMT
- Title: Simulation of Lindbladian dynamics via adaptive variational quantum trajectory compression
- Abstract summary: We propose a resource-efficient algorithm for simulating Lindbladian dynamics on NISQ devices.<n>For open quantum systems with Pauli dissipations, we first derive a compact and stable mixed-unitary adjoint channel.<n>To further reduce the circuit depth required for implementing the sampled trajectories, we introduce an adaptive variational quantum trajectory compression framework.
- Score: 6.296586170753371
- License: http://creativecommons.org/publicdomain/zero/1.0/
- Abstract: Quantum simulation of open quantum systems in the noisy intermediate-scale quantum (NISQ) era is hindered by the non-unitary nature of dissipative dynamics and the limited quantum resources available on near-term quantum processors. In this work, we propose a resource-efficient algorithm for simulating Lindbladian dynamics on NISQ devices. For open quantum systems with Pauli dissipations, we first derive a compact and stable mixed-unitary adjoint channel that approximates the target dissipative dynamics and enables ancilla-free implementation through trajectory sampling. To further reduce the circuit depth required for implementing the sampled trajectories, we introduce an adaptive variational quantum trajectory compression framework. In this framework, a depth-adaptive parameterized quantum circuit is trained to approximate repeated Trotterized Hamiltonian simulation operators, which are then used to replace repeated unitary segments appearing in the sampled trajectories. Importantly, the training procedure can also be performed without auxiliary qubits. Numerical simulations of the dissipative quantum $XY$ model demonstrate the accuracy and resource efficiency of the proposed algorithm. Our results provide a practical route toward ancilla-free and depth-reduced simulation of open quantum systems on near-term quantum hardware.
Related papers
- Stochastic Pauli-path simulator for large-scale quantum optimization [57.179828941706006]
Pauli-path simulators offer a promising route to large-scale classical simulation of quantum circuits in the low-magic regime.<n>Existing approaches either lack native support for gradient-based optimization or suffer from severe gradient bias.<n>Here we propose the Pauli-path simulator (SPPS), a computational framework for large-scale quantum optimization.
arXiv Detail & Related papers (2026-07-20T10:43:44Z) - Shot and Architecture Adaptive Subspace Variational Quantum Eigensolver for Microwave Simulation [18.95340169522508]
We propose an architecture and shot adaptive subspace variational quantum eigensolver for efficient microwave waveguide eigenmode simulation on NISQ devices.<n>The proposed framework integrates a reinforcement learning based circuit design strategy and an adaptive shot allocation mechanism to jointly reduce quantum resource overhead.
arXiv Detail & Related papers (2025-12-11T09:34:17Z) - Variational noise mitigation in quantum circuits: the case of Quantum Fourier Transform [35.18016233072556]
We perform numerical simulations for two qubits under both coherent and incoherent noise.<n>Our results show that the variational circuit can reproduce the QFT with higher fidelity in scenarios dominated by coherent noise.<n>This demonstrates the potential of the approach as an effective error-mitigation strategy for small- to medium-scale quantum systems.
arXiv Detail & Related papers (2025-11-07T14:35:55Z) - VQC-MLPNet: An Unconventional Hybrid Quantum-Classical Architecture for Scalable and Robust Quantum Machine Learning [50.95799256262098]
Variational quantum circuits (VQCs) hold promise for quantum machine learning but face challenges in expressivity, trainability, and noise resilience.<n>We propose VQC-MLPNet, a hybrid architecture where a VQC generates the first-layer weights of a classical multilayer perceptron during training, while inference is performed entirely classically.
arXiv Detail & Related papers (2025-06-12T01:38:15Z) - RhoDARTS: Differentiable Quantum Architecture Search with Density Matrix Simulations [44.13836547616739]
Variational Quantum Algorithms (VQAs) are a promising approach to leverage Noisy Intermediate-Scale Quantum (NISQ) computers.<n> choosing optimal quantum circuits that efficiently solve a given VQA problem is a non-trivial task.<n>Quantum Architecture Search (QAS) algorithms enable automatic generation of quantum circuits tailored to the provided problem.
arXiv Detail & Related papers (2025-06-04T08:30:35Z) - Adaptive variational quantum dynamics simulations with compressed circuits and fewer measurements [4.2643127089535104]
We show an improved version of the adaptive variational quantum dynamics simulation (AVQDS) method, which we call AVQDS(T)<n>The algorithm adaptively adds layers of disjoint unitary gates to the ansatz circuit so as to keep the McLachlan distance, a measure of the accuracy of the variational dynamics, below a fixed threshold.<n>We also show a method based on eigenvalue truncation to solve the linear equations of motion for the variational parameters with enhanced noise resilience.
arXiv Detail & Related papers (2024-08-13T02:56:43Z) - Overhead-constrained circuit knitting for variational quantum dynamics [0.0]
We use circuit knitting to partition a large quantum system into smaller subsystems that can each be simulated on a separate device.
We show that the same method can be used to reduce the circuit depth by cutting long-ranged gates.
arXiv Detail & Related papers (2023-09-14T17:01:06Z) - 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) - Efficient Quantum Simulation of Open Quantum System Dynamics on Noisy
Quantum Computers [0.0]
We show that quantum dissipative dynamics can be simulated efficiently across coherent-to-incoherent regimes.
This work provides a new direction for quantum advantage in the NISQ era.
arXiv Detail & Related papers (2021-06-24T10:37:37Z) - Pulse-level noisy quantum circuits with QuTiP [53.356579534933765]
We introduce new tools in qutip-qip, QuTiP's quantum information processing package.
These tools simulate quantum circuits at the pulse level, leveraging QuTiP's quantum dynamics solvers and control optimization features.
We show how quantum circuits can be compiled on simulated processors, with control pulses acting on a target Hamiltonian.
arXiv Detail & Related papers (2021-05-20T17:06:52Z) - Autoregressive Transformer Neural Network for Simulating Open Quantum Systems via a Probabilistic Formulation [5.668795025564699]
We present an approach for tackling open quantum system dynamics.
We compactly represent quantum states with autoregressive transformer neural networks.
Efficient algorithms have been developed to simulate the dynamics of the Liouvillian superoperator.
arXiv Detail & Related papers (2020-09-11T18: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.