Practical Black Box Hamiltonian Learning

• URL: http://arxiv.org/abs/2206.15464v1
• Date: Thu, 30 Jun 2022 17:56:14 GMT
• Title: Practical Black Box Hamiltonian Learning
• Abstract summary: We study the problem of learning the parameters for the Hamiltonian of a quantum many-body system, given limited access to the system. We build upon recent approaches to Hamiltonian learning via derivative estimation.
• Score: 0.9281671380673306
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We study the problem of learning the parameters for the Hamiltonian of a quantum many-body system, given limited access to the system. In this work, we build upon recent approaches to Hamiltonian learning via derivative estimation. We propose a protocol that improves the scaling dependence of prior works, particularly with respect to parameters relating to the structure of the Hamiltonian (e.g., its locality $k$). Furthermore, by deriving exact bounds on the performance of our protocol, we are able to provide a precise numerical prescription for theoretically optimal settings of hyperparameters in our learning protocol, such as the maximum evolution time (when learning with unitary dynamics) or minimum temperature (when learning with Gibbs states). Thanks to these improvements, our protocol is practical for large problems: we demonstrate this with a numerical simulation of our protocol on an 80-qubit system.

Related papers

• Optimal Ansatz-free Hamiltonian Learning In Situ [3.3230675313521716]
  We show that an algorithm can learn an ansatz-free Hamiltonian $H$ in total evolution time of $(frac2log(frac))$.<n>Our results demonstrate the fundamental cost of experimentally friendly Hamiltonian learning and provide a practical route to rigorous in situ characterization of near-term quantum platforms.
  arXiv  Detail & Related papers  (2026-06-17T18:21:30Z)
• Large-scale Lindblad learning from time-series data [0.1749935196721634]
  We develop a protocol for learning a time-independent Lindblad model for operations that can be applied repeatedly on a quantum computer.<n>We demonstrate the approach by learning the Lindbladian for a full layer of gates on a 156-qubit superconducting quantum processor.
  arXiv  Detail & Related papers  (2025-12-09T01:50:14Z)
• Minimal Quantum Reservoirs with Hamiltonian Encoding [72.27323884094953]
  We investigate a minimal architecture for quantum reservoir computing based on Hamiltonian encoding.<n>This approach circumvents many of the experimental overheads typically associated with quantum machine learning.
  arXiv  Detail & Related papers  (2025-05-28T16:50:05Z)
• Enhanced Hamiltonian Learning Precision with Multi-Stage Neural Networks [10.285214278728528]
  We propose a multi-stage neural network framework that enhances Hamiltonian learning precision. Our approach utilizes time-series data from single-qubit Pauli measurements of random initial states. We demonstrate the framework on two-qubit systems, achieving orders-of-magnitude improvement in parameter accuracy.
  arXiv  Detail & Related papers  (2025-03-10T14:10:59Z)
• Learning interactions between Rydberg atoms [4.17037025217542]
  We introduce a scalable approach to Hamiltonian learning using graph neural networks (GNNs) We demonstrate that our GNN model has a remarkable capacity to extrapolate beyond its training domain.
  arXiv  Detail & Related papers  (2024-12-16T17:45:30Z)
• Learning Optimal Deterministic Policies with Stochastic Policy Gradients [62.81324245896716]
  Policy gradient (PG) methods are successful approaches to deal with continuous reinforcement learning (RL) problems. In common practice, convergence (hyper)policies are learned only to deploy their deterministic version. We show how to tune the exploration level used for learning to optimize the trade-off between the sample complexity and the performance of the deployed deterministic policy.
  arXiv  Detail & Related papers  (2024-05-03T16:45:15Z)
• Hyperparameters in Continual Learning: A Reality Check [53.30082523545212]
  Continual learning (CL) aims to train a model on a sequence of tasks while balancing the trade-off between plasticity (learning new tasks) and stability (retaining prior knowledge)
  arXiv  Detail & Related papers  (2024-03-14T03:13:01Z)
• Neural Time-Reversed Generalized Riccati Equation [60.92253836775246]
  Hamiltonian equations offer an interpretation of optimality through auxiliary variables known as costates. This paper introduces a novel neural-based approach to optimal control, with the aim of working forward-in-time.
  arXiv  Detail & Related papers  (2023-12-14T19:29:37Z)
