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 73 records · Page 4

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↗

NoRA: A Tensor Network Ansatz for Volume-Law Entangled Equilibrium States of Highly Connected Hamiltonians

Motivated by the ground state structure of quantum models with all-to-all interactions such as mean-field quantum spin glass models and the Sachdev-Ye-Kitaev (SYK) model, we propose a tensor network architecture which can accomodate volume law entanglement and a large ground state degeneracy. We call this architecture the non-local renormalization ansatz (NoRA) because it can be viewed as a generalization of MERA, DMERA, and branching MERA networks with the constraints of spatial locality removed. We argue that the architecture is potentially expressive enough to capture the entanglement and complexity of the ground space of the SYK model, thus making it a suitable variational ansatz, but we leave a detailed study of SYK to future work. We further explore the architecture in the special case in which the tensors are random Clifford gates. Here the architecture can be viewed as the encoding map of a random stabilizer code. We introduce a family of codes inspired by the SYK model which can be chosen to have constant rate and linear distance at the cost of some high weight stabilizers. We also comment on potential similarities between this code family and the approximate code formed from the SYK ground space.

Physics↗

Optimization Algorithms as Quantum Performance Benchmarks

Combinatorial optimization is anticipated to be one of the primary use cases for quantum computation in the coming years. The Quantum Approximate Optimization Algorithm (QAOA) and Quantum Annealing (QA) have the potential to demonstrate significant run-time performance benefits over current state-of-the-art solutions. Using existing methods for characterizing classical optimization algorithms, we analyze solution quality obtained by solving Max-Cut problems using a quantum annealing device and gate-model quantum simulators and devices. This is used to guide the development of an advanced benchmarking framework for quantum computers designed to evaluate the trade-off between run-time execution performance and the solution quality for iterative hybrid quantum-classical applications. The framework generates performance profiles through effective visualizations that show performance progression as a function of time for various problem sizes and illustrates algorithm limitations uncovered by the benchmarking approach. The framework is an enhancement to the existing open-source QED-C Application-Oriented Benchmark suite and can connect to the open-source analysis libraries. The suite can be executed on various quantum simulators and quantum hardware systems.

benchmarking↗

Quantum utility in simulating the real-time dynamics of the Fermi–Hubbard model using superconducting quantum computers

The Fermi–Hubbard model is a fundamental model in condensed matter physics that describes strongly correlated electrons. On the other hand, quantum computers are emerging as powerful tools for exploring the complex dynamics of these quantum many-body systems. In this work, we demonstrate the quantum simulation of the one-dimensional Fermi–Hubbard model using IBM's superconducting quantum computers, employing over 100 qubits. We introduce a first-order Trotterization scheme and extend it to an optimized second-order Trotterization for the time evolution in the Fermi–Hubbard model, specifically tailored for the limited qubit connectivity of quantum architectures, such as IBM's platforms. Notably, both Trotterization approaches are scalable and maintain a constant circuit depth at each Trotter step, regardless of the qubit count, enabling us to precisely investigate the relaxation dynamics in the Fermi–Hubbard model by measuring the expectation value of the Néel observable (staggered magnetization) for time-evolved quantum states. Lastly, our successful measurement of expectation values in such large-scale quantum many-body systems, especially at longer time scales with larger entanglement, highlights the quantum utility of superconducting quantum platforms over conventional classical approximation methods.

97 MATHEMATICS AND COMPUTING↗

Exploring Network-Related Optimization Problems Using Quantum Heuristics

Network-related connectivity optimization problems are underlying a wide range of applications and are also of high computational complexity. We consider studying network optimization problems using two types of quantum heuristics.One is quantum annealing, and the other Quantum Alternating Operator Ansatz, an extension of the Quantum Approximate Optimization Algorithms for gate-model quantum computation, in which a cost-function based unitary and a non-commuting mixing unitary are applied alternately. We present problem mappings for problems of finding the spanning-tree or spanning-graph of a graph that optimizes certain costs, and a variant that further requires the spanning-tree be degree-bounded. With quantum annealing, all constraints are cast into penalty terms in the cost Hamiltonian, and the solution is encoded as the ground state of the Hamiltonian. We provide three mappings to the quadratic unconstrained binary optimization (QUBO) form, compare the resource requirements, and analyze the tradeoffs. For QAOA, we give special focus on the design of mixers based on the constraints presented in the problem, such that the system evolution remains in a subspace of the full Hilbert space where all constraints are satisfied. In the spanning-tree problem, one such hard constraint is that a mixer applied to a spanning-tree needs also be a spanning tree. This involves checking the connectivity of a subgraph, which is a global condition common for most network-related problems. We show how this feature can be efficiently represented in the mixer in a quantum coherent way, based on manipulation of a descendant-matrix and an adjacent matrix. We further develop a mixer for the spanning-graphs based on the spanning-tree mixer.

