Data-driven learning of non-Markovian quantum dynamics
- URL: http://arxiv.org/abs/2601.07934v1
- Date: Mon, 12 Jan 2026 19:03:58 GMT
- Title: Data-driven learning of non-Markovian quantum dynamics
- Authors: Samuel Goodwin, Brian K. McFarland, Manuel H. Muñoz-Arias, Edward C. Tortorici, Melissa C. Revelle, Christopher G. Yale, Daniel S. Lobser, Susan M. Clark, Mohan Sarovar,
- Abstract summary: Fault-tolerant quantum computing requires precise knowledge and control of qubit dynamics during the application of a gate.<n>We develop a data-driven learning protocol for characterizing quantum gates that builds off previous work on learning the Nakajima-Mori-Zwanzig (NMZ) formulation of open system dynamics from time series data.<n>We demonstrate this learning technique on three different systems: a simulation of a qubit whose dynamics are purely Markovian, a simulation of a driven qubit coupled to noise produced by an Ornstein-Uhlenbeck process, and trapped-ion experimental data of a driven qubit whose noise environment is not
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Fault-tolerant quantum computing requires extremely precise knowledge and control of qubit dynamics during the application of a gate. We develop a data-driven learning protocol for characterizing quantum gates that builds off previous work on learning the Nakajima-Mori-Zwanzig (NMZ) formulation of open system dynamics from time series data, which allows detailed reconstruction of quantum evolution, including non-Markovian dynamics. We demonstrate this learning technique on three different systems: a simulation of a qubit whose dynamics are purely Markovian, a simulation of a driven qubit coupled to stochastic noise produced by an Ornstein-Uhlenbeck process, and trapped-ion experimental data of a driven qubit whose noise environment is not characterized ahead of time. Our technique is able to learn the generators of time evolution, or the NMZ operators, in all three cases and can learn the timescale in which the qubit dynamics can no longer be accurately described by a purely Markovian model. Our technique complements existing quantum gate characterization methods such as gate set tomography by explicitly capturing non-Markovianity in the gate generator, thus allowing for more thorough diagnosis of noise sources.
Related papers
- Quantum Noise Tomography with Physics-Informed Neural Networks [0.15229257192293197]
We introduce a novel framework for performing Lindblad tomography using Physics-Informed Neural Networks.<n>Our method produces a fully-differentiable digital twin of a noisy quantum system by learning its governing master equation.
arXiv Detail & Related papers (2025-09-15T13:30:50Z) - Inverse Physics-informed neural networks procedure for detecting noise in open quantum systems [0.0]
We extend the inverse physics-informed neural network (referred to as PINNverse) framework to open quantum systems governed by Lindblad master equations.<n>We demonstrate the effectiveness and robustness of the approach through numerical simulations of two-qubit open systems.<n>Our results show that PINNverse provides a scalable and noise-resilient framework for quantum system identification, with potential applications in quantum control and error mitigation.
arXiv Detail & Related papers (2025-07-16T18:03:48Z) - 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 [62.46800898243033]
Recent progress in quantum learning theory prompts a question: can linear properties of a large-qubit circuit be efficiently learned from measurement data generated by varying classical inputs?<n>We prove that the sample complexity scaling linearly in $d$ is required to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d.<n>We propose a kernel-based method leveraging classical shadows and truncated trigonometric expansions, enabling a controllable trade-off between prediction accuracy and computational overhead.
arXiv Detail & Related papers (2024-08-22T08:21:28Z) - Machine learning of quantum channels on NISQ devices [0.7067443325368975]
We propose a neural-network algorithm approximating generic discrete-time dynamics through the repeated action of an effective quantum channel.
We exploit it to investigate cross-talk effects on the ibmq_ehningen quantum processor.
arXiv Detail & Related papers (2024-05-21T08:44:42Z) - Lindblad-like quantum tomography for non-Markovian quantum dynamical maps [46.350147604946095]
We introduce Lindblad-like quantum tomography (L$ell$QT) as a quantum characterization technique of time-correlated noise in quantum information processors.<n>We discuss L$ell$QT for the dephasing dynamics of single qubits in detail, which allows for a neat understanding of the importance of including multiple snapshots of the quantum evolution in the likelihood function.
arXiv Detail & Related papers (2024-03-28T19:29:12Z) - Randomised benchmarking for characterizing and forecasting correlated
processes [8.788375252357945]
We develop a method to learn the details of temporally correlated noise.
In particular, we can learn the time-independent evolution operator of system plus bath.
We exemplify this by implementing our method on a superconducting quantum processor.
arXiv Detail & Related papers (2023-12-11T01:55:44Z) - Reinforcement learning pulses for transmon qubit entangling gates [0.0]
We utilize a continuous-control reinforcement learning algorithm to design entangling two-qubit gates for superconducting qubits.
We demonstrate the capability to generate novel pulse sequences that outperform the standard cross-resonance gates.
arXiv Detail & Related papers (2023-11-07T03:19:19Z) - 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) - Quantum-tailored machine-learning characterization of a superconducting
qubit [50.591267188664666]
We develop an approach to characterize the dynamics of a quantum device and learn device parameters.
This approach outperforms physics-agnostic recurrent neural networks trained on numerically generated and experimental data.
This demonstration shows how leveraging domain knowledge improves the accuracy and efficiency of this characterization task.
arXiv Detail & Related papers (2021-06-24T15:58:57Z) - 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)
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.