Search NASA⌕ Search

SEARCH · Search NASA

Results for “quantum modeling”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 127 records · Page 7

Quantum-chemical modeling of smectite clays

A self-consistent charge extended Hueckel program is used in modeling isomorphic substitution of Al(3+) by Na(+), K(+), Mg(2+), Fe(2+), and Fe(3+) in the octahedral layer of a dioctahedral smectite clay, such as montmorillonite. Upon comparison of the energies involved in the isomorphic substitution, it is found that the order for successful substitution is as follows: Al(3+), Fe(3+), Mg(2+), Fe(2+), Na(+), which is equivalent to Ca(2+), and then K(+). This ordering is found to be consistent with experimental observation. The calculations also make it possible to determine the possible penetration of metal ions into the clay's 2:1 crystalline layer. For the cases studied, this type of penetration can occur at elevated temperatures into regions where isomorphic substitution has occurred with metal ions that bear a formal charge of less than 3+. The computed behavior of the electronic structure in the presence of isomorphic substitution is found to be similar to behavior associated with semiconductors.

Aronowitz, S.↗

Quantum-chemical modeling of boron and noble gas dopants in silicon

The electron effects of the presence of boron and noble gas dopants in a model silicon lattice were investigated using a self-consistent charge extended Hueckel program. The extent of electronic interaction of the noble gas with the lattice is given by: Kr greater than Ar greater than Ne. Theoretically, boron diffusion in the presence of neon, argon or krypton was examined using a self-consistent charge extended Hueckel program. The net energy of interaction between boron and neon is strongly repulsive while argon-boron exhibits a region of relative stability; krypton exhibits behavior similar to argon though no region of stability was found for the range of separations used in the calculations. Finally, it is noted, from the relative energy of the topmost filled molecular orbital associated with boron (in an interstitial position), that activation of the boron does not require boron movement but can be accomplished by indirect transitions.

Aronowitz, S.↗

Quantum Mechanical Modeling of Ballistic MOSFETs

The objective of this project was to develop theory, approximations, and computer code to model quasi 1D structures such as nanotubes, DNA, and MOSFETs: (1) Nanotubes: Influence of defects on ballistic transport, electro-mechanical properties, and metal-nanotube coupling; (2) DNA: Model electron transfer (biochemistry) and transport experiments, and sequence dependence of conductance; and (3) MOSFETs: 2D doping profiles, polysilicon depletion, source to drain and gate tunneling, understand ballistic limit.

Svizhenko, Alexei↗

Autoregressive neural quantum states of Fermi Hubbard models

Neural quantum states (NQSs) have emerged as a powerful ansatz for variational quantum Monte Carlo studies of strongly correlated systems. Here, we apply recurrent neural networks (RNNs) and autoregressive transformer neural networks to the Fermi-Hubbard and the (non-Hermitian) Hatano-Nelson-Hubbard models in one and two dimensions. In both cases, we observe that the convergence of the RNN ansatz is challenged when increasing the interaction strength. We present a physically motivated and easy-to-implement strategy for improving the optimization, namely, by ramping of the model parameters. Furthermore, we investigate the advantages and disadvantages of the autoregressive sampling property of both network architectures. For the Hatano-Nelson-Hubbard model, we identify convergence issues that stem from the autoregressive sampling scheme in combination with the non-Hermitian nature of the model. Our findings provide insights into the challenges of the NQS approach and make the first step towards exploring strongly correlated electrons using this ansatz. Published by the American Physical Society 2025

