Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
173 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Deep Bayesian Experimental Design for Quantum Many-Body Systems (2306.14510v1)

Published 26 Jun 2023 in quant-ph and cs.LG

Abstract: Bayesian experimental design is a technique that allows to efficiently select measurements to characterize a physical system by maximizing the expected information gain. Recent developments in deep neural networks and normalizing flows allow for a more efficient approximation of the posterior and thus the extension of this technique to complex high-dimensional situations. In this paper, we show how this approach holds promise for adaptive measurement strategies to characterize present-day quantum technology platforms. In particular, we focus on arrays of coupled cavities and qubit arrays. Both represent model systems of high relevance for modern applications, like quantum simulations and computing, and both have been realized in platforms where measurement and control can be exploited to characterize and counteract unavoidable disorder. Thus, they represent ideal targets for applications of Bayesian experimental design.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (10)
  1. Settles B 2012 Synthesis Lectures on Artificial Intelligence and Machine Learning 6 1–114 ISSN 1939-4608 URL https://www.morganclaypool.com/doi/abs/10.2200/S00429ED1V01Y201207AIM018
  2. Kleinegesse S and Gutmann M U 2020 arXiv:2002.08129 [cs, stat] ArXiv: 2002.08129 URL http://arxiv.org/abs/2002.08129
  3. Tong S 2001 ACTIVE LEARNING: THEORY AND APPLICATIONS (Stanford University) URL http://www.robotics.stanford.edu/ stong/papers/tong_thesis.pdf
  4. Chaloner K and Verdinelli I 1995 Statistical Science 10 ISSN 0883-4237 URL https://projecteuclid.org/journals/statistical-science/volume-10/issue-3/Bayesian-Experimental-Design-A-Review/10.1214/ss/1177009939.full
  5. Lindley D V 1956 The Annals of Mathematical Statistics 27 986–1005 ISSN 0003-4851 URL http://projecteuclid.org/euclid.aoms/1177728069
  6. Hentschel A and Sanders B C 2011 Physical Review Letters 107 233601 ISSN 0031-9007, 1079-7114 URL https://link.aps.org/doi/10.1103/PhysRevLett.107.233601
  7. Leclercq F 2018 Physical Review D 98 063511 ISSN 2470-0010, 2470-0029 URL https://link.aps.org/doi/10.1103/PhysRevD.98.063511
  8. Kleinegesse S and Gutmann M U 2021 arXiv:2105.04379 [cs, stat] ArXiv: 2105.04379 URL http://arxiv.org/abs/2105.04379
  9. Barber D and Agakov F V 2003 The IM algorithm: a variational approach to Information Maximization NIPS 2003
  10. Sutton R S and Barto A G 2018 Reinforcement learning: an introduction second edition ed Adaptive computation and machine learning series (Cambridge, Massachusetts: The MIT Press) ISBN 978-0-262-03924-6 URL 10.5555/3312046
Citations (1)

Summary

We haven't generated a summary for this paper yet.