Search NASA⌕ Search

SEARCH · Search NASA

Results for “quantum computing for simulation”

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 1,603 records · Page 89

Quantum optimization of maximum independent set using Rydberg atom arrays

Realizing quantum speedup for practically relevant, computationally hard problems is a central challenge in quantum information science. Using Rydberg atom arrays with up to 289 qubits in two spatial dimensions, we experimentally investigate quantum algorithms for solving the maximum independent set problem. We use a hardware-efficient encoding associated with Rydberg blockade, realize closed-loop optimization to test several variational algorithms, and subsequently apply them to systematically explore a class of graphs with programmable connectivity. We find that the problem hardness is controlled by the solution degeneracy and number of local minima, and we experimentally benchmark the quantum algorithm’s performance against classical simulated annealing. On the hardest graphs, we observe a superlinear quantum speedup in finding exact solutions in the deep circuit regime and analyze its origins.

Science & Technology - Other Topics↗

A physics-informed data-driven low order model for the wind velocity deficit at the wake of isolated buildings

Detailed simulations of the Atmospheric boundary layer (ABL) provides information on wind velocity, direction and turbulence for optimizing the design of wind turbines and wind farms and their operations. Distributed wind turbines have been considered for use in urban or suburban areas for covering energy needs using a sustainable energy solution. Simulations of high Reynolds number turbulent ABL flows past obstacles can be used for the prediction of the velocity deficit and turbulence characteristics in the leeward side of building-like obstacles, allowing for the estimation of power losses and fatigue loads in wind turbines. However, fully three-dimensional simulations of high Reynolds number ABL flows using Large Eddy Simulation (LES) or Reynolds Average Navier-Stokes Simulations (RANS) continue to require large computational/ execution times. As a result, these 3D simulations may not be ideal tools for the rapid assessment of wind energy potential. In the present study, 3D numerical results from wall resolved RANS simulations were used for the development of a low order model that allows the rapid assessment of wind velocity and turbulence in the leeward side of an isolated building.

17 WIND ENERGY↗

Inferring Quantum Network Topology Using Local Measurements

Statistical correlations that can be generated across the nodes in a quantum network depend crucially on its topology. However, this topological information might not be known a priori, or it may need to be verified. In this paper, we propose an efficient protocol for distinguishing and inferring the topology of a quantum network. We leverage entropic quantities-namely, the von Neumann entropy and the measured mutual information-as well as measurement covariance to uniquely characterize the topology. We show that the entropic quantities are sufficient to distinguish two networks that prepare GHZ states. Moreover, if qubit measurements are available, both entropic quantities and covariance can be used to infer the network topology without state-preparation assumptions. We show that the protocol can be entirely robust to noise and can be implemented via quantum variational optimization. Numerical experiments on both classical simulators and quantum hardware show that covariance is generally more reliable for accurately and efficiently inferring the topology, whereas entropy-based methods are often better at identifying the absence of entanglement in the low-shot regime.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Efficient Ab Initio Auxiliary-Field Quantum Monte Carlo Calculations in Gaussian Bases via Low-Rank Tensor Decomposition

We describe an algorithm to reduce the cost of auxiliary-field quantum Monte Carlo (AFQMC) calculations for the electronic structure problem. The technique uses a nested low-rank factorization of the electron repulsion integral (ERI). While the cost of conventional AFQMC calculations in Gaussian bases scales as O(N 4 ), where N is the size of the basis, we show that ground-state energies can be computed through tensor decomposition with reduced memory requirements and subquartic scaling. Here, the algorithm is applied to hydrogen chains and square grids, water clusters, and hexagonal BN. In all cases, we observe significant memory savings and, for larger systems, reduced, subquartic simulation time.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Spectral quadrature for the first principles study of crystal defects: Application to magnesium

In this work, we present an accurate and efficient finite-difference formulation and parallel implementation of Kohn-Sham Density (Operator) Functional Theory (DFT) for non periodic systems embedded in a bulk environment. Specifically, employing non-local pseudopotentials, local reformulation of electrostatics, and truncation of the spatial Kohn-Sham Hamiltonian, and the Linear Scaling Spectral Quadrature method to solve for the pointwise electronic fields in real-space and the non-local component of the atomic force, we develop a parallel finite difference framework suitable for distributed memory computing architectures to simulate non-periodic systems embedded in a bulk environment. Choosing examples from magnesium-aluminum alloys, we first demonstrate the convergence of energies and forces with respect to spectral quadrature polynomial order, and the width of the spatially truncated Hamiltonian. Next, we demonstrate the parallel scaling of our framework, and show that the computation time and memory scale linearly with respect to the number of atoms. Next, we use the developed framework to simulate isolated point defects and their interactions in magnesium-aluminum alloys. Our findings conclude that the binding energies of divacancies, Al solute-vacancy and two Al solute atoms are anisotropic and are dependent on cell size. Furthermore, the binding is favorable in all three cases.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

