Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “quantum algorithms”

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,567 records · Page 87
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

Superconducting Hyperdimensional Associative Memory Circuit for Scalable Machine Learning

Here we propose a generalized architecture for the first rapid-single-flux-quantum (RSFQ) associative memory circuit. The circuit employs hyperdimensional computing (HDC), a machine learning (ML) paradigm utilizing vectors with dimensionality in the thousands to represent information. HDC designs have small memory footprints, simple computations, and simple training algorithms compared to superconducting neural network accelerators (SNNAs), making them a better option for scalable SFQ machine learning (ML) solutions. The proposed superconducting HDC (SHDC) circuit uses entirely on-chip RSFQ memory which is tightly integrated with logic, operates at 33.3 GHz, is applicable to general ML tasks, and is manufacturable at practically useful scales given current SFQ fabrication limits. Tailored to a language recognition task, SHDC consists of ~ 2-20 M Josephson junctions (JJs) and consumes up to three times less power than an analogous CMOS HDC circuit while achieving 78-84% higher throughput. SHDC is capable of outperforming the state of the art RSFQ SNNA, SuperNPU, by 48-99% for all benchmark NN architectures tested while occupying up to 90% less area and consuming up to nine times less power. To the best of the authors' knowledge, SHDC is currently the only superconducting ML approach feasible at practically useful scales for real-world ML tasks and capable of online learning.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
NASA NTRS1995

High Performance Parallel Computational Nanotechnology

At a recent press conference, NASA Administrator Dan Goldin encouraged NASA Ames Research Center to take a lead role in promoting research and development of advanced, high-performance computer technology, including nanotechnology. Manufacturers of leading-edge microprocessors currently perform large-scale simulations in the design and verification of semiconductor devices and microprocessors. Recently, the need for this intensive simulation and modeling analysis has greatly increased, due in part to the ever-increasing complexity of these devices, as well as the lessons of experiences such as the Pentium fiasco. Simulation, modeling, testing, and validation will be even more important for designing molecular computers because of the complex specification of millions of atoms, thousands of assembly steps, as well as the simulation and modeling needed to ensure reliable, robust and efficient fabrication of the molecular devices. The software for this capacity does not exist today, but it can be extrapolated from the software currently used in molecular modeling for other applications: semi-empirical methods, ab initio methods, self-consistent field methods, Hartree-Fock methods, molecular mechanics; and simulation methods for diamondoid structures. In as much as it seems clear that the application of such methods in nanotechnology will require powerful, highly powerful systems, this talk will discuss techniques and issues for performing these types of computations on parallel systems. We will describe system design issues (memory, I/O, mass storage, operating system requirements, special user interface issues, interconnects, bandwidths, and programming languages) involved in parallel methods for scalable classical, semiclassical, quantum, molecular mechanics, and continuum models; molecular nanotechnology computer-aided designs (NanoCAD) techniques; visualization using virtual reality techniques of structural models and assembly sequences; software required to control mini robotic manipulators for positional control; scalable numerical algorithms for reliability, verifications and testability. There appears no fundamental obstacle to simulating molecular compilers and molecular computers on high performance parallel computers, just as the Boeing 777 was simulated on a computer before manufacturing it.

Saini, Subhash↗
DOE OSTI2026

A simple fourth order propagator based on the Magnus expansion in the Liouville space: Application to a Λ-system and assessment of the rotating wave approximation

A simple fourth-order propagator [Ture and Jang, J. Phys. Chem. A 128, 2871 (2024)] based on the Magnus expansion is extended to the Liouville space for both closed-system and Lindbladian open-system quantum dynamics. For both dynamics, commutator free versions of fourth-order propagators are provided as well. These propagators are then applied to the dynamics of a driven Λ-system, where Lindblad terms represent the effect of a photonic bath. For both dynamics, the accuracy of the rotating wave approximation (RWA) for the matter–radiation interaction is assessed. We confirmed reasonable performance of RWA for weak and resonant fields. However, small errors appear for moderate fields and substantial errors can be found for strong fields where coherent population trapping can still be expected. We also found that the presence of bath for open-system quantum dynamics consistently reduces the errors of the RWA. These results provide quantitative information on how the RWA breaks down beyond weak field or for non-resonant cases. Major results are benchmarked against results of our sixth-order ME-based propagator. Finally, we also provide numerical comparison of our algorithms with other fourth-order algorithms for the Λ-system. These confirm reasonable performance of our simple propagators and the improvement gained through commutator-free expressions.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2024