Wang, Zhihui↗

Study network-related optimization problems using quantum alternating optimization ansatz

Network-related connectivity optimization problems are underlying a wide range of applications and are also of high computational complexity. We consider studying network optimization problems using two types of quantum heuristics. One is quantum annealing, and the other Quantum Alternating Operator Ansatz, an extension of the Quantum Approximate Optimization Algorithms for gate-model quantum computation, in which a cost-function based unitary and a non-commuting mixing unitary are applied alternately. We present problem mappings for problems of finding the spanning-tree or spanning-graph of a graph that optimizes certain costs, and a variant that further requires the spanning-tree be degree-bounded. With quantum annealing, all constraints are cast into penalty terms in the cost Hamiltonian, and the solution is encoded as the ground state of the Hamiltonian. We provide three mappings to the quadratic unconstrained binary optimization (QUBO) form, compare the resource requirements, and analyze the tradeoffs. For QAOA, we give special focus on the design of mixers based on the constraints presented in the problem, such that the system evolution remains in a subspace of the full Hilbert space where all constraints are satisfied. In the spanning-tree problem, one such hard constraint is that a mixer applied to a spanning-tree needs also be a spanning tree. This involves checking the connectivity of a subgraph, which is a global condition common for most network-related problems. We show how this feature can be efficiently represented in the mixer in a quantum coherent way, based on manipulation of a descendant-matrix and an adjacent matrix. We further develop a mixer for the spanning-graphs based on the spanning-tree mixer.

Zhihui Wang↗

Endo-Fullerene and Doped Diamond Nanocrystallite Based Models of Qubits for Solid-State Quantum Computers

Models of encapsulated 1/2 nuclear spin H-1 and P-31 atoms in fullerene and diamond nanocrystallite, respectively, are proposed and examined with ab-initio local density functional method for possible applications as single quantum bits (qubits) in solid-state quantum computers. A H-1 atom encapsulated in a fully deuterated fullerene, C(sub 20)D(sub 20), forms the first model system and ab-initio calculation shows that H-1 atom is stable in atomic state at the center of the fullerene with a barrier of about 1 eV to escape. A P-31 atom positioned at the center of a diamond nanocrystallite is the second model system, and 3 1P atom is found to be stable at the substitutional site relative to interstitial sites by 15 eV, Vacancy formation energy is 6 eV in diamond so that substitutional P-31 atom will be stable against diffusion during the formation mechanisms within the nanocrystallite. The coupling between the nuclear spin and weakly bound (valance) donor electron coupling in both systems is found to be suitable for single qubit applications, where as the spatial distributions of (valance) donor electron wave functions are found to be preferentially spread along certain lattice directions facilitating two or more qubit applications. The feasibility of the fabrication pathways for both model solid-state qubit systems within practical quantum computers is discussed with in the context of our proposed solid-state qubits.

Park, Seongjun↗

State preparation of lattice field theories using quantum optimal control

Here, we explore the application of quantum optimal control (QOC) techniques to state preparation of lattice field theories on quantum computers. As a first example, we focus on the Schwinger model, quantum electrodynamics in 1+1 dimensions. We demonstrate that QOC can significantly speed up the ground state preparation compared to gate-based methods, even for models with long-range interactions. Using classical simulations, we explore the dependence on the interqubit coupling strength and the device connectivity, and we study the optimization in the presence of noise. While our simulations indicate potential speedups, the results strongly depend on the device specifications. In addition, we perform exploratory studies on the preparation of thermal states. Our results motivate further studies of QOC techniques in the context of quantum simulations for fundamental physics.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Quantum fluctuations in dense plasma simulations