High-dimensional discrete Fourier transform gates with a quantum frequency processor

The discrete Fourier transform (DFT) is of fundamental interest in photonic quantum information, yet the ability to scale it to high dimensions depends heavily on the physical encoding, with practical recipes lacking in emerging platforms such as frequency bins. In this article, we show that d -point frequency-bin DFTs can be realized with a fixed three-component quantum frequency processor (QFP), simply by adding to the electro-optic modulation signals one radio-frequency harmonic per each incremental increase in d . We verify gate fidelity F W > 0.9997 and success probability P W > 0.965 up to d = 10 in numerical simulations, and experimentally implement the solution for d = 3, utilizing measurements with parallel DFTs to quantify entanglement and perform tomography of multiple two-photon frequency-bin states. Our results furnish new opportunities for high-dimensional frequency-bin protocols in quantum communications and networking.

97 MATHEMATICS AND COMPUTING↗

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↗

Persistent Homology Metrics Reveal Quantum Fluctuations and Reactive Atoms in Path Integral Dynamics

Nuclear quantum effects (NQEs) are known to impact a number of features associated with chemical reactivity and physicochemical properties, particularly for light atoms and at low temperatures. In the imaginary time path integral formalism, each atom is mapped onto a “ring polymer” whose spread is related to the quantum mechanical uncertainty in the particle’s position, i.e., its thermal wavelength. A number of metrics have previously been used to investigate and characterize this spread and explain effects arising from quantum delocalization, zero-point energy, and tunneling. Many of these shape metrics consider just the instantaneous structure of the ring polymers. However, given the significant interest in methods such as centroid molecular dynamics and ring polymer molecular dynamics that link the molecular dynamics of these ring polymers to real time properties, there exists significant opportunity to exploit metrics that also allow for the study of the fluctuations of the atom delocalization in time. Here we consider the ring polymer delocalization from the perspective of computational topology, specifically persistent homology, which describes the 3-dimensional arrangement of point cloud data, (i.e. atomic positions). We employ the Betti sequence probability distribution to define the ensemble of shapes adopted by the ring polymer. The Wasserstein distances of Betti sequences adjacent in time are used to characterize fluctuations in shape, where the Fourier transform and associated principal components provides added information differentiating atoms with different NQEs based on their dynamic properties. We demonstrate this methodology on two representative systems, a glassy system consisting of two atom types with dramatically different de Broglie thermal wavelengths, and ab initio molecular dynamics simulation of an aqueous 4 M HCl solution where the H-atoms are differentiated based on their participation in proton transfer reactions.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Modeling betatron radiation using particle-in-cell codes for plasma wakefield accelerator diagnostics

The analysis of plasma wakefield acceleration experimental measurements, particularly in the characterization of photons emitted through the betatron radiation mechanism, requires the development of accurate numerical models. These computational models are crucial for supporting modern instrumentation designed to measure the single-shot, double-differential angular-energy radiation spectra resulting from interactions between beams and plasmas. Motivated by the needs of such applications, this paper presents detailed numerical models of betatron radiation generated in beam-plasma acceleration experiments. These models are based on the integration of the Liénard-Wiechert (LW) potentials, applied to computed particle trajectories. The particle trajectories are generated using three distinct methods: first, by tracking particles through idealized fields in the blowout regime of PWFA; second, by obtaining trajectories using the fast quasistatic particle-in-cell (PIC) code quickpic; and third, obtaining trajectories from the fully self-consistent PIC code osiris. To ensure the accuracy and reliability of these models, the paper includes various benchmark tests using analytical expressions, as well as employing the PIC code epoch, which takes an alternative approach by using a Monte Carlo quantum electrodynamics (QED)-based radiation model. Additionally, the paper presents simulations of the expected experimental betatron radiation spectra, taking into account parameters relevant to PWFA and plasma photocathode experiments at the SLAC FACET-II facility.

