Bulletin of the American Physical Society
APS March Meeting 2022
Volume 67, Number 3
Monday–Friday, March 14–18, 2022; Chicago
Session B32: Material modeling and computational methods for Quantum science and advanced applicationsInvited Session Live Streamed
|
Hide Abstracts |
Sponsoring Units: GDS Chair: Maria Longobardi, University of Basel, Switzerland Room: McCormick Place W-192A |
Monday, March 14, 2022 11:30AM - 12:06PM |
B32.00001: Machine learning for combinatorial exploration of quantum materials Invited Speaker: Ichiro Takeuchi We have been applying machine learning (ML) to high-throughput experimentation in a variety of ways in order to discover new quantum materials [1]. The main focus of our exploration have been superconductors and topological insulators. The combinatorial strategy can be used to uncover minute details of composition - structure – property relationships which reflect the physical origin of superconductivity [2]. ML can substantially enrich combinatorial experimentation in guiding the experiments as well as streamlining the massive amount of data which result from combinatorial libraries. For instance, we have developed ML models for superconducting critical temperature which can be used to predict possible new superconductors. Our recent emphasis is to develop autonomous combinatorial experimentation techniques based on Bayesian active learning which can further speed up the screening process by removing the necessity to test every composition on libraries. We have shown that we can reduce the number of experiments by an order of magnitude in this manner. I will discuss our recent live demonstration where autonomous interaction between experiment and theory is used to rapidly map thin-film phase diagrams of multinary systems in closed-loop cycles. This work is carried out in collaboration with A. G. Kusne, V. Stanev, H. Liang, H. Yu, J. Park, and J. Paglione. |
Monday, March 14, 2022 12:06PM - 12:42PM |
B32.00002: Charting the electronic structure of inorganic materials. Invited Speaker: Nicola Marzari I'll first present our efforts towards verified, curated, and reproducible materials simulations, powered by AiiDA (https://www.aiida.net/) and disseminated on the Materials Cloud (https://www.materialscloud.org/), under a model of open-source software and open-access data with full provenance of every step in the simulation workflows. Brief mention will be made of the verification of pseudopotentials for density-functional theory calculations, the curation of protocols for targeted accuracies, and the deployment of robust direct-minimization approaches on accelerated architectures. Then, I will discuss our approach to capture the electronic structure fingerprints of inorganic materials in the form of atom-centered maximally localized Wannier functions spanning the valence and the lower part of the conduction manifolds, obtained through a novel approach to disentanglement and localization also aimed at full automation. Early applications to the exploration of the electronic-structure fingerprints will also be presented. |
Monday, March 14, 2022 12:42PM - 1:18PM |
B32.00003: New AI models for understanding and predicting quantum phenomena. Invited Speaker: Alan Aspuru-Guzik
|
Monday, March 14, 2022 1:18PM - 1:54PM |
B32.00004: Multi-armed quantum bandits: Exploration versus exploitation when learning properties of quantum states Invited Speaker: Marco P Tomamichel We initiate the study of tradeoffs between exploration and exploitation in online learning of properties of quantum states. Given sequential oracle access to an unknown quantum state, in each round, we are tasked to choose an observable from a set of actions aiming to maximize its expectation value on the state (the reward). Information gained about the unknown state from previous rounds can be used to gradually improve the choice of action, thus reducing the gap between the reward and the maximal reward attainable with the given action set (the regret). We provide various information-theoretic lower bounds on the cumulative regret that an optimal learner must incur, and show that it scales at least as the square root of the number of rounds played. We also investigate the dependence of the cumulative regret on the number of available actions and the dimension of the underlying space. Moreover, we exhibit strategies that are optimal for bandits with a finite number of arms and general mixed states. If we have a promise that the state is pure and the action set is all rank-1 projectors the regret can be interpreted as the infidelity with the target state and we provide some support for the conjecture that measurement strategies with less regret exist for this case. |
Monday, March 14, 2022 1:54PM - 2:30PM |
B32.00005: 2-D Materials Modelling: from Transistors to Majorana Fermions Invited Speaker: Mathieu Luisier Since the first experimental demonstration of a monolayer MoS2 transistor in 2011, transition metal dichalcogenides (TMDs) have received a wide attention from the scientific community as potential replacement for Silicon FinFETs at the end of the semiconductor roadmap. As graphene, TMDs exhibit excellent electrostatic properties due to their 2-D nature, but contrary to it, they are characterized by large band gaps, while keeping acceptable mobilities. However, so far, no transistor based on a TMD channel could outperform the Si technology. While this limitation can be partly attributed to technical issues, the TMD bandstructure also explains this behavior: electrons/holes are not fast enough to allow for large ON-state currents. |
Follow Us |
Engage
Become an APS Member |
My APS
Renew Membership |
Information for |
About APSThe American Physical Society (APS) is a non-profit membership organization working to advance the knowledge of physics. |
© 2025 American Physical Society
| All rights reserved | Terms of Use
| Contact Us
Headquarters
1 Physics Ellipse, College Park, MD 20740-3844
(301) 209-3200
Editorial Office
100 Motor Pkwy, Suite 110, Hauppauge, NY 11788
(631) 591-4000
Office of Public Affairs
529 14th St NW, Suite 1050, Washington, D.C. 20045-2001
(202) 662-8700