Precision Computations in Strongly Coupled Conformal Field Theories (Final Technical Report)

Conformal Field Theories (CFTs) are quantum field theories that are invariant under the conformal symmetry group (which includes translations and rotations, but also local rescalings of spacetime). They are building blocks of general quantum field theories, and appear in many areas of physics, including statistical physics, condensed matter physics, particle physics, and quantum gravity. Because of their extra symmetries, the mathematical structure of CFTs is tightly constrained, and this leads to the idea of the ``conformal bootstrap," which is to use these mathematical structures to constrain, and in some cases determine, CFT observables. A new numerical implementation of the conformal bootstrap idea appeared in 2008 with the work of Rattazzi, Rychkov, Tonni, and Vichi. Their observation was that certain bootstrap constraints (conformal symmetry and unitarity) could be combined to yield a convex optimization problem that constraints CFT data. By solving this convex optimization problem on a computer, one could obtain bounds on observables like critical exponents and operator product expansion (OPE) coefficients. Over the course of this award, the PI has improved numerical bootstrap techniques by optimizing known algorithms and finding new ones for performing the required convex optimization computations. The PI has applied these techniques to compute high-precision observables in several important strongly-coupled systems. The PI has also explored both analytical and numerical bootstrap methods for constraining the space of low energy effective field theories of quantum gravity, and developed new analytical techniques for CFT and QFT more broadly.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2021

ThickBrick: optimal event selection and categorization in high energy physics. Part I. Signal discovery

We provide a prescription called ThickBrick to train optimal machine-learning-based event selectors and categorizers that maximize the statistical significance of a potential signal excess in high energy physics (HEP) experiments, as quantified by any of six different performance measures. For analyses where the signal search is performed in the distribution of some event variables, our prescription ensures that only the information complementary to those event variables is used in event selection and categorization. This eliminates a major misalignment with the physics goals of the analysis (maximizing the significance of an excess) that exists in the training of typical ML-based event selectors and categorizers. In addition, this decorrelation of event selectors from the relevant event variables prevents the background distribution from becoming peaked in the signal region as a result of event selection, thereby ameliorating the challenges imposed on signal searches by systematic uncertainties. Our event selectors (categorizers) use the output of machine-learning-based classifiers as input and apply optimal selection cutoffs (categorization thresholds) that are functions of the event variables being analyzed, as opposed to flat cutoffs (thresholds). These optimal cutoffs and thresholds are learned iteratively, using a novel approach with connections to Lloyd’s k-means clustering algorithm. We provide a public, Python implementation of our prescription, also called ThickBrick, along with usage examples.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2023

Exploring strongly correlated quantum spin systems with quantum computers

At inception, quantum annealing leveraged quantum mechanics for classical optimization tasks. However, as machine coherence increases, the realization of quantum spin systems has emerged as an even more fruitful application of this computational model. Alternatives to the standard gate model deserve exploration, to achieve useful quantum advantage via analog quantum computing. The recent demonstration of so-called coherent quantum annealing with 1,000s of qubits, further expands the potential for this hardware to explore quantum system dynamics where the effects of quantum fluctuations can be carefully controlled and observed directly. Implementing existing celebrated spin models—or in fact new and dedicated ones—into quantum annealers will lead to observation and detection of quantum phenomena not yet observed, or not visualized directly, in experimental physics laboratories. Rather than computing or simulating quantum systems, these quantum computers allow one to simply build quantum systems, and experiment on them in an uniquely controlled way, with characterization down to the constitutive degree of freedom. This provides an unprecedented opportunity for understanding the physics of quantum spin systems. Keywords: Theoretical physics currently abounds of interesting theoretical spin models to explore frustration, strongly correlated spins, spin liquids, fractionalized excitations, and topological matter. However enticing, such models are generally only weak proxies for the properties of actual materials. In quantum annealers these models could be realized and experimented upon. Moreover, many more realistic models of such materials could be realized in quantum annealers. Employed in this way, quantum annealers provide an extraordinary versatile platform to explore quantum effects that are hard to find, detect, and characterize in natural materials.

