Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “high performance computing, quantum computing”

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 235 records · Page 13

QC-GN 2 oMS 2 : a Graph Neural Net for High Resolution Mass Spectra Prediction

Predicting the mass spectrum of a molecular ion is often accomplished via three generalized approaches: rules-based methods for bond breaking, deep learning, or quantum chemical (QC) modeling. Rules-based approaches are often limited by the conditions for different chemical subspaces and perform poorly under chemical regimes with few defined rules. QC modeling is theoretically robust but requires significant amounts of computational time to produce a spectrum for a given target. Among deep learning techniques, graph neural networks (GNNs) have performed better than previous work with fingerprint-based neural networks in mass spectra prediction. To explore this technique further, we investigate the effects of including quantum chemically derived information as edge features in the GNN to increase predictive accuracy. The models we investigated include categorical bond order, bond force constants derived from extended tight-binding (xTB) quantum chemistry, and acyclic bond dissociation energies. Throughout this work, we evaluated these models against a control GNN with no edge features in the input graphs. Bond dissociation enthalpies yielded the best improvement with a cosine similarity score of 0.462 relative to the baseline model (0.437). In this work we also apply dynamic graph attention which improves performance on benchmark problems and supports the inclusion of edge features. Between implementations, we investigate the nature of the molecular embedding for spectra prediction and discuss the recognition of fragment topographies in distinct chemistries for further development in tandem mass spectrometry prediction.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

First-passage time statistics on surfaces of general shape: Surface PDE solvers using Generalized Moving Least Squares (GMLS)

Here, we develop numerical methods for computing statistics of stochastic processes on surfaces of general shape with drift-diffusion dynamics d X t = a (X t ) dt + b(X t ) d W t . We formulate descriptions of Brownian motion and general drift-diffusion processes on surfaces. We consider statistics of the form u (x) = E x [$∫^{τ}_{0}$ g (X t ) dt ] + E x [ f (X τ )] for a domain Ω and the exit stopping time τ = inf t { t >0 | X i Ω}, where f , g are general smooth functions. For computing these statistics, we develop high-order Generalized Moving Least Squares (GMLS) solvers for associated surface PDE boundary-value problems based on Backward- Kolmogorov equations. We focus particularly on the mean First Passage Times (FPTs) given by the case f = 0, g = 1 where u (x) = E x [τ]. We perform studies for a variety of shapes showing our methods converge with high-order accuracy both in capturing the geometry and the surface PDE solutions. We then perform studies showing how statistics are influenced by the surface geometry, drift dynamics, and spatially dependent diffusivities.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Real-Time Krylov Theory for Quantum Computing Algorithms

Quantum computers provide new avenues to access ground and excited state properties of systems otherwise difficult to simulate on classical hardware. New approaches using subspaces generated by real-time evolution have shown efficiency in extracting eigenstate information, but the full capabilities of such approaches are still not understood. In recent work, we developed the variational quantum phase estimation (VQPE) method, a compact and efficient real-time algorithm to extract eigenvalues on quantum hardware. Here we build on that work by theoretically and numerically exploring a generalized Krylov scheme where the Krylov subspace is constructed through a parametrized real-time evolution, which applies to the VQPE algorithm as well as others. We establish an error bound that justifies the fast convergence of our spectral approximation. We also derive how the overlap with high energy eigenstates becomes suppressed from real-time subspace diagonalization and we visualize the process that shows the signature phase cancellations at specific eigenenergies. We investigate various algorithm implementations and consider performance when stochasticity is added to the target Hamiltonian in the form of spectral statistics. To demonstrate the practicality of such real-time evolution, we discuss its application to fundamental problems in quantum computation such as electronic structure predictions for strongly correlated systems.

97 MATHEMATICS AND COMPUTING↗

On decoupling the integrals of cosmological perturbation theory

ABSTRACT Perturbation theory (PT) is often used to model statistical observables capturing the translation and rotation-invariant information in cosmological density fields. PT produces higher order corrections by integration over linear statistics of the density fields weighted by kernels resulting from recursive solution of the fluid equations. These integrals quickly become high dimensional and naively require increasing computational resources the higher the order of the corrections. Here, we show how to decouple the integrands that often produce this issue, enabling PT corrections to be computed as a sum of products of independent 1D integrals. Our approach is related to a commonly used method for calculating multiloop Feynman integrals in quantum field theory, the Gegenbauer Polynomial x-Space Technique. We explicitly reduce the three terms entering the 2-loop power spectrum, formally requiring 9D integrations, to sums over successive 1D radial integrals. These 1D integrals can further be performed as convolutions, rendering the scaling of this method Nglog Ng with Ng the number of grid points used for each fast Fourier transform. This method should be highly enabling for upcoming large-scale structure redshift surveys where model predictions at an enormous number of cosmological parameter combinations will be required by Monte Carlo Markov Chain searches for the best-fitting values.