Ibarra-García-Padilla, Eduardo (ORCID:000000019165↗

Intrinsically Quantum Effects of Axion Dark Matter Are Undetectable

Is the usual treatment of axion dark matter as a classical field reliable? We show that the answer is subtle: the axion field could well be in a quantum state that has no complete classical description, but realistic detectors cannot tell the difference. To see this, we solve a fully quantum model of axion detection using quantum optics techniques. We show that intrinsically quantum effects are washed out by mode averaging or small amounts of noise, and significantly suppressed by the weakness of the axion coupling. Our Letter exemplifies that there should always be a classical analog for axion dark matter effects, extends to other wave (ultralight) dark-matter candidates, and gives a general method to compute the effects of exotic dark-matter states.

Bao, Yunjia [University of Chicago, IL (United Sta↗

Quantum-accelerated Global Constraint Filtering

Motivated by recent advances in quantum algorithms and gate-model quantum computation, we introduce quantum-accelerated filtering algorithms for global constraints in constraint programming. We adapt recent work in quantum algorithms for graph problems and identify quantum subroutines that accelerate the main domain consistency algorithms for the all different constraint and the global cardinality constraint (gcc). The subroutines are based on quantum algorithms for finding maximum matchings and strongly connected components in graphs, and provide speedups over the best classical algorithms. We detail both complete and bounded-probability frameworks for quantum-accelerated global constraint filtering algorithms within backtracking search.

Quantum algorithms↗

Hamming distance and the onset of quantum criticality

Simulating models for quantum correlated matter unveils the inherent limitations of deterministic classical computations. In particular, in the case of quantum Monte Carlo methods, this is manifested by the emergence of negative weight configurations in the sampling, that is, the sign problem (SP). There have been several recent calculations which exploit the SP to locate underlying critical behavior. Here, utilizing a metric that quantifies phase-space ergodicity in such sampling, the Hamming distance, we suggest a significant advance on these ideas to extract the location of quantum critical points in various fermionic models, in spite of the presence of a severe SP. Combined with other methods, exact diagonalization in our case, it elucidates both the nature of the different phases as well as their location, as we demonstrate explicitly for the honeycomb and triangular Hubbard models, in both their U(1) and SU(2) forms. Furthermore, our approach exemplifies a possible path allowing the exploration of the phase diagram of a variety of fermionic quantum models hitherto considered to be impractical via quantum Monte Carlo simulations.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Sampling-based Sublinear Low-rank Matrix Arithmetic Framework for Dequantizing Quantum Machine Learning

We present an algorithmic framework for quantum-inspired classical algorithms on close-to-low-rank matrices, generalizing the series of results started by Tang’s breakthrough quantum-inspired algorithm for recommendation systems [STOC’19]. Motivated by quantum linear algebra algorithms and the quantum singular value transformation (SVT) framework of Gilyén et al. [STOC’19], we develop classical algorithms for SVT that run in time independent of input dimension, under suitable quantum-inspired sampling assumptions. Our results give compelling evidence that in the corresponding QRAM data structure input model, quantum SVT does not yield exponential quantum speedups. Since the quantum SVT framework generalizes essentially all known techniques for quantum linear algebra, our results, combined with sampling lemmas from previous work, suffice to generalize all prior results about dequantizing quantum machine learning algorithms. In particular, our classical SVT framework recovers and often improves the dequantization results on recommendation systems, principal component analysis, supervised clustering, support vector machines, low-rank regression, and semidefinite program solving. We also give additional dequantization results on low-rank Hamiltonian simulation and discriminant analysis. Our improvements come from identifying the key feature of the quantum-inspired input model that is at the core of all prior quantum-inspired results: ℓ 2 -norm sampling can approximate matrix products in time independent of their dimension. We reduce all our main results to this fact, making our exposition concise, self-contained, and intuitive.

Computer Science↗

Quantum-Inspired Power System Reliability Assessment

To enable an in-depth study of power system operation and planning, the assessment of standard reliability indices is inevitable. The Monte Carlo Simulation (MCS) approach is a broadly used method in replacing the analytical methods in reliability indices assessment. The accuracy of MCS, however, highly depends on the sampling size, and hence, a complicated system with large number of components requires a large sampling size and daunting computational effort. To address this shortcoming, we, in this paper attempt to take advantage of potentials of the quantum computing (QC) for power system reliability assessment by realizing the following contributions: 1) an innovative quantum model designed for reliability assessment; 2) a quantum circuit that achieves the quadratic speed up compared to the classical MCS method; 3) an efficient quantum amplitude estimation (QAE) algorithm to accurately evaluate the reliability indices. The accuracy and efficacy of the quantum reliability method are extensively verified and demonstrated on both radial and mesh distribution systems.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Computational projects with the Landau–Zener problem in the quantum mechanics classroom

The Landau–Zener problem, where a minimum energy separation is passed with constant rate in a two-state quantum-mechanical system, is an excellent model quantum system for a computational project. It requires a low-level computational effort, but has a number of complex numerical and algorithmic issues that can be resolved through dedicated work. It can be used to teach computational concepts, such as accuracy, discretization, and extrapolation, and it reinforces quantum concepts of time-evolution via a time-ordered product and of extrapolation to infinite time via time-dependent perturbation theory. Additionally, we discuss the concept of compression algorithms, which are employed in many advanced quantum computing strategies, and easy to illustrate with the Landau–Zener problem.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