Yadav, M. [University of California, Los Angeles, ↗

GenASiS Basics: Object-oriented utilitarian functionality for large-scale physics simulations (Version 3)

GenASiS Basics provides Fortran 2003 classes furnishing extensible object-oriented utilitarian functionality for large-scale physics simulations on distributed memory supercomputers. This functionality includes physical units and constants; display to the screen or standard output device; message passing; I/O to disk; and runtime parameter management and usage statistics. This revision – Version 3 of Basics – includes a significant name change, some minor additions to functionality, and a major addition to functionality: infrastructure facilitating the offloading of computational kernels to devices such as GPUs.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Analyzing the Quantum Approximate Optimization Algorithm: Ansätze, Symmetries, and Lie Algebras

The quantum approximate optimization algorithm (QAOA) has been proposed as a method to obtain approximate solutions for combinatorial optimization tasks. In this work, we study the underlying algebraic properties of three QAOA ansätze for the maximum-cut problem on connected graphs, while focusing on the generated Lie algebras as well as their invariant subspaces. Specifically, we analyze the standard QAOA ansatz as well as the orbit and multiangle ansätze. We are able to fully characterize the Lie algebras of the multiangle ansatz across arbitrary connected graphs, finding that they only fall into one of just six families. Aside from the cycle and path graphs, the Lie dimensions for every graph are exponentially large in the system size, meaning that multiangle ansätze are extremely prone to exhibiting barren plateaus. Then, a similar quasi-graph-independent Lie-algebraic characterization beyond the multiangle ansatz is impeded as the circuit exhibits additional “hidden” symmetries besides those naturally arising from a certain parity-superselection operator and all automorphisms of the considered graph. Disregarding the “hidden” symmetries, we can upper bound the dimensions of the orbit and the standard Lie algebras, and the dimensions of the associated invariant subspaces are determined via explicit character formulas. To finish, we conjecture that (for most graphs) the standard Lie algebras have only components that are either exponential or that grow, at most, polynomially with the system size. This would imply that the QAOA is either prone to barren plateaus or classically simulable. More generally, our work provides a symmetry framework and tools to analyze any desired variational quantum algorithm.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A Review of Software for Designing and Operating Quantum Networks

Quantum networks development is crucial to realizing a production-grade network that can support distributed sensing, secure communication, and utility-scale quantum computation. However, the transition from laboratory demonstration to deployable networks requires software implementations of architectures and protocols tailored to the unique constraints of quantum systems. This paper reviews the current state of software implementations for quantum networks, organized around a three-plane abstraction of infrastructure, logical, and control/service planes. We cover software for both designing quantum network protocols (e.g., SeQUeNCe, QuISP, and NetSquid) and operating testbeds, with a focus on essential control/service plane functions such as entanglement, topology, and resource management, in a proposed taxonomy. Our review highlights a persistent gap between theoretical architecture and protocol proposals and their realization in simulators or testbeds, particularly in dynamic topology and network management. We conclude by outlining open challenges and proposing a roadmap for developing scalable software architectures to enable hybrid, large-scale quantum networks.

Network Design↗

Methods for analysing the quality of the element base of quantum information technologies

Methods for analysing the quality of the element base of quantum information technologies are considered. Methods for simulating quantum operations with allowance for quantum noise, based on the formalism of quantum operations (operator sum method and Choi – Jamiolkowski isomorphism), are described. Results of simulating some one- and two-qubit quantum transformations with allowance for the amplitude and phase relaxation and the presence of depolarising noise are reported. The quantum state tomography, based on the root approach and maximum likelihood method, is considered. The method of guaranteed estimation of quantum tomography accuracy, which implies quantitative estimation of measurement results, is described. Tomography of a single-qubit transformation on a superconducting quantum processor (IBM) is performed. The practical purpose of the study is to provide high quality and efficiency of quantum information technologies. The results obtained can be used to improve the quality of logic gates of quantum computers and debug the procedures of quantum state control in quantum cryptography problems. The bibliography includes 28 references. (quantum technology)

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Emu v1.1

Emu is a particle-in-cell code for solving the neutrino quantum kinetic equations in 1, 2, or 3 spatial dimensions with arbitrary angular resolution in order to simulate neutrino flavor transformation in neutron star merger and core collapse supernova environments. Emu represents the neutrino distribution function as a set of particles, each of which represent a collection of neutrinos and antineutrinos with unique position and momentum. Each particle carries two density matrices to define the flavor state of the neutrinos and antineutrinos it represents. Emu includes the vacuum, matter, and neutrino self-interaction potentials. Emu calculates the self-interaction potential using PIC deposition and interpolation algorithms that efficiently compute the local number density and flux at particle locations. Emu is implemented in C++ and is based on the AMReX library for high-performance, block-structured adaptive mesh refinement. Emu is parallelized with MPI + OpenMP for CPUs and MPI + CUDA for GPUs.

Willcox, Donald↗

Toward a microscopic picture of hadronization and multi-parton processes

This project advanced the understanding of how quarks and gluons produced in high-energy collisions transform into the hadrons observed in particle detectors, a fundamental process known as quantum chromodynamics (QCD) hadronization. By combining theoretical calculations, quantum simulation methods, and modern AI techniques, the research developed new tools to study multi-parton dynamics and nonperturbative effects that are essential for interpreting data from current and future nuclear physics experiments. Key outcomes include new theoretical frameworks for jet and hadron measurements, pioneering quantum simulation algorithms for real-time dynamics in field theories, and the development of advanced machine-learning models, such as diffusion models and explainable classifiers, to simulate and analyze collider events. These results are directly relevant to experiments at Jefferson Lab, Brookhaven National Laboratory, and the future Electron-Ion Collider, and they also have a broader impact in areas such as quantum information science and data-driven modeling of complex systems. The project supported the training of graduate students and postdoctoral fellows and contributed to the broader scientific community through publications, workshops, and collaborative activities. Overall, this work provides new insights into the microscopic mechanisms of hadron formation and establishes a foundation for future studies at the intersection of nuclear physics, artificial intelligence, and quantum computing.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Multi-fidelity modeling to predict the rheological properties of a suspension of fibers using neural networks and Gaussian processes

Unveiling the rheological properties of fiber suspensions is of paramount interest to many industrial applications. There are multiple factors, such as fiber aspect ratio and volume fraction, that play a significant role in altering the rheological behavior of suspensions. Three-dimensional (3D) numerical simulations of coupled differential equations of the suspension of fibers are computationally expensive and time-consuming. Machine learning algorithms can be trained on the available data and make predictions for the cases where no numerical data are available. However, some widely used machine learning surrogates, such as neural networks, require a relatively large training dataset to produce accurate predictions. Multi-fidelity models, which combine high-fidelity data from numerical simulations and less expensive lower fidelity data from resources such as simplified constitutive equations, can pave the way for more accurate predictions. Here, we focus on neural networks and the Gaussian processes with two levels of fidelity, i.e., high and low fidelity networks, to predict the steady-state rheological properties, and compare them to the single-fidelity network. High-fidelity data are obtained from direct numerical simulations based on an immersed boundary method to couple the fluid and solid motion. The low-fidelity data are produced by using constitutive equations. Multiple neural networks and the Gaussian process structures are used for the hyperparameter tuning purpose. Results indicate that with the best choice of hyperparameters, both the multi-fidelity Gaussian processes and neural networks are capable of making predictions with a high level of accuracy with neural networks demonstrating marginally better performance.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Probing the Kinetic Origin of Varying Oxidative Stability of Ethyl- vs. Propyl-spaced Amines for Direct Air Capture

Amine-based adsorbents are promising for direct air capture of CO 2 , yet oxidative degradation remains a key unmitigated risk hindering wide-scale deployment. Borrowing wisdom from the basic auto-oxidation scheme, insights are gained into the underlying degradation mechanisms of polyamines by quantum chemical, advanced sampling simulations, adsorbent synthesis, and accelerated degradation experiments. The reaction kinetics of polyamines are contrasted with that of typical aliphatic polymers and they elucidate for the first time the critical role of aminoalkyl hydroperoxide decomposition in the oxidative degradation of amino-oligomers. The experimentally observed variation in oxidative stability of polyamines with different backbone structures is explained by the relationship between the local chemical structure and the free energy barrier of aminoalkyl hydroperoxide decomposition, suggesting that its energetics can be used as a descriptor to screen and design new polyamines with improved stability. In conclusion, the developed computational capability sheds light on radical-induced degradation chemistry of other organic functional materials.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Evaluating the active site-substrate interplay between x-ray crystal structure and molecular dynamics in chorismate mutase

Designing realistic quantum mechanical (QM) models of enzymes is dependent on reliably discerning and modeling residues, solvents, and cofactors important in crafting the active site microenvironment. Interatomic van der Waals contacts have previously demonstrated usefulness toward designing QM-models, but their measured values (and subsequent residue importance rankings) are expected to be influenceable by subtle changes in protein structure. Using chorismate mutase as a case study, this work examines the differences in ligand-residue interatomic contacts between an x-ray crystal structure and structures from a molecular dynamics simulation. Select structures are further analyzed using symmetry adapted perturbation theory to compute ab initio ligand-residue interaction energies. The findings of this study show that ligand-residue interatomic contacts measured for an x-ray crystal structure are not predictive of active site contacts from a sampling of molecular dynamics frames. In addition, the variability in interatomic contacts among structures is not correlated with variability in interaction energies. However, the results spotlight using interaction energies to characterize and rank residue importance in future computational enzymology workflows.

Chemistry↗