Slepian, Zachary↗

Quantum simulations of hydrodynamics via the Madelung transformation

Developing numerical methods to simulate efficiently nonlinear fluid dynamics on universal quantum computers is a challenging problem. In this paper, a generalization of the Madelung transform is defined to solve quantum relativistic charged fluid equations interacting with external electromagnetic forces via the Dirac equation. The Dirac equation is discretized into discrete-time quantum walks which can be efficiently implemented on universal quantum computers. A variant of this algorithm is proposed to implement simulations using current noisy intermediate scale quantum (NISQ) devices in the case of homogeneous external forces. High resolution (up to N=2 17 grid points) numerical simulations of relativistic and nonrelativistic hydrodynamical shocks on current IBM NISQs are performed with this algorithm. Here, this paper demonstrates that fluid dynamics can be simulated on NISQs, and opens the door to simulating other fluids, including plasmas, with more general quantum walks and quantum automata.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Efficient Routing of Quantum LDPC Codes on Programmable 2D Toric Architectures

Quantum low-density parity-check codes are promising candidates towards scalable fault-tolerant quantum computation. Among these, bivariate bicycle (BB) codes offer superior encoding rates and large code distance compared to surface codes. However, their requirement on long-range stabilizer measurements poses significant challenges for implementation on realistic hardware with limited connectivity, such as superconducting circuit platforms. In this work, we introduce a novel hardware-software co-design that leverages a programmable communication network architecture to address these limitations. Our approach utilizes a 2D toric network of oscillators as a flexible communication fabric linking qubits at each site. Such architecture significantly reduces the number of long-range couplers required from O ( n ) to O (√ n ). Dual-rail qubits, along with native gates including Swap-Wait-Swap gates and beamsplitter SWAPs, ensure that long-range two-qubit gates can be executed with high fidelity and low latency. To further enhance performance, our qubit layout and routing algorithm utilize symmetries of the codes and enable maximum parallelism for long-range two-qubit gates, maintaining a low syndrome extraction cycle duration and scalability over the code length. We perform circuit-level simulation with realistic noise modeling based on experimental hardware parameters, observing an logical error rate per logical qubit per cycle of 3.06% for [[18,4,4]] BB code, 2.6× less than the existing experimental result. These findings provide a practical roadmap and identify key technological advancements needed to achieve low-overhead fault-tolerant quantum computing at scale.

