Gillespie algorithm for quantum jump trajectories

• URL: http://arxiv.org/abs/2303.15405v2
• Date: Fri, 13 Dec 2024 16:52:02 GMT
• Title: Gillespie algorithm for quantum jump trajectories
• Authors: Marco Radaelli, Gabriel T. Landi, Felix C. Binder,
• Abstract summary: We present an alternative method for the simulation of the quantum jump unraveling, inspired by the classical Gillespie algorithm.<n>We include four example applications of increasing physical complexity and discuss the performance of the algorithm across regimes of interest for open quantum systems simulation.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The jump unravelling of a quantum master equation decomposes the dynamics of an open quantum system into abrupt jumps, interspersed by periods of coherent dynamics when no jumps occur. Such open quantum systems are ubiquitous in quantum optics and mesoscopic physics, hence the need for efficient techniques for their stochastic simulation. Numerical simulation techniques fall into two main categories. The first splits the evolution into small timesteps and determines stochastically for each step if a jump occurs or not. The second, known as Monte Carlo Wavefunction simulation, is based on the reduction of the norm of an initially pure state in the conditional no-jump evolution. It exploits the fact that the purity of the state is preserved by the finest unraveling of the master equation. In this work, we present an alternative method for the simulation of the quantum jump unraveling, inspired by the classical Gillespie algorithm. The method is particularly well suited for situations in which a large number of trajectories is required for relatively small systems. It allows for non-purity-preserving dynamics, such as the ones generated by partial monitoring and channel merging. We describe the algorithm in detail and discuss relevant limiting cases. To illustrate it, we include four example applications of increasing physical complexity and discuss the performance of the algorithm across regimes of interest for open quantum systems simulation. Publicly available implementations of our code are provided in Julia and Mathematica.

Related papers

• Algorithmic Advances Towards a Realizable Quantum Lattice Boltzmann Method [2.7192829556657774]
  The Quantum Lattice Boltzmann Method (QLBM) is one of the most promising approaches for realizing the potential of quantum computing. We present a series of novel algorithmic advances which allow us to implement the QLBM algorithm, for the first time, on a quantum computer.
  arXiv  Detail & Related papers  (2025-04-15T05:02:41Z)
• Faster Quantum Simulation Of Markovian Open Quantum Systems Via Randomisation [0.0]
  We introduce novel non-probabilistic algorithms for simulating Markovian open quantum systems using randomisation. Our methods maintain the physicality of the system's evolution but also enhance the scalability and precision of quantum simulations. This work is the first to apply randomisation techniques to the simulation of open quantum systems, highlighting their potential to enable faster and more accurate simulations.
  arXiv  Detail & Related papers  (2024-08-21T15:06:29Z)
• Quantum Dissipative Search via Lindbladians [0.0]
  We analyze a purely dissipative quantum random walk on an unstructured classical search space. We show that certain jump operators make the quantum process replicate a classical one, while others yield differences between open quantum (OQRW) and classical random walks. We also clarify a previously observed quadratic speedup, demonstrating that OQRWs are no more efficient than classical search.
  arXiv  Detail & Related papers  (2024-07-16T14:39:18Z)
• Quantum quench dynamics as a shortcut to adiabaticity [31.114245664719455]
  We develop and test a quantum algorithm in which the incorporation of a quench step serves as a remedy to the diverging adiabatic timescale. Our experiments show that this approach significantly outperforms the adiabatic algorithm.
  arXiv  Detail & Related papers  (2024-05-31T17:07:43Z)
• Parallelizing quantum simulation with decision diagrams [2.5999037208435705]
  Classical computers face a critical obstacle in simulating quantum algorithms. Quantum states reside in a Hilbert space whose size grows exponentially to the number of subsystems, i.e., qubits. This work explores several strategies for parallelizing decision diagram operations, specifically for quantum simulations.
  arXiv  Detail & Related papers  (2023-12-04T02:00:24Z)
• Quantum speedup of leverage score sampling and its application [0.0]
  In this paper, we propose a quantum algorithm to accelerate the computation of leverage scores. As an application, we propose a new quantum algorithm for rigid regression problems with vector solution outputs.
  arXiv  Detail & Related papers  (2023-01-15T14:40:18Z)
• Quantum Clustering with k-Means: a Hybrid Approach [117.4705494502186]
  We design, implement, and evaluate three hybrid quantum k-Means algorithms. We exploit quantum phenomena to speed up the computation of distances. We show that our hybrid quantum k-Means algorithms can be more efficient than the classical version.
  arXiv  Detail & Related papers  (2022-12-13T16:04:16Z)
• Classical simulation of short-time quantum dynamics [0.0]
  We present classical algorithms for approximating the dynamics of local observables and nonlocal quantities. We establish a novel quantum speed limit, a bound on dynamical phase transitions, and a concentration bound for product states evolved for short times.
  arXiv  Detail & Related papers  (2022-10-20T18:00:04Z)