• Sample-efficient Model-based Reinforcement Learning for Quantum Control [0.2999888908665658]
  We propose a model-based reinforcement learning (RL) approach for noisy time-dependent gate optimization. We show an order of magnitude advantage in the sample complexity of our method over standard model-free RL. Our algorithm is well suited for controlling partially characterised one and two qubit systems.
  arXiv  Detail & Related papers  (2023-04-19T15:05:19Z)
• Learning Energy Conserving Dynamics Efficiently with Hamiltonian Gaussian Processes [9.581740983484472]
  We present a process model for Hamiltonian systems with efficient decoupled parameterisation. We introduce an energy-conserving shooting method that allows robust inference from both short and long trajectories. We demonstrate the method's success in learning Hamiltonian systems in various data settings.
  arXiv  Detail & Related papers  (2023-03-03T13:51:04Z)
• Data post-processing for the one-way heterodyne protocol under composable finite-size security [62.997667081978825]
  We study the performance of a practical continuous-variable (CV) quantum key distribution protocol. We focus on the Gaussian-modulated coherent-state protocol with heterodyne detection in a high signal-to-noise ratio regime. This allows us to study the performance for practical implementations of the protocol and optimize the parameters connected to the steps above.
  arXiv  Detail & Related papers  (2022-05-20T12:37:09Z)
• Efficient and robust estimation of many-qubit Hamiltonians [0.0]
  Characterizing the interactions and dynamics of quantum mechanical systems is an essential task in development of quantum technologies. We propose an efficient protocol for characterizing the underlying Hamiltonian dynamics and the noise of a multi-qubit device. This protocol can be used to parallelize to learn the Hamiltonian, rendering it applicable for the characterization of both current and future quantum devices.
  arXiv  Detail & Related papers  (2022-05-19T13:52:32Z)
• Dynamical learning of a photonics quantum-state engineering process [48.7576911714538]
  Experimentally engineering high-dimensional quantum states is a crucial task for several quantum information protocols. We implement an automated adaptive optimization protocol to engineer photonic Orbital Angular Momentum (OAM) states. This approach represents a powerful tool for automated optimizations of noisy experimental tasks for quantum information protocols and technologies.
  arXiv  Detail & Related papers  (2022-01-14T19:24:31Z)
• Physics-informed neural networks via stochastic Hamiltonian dynamics learning [3.2857981869020327]
  We propose novel learning frameworks to tackle optimal control problems. Applying the Pontryagin maximum principle to the original optimal control problem shifts the learning focus to reduced Hamiltonian dynamics. We apply our learning frameworks called NeuralPMP to various control tasks and obtain competitive results.
  arXiv  Detail & Related papers  (2021-11-15T22:13:43Z)
• Optimal short-time measurements for Hamiltonian learning [0.0]
  We propose efficient measurement schemes based on short-time dynamics. We demonstrate that the reconstruction requires a system-size independent number of experimental shots. Grouping of commuting observables and use of Hamiltonian symmetries improve the accuracy of the reconstruction.
  arXiv  Detail & Related papers  (2021-08-19T17:48:48Z)
• Sufficiently Accurate Model Learning for Planning [119.80502738709937]
  This paper introduces the constrained Sufficiently Accurate model learning approach. It provides examples of such problems, and presents a theorem on how close some approximate solutions can be. The approximate solution quality will depend on the function parameterization, loss and constraint function smoothness, and the number of samples in model learning.
  arXiv  Detail & Related papers  (2021-02-11T16:27:31Z)
• How much progress have we made in neural network training? A New Evaluation Protocol for Benchmarking Optimizers [86.36020260204302]
  We propose a new benchmarking protocol to evaluate both end-to-end efficiency and data-addition training efficiency. A human study is conducted to show that our evaluation protocol matches human tuning behavior better than the random search. We then apply the proposed benchmarking framework to 7s and various tasks, including computer vision, natural language processing, reinforcement learning, and graph mining.
  arXiv  Detail & Related papers  (2020-10-19T21:46:39Z)

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.