Accelerating the analysis of optical quantum systems using the Koopman operator

• URL: http://arxiv.org/abs/2310.16578v3
• Date: Mon, 9 Sep 2024 15:00:23 GMT
• Title: Accelerating the analysis of optical quantum systems using the Koopman operator
• Authors: Anna Hunstig, Sebastian Peitz, Hendrik Rose, Torsten Meier,
• Abstract summary: prediction of photon echoes is a crucial technique for understanding optical quantum systems. This article investigates the use of data-driven surrogate models based on the Koopman operator to accelerate this process.
• Score: 1.2499537119440245
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The prediction of photon echoes is a crucial technique for understanding optical quantum systems. However, it typically requires numerous simulations with varying parameters and input pulses, rendering numerical studies computationally expensive. This article investigates the use of data-driven surrogate models based on the Koopman operator to accelerate this process while maintaining accuracy over many time steps. To this end, we employ a bilinear Koopman model using extended dynamic mode decomposition to simulate the optical Bloch equations for an ensemble of inhomogeneously broadened two-level systems. These systems are well suited to describe the excitation of excitonic resonances in semiconductor nanostructures, such as ensembles of semiconductor quantum dots. We conduct a detailed study to determine the number of system simulations required for the resulting data-driven Koopman model to achieve sufficient accuracy across a wide range of parameter settings. We analyze the L2 error and the relative error of the photon echo peak and investigate how the control positions relate to stabilization. After proper training, our methods can predict the dynamics of the quantum ensemble accurately and with numerical efficiency.

Related papers

• Simulations of quantum dynamics with fermionic phase-space representations using numerical matrix factorizations as stochastic gauges [0.0]
  We explore the use of dynamical diffusion gauges in quantum dynamics simulations. For the physical systems with fermionic particles considered here, the numerical evaluation of the new diffusion gauges allows us to double the practical simulation time. This development may have far reaching consequences for future quantum dynamical simulations of many-body systems.
  arXiv  Detail & Related papers  (2023-04-11T11:33:55Z)
• Capturing dynamical correlations using implicit neural representations [85.66456606776552]
  We develop an artificial intelligence framework which combines a neural network trained to mimic simulated data from a model Hamiltonian with automatic differentiation to recover unknown parameters from experimental data. In doing so, we illustrate the ability to build and train a differentiable model only once, which then can be applied in real-time to multi-dimensional scattering data.
  arXiv  Detail & Related papers  (2023-04-08T07:55:36Z)
• 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)
• Compensating for non-linear distortions in controlled quantum systems [0.0]
  Distortion of the input fields in an experimental platform alters the model accuracy and disturbs the predicted dynamics. We present an effective method for estimating these distortions which is suitable for non-linear transfer functions of arbitrary lengths and magnitudes. We have successfully tested our approach for a numerical example of a single Rydberg atom system.
  arXiv  Detail & Related papers  (2022-10-14T14:02:39Z)
• Trapped-Ion Quantum Simulation of Collective Neutrino Oscillations [55.41644538483948]
  We study strategies to simulate the coherent collective oscillations of a system of N neutrinos in the two-flavor approximation using quantum computation. We find that the gate complexity using second order Trotter- Suzuki formulae scales better with system size than with other decomposition methods such as Quantum Signal Processing.
  arXiv  Detail & Related papers  (2022-07-07T09:39:40Z)
• Efficient motional-mode characterization for high-fidelity trapped-ion quantum computing [5.930991818928443]
  We develop and explore physical models that accurately predict both magnitude and sign of the Lamb-Dicke parameters when the modes are probed. We discuss potential ramifications of our results to the development of a scalable trapped-ion quantum computer.
  arXiv  Detail & Related papers  (2022-06-09T01:29:28Z)
• 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)
• Robustly learning the Hamiltonian dynamics of a superconducting quantum processor [0.5564835829075486]
  We robustly estimate the free Hamiltonian parameters of bosonic excitations in a superconducting-qubit analog quantum simulator. Our results constitute an accurate implementation of a dynamical quantum simulation.
  arXiv  Detail & Related papers  (2021-08-18T18:01:01Z)
• 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)
• 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)
• Model-Independent Simulation Complexity of Complex Quantum Dynamics [0.13999481573773068]
  We present a model-independent measure of dynamical complexity based on simulating complex quantum dynamics using stroboscopic Markovian dynamics. Tools from classical signal processing enable us to infer the Hilbert space dimension of a complex quantum system evolving under a time-independent Hamiltonian.
  arXiv  Detail & Related papers  (2020-09-01T14:52:35Z)

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.