• Losing momentum in continuous-time stochastic optimisation [42.617042045455506]
  momentum-based optimisation algorithms have become particularly widespread. In this work, we analyse a continuous-time model for gradient descent with momentum. We also train a convolutional neural network in an image classification problem.
  arXiv  Detail & Related papers  (2022-09-08T10:46:05Z)
• A single $T$-gate makes distribution learning hard [56.045224655472865]
  This work provides an extensive characterization of the learnability of the output distributions of local quantum circuits. We show that for a wide variety of the most practically relevant learning algorithms -- including hybrid-quantum classical algorithms -- even the generative modelling problem associated with depth $d=omega(log(n))$ Clifford circuits is hard.
  arXiv  Detail & Related papers  (2022-07-07T08:04:15Z)
• Entanglement and coherence in Bernstein-Vazirani algorithm [58.720142291102135]
  Bernstein-Vazirani algorithm allows one to determine a bit string encoded into an oracle. We analyze in detail the quantum resources in the Bernstein-Vazirani algorithm. We show that in the absence of entanglement, the performance of the algorithm is directly related to the amount of quantum coherence in the initial state.
  arXiv  Detail & Related papers  (2022-05-26T20:32:36Z)
• Quantifying Grover speed-ups beyond asymptotic analysis [0.0]
  We consider an approach that combines classical emulation with detailed complexity bounds that include all constants. We apply our method to some simple quantum speedups of classical algorithms for solving the well-studied MAX-$k$-SAT optimization problem. This requires rigorous bounds (including all constants) on the expected- and worst-case complexities of two important quantum sub-routines.
  arXiv  Detail & Related papers  (2022-03-09T19:00:00Z)
• Quantum algorithms for grid-based variational time evolution [36.136619420474766]
  We propose a variational quantum algorithm for performing quantum dynamics in first quantization. Our simulations exhibit the previously observed numerical instabilities of variational time propagation approaches.
  arXiv  Detail & Related papers  (2022-03-04T19:00:45Z)
• 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)
• Synthesis of Quantum Circuits with an Island Genetic Algorithm [44.99833362998488]
  Given a unitary matrix that performs certain operation, obtaining the equivalent quantum circuit is a non-trivial task. Three problems are explored: the coin for the quantum walker, the Toffoli gate and the Fredkin gate. The algorithm proposed proved to be efficient in decomposition of quantum circuits, and as a generic approach, it is limited only by the available computational power.
  arXiv  Detail & Related papers  (2021-06-06T13:15:25Z)
• Simulating hydrodynamics on noisy intermediate-scale quantum devices with random circuits [0.0]
  We show that random circuits provide tailor-made building blocks for simulating quantum many-body systems. Specifically, we propose an algorithm consisting of a random circuit followed by a trotterized Hamiltonian time evolution. We numerically demonstrate the algorithm by simulating the buildup of correlation functions in one- and two-dimensional quantum spin systems.
  arXiv  Detail & Related papers  (2020-12-04T19:00:00Z)
• Efficient Algorithms for Causal Order Discovery in Quantum Networks [44.356294905844834]
  Given black-box access to the input and output systems, we develop the first efficient quantum causal order discovery algorithm. We model the causal order with quantum combs, and our algorithms output the order of inputs and outputs that the given process is compatible with. Our algorithms will provide efficient ways to detect and optimize available transmission paths in quantum communication networks.
  arXiv  Detail & Related papers  (2020-12-03T07:12:08Z)
• Generalized Quantum Assisted Simulator [0.0]
  We introduce the notion of the hybrid density matrix, which allows us to disentangle the different steps of our algorithm. Our algorithm has potential applications in solving the Navier-Stokes equation, plasma hydrodynamics, quantum Boltzmann training, quantum signal processing and linear systems.
  arXiv  Detail & Related papers  (2020-11-30T12:40:17Z)
• Low-depth Hamiltonian Simulation by Adaptive Product Formula [3.050399782773013]
  Various Hamiltonian simulation algorithms have been proposed to efficiently study the dynamics of quantum systems on a quantum computer. Here, we propose an adaptive approach to construct a low-depth time evolution circuit. Our work sheds light on practical Hamiltonian simulation with noisy-intermediate-scale-quantum devices.
  arXiv  Detail & Related papers  (2020-11-10T18:00:42Z)
• Jumptime unraveling of Markovian open quantum systems [68.8204255655161]
  We introduce jumptime unraveling as a distinct description of open quantum systems. quantum jump trajectories emerge, physically, from continuous quantum measurements. We demonstrate that quantum trajectories can also be ensemble-averaged at specific jump counts.
  arXiv  Detail & Related papers  (2020-01-24T09:35:32Z)

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.