Beating the House: Fast Simulation of Dissipative Quantum Systems with Ensemble Rank Truncation

• URL: http://arxiv.org/abs/2010.05399v1
• Date: Mon, 12 Oct 2020 02:01:27 GMT
• Title: Beating the House: Fast Simulation of Dissipative Quantum Systems with Ensemble Rank Truncation
• Authors: Gerard McCaul, Kurt Jacobs and Denys I. Bondar
• Abstract summary: We introduce a new technique for the simulation of dissipative quantum systems. This method is composed of an approximate decomposition of the Lindblad equation into a Kraus map. We find that in the regime of weak coupling, this method is able to outperform existing wavefunction Monte-Carlo methods by an order of magnitude in both accuracy and speed.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We introduce a new technique for the simulation of dissipative quantum systems. This method is composed of an approximate decomposition of the Lindblad equation into a Kraus map, from which one can define an ensemble of wavefunctions. Using principal component analysis, this ensemble can be truncated to a manageable size without sacrificing numerical accuracy. We term this method \emph{Ensemble Rank Truncation} (ERT), and find that in the regime of weak coupling, this method is able to outperform existing wavefunction Monte-Carlo methods by an order of magnitude in both accuracy and speed. We also explore the possibility of combining ERT with approximate techniques for simulating large systems (such as Matrix Product States (MPS)), and show that in many cases this approach will be more efficient than directly expressing the density matrix in its MPS form. We expect the ERT technique to be of practical interest when simulating dissipative systems for quantum information, metrology and thermodynamics.

Related papers

• Fast classical simulation of qubit-qudit hybrid systems [6.116156387681214]
  Simulating quantum circuits is a computationally intensive task that relies heavily on tensor products and matrix multiplications. Recent advancements, eliminate the need for tensor products and matrix multiplications, offering significant improvements in efficiency and parallelization. We propose a block-simulation methodology applicable to qubit-qudit hybrid systems.
  arXiv  Detail & Related papers  (2024-10-23T13:49:25Z)
• Efficiency of Dynamical Decoupling for (Almost) Any Spin-Boson Model [44.99833362998488]
  We analytically study the dynamical decoupling of a two-level system coupled with a structured bosonic environment. We find sufficient conditions under which dynamical decoupling works for such systems. Our bounds reproduce the correct scaling in various relevant system parameters.
  arXiv  Detail & Related papers  (2024-09-24T04:58:28Z)
• Enhanced Krylov Methods for Molecular Hamiltonians via Tensor Hypercontraction [2.2022550150705804]
  We present a matrix product operator (MPO) construction based on the tensor hypercontraction (THC) format for ab initio molecular Hamiltonians. Such an MPO construction dramatically lowers the memory requirement and cost scaling of Krylov subspace methods.
  arXiv  Detail & Related papers  (2024-09-19T12:34:06Z)
• Simulating Neutral Atom Quantum Systems with Tensor Network States [0.0]
  We show that circuits with a large number of qubits fail more often under noise that depletes the qubit population. We also find that the optimized parameters are especially robust to noise, suggesting that a noisier quantum system can be used to find the optimal parameters.
  arXiv  Detail & Related papers  (2023-09-15T17:38:37Z)
• A Score-Based Model for Learning Neural Wavefunctions [41.82403146569561]
  We provide a new framework for obtaining properties of quantum many-body ground states using score-based neural networks. Our new framework does not require explicit probability distribution and performs the sampling via Langevin dynamics.
  arXiv  Detail & Related papers  (2023-05-25T23:44:27Z)
• Importance sampling for stochastic quantum simulations [68.8204255655161]
  We introduce the qDrift protocol, which builds random product formulas by sampling from the Hamiltonian according to the coefficients. We show that the simulation cost can be reduced while achieving the same accuracy, by considering the individual simulation cost during the sampling stage. Results are confirmed by numerical simulations performed on a lattice nuclear effective field theory.
  arXiv  Detail & Related papers  (2022-12-12T15:06:32Z)
• Formal Controller Synthesis for Markov Jump Linear Systems with Uncertain Dynamics [64.72260320446158]
  We propose a method for synthesising controllers for Markov jump linear systems. Our method is based on a finite-state abstraction that captures both the discrete (mode-jumping) and continuous (stochastic linear) behaviour of the MJLS. We apply our method to multiple realistic benchmark problems, in particular, a temperature control and an aerial vehicle delivery problem.
  arXiv  Detail & Related papers  (2022-12-01T17:36:30Z)
• 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)
• Analysis of a density matrix renormalization group approach for transport in open quantum systems [0.0]
  Density matrix renormalization group-based tools have been widely used in the study of closed systems. We present an implementation based on state-of-the-art matrix product state (MPS) and tensor network methods. We show that this implementation is suited for studying thermal transport in one-dimensional systems.
  arXiv  Detail & Related papers  (2020-09-17T10:37:49Z)
• 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)
• Efficient construction of tensor-network representations of many-body Gaussian states [59.94347858883343]
  We present a procedure to construct tensor-network representations of many-body Gaussian states efficiently and with a controllable error. These states include the ground and thermal states of bosonic and fermionic quadratic Hamiltonians, which are essential in the study of quantum many-body systems.
  arXiv  Detail & Related papers  (2020-08-12T11:30:23Z)

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.