Efficient formulation of multitime generalized quantum master equations:
Taming the cost of simulating 2D spectra
- URL: http://arxiv.org/abs/2310.20022v1
- Date: Mon, 30 Oct 2023 21:16:04 GMT
- Title: Efficient formulation of multitime generalized quantum master equations:
Taming the cost of simulating 2D spectra
- Authors: Thomas Sayer and Andr\'es Montoya-Castillo
- Abstract summary: We present a formulation that greatly simplifies and reduces the computational cost of previous work that extended the GQME framework.
Specifically, we remove the time derivatives of quantum correlation functions from the modified Mori-Nakajima-Zwanzig framework.
We are also able to decompose the spectra into 1-, 2-, and 3-time correlations, showing how and when the system enters a Markovian regime.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Modern 4-wave mixing spectroscopies are expensive to obtain experimentally
and computationally. In certain cases, the unfavorable scaling of quantum
dynamics problems can be improved using a generalized quantum master equation
(GQME) approach. However, the inclusion of multiple (light-matter) interactions
complicates the equation of motion and leads to seemingly unavoidable cubic
scaling in time. In this paper, we present a formulation that greatly
simplifies and reduces the computational cost of previous work that extended
the GQME framework to treat arbitrary numbers of quantum measurements.
Specifically, we remove the time derivatives of quantum correlation functions
from the modified Mori-Nakajima-Zwanzig framework by switching to a
discrete-convolution implementation inspired by the transfer-tensor approach.
We then demonstrate the method's capabilities by simulating 2D electronic
spectra for the excitation-energy-transfer dimer model. In our method, the
resolution of the data can be arbitrarily coarsened, especially along the $t_2$
axis, which mirrors how the data are obtained experimentally. Even in a modest
case, this demands $\mathcal{O}(10^3)$ fewer data points. We are further able
to decompose the spectra into 1-, 2-, and 3-time correlations, showing how and
when the system enters a Markovian regime where further measurements are
unnecessary to predict future spectra and the scaling becomes quadratic. This
offers the ability to generate long-time spectra using only short-time data,
enabling access to timescales previously beyond the reach of standard
methodologies.
Related papers
- Fourier Neural Operators for Learning Dynamics in Quantum Spin Systems [77.88054335119074]
We use FNOs to model the evolution of random quantum spin systems.
We apply FNOs to a compact set of Hamiltonian observables instead of the entire $2n$ quantum wavefunction.
arXiv Detail & Related papers (2024-09-05T07:18:09Z) - Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties?
We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d.
We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
arXiv Detail & Related papers (2024-08-22T08:21:28Z) - Generalized quantum master equations can improve the accuracy of semiclassical predictions of multitime correlation functions [0.0]
Multitime quantum correlation functions are central objects in physical science.
Experiments such as 2D spectroscopy and quantum control can now measure such quantities.
We show for the first time that one can exploit a multitime semiclassical GQME to dramatically improve the accuracy of coarse mean-field Ehrenfest dynamics.
arXiv Detail & Related papers (2024-05-14T22:34:59Z) - Dense outputs from quantum simulations [5.295277584890625]
The quantum dense output problem is the process of evaluating time-accumulated observables from time-dependent quantum dynamics.
This problem arises frequently in applications such as quantum control and spectroscopic computation.
We present a range of algorithms designed to operate on both early and fully fault-tolerant quantum platforms.
arXiv Detail & Related papers (2023-07-26T18:16:51Z) - Robust Extraction of Thermal Observables from State Sampling and
Real-Time Dynamics on Quantum Computers [49.1574468325115]
We introduce a technique that imposes constraints on the density of states, most notably its non-negativity, and show that this way, we can reliably extract Boltzmann weights from noisy time series.
Our work enables the implementation of the time-series algorithm on present-day quantum computers to study finite temperature properties of many-body quantum systems.
arXiv Detail & Related papers (2023-05-30T18:00:05Z) - Algorithmic Shadow Spectroscopy [0.0]
We present a simulator-agnostic quantum algorithm for estimating energy gaps using very few circuit repetitions (shots) and no extra resources (ancilla qubits)
We demonstrate that our method is intuitively easy to use in practice, robust against gate noise, to a new type of algorithmic error mitigation technique, and uses orders of magnitude fewer number of shots than typical near-term quantum algorithms -- as low as 10 shots per timestep is sufficient.
arXiv Detail & Related papers (2022-12-21T14:23:48Z) - Commutation simulator for open quantum dynamics [0.0]
We propose an innovative method to investigate directly the properties of a time-dependent density operator $hatrho(t)$.
We can directly compute the expectation value of the commutation relation and thus of the rate of change of $hatrho(t)$.
A simple but important example is demonstrated in the single-qubit case and we discuss extension of the method for practical quantum simulation with many qubits.
arXiv Detail & Related papers (2022-06-01T16:03:43Z) - Continuous-time dynamics and error scaling of noisy highly-entangling
quantum circuits [58.720142291102135]
We simulate a noisy quantum Fourier transform processor with up to 21 qubits.
We take into account microscopic dissipative processes rather than relying on digital error models.
We show that depending on the dissipative mechanisms at play, the choice of input state has a strong impact on the performance of the quantum algorithm.
arXiv Detail & Related papers (2021-02-08T14:55:44Z) - 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) - Floquet theory for temporal correlations and spectra in time-periodic
open quantum systems: Application to squeezed parametric oscillation beyond
the rotating-wave approximation [0.0]
We propose a method to compute two-time correlations and corresponding spectral densities of time-periodic open quantum systems.
We show how the quantum Langevin equations for the fluctuations can be efficiently integrated by partitioning the time domain into one-period duration intervals.
arXiv Detail & Related papers (2020-05-17T13:25:04Z) - Quantum Statistical Complexity Measure as a Signalling of Correlation
Transitions [55.41644538483948]
We introduce a quantum version for the statistical complexity measure, in the context of quantum information theory, and use it as a signalling function of quantum order-disorder transitions.
We apply our measure to two exactly solvable Hamiltonian models, namely: the $1D$-Quantum Ising Model and the Heisenberg XXZ spin-$1/2$ chain.
We also compute this measure for one-qubit and two-qubit reduced states for the considered models, and analyse its behaviour across its quantum phase transitions for finite system sizes as well as in the thermodynamic limit by using Bethe ansatz.
arXiv Detail & Related papers (2020-02-05T00:45:21Z)
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.