36 MATERIALS SCIENCE↗
DOE OSTI2020

Pilgrim : A thermal rate constant calculator and a chemical kinetics simulator

Pilgrim is a program written in Python and designed to use direct dynamics in the calculation of thermal rate constants of chemical reactions by the variational transition state theory (VTST), based on electronic structure calculations for the potential energy surface. Pilgrim can also simulate reaction mechanisms using kinetic Monte Carlo (KMC). For reaction processes with many elementary steps, the rate constant of each of these steps can be calculated by means of conventional transition state theory (TST) or by using VTST. In the current version, Pilgrim can evaluate thermal rates using the canonical version of reaction-path VTST, which requires the calculation of the minimum energy path (MEP) associated with each elementary step or transition structure. Multi-dimensional quantum effects can be incorporated through the small-curvature tunneling (SCT) approximation. These methodologies are available both for reactions involving a single structure of the reactants and the transition state and also for reactions involving flexible molecules with multiple conformations of the reactant and/or of the transition state. For systems with many conformers, the program can evaluate each of the elementary reaction rate constants by multipath canonical VTST or multi-structural VTST. Moreover, the reactant can be unimolecular or bimolecular. Torsional anharmonicity can be incorporated through either the MSTor or the Q2DTor programs. Dual-level calculations are also available in Pilgrim: automatic high-level single-point energies can be used to correct the energy of reactants, transition states, products, and MEP points using the interpolated single-point energies (ISPE) algorithm. When the rate constants of all the chemical processes of interest are known, by means of their calculation using Pilgrim or alternatively through analytical fits to the rate constants as functions of temperature, it is possible to simulate a multistep mechanism under specified laboratory conditions using KMC. Finally, this algorithm allows performing a kinetic simulation to monitor the evolution of each chemical species with time and obtain the product yields.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2020

Two-temperature warm dense hydrogen as a test of quantum protons driven by orbital-free density functional theory electronic forces

We consider a steady-state (but transient) situation in which a warm dense aggregate is a two-temperature system with equilibrium electrons at temperature Te, ions at Ti, and Te ≠ Ti. Such states are achievable by pump–probe experiments. For warm dense hydrogen in such a two-temperature situation, we investigate nuclear quantum effects (NQEs) on structure and thermodynamic properties, thereby delineating the limitations of ordinary ab initio molecular dynamics. We use path integral molecular dynamics (PIMD) simulations driven by orbital-free density functional theory (OFDFT) calculations with state-of-the-art noninteracting free-energy and exchange-correlation functionals for the explicit temperature dependence. We calibrate the OFDFT calculations against conventional (explicit orbitals) Kohn–Sham DFT. We find that when the ratio of the ionic thermal de Broglie wavelength to the mean interionic distance is larger than about 0.30, the ionic radial distribution function is meaningfully affected by the inclusion of NQEs. Moreover, NQEs induce a substantial increase in both the ionic and electronic pressures. This confirms the importance of NQEs for highly accurate equation-of-state data on highly driven hydrogen. For Te > 20 kK, increasing Te in the warm dense hydrogen has slight effects on the ionic radial distribution function and equation of state in the range of densities considered. In addition, we confirm that compared with thermostatted ring-polymer molecular dynamics, the primitive PIMD algorithm overestimates electronic pressures, a consequence of the overly localized ionic description from the primitive scheme.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2022

On the closedness and geometry of tensor network state sets

Tensor network states (TNS) are a powerful approach for the study of strongly correlated quantum matter. The curse of dimensionality is addressed by parametrizing the many-body state in terms of a network of partially contracted tensors. These tensors form a substantially reduced set of effective degrees of freedom. In practical algorithms, functionals like energy expectation values or overlaps are optimized over certain sets of TNS. Concerning algorithmic stability, it is important whether the considered sets are closed because, otherwise, the algorithms may approach a boundary point that is outside the TNS set and tensor elements diverge. Here we discuss the closedness and geometries of TNS sets, and we propose regularizations for optimization problems on non-closed TNS sets. We show that sets of matrix product states (MPS) with open boundary conditions, tree tensor network states, and the multiscale entanglement renormalization ansatz are always closed, whereas sets of translation-invariant MPS with periodic boundary conditions (PBC), heterogeneous MPS with PBC, and projected entangled pair states are generally not closed. The latter is done using explicit examples like the W state, states that we call two-domain states, and fine-grained versions thereof.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

