scispace - formally typeset
Search or ask a question
Institution

National Institute of Standards and Technology

GovernmentGaithersburg, Maryland, United States
About: National Institute of Standards and Technology is a government organization based out in Gaithersburg, Maryland, United States. It is known for research contribution in the topics: Laser & Scattering. The organization has 26667 authors who have published 60661 publications receiving 2215547 citations. The organization is also known as: National Bureau of Standards & NIST.


Papers
More filters
Journal ArticleDOI
TL;DR: In this paper, the long range electromigration of methylammonium ions (MA+) in MAPbI3 perovskite was observed directly using the photo-thermal induced resonance technique.
Abstract: In this study, long range electromigration of methylammonium ions (MA+) in methyl ammonium lead tri-iodide (MAPbI3) film is observed directly using the photo­thermal induced resonance technique. The electromigration of MA+ leads to the formation of a lateral p-i-n structure, which is the origin of the switchable photovoltaic effect in MAPbI3 perovskite devices.

549 citations

Journal ArticleDOI
TL;DR: It is found that metal-organic framework compounds M(2)(dhtp) (open metal M = Mg, Mn, Co, Ni, Zn; dhtp = 2,5-dihydroxyterephthalate) possess exceptionally large densities of open metal sites, and the primary CH(4) adsorption occurs directly on the openMetal sites.
Abstract: We found that metal−organic framework (MOF) compounds M2(dhtp) (open metal M = Mg, Mn, Co, Ni, Zn; dhtp = 2,5-dihydroxyterephthalate) possess exceptionally large densities of open metal sites. By adsorbing one CH4 molecule per open metal, these sites alone can generate very large methane storage capacities, 160−174 cm3(STP)/cm3, approaching the DOE target of 180 cm3(STP)/cm3 for material-based methane storage at room temperature. Our adsorption isotherm measurements at 298 K and 35 bar for the five M2(dhtp) compounds yield excess methane adsorption capacities ranging from 149 to 190 cm3(STP)/cm3 (derived using their crystal densities), indeed roughly equal to the predicted, maximal adsorption capacities of the open metals (within ±10%) in these MOFs. Among the five isostructural MOFs studied, Ni2(dhtp) exhibits the highest methane storage capacity, ∼200 cm3(STP)/cm3 in terms of absolute adsorption, potentially surpassing the DOE target by ∼10%. Our neutron diffraction experiments clearly reveal that the p...

549 citations

Journal ArticleDOI
29 Jul 2005-Science
TL;DR: Experimental realization of the general technique for precision spectroscopy of atoms that lack suitable transitions for efficient laser cooling, internal state preparation, and detection indicates the feasibility of applying this technique to make accurate optical clocks based on single ions.
Abstract: We present a general technique for precision spectroscopy of atoms that lack suitable transitions for efficient laser cooling, internal state preparation, and detection. In our implementation with trapped atomic ions, an auxiliary “logic” ion provides sympathetic laser cooling, state initialization, and detection for a simultaneously trapped “spectroscopy” ion. Detection is achieved by applying a mapping operation to each ion, which results in a coherent transfer of the spectroscopy ion9s internal state onto the logic ion, where it is then measured with high efficiency. Experimental realization, by using 9Be+ as the logic ion and 27Al+ as the spectroscopy ion, indicates the feasibility of applying this technique to make accurate optical clocks based on single ions.

548 citations

01 Apr 2010
TL;DR: This paper discusses some aspects of selecting and testing random and pseudorandom number generators and their relation to cryptanalysis, and some recommended statistical tests are provided.
Abstract: This paper discusses some aspects of selecting and testing random and pseudorandom number generators. The outputs of such generators may be used in many cryptographic applications, such as the generation of key material. Generators suitable for use in cryptographic applications may need to meet stronger requirements than for other applications. In particular, their outputs must be unpredictable in the absence of knowledge of the inputs. Some criteria for characterizing and selecting appropriate generators are discussed in this document. The subject of statistical testing and its relation to cryptanalysis is also discussed, and some recommended statistical tests are provided. These tests may be useful as a first step in determining whether or not a generator is suitable for a particular cryptographic application. However, no set of statistical tests can absolutely certify a generator as appropriate for usage in a particular application, i.e., statistical testing cannot serve as a substitute for cryptanalysis. The design and cryptanalysis of generators is outside the scope of this paper.

548 citations

Journal ArticleDOI
TL;DR: Efficient quantum-logic circuits that perform two tasks are discussed: 1) implementing generic quantum computations, and 2) initializing quantum registers that are asymptotically optimal for respective tasks.
Abstract: The pressure of fundamental limits on classical computation and the promise of exponential speedups from quantum effects have recently brought quantum circuits (Proc. R. Soc. Lond. A, Math. Phys. Sci., vol. 425, p. 73, 1989) to the attention of the electronic design automation community (Proc. 40th ACM/IEEE Design Automation Conf., 2003), (Phys. Rev. A, At. Mol. Opt. Phy., vol. 68, p. 012318, 2003), (Proc. 41st Design Automation Conf., 2004), (Proc. 39th Design Automation Conf., 2002), (Proc. Design, Automation, and Test Eur., 2004), (Phys. Rev. A, At. Mol. Opt. Phy., vol. 69, p. 062321, 2004), (IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst., vol. 22, p. 710, 2003). Efficient quantum-logic circuits that perform two tasks are discussed: 1) implementing generic quantum computations, and 2) initializing quantum registers. In contrast to conventional computing, the latter task is nontrivial because the state space of an n-qubit register is not finite and contains exponential superpositions of classical bitstrings. The proposed circuits are asymptotically optimal for respective tasks and improve earlier published results by at least a factor of 2. The circuits for generic quantum computation constructed by the algorithms are the most efficient known today in terms of the number of most expensive gates [quantum controlled-NOTs (CNOTs)]. They are based on an analog of the Shannon decomposition of Boolean functions and a new circuit block, called quantum multiplexor (QMUX), which generalizes several known constructions. A theoretical lower bound implies that the circuits cannot be improved by more than a factor of 2. It is additionally shown how to accommodate the severe architectural limitation of using only nearest neighbor gates, which is representative of current implementation technologies. This increases the number of gates by almost an order of magnitude, but preserves the asymptotic optimality of gate counts

545 citations


Authors

Showing all 26760 results

NameH-indexPapersCitations
Zhong Lin Wang2452529259003
John A. Rogers1771341127390
J. N. Butler1722525175561
Yury Gogotsi171956144520
Zhenan Bao169865106571
Gang Chen1673372149819
Michel C. Nussenzweig16551687665
Donald G. Truhlar1651518157965
Tobin J. Marks1591621111604
Jongmin Lee1502257134772
Galen D. Stucky144958101796
Thomas P. Russell141101280055
William D. Travis13760593286
Peter Zoller13473476093
Anthony G. Evans13057665803
Network Information
Related Institutions (5)
École Polytechnique Fédérale de Lausanne
98.2K papers, 4.3M citations

89% related

Massachusetts Institute of Technology
268K papers, 18.2M citations

88% related

Georgia Institute of Technology
119K papers, 4.6M citations

87% related

University of California, Santa Barbara
80.8K papers, 4.6M citations

87% related

Pennsylvania State University
196.8K papers, 8.3M citations

87% related

Performance
Metrics
No. of papers from the Institution in previous years
YearPapers
202327
2022186
20212,001
20202,438
20192,236
20182,414