Data and codes for "Structure–property relationships for exciton polarons in organic–inorganic hybrid materials"
- Award ID(s):
- 2338663
- PAR ID:
- 10660874
- Publisher / Repository:
- Zenodo
- Date Published:
- Subject(s) / Keyword(s):
- exciton-phonon coupling 2D perovskites Impulsive vibrational spectroscopy
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
Abstract Quantum technologies are poised to move the foundational principles of quantum physics to the forefront of applications. This roadmap identifies some of the key challenges and provides insights on material innovations underlying a range of exciting quantum technology frontiers. Over the past decades, hardware platforms enabling different quantum technologies have reached varying levels of maturity. This has allowed for first proof-of-principle demonstrations of quantum supremacy, for example quantum computers surpassing their classical counterparts, quantum communication with reliable security guaranteed by laws of quantum mechanics, and quantum sensors uniting the advantages of high sensitivity, high spatial resolution, and small footprints. In all cases, however, advancing these technologies to the next level of applications in relevant environments requires further development and innovations in the underlying materials. From a wealth of hardware platforms, we select representative and promising material systems in currently investigated quantum technologies. These include both the inherent quantum bit systems and materials playing supportive or enabling roles, and cover trapped ions, neutral atom arrays, rare earth ion systems, donors in silicon, color centers and defects in wide-band gap materials, two-dimensional materials and superconducting materials for single-photon detectors. Advancing these materials frontiers will require innovations from a diverse community of scientific expertise, and hence this roadmap will be of interest to a broad spectrum of disciplines.more » « less
-
Beyersdorff, Olaf; Kanté, Mamadou Moustapha; Kupferman, Orna; Lokshtanov, Daniel (Ed.)Given a set P of n points and a set S of n segments in the plane, we consider the problem of computing for each segment of S its closest point in P. The previously best algorithm solves the problem in n^{4/3}2^{O(log^*n)} time [Bespamyatnikh, 2003] and a lower bound (under a somewhat restricted model) Ω(n^{4/3}) has also been proved. In this paper, we present an O(n^{4/3}) time algorithm and thus solve the problem optimally (under the restricted model). In addition, we also present data structures for solving the online version of the problem, i.e., given a query segment (or a line as a special case), find its closest point in P. Our new results improve the previous work.more » « less
An official website of the United States government