Understanding the nature of mean-field semiclassical light-matter dynamics: An investigation of energy transfer, electron-electron correlations, external driving, and long-time detailed balance

Semiclassical electrodynamics (with quantum matter plus classical electrodynamics fields) is an appealing approach for studying light-matter interactions, especially for realistic molecular systems. However, there is no unique semiclassical scheme. On the one hand, intermolecular interactions can be described instantaneously by static two-body interactions connecting two different molecules, while a classical transverse E field acts as a spectator at short distance; we will call this Hamiltonian no. I. On the other hand, intermolecular interactions can also be described as effects that are mediated exclusively through a classical one-body Ε field without any quantum effects at all (assuming we ignore electronic exchange); we will call this Hamiltonian no. II. Moreover, one can also mix these two different Hamiltonians into a third, hybrid Hamiltonian, which preserves quantum electron-electron correlations for lower excitations but describes higher excitations in a mean-field way. To investigate which semiclassical scheme is most reliable for practical use, here we study the real-time dynamics of a minimalistic many-site model—a pair of identical two-level systems (TLSs)—undergoing either resonance energy transfer (RET) or collectively driven dynamics. While both approaches (no. 1 and no. 2) perform reasonably well when there is no strong external excitation, we find that no single approach is perfect for all conditions (and all methods fail when a strong external field is applied). Each method has its own distinct problems: Hamiltonian no. I performs best for RET but behaves in a complicated manner for driven dynamics; Hamiltonian no. II is always stable, but obviously fails for RET at short distances. One key finding is that, for externally driven dynamics, a full configuration-interaction description of Hamiltonian no. I strongly overestimates the long-time electronic energy, highlighting the not obvious fact that, if one plans to merge quantum molecules with classical light, a full, exact treatment of electron-electron correlations can actually lead to worse results than a simple mean-field electronic structure treatment. Future work will need to investigate (i) how these algorithms behave in the context of more than a pair of TLSs and (ii) whether or not these algorithms can be improved in general by including crucial aspects of spontaneous emission.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2020

Efficient compressive and Bayesian characterization of biphoton frequency spectra

Frequency-bin qudits constitute a promising tool for quantum information processing, but their high dimensionality can make for tedious characterization measurements. Here we introduce and compare compressive sensing and Bayesian mean estimation for recovering the spectral correlations of entangled photon pairs. Using a conventional compressive sensing algorithm, we reconstruct joint spectra with up to a 26-fold reduction in measurement time compared to the equivalent raster scan. Applying a custom Bayesian model to the same data, we then additionally realize reliable and consistent quantification of uncertainty. Finally, these efficient methods of biphoton characterization should advance our ability to use the high degree of parallelism and complexity afforded by frequency-bin encoding.

42 ENGINEERING↗
DOE OSTI2022

Enhancing scalability of a matrix-free eigensolver for studying many-body localization

We propose several techniques to enhance the parallel scalability of a matrix-free eigensolver designed for studying many-body localization (MBL) of quantum spin chain models with nearest-neighbor interactions and on-site disorder. This type of problem is computationally challenging because the dimension of the associated Hamiltonian matrix grows exponentially with respect to the number of spins L, and we need to average over different realizations of the random disorder to obtain relevant statistical behavior. For each disorder realization, we need to compute eigenvalues from different regions of the spectrum and their corresponding eigenvectors. In previous work, the interior eigenstates for a single eigenvalue problem are computed via the shift-and-invert Lanczos algorithm. Due to the extremely high memory footprint of the LU factorizations, this technique is not well suited for large L’s. For example, we need thousands of compute nodes on modern high performance computing infrastructures to go beyond L = 24. The matrix-free approach does not suffer from this memory bottleneck, however, its scalability is limited by a computation and communication load imbalance. To reduce this imbalance and to significantly enhance the scalability of the matrix-free eigensolver, we reorder the matrix and leverage the consistent space runtime, CSPACER. We also show its efficiency in managing irregular communication patterns at scale compared to optimized MPI non-blocking two-sided and one-sided RMA implementation variants. This effort enables us to study MBL for spin chains with a larger number of spins. The efficiency and effectiveness of the proposed algorithm is demonstrated by computing eigenstates on a massively parallel many-core high performance computer.