Liu, Kun [Yale Univ., New Haven, CT (United States↗

Scaling the SciDAC QuantOm Workflow

As part of the Scientific Discovery through Advanced Computing (SciDAC) program, the Quantum Chromodynamics Nuclear Tomography (QuantOM) project aims to analyze data from Deep Inelastic Scattering (DIS) experiments conducted at Jefferson Lab and the upcoming Electron Ion Collider. The DIS data analysis is performed on an event-level by combining the input from theoretical and experimental nuclear physics into a single, composable workflow. The optimization itself (I.e. fitting the experimental data with theoretical predictions) is carried out by a machine / deep learning algorithm. The size of the acquired DIS data as well as the complexity of the workflow itself require that the analysis is performed across multiple GPUs on high performance computing systems, such as Polaris at Argonne National Laboratory. This presentation discusses the novelties and challenges that came along with parallelizing this workflow. Recent results are compared to common distributed training techniques.

Lersch, Daniel↗

Accuracy, transferability, and computational efficiency of interatomic potentials for simulations of carbon under extreme conditions

Large-scale atomistic molecular dynamics (MD) simulations provide an exceptional opportunity to advance the fundamental understanding of carbon under extreme conditions of high pressures and temperatures. However, the fidelity of these simulations depends heavily on the accuracy of classical interatomic potentials governing the dynamics of many-atom systems. Here, this study critically assesses several popular empirical potentials for carbon, as well as machine learning interatomic potentials (MLIPs), in their ability to simulate a range of physical properties at high pressures and temperatures, including the diamond equation of state, its melting line, shock Hugoniot, uniaxial compressions, and the structure of liquid carbon. Empirical potentials fail to accurately predict the behavior of carbon under high pressure–temperature conditions. In contrast, MLIPs demonstrate quantum accuracy, with Spectral Neighbor Analysis Potential (SNAP) and atomic cluster expansion (ACE) being the most accurate in reproducing the density functional theory results. ACE displays remarkable transferability despite not being specifically trained for extreme conditions. Furthermore, ACE and SNAP exhibit superior computational performance on graphics processing unit-based systems in billion atom MD simulations, with SNAP emerging as the fastest. In addition to offering practical guidance in selecting an interatomic potential with a fine balance of accuracy, transferability, and computational efficiency, this work also highlights transformative opportunities for groundbreaking scientific discoveries facilitated by quantum-accurate MD simulations with MLIPs on emerging exascale supercomputers.

36 MATERIALS SCIENCE↗

Anomaly Detection in Gamma Spectra Using Hopfield Neural Network with B-SAT and Grover’s Algorithm on a Quantum Computing Simulator

Environmental screening of gamma radiation consists of detecting weak nuisance and anomaly signal in the presence of strong and highly varying background. In a typical scenario, a mobile detector-spectrometer continuously measures gamma radiation spectra in short, e.g., one-second, signal acquisition intervals. In principle, gamma radiation sources can be detected and identified by their unique spectral lines. However, detecting sources from data measured in a search scenario is difficult due to the highly varying background because of naturally occurring radioactive material (NORM), and low signal-to-noise ratio (S/N) of spectral signal measured during one-second acquisition intervals. In recent prior work, we have developed a Hopfield Neural Network (HNN) in conjunction with an image processing algorithm to detect a weak signal anomaly hidden among the highly fluctuating background spectra. The objective of this work is to explore quantum computing methods to increase the speed of HNN. The approach is based on the Grover’s search algorithm in conjunction with a 3-SAT problem formalism. The Grover’s algorithm is implemented on a quantum computing simulator using Qiskit software. Performance of HNN algorithm is benchmarked using search data from an environmental screening campaign, where the anomaly is a subset of measurements containing a 137 Cs source. Results indicate that using Grover’s algorithm on a quantum simulator reduces runtime of HNN by two orders of magnitude.

61 RADIATION PROTECTION AND DOSIMETRY↗

Scaling quantum approximate optimization on near-term hardware

The quantum approximate optimization algorithm (QAOA) is an approach for near-term quantum computers to potentially demonstrate computational advantage in solving combinatorial optimization problems. However, the viability of the QAOA depends on how its performance and resource requirements scale with problem size and complexity for realistic hardware implementations. Here, we quantify scaling of the expected resource requirements by synthesizing optimized circuits for hardware architectures with varying levels of connectivity. Assuming noisy gate operations, we estimate the number of measurements needed to sample the output of the idealized QAOA circuit with high probability. We show the number of measurements, and hence total time to solution, grows exponentially in problem size and problem graph degree as well as depth of the QAOA ansatz, gate infidelities, and inverse hardware graph degree. These problems may be alleviated by increasing hardware connectivity or by recently proposed modifications to the QAOA that achieve higher performance with fewer circuit layers.

97 MATHEMATICS AND COMPUTING↗

Implementing a Laser Stabilization System for Trapping Ca+ Ions: an Internship Reflection

At Lawrence Livermore National Laboratory, I contributed to a project developing 3D printed micro ion traps for quantum computing. I designed, implemented, and assessed a laser stabilization system that locked lasers to the frequencies required for calibrating our High Finesse WS8-10 wavelength meter and for laser cooling and trapping of Ca+ ions. I also programmed a Python interface for hardware communication, data collection, and statistical analysis. Additionally, I optimized and aligned laser beam paths, and I implemented a closed digital feedback loop using Proportional, Integral, and Derivative (PID) control parameters. I analyzed both the long-term and short-term behavior of our locked lasers and adjusted PID parameters to enhance performance. Furthermore, I used COMSOL to simulate the capacitance of a linear Paul trap design and predict our trap’s performance. The procedures I developed for the interface, analysis, and simulations will continue to support the ion trapping experiment after my appointment. I strengthened my skills in data analysis, Python coding, and optical alignment for laser systems. My confidence as a researcher grew, particularly in communicating my research. This experience taught me the importance of careful planning and consideration in research and solidified my desire to continue exploring novel quantum technology as an undergraduate

42 ENGINEERING↗

Distributed-Memory Sparse Deep Neural Network Inference Using Global Arrays

Partitioned Global Address Space (PGAS) models exhibit tremendous promise in developing efficient and productive distributed-memory parallel applications. They have been used extensively in scientific computations due to conveniently offering a ``shared-memory''-like model and convenient interfaces that separate communication with synchronization. Traditionally, PGAS communication models have been applied to dense/contiguously distributed data, but most modern applications depict varied levels of sparsity. Existing PGAS models require certain adaptations to support distributed sparse computations, since associated computations often require matrix arithmetic, in addition to data movement. The Global Arrays toolkit from Pacific Northwest National Laboratory (PNNL) is one of the earliest PGAS models to combine one-sided data communication and distributed matrix operations and is still used in the popular NWChem quantum chemistry suite. Recently, we have expanded the Global Arrays toolkit to support common sparse operations, like sparse matrix-dense matrix multiplies (SpMM), sparse matrix-sparse matrix multiplication (SpGEMM) and Sampled Dense-Dense Matrix Multiplication (SDDMM). As it turns out, these operations are the bedrock of sparse Deep Learning (DL); sparse deep neural networks and Graph Neural Networks (GNNs) have gained increasing attention recently in achieving speedups on training and inference with reduced memory footprints. Unlike scientific applications in High Performance Computing (HPC), modern (distributed-memory capable) DL toolkits often rely on non-standardized and closed-source vendor software optimizations, creating challenges in software-hardware co-design at scale. Our goal is to support a variety of distributed-memory sparse matrix operations and helper functions in the newly created Sparse Global Arrays (SGA), such that it is possible to build portable and productive Machine Learning scenarios for algorithm/software and hardware codesign purposes. Contemporary data-parallel schemes for training/inference are undergoing a major overhaul since model replication limits scalability and causes resource inefficiencies. As such, we have adopted tensor parallelism in decomposing the model and inputs, to mitigate memory issues. Current implementation is built on top of MPI and uses CPUs to maximize the portability across the platforms.

Distributed computing, machine learning↗

Identification of Solid-Electrolyte Interphase Species by Joint Characterization of Li-Ion Battery Chemistry by Mass Spectrometry and Electrochemical Reaction Networks

The formation and stability of the solid-electrolyte interphase (SEI) play central roles in determining the long-term performance and safety of modern electrochemical energy storage systems. Despite decades of research, the SEI’s heterogeneous, dynamic, and multiphase nature has defied comprehensive molecular-level characterization, creating a critical knowledge gap that limits rational battery design. In this work, we introduce a computational−experimental framework that integrates high-throughput quantum chemistry calculations, data-driven electrochemical reaction networks (eCRNs), stochastic algorithms, and laser desorption/ionization Fourier transform ion cyclotron resonance mass spectrometry (LDI-FTICR-MS) to unravel SEI formation in carbonatebased electrolytes without imposing predefined mechanisms. We constructed the most comprehensive eCRN to date, spanning over 10,000 species and 209 million reactions. Through stochastic network analysis, we successfully recovered 27 species that were previously reported in the literature and predicted 28 novel SEI species nearly doubling our scientific knowledge in this area. Each new species was rigorously confirmed through advanced mass spectral analysis of its distinct molecular and isotopic signatures. We kinetically refined the formation pathways for a select set of both previously reported and novel SEI products, revealing kinetically feasible elementary reaction mechanisms with activation barriers below 1 eV. This computational−experimental approach deepens our molecular-level understanding of SEI chemistry by resolving which species form and through which decomposition mechanisms they emerge. Such knowledge provides the foundation necessary to connect electrolyte composition to the resulting SEI components, a critical step toward a more informed electrolyte development in next-generation lithium-based batteries.

25 ENERGY STORAGE↗

Benchmarking highly entangled states on a 60-atom analogue quantum simulator

Abstract Quantum systems have entered a competitive regime in which classical computers must make approximations to represent highly entangled quantum states 1,2 . However, in this beyond-classically-exact regime, fidelity comparisons between quantum and classical systems have so far been limited to digital quantum devices 2–5 , and it remains unsolved how to estimate the actual entanglement content of experiments 6 . Here, we perform fidelity benchmarking and mixed-state entanglement estimation with a 60-atom analogue Rydberg quantum simulator, reaching a high-entanglement entropy regime in which exact classical simulation becomes impractical. Our benchmarking protocol involves extrapolation from comparisons against an approximate classical algorithm, introduced here, with varying entanglement limits. We then develop and demonstrate an estimator of the experimental mixed-state entanglement 6 , finding our experiment is competitive with state-of-the-art digital quantum devices performing random circuit evolution 2–5 . Finally, we compare the experimental fidelity against that achieved by various approximate classical algorithms, and find that only the algorithm we introduce is able to keep pace with the experiment on the classical hardware we use. Our results enable a new model for evaluating the ability of both analogue and digital quantum devices to generate entanglement in the beyond-classically-exact regime, and highlight the evolving divide between quantum and classical systems.

Science & Technology - Other Topics↗

Thermoelectric coolers for high-power-density 3D electronics heat management

Future advancements in three-dimensional (3D) electronics require robust thermal management methodology. Thermoelectric coolers (TECs) are reliable and solid-state heat pumping devices with high cooling capacity that can meet the requirements of emerging 3D microelectronic devices. In this work, we first provide the design of TECs for electronics cooling using a computational model and then experimentally validate the main predictions. Key device parameters such as device thickness, leg density, and contact resistance were studied to understand their influence on the performance of TECs. Our results show that it is possible to achieve high cooling power density through optimization of TE leg height and packing density. Scaling of TECs is shown to provide ultra-high cooling power density.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Beyond CCSD(T) Accuracy at Lower Scaling with Auxiliary Field Quantum Monte Carlo

We introduce a black-box auxiliary field quantum Monte Carlo (AFQMC) approach to perform highly accurate electronic structure calculations using configuration interaction singles and doubles (CISD) trial states. This method consistently provides more accurate energy estimates than coupled cluster singles and doubles with perturbative triples (CCSD(T)), often regarded as the gold standard in quantum chemistry. This level of precision is achieved at a lower asymptotic computational cost, scaling as O(N 6 ) compared to the O(N 7 ) scaling of CCSD(T). Furthermore, we provide numerical evidence supporting these findings through results for challenging main group and transition metal-containing molecules.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Inventory of Public Key Cryptography in US Electric Vehicle Charging

Electric vehicles (EVs) and charging infrastructure are networked systems, which employ high-level communications in support of charging and grid service decisions. Public key cryptography (PKC) underlies much of the security and privacy protections of the information exchange. We are entering a new epoch where quantum computing threats must be seriously considered. A sufficiently large quantum computer, so named Cryptographically Relevant Quantum Computer (QRQC), will be able to perform the mathematical operations to efficiently attack the underpinnings of traditional PKC, thus jeopardizing the digital foundations for trust, communications security, and data security. Estimates suggest a QRQC can break public key encryption and digital signatures in the manner of tens to hundreds of hours, compared to traditional computing that would demand more than 10 18 years in a brute force-style attack. A consensus belief of quantum theorists, quantum experimenters, and cryptographers suggest that the quantum threat will be likely realized in the next twenty years. To address the threat, post-quantum cryptography, which is cryptosystems that are designed to be secure against both traditional and quantum computing threats, must be adopted. Migration from traditional PKC to quantum-resilient cryptography is a global undertaking and likely represents the largest transition in computing history. The nascent state of EV public key infrastructure, combined with limited adoption of the vehicle secure charging features, presents an opportunity to establish a preference for quantum-resistant cryptography as a step on the migration path. Delays will stunt the efforts as rapidly accelerating EVs sales and huge infrastructure investments will create large growing bases of long-lived vehicles and infrastructure. Migration preparations can commence while NIST continues the process to standardize post-quantum cryptography (PQC), which are quantum-resilient algorithms designed to be secure against traditional and quantum computing threats. The first step in preparing EV charging is to identify the presence of traditional public key cryptography algorithms and applications. With this objective in mind, this report is intended to advise the vehicle manufacturers, charging station manufacturers, charging station operators, charge network providers and other EV charging stakeholders with information on traditional PKC application and the potential risks when PKC becomes insecure. This report, the first in a series of reports discussing the topics existing at the confluence of post-quantum cryptography adoption and EV charging, identifies traditional public key applications employed and identifies potential consequences of leaving EV charging infrastructure vulnerable to quantum computing. The focus remains squarely on the of EV charging and infrastructure with respect to PKC and is believed by the authors to complement the NIST SP 1800-38 Migration to Post-Quantum Cryptography. While the report is centered on infrastructure, there are implications to vehicles.

33 ADVANCED PROPULSION SYSTEMS↗

Understanding Quantum Control Processor Capabilities and Limitations through Circuit Characterization

Continuing the scaling of quantum computers hinges on building classical control hardware pipelines that are scalable, extensible, and provide real time response. The instruction set architecture (ISA) of the control processor provides functional abstractions that map high-level semantics of quantum programming languages to low-level pulse generation by hardware. Here, we provide a methodology to quantitatively assess the effectiveness of the ISA to encode quantum circuits for intermediate-scale quantum devices with O(10 2 ) qubits. The characterization model that we define reflects performance, the ability to meet timing constraint implications, scalability for future quantum chips, and other important considerations making them useful guides for future designs. Using our methodology, we propose scalar (QUASAR) and vector (qV) quantum ISAs as extensions and compare them with other ISAs in metrics such as circuit encoding efficiency, the ability to meet real-time gate cycle requirements of quantum chips, and the ability to scale to more qubits.

97 MATHEMATICS AND COMPUTING↗