Molecular dynamics (MD) simulations are a powerful tool for modeling warm and hot dense matter. Density functional theory (DFT) MD simulations are often preferred in dense plasmas in order to accurately model quantum electronic structure. However, DFT-MD simulations neglect interaction effects due to fluctuations in excited states. In this work, we present an MD approach that uses excited state method pseudoatoms to run dense plasma simulations with many different core-electron configurations at classical MD speeds. We also allow for transitions between different configurations in our simulations and find that these fluctuations are especially important for highly excited states. Our results suggest that finite configuration lifetimes that are comparable to the inverse ion plasma frequency need to be accounted for in order to accurately model ion distributions in dense plasma simulations. We also demonstrate that excited state fluctuations have a direct impact on ion plasma microfields, generate different plasma microfields for different excitation levels, and thereby induce absorption–emission line shape asymmetries even in steady-state plasmas.

36 MATERIALS SCIENCE↗

Search for Soft Unclustered Energy Patterns in Proton-Proton Collisions at 13 TeV

The first search for soft unclustered energy patterns (SUEPs) is performed using an integrated luminosity of 138 fb −1 of proton-proton collision data at $\sqrt{𝑠}$ = 13 TeV, collected in 2016–2018 by the CMS detector at the LHC. Such SUEPs are predicted by hidden valley models with a new, confining force with a large ’t Hooft coupling. In events with boosted topologies, selected by high-threshold hadronic triggers, the multiplicity and sphericity of clustered tracks are used to reject the background from standard model quantum chromodynamics. With no observed excess of events over the standard model expectation, limits are set on the cross section for production via gluon fusion of a scalar mediator with SUEP-like decays.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Full‐dimensional coupled‐channel statistical approach to atom‐triatom systems and applications to H/D + O 3 reaction

Abstract The statistical quantum model (SQM), which assumes that the reactivity is controlled by entrance/exit channel quantum capture probabilities, is well suited for chemical reactions with a long‐lived intermediate complex. In this work, a time‐independent coupled‐channel implementation of the SQM approach is developed for atom‐triatom systems in full dimensionality. As SQM treats the capture dynamics quantum mechanically, it is capable of handling quantum effects such as tunneling. A detailed study of the H/D + O 3 capture dynamics was performed by applying the newly developed SQM method on an accurate global potential energy surface. Agreement with previous ring polymer molecular dynamics (RPMD) results on the same potential energy surface is excellent except for very low temperatures. The SQM results are also in reasonably good agreement with available experimental rate coefficients. The strong H/D kinetic isotope effect underscores the dominant role of quantum tunneling under an entrance channel barrier at low temperatures.

Yang, Dongzheng↗

Ferrimagnetism of ultracold fermions in a multiband Hubbard system

Strongly correlated materials feature multiple electronic orbitals, which are crucial to accurately understanding their many-body properties. In such multiband models, quantum interference can lead to flat energy bands with large degeneracy that gives rise to itinerant magnetic phases. Here, we report on signatures of a ferrimagnetic state realized in a Lieb lattice with ultracold fermions, characterized by antialigned magnetic moments with antiferromagnetic correlations, and concomitant with a finite spin polarization. The signatures remain robust when increasing repulsive interactions from the weakly interacting to the Heisenberg regime and emerge when continuously tuning the lattice unit cell from a square to a Lieb geometry. Our flexible approach paves the way toward exploring exotic phases, such as quantum spin liquids in kagome lattices and heavy fermion behavior in Kondo models.

Lebrat, Martin [Harvard Univ., Cambridge, MA (Unit↗

Quantum Technologies for UAS (QTech)

Recent advances in small Unmanned Aerial System (sUAS) technologies lower the barriers for use by both private and commercial entities. However, these advances are also likely to lead to greater vehicle densities, a more heterogenous mix of vehicles and equipment and greater levels of vehicle autonomy, which can increase the chance for communications disruptions. For the safe and secure operation of these vehicles, it is essential to have a robust communications network. This work is focused on harnessing the power of quantum technologies to enable this robust communications network by: (1) utilizing quantum optimization algorithms to design robust network with routing redundancy that can respond adaptively to dynamically changing real-time environment and disruptions, (2) utilize quantum optimization algorithms resource allocation for detection, localization, and tracking of mobile communication disruption agents and (3) utilize quantum key distribution (QKD) to execute secure key sharing in anti-jamming protocols for secure radio frequency (RF) communication. Efforts to map these quantum optimization algorithms to commercially available quantum annealers and soon to be available general-purpose gate-model quantum hardware architectures will be reviewed, and plans for testing the solutions to these algorithms through indoor sUAS flight tests will be discussed. Lastly, efforts to miniaturize and practically deploy Quantum Key Distribution (QKD) hardware, which could ultimately be used to securely exchange encryption keys, in sUAS networks will be reviewed.

Quantum Computing↗