METIS↗
DOE OSTI2025

A scalable multidimensional fully implicit solver for Hall magnetohydrodynamics

We propose an optimally performant fully implicit algorithm for the Hall magnetohydrodynamics (HMHD) equations based on multigrid-preconditioned Jacobian-free Newton-Krylov methods. HMHD is a challenging system to solve numerically because it supports stiff fast dispersive waves. The preconditioner is formulated using an operator-split approximate block factorization (Schur complement), informed by physics insight. We use a vector-potential formulation (instead of a magnetic field one) to allow a clean segregation of the problematic $\nabla$ x $\nabla$ x operator in the electron Ohm's law subsystem. This segregation allows the formulation of an effective damped block-Jacobi smoother for multigrid. We demonstrate by analysis that our proposed block-Jacobi iteration is convergent and has the smoothing property. The resulting HMHD solver is verified linearly with wave propagation examples, and nonlinearly with the GEM challenge reconnection problem by comparison against another HMHD code. We demonstrate the excellent algorithmic and parallel performance of the algorithm up to 16384 MPI tasks in two dimensions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

Theoretical Insights for Improving the Schottky-Barrier Height at the Ga2O3/Pt Interface

In this work, we study the Schottky-barrier height (SBH) at the junction between ..beta..-Ga2O3 and platinum, a system of great importance for the next generation of high-power and high-temperature electronic devices. Specifically, we obtain interfacial atomic structures at different orientations using our structure-matching algorithm and compute their SBH using electronic structure calculations based on hybrid density-functional theory.

CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSICS,P↗
DOE OSTI2022

A Novel Approach to Quantum Circuit Partitioning

Quantum synthesis presents an effective method of circuit optimization, but scales exponentially with the number of qubits in the circuit. This problem can be addressed by partitioning the circuit into blocks with a limited number of qubits. Existing partitioning algorithms make large trade-offs to achieve either high speed or quality. We propose a method of circuit partitioning which is competitive with existing algorithms for both metrics. The proposed method is compared with two existing methods across common circuit architectures, matching an exhaustive solution in performance and a fast solution on time.

Clark, Joseph↗
DOE OSTI2024

HLS4ML Integration with QICK

The QICK (Quantum Instrumentation Control Kit) integration aims to enhance the readout of superconducting qubits by leveraging machine learning (ML) techniques. These techniques offer high accuracy, increased speed, and better state preservation for qubit readouts. The integration process employs neural network algorithms to optimize system performance and achieve high accuracy rates. The QICK board uses an FPGA, allowing for efficient real-time processing and high-performance execution of machine learning algorithms.

Ali, Mohamud↗
DOE OSTI2020

Pass-efficient methods for compression of high-dimensional turbulent flow data

The future of high-performance computing, specifically on future Exascale computers, will presumably see memory capacity and bandwidth fail to keep pace with data generated, for instance, from massively parallel partial differential equation (PDE) systems. Current strategies proposed to address this bottleneck entail the omission of large fractions of data, as well as the incorporation of in situ compression algorithms to avoid overuse of memory. To ensure that post-processing operations are successful, this must be done in a way that a sufficiently accurate representation of the solution is stored. Moreover, in situations where the input/output system becomes a bottleneck in analysis, visualization, etc., or the execution of the PDE solver is expensive, the number of passes made over the data must be minimized. In the interest of addressing this problem, this work focuses on the utility of pass-efficient, parallelizable, low-rank, matrix decomposition methods in compressing high-dimensional simulation data from turbulent flows. Additionally, a particular emphasis is placed on using coarse representation of the data – compatible with the PDE discretization grid – to accelerate the construction of the low-rank factorization. This includes the presentation of a novel single-pass matrix decomposition algorithm for computing the so-called interpolative decomposition. The methods are described extensively and numerical experiments on two turbulent channel flow data are performed. In the first (unladen) channel flow case, compression factors exceeding 400 are achieved while maintaining accuracy with respect to first- and second-order flow statistics. In the particle-laden case, compression factors of 100 are achieved and the compressed data is used to recover particle velocities. These results show that these compression methods can enable efficient computation of various quantities of interest in both the carrier and disperse phases.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