Optimal control of quantum thermal machines using machine learning

• URL: http://arxiv.org/abs/2108.12441v1
• Date: Fri, 27 Aug 2021 18:00:49 GMT
• Title: Optimal control of quantum thermal machines using machine learning
• Authors: Ilia Khait, Juan Carrasquilla, Dvira Segal
• Abstract summary: We show that differentiable programming (DP) can be employed to optimize finite-time thermodynamical processes in a quantum thermal machine. We formulate the STA driving protocol as a constrained optimization task and apply DP to find optimal driving profiles for an appropriate figure of merit. Our method and results demonstrate that ML is beneficial both for solving hard-constrained quantum control problems and for devising and assessing their theoretical groundwork.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Identifying optimal thermodynamical processes has been the essence of thermodynamics since its inception. Here, we show that differentiable programming (DP), a machine learning (ML) tool, can be employed to optimize finite-time thermodynamical processes in a quantum thermal machine. We consider the paradigmatic quantum Otto engine with a time-dependent harmonic oscillator as its working fluid, and build upon shortcut-to-adiabaticity (STA) protocols. We formulate the STA driving protocol as a constrained optimization task and apply DP to find optimal driving profiles for an appropriate figure of merit. Our ML scheme discovers profiles for the compression and expansion strokes that are superior to previously-suggested protocols. Moreover, using our ML algorithm we show that a previously-employed, intuitive energetic cost of the STA driving suffers from a fundamental flaw, which we resolve with an alternative construction for the cost function. Our method and results demonstrate that ML is beneficial both for solving hard-constrained quantum control problems and for devising and assessing their theoretical groundwork.

Related papers

• Floquet engineering of quantum thermal machines: A gradient-based spectral method to optimize their performance [0.0]
  A procedure to find optimal regimes for quantum thermal engines (QTMs) is described and demonstrated. The QTMs are modelled as the periodically-driven non-equilibrium steady states of open quantum systems.
  arXiv  Detail & Related papers  (2024-05-15T06:42:11Z)
• PreQuant: A Task-agnostic Quantization Approach for Pre-trained Language Models [52.09865918265002]
  We propose a novel quantize before fine-tuning'' framework, PreQuant. PreQuant is compatible with various quantization strategies, with outlier-aware fine-tuning incorporated to correct the induced quantization error. We demonstrate the effectiveness of PreQuant on the GLUE benchmark using BERT, RoBERTa, and T5.
  arXiv  Detail & Related papers  (2023-05-30T08:41:33Z)
• Entropic Neural Optimal Transport via Diffusion Processes [105.34822201378763]
  We propose a novel neural algorithm for the fundamental problem of computing the entropic optimal transport (EOT) plan between continuous probability distributions. Our algorithm is based on the saddle point reformulation of the dynamic version of EOT which is known as the Schr"odinger Bridge problem. In contrast to the prior methods for large-scale EOT, our algorithm is end-to-end and consists of a single learning step.
  arXiv  Detail & Related papers  (2022-11-02T14:35:13Z)
• Optimizing thermalizations [0.0]
  We present a rigorous approach, based on the concept of continuous thermomajorisation, to algorithmically characterise the full set of energy occupations of a quantum system. We illustrate this by finding optimal protocols in the context of cooling, work extraction and optimal sequences. The same tools also allow one to quantitatively assess the role played by memory effects in the performance of thermodynamic protocols.
  arXiv  Detail & Related papers  (2022-02-25T11:05:39Z)
• Adiabatic Quantum Computing for Multi Object Tracking [170.8716555363907]
  Multi-Object Tracking (MOT) is most often approached in the tracking-by-detection paradigm, where object detections are associated through time. As these optimization problems are often NP-hard, they can only be solved exactly for small instances on current hardware. We show that our approach is competitive compared with state-of-the-art optimization-based approaches, even when using of-the-shelf integer programming solvers.
  arXiv  Detail & Related papers  (2022-02-17T18:59:20Z)
• 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)
• Best-practice aspects of quantum-computer calculations: A case study of hydrogen molecule [0.0]
  We have performed an extensive series of simulations of quantum-computer runs aimed at inspecting best-practice aspects of these calculations. Applying variational quantum eigensolver (VQE) to a qubit Hamiltonian obtained by the Bravyi-Kitaev transformation we have analyzed the impact of various computational technicalities.
  arXiv  Detail & Related papers  (2021-12-02T13:21:10Z)
• HEMP: High-order Entropy Minimization for neural network comPression [20.448617917261874]
  We formulate the entropy of a quantized artificial neural network as a differentiable function that can be plugged as a regularization term into the cost function minimized by descent. We show that HEMP is able to work in synergy with other approaches aiming at pruning or quantizing the model itself, delivering significant benefits in terms of storage size compressibility without harming the model's performance.
  arXiv  Detail & Related papers  (2021-07-12T10:17:53Z)
• 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)
• Logistic Q-Learning [87.00813469969167]
  We propose a new reinforcement learning algorithm derived from a regularized linear-programming formulation of optimal control in MDPs. The main feature of our algorithm is a convex loss function for policy evaluation that serves as a theoretically sound alternative to the widely used squared Bellman error.
  arXiv  Detail & Related papers  (2020-10-21T17:14:31Z)

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.