Learning Lindblad Dynamics of a Superconducting Quantum Processor

• URL: http://arxiv.org/abs/2605.00626v1
• Date: Fri, 01 May 2026 13:00:12 GMT
• Title: Learning Lindblad Dynamics of a Superconducting Quantum Processor
• Abstract summary: LIMINAL is a framework for testing and selecting minimal adequate Lindblad models.<n>We apply LIMINAL to a five-qubit superconducting processor, identifying an idling model with three-local Hamiltonian terms and two-local dissipation.<n>We further apply it to recover driven single-qubit Hamiltonians, reconstruct a shaped-pulse Hamiltonian without assuming an analytic pulse model, and test hidden-qubit extensions in coupler-mediated dynamics.
• Score: 0.5517748509836581
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Accurate models of quantum processors are essential for understanding, calibrating, and improving their performance. In practice, model construction must balance physical detail against the experimental and computational effort required to reliably learn parameters. Compact descriptions therefore often rely on assumptions about which interactions, noise processes, or hidden degrees of freedom are relevant. Here we introduce LIMINAL, a data-driven framework for testing such assumptions and selecting minimal adequate Lindblad models. LIMINAL fits nested candidate models to time-resolved tomographic data and uses likelihood-ratio tests to decide when added physical mechanisms are warranted. We apply LIMINAL to a five-qubit superconducting processor, identifying an idling model with three-local Hamiltonian terms and two-local dissipation, while finding no support for three-local dissipation. We further apply it to recover driven single-qubit Hamiltonians, reconstruct a shaped-pulse Hamiltonian without assuming an analytic pulse model, and test hidden-qubit extensions in coupler-mediated dynamics, demonstrating the applicability of the framework for a wide range of tasks.

Related papers

• Quantum computational resources and validation protocols for a three-mode non-Gaussian trilinear Hamiltonian [39.146761527401424]
  We focus on a three-mode non-Gaussian trilinear Hamiltonian that has recently been realized in superconducting microwave platforms.<n>We investigate its ability to generate two key resources for quantum computation: multipartite entanglement and Wigner negativity.<n>We introduce a measurement-efficient protocol for the experimental validation of the Hamiltonian implementation without requiring full reconstruction of the Wigner function.
  arXiv  Detail & Related papers  (2026-09-09T11:17:53Z)
• Ansatz-Free Learning of Lindbladian Dynamics In Situ [2.380854690607918]
  We present the first sample-efficient protocol for learning sparse Lindbladians without assuming a priori structure or locality.<n>Our protocol is ancilla-free, uses only product-state preparations and Pauli-basis measurements, and achieves near-optimal time resolution.
  arXiv  Detail & Related papers  (2026-03-05T18:57:25Z)
• Effective Hamiltonian for an off-resonantly driven qubit-cavity system [0.0]
  We derive an effective Hamiltonian that retains slowly rotating terms, providing a general framework for accurately describing driven dynamics.<n>As a concrete application, we validate the theory in circuit QED, where it quantitatively reproduces experimentally measured ac Stark shifts.<n>Our results establish a broadly applicable tool to engineer driven interactions in quantum information processing platforms.
  arXiv  Detail & Related papers  (2025-09-03T14:53:07Z)
• Noise Hypernetworks: Amortizing Test-Time Compute in Diffusion Models [57.49136894315871]
  New paradigm of test-time scaling has yielded remarkable breakthroughs in reasoning models and generative vision models.<n>We propose one solution to the problem of integrating test-time scaling knowledge into a model during post-training.<n>We replace reward guided test-time noise optimization in diffusion models with a Noise Hypernetwork that modulates initial input noise.
  arXiv  Detail & Related papers  (2025-08-13T17:33:37Z)
• Hamiltonian Learning using Machine Learning Models Trained with Continuous Measurements [0.0]
  We build upon recent work on using Machine Learning models to estimate Hamiltonian parameters using continuous weak measurement of qubits as input.<n>We consider two settings for the training of our model: (1) supervised learning where the weak measurement training record can be labeled with known Hamiltonian parameters, and (2) unsupervised learning where no labels are available.
  arXiv  Detail & Related papers  (2024-04-08T13:50:50Z)
• End-to-End Reinforcement Learning of Koopman Models for Economic Nonlinear Model Predictive Control [45.84205238554709]
  We present a method for reinforcement learning of Koopman surrogate models for optimal performance as part of (e)NMPC. We show that the end-to-end trained models outperform those trained using system identification in (e)NMPC.
  arXiv  Detail & Related papers  (2023-08-03T10:21:53Z)
• A Three-regime Model of Network Pruning [47.92525418773768]
  We use temperature-like and load-like parameters to model the impact of neural network (NN) training hyper parameters on pruning performance. A key empirical result we identify is a sharp transition phenomenon: depending on the value of a load-like parameter in the pruned model, increasing the value of a temperature-like parameter in the pre-pruned model may either enhance or impair subsequent pruning performance. Our model reveals that the dichotomous effect of high temperature is associated with transitions between distinct types of global structures in the post-pruned model.
  arXiv  Detail & Related papers  (2023-05-28T08:09:25Z)
• 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)
• MoEfication: Conditional Computation of Transformer Models for Efficient Inference [66.56994436947441]
  Transformer-based pre-trained language models can achieve superior performance on most NLP tasks due to large parameter capacity, but also lead to huge computation cost. We explore to accelerate large-model inference by conditional computation based on the sparse activation phenomenon. We propose to transform a large model into its mixture-of-experts (MoE) version with equal model size, namely MoEfication.
  arXiv  Detail & Related papers  (2021-10-05T02:14:38Z)
• A data-driven peridynamic continuum model for upscaling molecular dynamics [3.1196544696082613]
  We propose a learning framework to extract, from molecular dynamics data, an optimal Linear Peridynamic Solid model. We provide sufficient well-posedness conditions for discretized LPS models with sign-changing influence functions. This framework guarantees that the resulting model is mathematically well-posed, physically consistent, and that it generalizes well to settings that are different from the ones used during training.
  arXiv  Detail & Related papers  (2021-08-04T07:07:47Z)
• Closed-form Continuous-Depth Models [99.40335716948101]
  Continuous-depth neural models rely on advanced numerical differential equation solvers. We present a new family of models, termed Closed-form Continuous-depth (CfC) networks, that are simple to describe and at least one order of magnitude faster.
  arXiv  Detail & Related papers  (2021-06-25T22:08:51Z)
• Quaternion Factorization Machines: A Lightweight Solution to Intricate Feature Interaction Modelling [76.89779231460193]
  factorization machine (FM) is capable of automatically learning high-order interactions among features to make predictions without the need for manual feature engineering. We propose the quaternion factorization machine (QFM) and quaternion neural factorization machine (QNFM) for sparse predictive analytics.
  arXiv  Detail & Related papers  (2021-04-05T00:02:36Z)

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.