Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “quantum memory”

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 811 records · Page 45

Creation of Long-Term Coherent Optical Memory via Controlled Nonlinear Interactions in Bose-Einstein Condensates

A Bose-Einstein condensate confined in an optical dipole trap is used to generate long-term coherent memory for light, and storage times of more than 1 s are observed. Phase coherence of the condensate as well as controlled manipulations of elastic and inelastic atomic scattering processes are utilized to increase the storage fidelity by several orders of magnitude over previous schemes. The results have important applications for creation of long-distance quantum networks and for generation of entangled states of light and matter.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Computational Performance Bounds Prediction in Quantum Computing With Unstable Noise

Quantum computing has significantly advanced in recent years, boasting devices with hundreds of quantum bits (qubits), hinting at its potential quantum advantage over classical computing. Yet, noise in quantum devices poses significant barriers to realizing this supremacy. Understanding noise’s impact is crucial for reproducibility and application reuse; moreover, the next-generation quantum-centric supercomputing essentially requires efficient and accurate noise characterization to support system management (e.g., job scheduling), where ensuring correct functional performance (i.e., fidelity) of jobs on available quantum devices can even be higher-priority than traditional objectives. However, noise fluctuates over time, even on the same quantum device, which makes predicting the computational bounds for on-the-fly noise is vital. Noisy quantum simulation can offer insights but faces efficiency and scalability issues. Here, in this work, we propose a data-driven workflow, namely QuBound, to predict computational performance bounds. It decomposes historical performance traces to isolate noise sources and devises a novel encoder to embed circuit and noise information processed by a Long Short-Term Memory (LSTM) network. For evaluation, we compare QuBound with a state-of-the-art learning-based predictor, which only generates a single performance value instead of a bound. Experimental results show that the result of the existing approach falls outside of performance bounds, while all predictions from our QuBound with the assistance of performance decomposition better fit the bounds. Moreover, QuBound can efficiently produce practical bounds for various circuits with over 106 speedup over simulation; in addition, the range from QuBound is over 10× narrower than the state-of-the-art analytical approach.

Li, Jinyang [George Mason Univ., Fairfax, VA (Unit↗

Parallelization and checkpointing of GPU applications through program transformation

GPUs have emerged as a powerful tool for accelerating general-purpose applications. The availability of programming languages that makes writing general-purpose applications for running on GPUs tractable have consolidated GPUs as an alternative for accelerating general purpose applications. Among the areas that have benefited from GPU acceleration are: signal and image processing, computational fluid dynamics, quantum chemistry, and, in general, the High Performance Computing (HPC) Industry. In order to continue to exploit higher levels of parallelism with GPUs, multi-GPU systems are gaining popularity. In this context, single-GPU applications are parallelized for running in multi-GPU systems. Furthermore, multi-GPU systems help to solve the GPU memory limitation for applications with large application memory footprint. Parallelizing single-GPU applications has been approached by libraries that distribute the workload at runtime, however, they impose execution overhead and are not portable. On the other hand, on traditional CPU systems, parallelization has been approached through application transformation at pre-compile time, which enhances the application to distribute the workload at application level and does not have the issues of library-based approaches. Hence, a parallelization scheme for GPU systems based on application transformation is needed. Like any computing engine of today, reliability is also a concern in GPUs. GPUs are vulnerable to transient and permanent failures. Current checkpoint/restart techniques are not suitable for systems with GPUs. Checkpointing for GPU systems present new and interesting challenges, primarily due to the natural differences imposed by the hardware design, the memory subsystem architecture, the massive number of threads, and the limited amount of synchronization among threads. Therefore, a checkpoint/restart technique suitable for GPU systems is needed. The goal of this work is to exploit higher levels of parallelism and to develop support for application-level fault tolerance in applications using multiple GPUs. Our techniques reduce the burden of enhancing single-GPU applications to support these features. To achieve our goal, this work designs and implements a framework for enhancing a single-GPU OpenCL application through application transformation.

97 MATHEMATICS AND COMPUTING↗

VAN-DAMME: GPU-accelerated and symmetry-assisted quantum optimal control of multi-qubit systems

We present an open-source software package, VAN-DAMME (Versatile Approaches to Numerically Design, Accelerate, and Manipulate Magnetic Excitations), for massively-parallelized quantum optimal control (QOC) calculations of multi-qubit systems. To enable large QOC calculations, the VAN-DAMME software package utilizes symmetry-based techniques with custom GPU-enhanced algorithms. This combined approach allows for the simultaneous computation of hundreds of matrix exponential propagators that efficiently leverage the intra-GPU parallelism found in high-performance GPUs. In addition, to maximize the computational efficiency of the VAN-DAMME code, we carried out several extensive tests on data layout, computational complexity, memory requirements, and performance. These extensive analyses allowed us to develop computationally efficient approaches for evaluating complex-valued matrix exponential propagators based on Padé approximants. To assess the computational performance of our GPU-accelerated VAN-DAMME code, we carried out QOC calculations of systems containing 10 - 15 qubits, which showed that our GPU implementation is 18.4× faster than the corresponding CPU implementation. Our GPU-accelerated enhancements allow efficient calculations of multi-qubit systems, which can be used for the efficient implementation of QOC applications across multiple domains.

97 MATHEMATICS AND COMPUTING↗

Paradeisos: A perfect hashing algorithm for many-body eigenvalue problems

Here, we describe an essentially perfect hashing algorithm for calculating the position of an element in an ordered list, appropriate for the construction and manipulation of many-body Hamiltonian, sparse matrices. Each element of the list corresponds to an integer value whose binary representation reflects the occupation of single-particle basis states for each element in the many-body Hilbert space. The algorithm replaces conventional methods, such as binary search, for locating the elements of the ordered list, eliminating the need to store the integer representation for each element, without increasing the computational complexity. Combined with the “checkerboard” decomposition of the Hamiltonian matrix for distribution over parallel computing environments, this leads to a substantial savings in aggregate memory. While the algorithm can be applied broadly to many-body, correlated problems, we demonstrate its utility in reducing total memory consumption for a series of fermionic single-band Hubbard model calculations on small clusters with progressively larger Hilbert space dimension.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Stochastic, real-space, imaginary-time evaluation of third-order Feynman–Goldstone diagrams

A new, alternative set of interpretation rules of Feynman–Goldstone diagrams for many-body perturbation theory is proposed, which translates diagrams into algebraic expressions suitable for direct Monte Carlo integrations. A vertex of a diagram is associated with a Coulomb interaction (rather than a two-electron integral) and an edge with the trace of a Green's function in real space and imaginary time. With these, 12 diagrams of third-order many-body perturbation (MP3) theory are converted into 20-dimensional integrals, which are then evaluated by a Monte Carlo method. It uses redundant walkers for convergence acceleration and a weight function for importance sampling in conjunction with the Metropolis algorithm. The resulting Monte Carlo MP3 method has low-rank polynomial size dependence of the operation cost, a negligible memory cost, and a naturally parallel computational kernel, while reproducing the correct correlation energies of small molecules within a few mE{sub h} after 10{sup 6} Monte Carlo steps.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

High speed finite element simulations on the graphics card

A software package is developed to perform explicit time domain finite element simulations of ultrasonic propagation on the graphical processing unit, using Nvidia’s CUDA. Of critical importance for this problem is the arrangement of nodes in memory, allowing data to be loaded efficiently and minimising communication between the independently executed blocks of threads. The initial stage of memory arrangement is partitioning the mesh; both a well established ‘greedy’ partitioner and a new, more efficient ‘aligned’ partitioner are investigated. A method is then developed to efficiently arrange the memory within each partition. The technique is compared to a commercial CPU equivalent, demonstrating an overall speedup of at least 100 for a non-destructive testing weld model.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Mean-field diffusivities in passive scalar and magnetic transport in irrotational flows

Certain aspects of the mean-field theory of turbulent passive scalar transport and of mean-field electrodynamics are considered with particular emphasis on aspects of compressible fluids. It is demonstrated that the total mean-field diffusivity for passive scalar transport in a compressible flow may well be smaller than the molecular diffusivity. This is in full analogy to an old finding regarding the magnetic mean-field diffusivity in an electrically conducting turbulently moving compressible fluid. These phenomena occur if the irrotational part of the motion dominates the vortical part, the Peclet or magnetic Reynolds number is not too large, and, in addition, the variation of the flow pattern is slow. For both the passive scalar and the magnetic cases several further analytical results on mean-field diffusivities and related quantities found within the second-order correlation approximation are presented, as well as numerical results obtained by the test-field method, which applies independently of this approximation. Particular attention is paid to nonlocal and noninstantaneous connections between the turbulence-caused terms and the mean fields. Two examples of irrotational flows, in which interesting phenomena in the above sense occur, are investigated in detail. In particular, it is demonstrated that the decay of a mean scalar in a compressible fluid under the influence of these flows can be much slower than without any flow, and can be strongly influenced by the so-called memory effect, that is, the fact that the relevant mean-field coefficients depend on the decay rates themselves.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Efficient Hamiltonian encoding algorithms for extracting quantum control mechanism as interfering pathway amplitudes in the Dyson series

Hamiltonian encoding is a methodology for revealing the mechanism behind the dynamics governing controlled quantum systems. In this paper, following Mitra and Rabitz \cite{abhra_1}, we define mechanism via pathways of eigenstates that describe the evolution of the system, where each pathway is associated with a complex-valued amplitude corresponding to a term in the Dyson series. The evolution of the system is determined by the constructive and destructive interference of these pathway amplitudes. Pathways with similar attributes can be grouped together into pathway classes. The amplitudes of pathway classes are computed by modulating the Hamiltonian matrix elements and decoding the subsequent evolution of the system rather than by direct computation of the individual terms in the Dyson series. The original implementation of Hamiltonian encoding was computationally intensive and became prohibitively expensive in large quantum systems. This paper presents two new encoding algorithms that calculate the amplitudes of pathway classes by using techniques from graph theory and algebraic topology to exploit patterns in the set of allowed transitions, greatly reducing the number of matrix elements that need to be modulated. These new algorithms provide an exponential decrease in both computation time and memory utilization with respect to the Hilbert space dimension of the system. To demonstrate the use of these techniques, they are applied to two illustrative state-to-state transition problems.

Abrams, Erez [Princeton University, Massachusetts ↗

First-principles thermodynamics and defect kinetics guidelines for engineering a tailored RRAM device

Resistive Random Access Memories are among the most promising candidates for the next generation of non-volatile memory. Transition metal oxides such as HfOx and TaOx attracted a lot of attention due to their CMOS compatibility. Furthermore, these materials do not require the inclusion of extrinsic conducting defects since their operation is based on intrinsic ones (oxygen vacancies). Using Density Functional Theory, we evaluated the thermodynamics of the defects formation and the kinetics of diffusion of the conducting species active in transition metal oxide RRAM materials. The gained insights based on the thermodynamics in the Top Electrode, Insulating Matrix and Bottom Electrode and at the interfaces are used to design a proper defect reservoir, which is needed for a low-energy reliable switching device. The defect reservoir has also a direct impact on the retention of the Low Resistance State due to the resulting thermodynamic driving forces. The kinetics of the diffusing conducting defects in the Insulating Matrix determine the switching dynamics and resistance retention. The interface at the Bottom Electrode has a significant impact on the low-current operation and long endurance of the memory cell. Our first-principles findings are confirmed by experimental measurements on fabricated RRAM devices.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Hybrid algorithms in quantum Monte Carlo

With advances in algorithms and growing computing powers, quantum Monte Carlo (QMC) methods have become a leading contender for high accuracy calculations for the electronic structure of realistic systems. The performance gain on recent HPC systems is largely driven by increasing parallelism: the number of compute cores of a SMP and the number of SMPs have been going up, as the Top500 list attests. However, the available memory as well as the communication and memory bandwidth per element has not kept pace with the increasing parallelism. This severely limits the applicability of QMC and the problem size it can handle. OpenMP/MPI hybrid programming provides applications with simple but effective solutions to overcome efficiency and scalability bottlenecks on large-scale clusters based on multi/many-core SMPs. We discuss the design and implementation of hybrid methods in QMCPACK and analyze its performance on current HPC platforms characterized by various memory and communication hierarchies.

Esler, Kenneth P↗

Automating Rabi & Ramsey Measurements via ML

As quantum computers scale up, the manual process of qubit tune-up becomes increasingly impractical due to its time-consuming and repetitive nature. While existing research has explored some automation techniques, many models remain underutilized for this purpose. This research aims to answer the question: can qubit tune-up be automated using the Long Short-Term Memory (LSTM) model? For the purposes of this project, only the rabi and ramsey measurement cycle was automated. These measurements are used to fine-tune a rough qubit frequency by repeating them until the optimal qubit frequency is obtained. The LSTM model uses the qubit frequency at one time step to forecast the qubit frequency at the next time step. A rabi-ramsey simulation was made to fabricate a dataset to train and test the LSTM model. As the model was trained, the error of the model decreased. Although there wasn t enough training data to generate perfect predictions, this shows it is possible to utilize forecasting models in automating the tune-up process.

Roberts, Rachel↗

Automating Rabi & Ramsey Measurements via Machine Learning

As quantum computers scale up, the manual process of qubit tune-up becomes increasingly impractical due to its time-consuming and repetitive nature. While existing research has explored some automation techniques, many models remain underutilized for this purpose. This research aims to answer the question: can qubit tune-up be automated using the Long Short-Term Memory (LSTM) model? For the purposes of this project, only the rabi and ramsey measurement cycle was automated. These measurements are used to fine-tune a rough qubit frequency by repeating them until the optimal qubit frequency is obtained. The LSTM model uses the qubit frequency at one time step to forecast the qubit frequency at the next time step. A rabi-ramsey simulation was made to fabricate a dataset to train and test the LSTM model. As the model was trained, the error of the model decreased. Although there wasn't enough training data to generate perfect predictions, this shows it is possible to utilize forecasting models in automating the tune-up process.

Roberts, Rachel↗

A Remark on Nonclassical Diffusion Equations with Memory

The nonclassical diffusion equation with hereditary memory u{sub t}−Δu{sub t}−Δu−∫{sub 0}{sup ∞}κ(s)Δu(t−s) ds+φ(u)=f on a 3D bounded domain is considered, for a very general class of memory kernels κ. Setting the problem both in the classical past history framework and in the more recent minimal state one, the related solution semigroups are shown to possess finite-dimensional regular exponential attractors.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Adaptive spectral solution method for the Landau and Lenard-Balescu equations

In this paper, we present an adaptive spectral method for solving the Landau/Fokker-Planck equation for electron-ion systems. The heart of the algorithm is an expansion in Laguerre polynomials, which has several advantages, including automatic conservation of both energy and particles without the need for any special discretization or time-stepping schemes. One drawback of such an expansion is the O(N 3 ) memory requirement, where N is the number of polynomials used. This can impose an inconvenient limit in cases of practical interest, such as when two particle species have widely separated temperatures. The algorithm we describe here addresses this problem by periodically re-projecting the solution onto a judicious choice of new basis functions that are still Laguerre polynomials but have arguments adapted to the current physical conditions. This results in a reduction in the number of polynomials needed, at the expense of increased solution time. Because the equations are solved with little difficulty, this added time is not of much concern compared to the savings in memory. To demonstrate the algorithm, we solve several relaxation problems that could not be computed with the spectral method without re-projection. Another major advantage of this method is that it can be used for collision operators more complicated than that of the Landau equation, and we demonstrate this here by using it to solve the non-degenerate quantum Lenard-Balescu (QLB) equation for a hydrogen plasma. We conclude with some comparisons of temperature relaxation problems solved with the latter equation and the Landau equation with a Coulomb logarithm inspired by the properties of the QLB operator. We find that with this choice of Coulomb logarithm, there is little difference between using the two equations for these particular systems.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

The role of water in resistive switching in graphene oxide

The resistive switching processes are investigated at the nano-scale in graphene oxide. The modification of the material resistivity is driven by the electrical stimulation with the tip of atomic force microscope. The presence of water in the atmosphere surrounding graphene oxide is found to be a necessary condition for the occurrence of the switching effect. In consequence, the switching is related to an electrochemical reduction. Presented results suggest that by changing the humidity level the in-plane resolution of data storage process can be controlled. These findings are essential when discussing the concept of graphene based resistive random access memories.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Unipolar resistive switching in metal oxide/organic semiconductor non-volatile memories as a critical phenomenon

Diodes incorporating a bilayer of an organic semiconductor and a wide bandgap metal oxide can show unipolar, non-volatile memory behavior after electroforming. The prolonged bias voltage stress induces defects in the metal oxide with an areal density exceeding 10{sup 17 }m{sup −2}. We explain the electrical bistability by the coexistence of two thermodynamically stable phases at the interface between an organic semiconductor and metal oxide. One phase contains mainly ionized defects and has a low work function, while the other phase has mainly neutral defects and a high work function. In the diodes, domains of the phase with a low work function constitute current filaments. The phase composition and critical temperature are derived from a 2D Ising model as a function of chemical potential. The model predicts filamentary conduction exhibiting a negative differential resistance and nonvolatile memory behavior. The model is expected to be generally applicable to any bilayer system that shows unipolar resistive switching.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

On the origin of resistive switching volatility in Ni/TiO{sub 2}/Ni stacks

Resistive switching and resistive random access memories have attracted huge interest for next generation nonvolatile memory applications, also thought to be able to overcome flash memories limitations when arranged in crossbar arrays. A cornerstone of their potential success is that the toggling between two distinct resistance states, usually a High Resistive State (HRS) and a Low Resistive State (LRS), is an intrinsic non-volatile phenomenon with the two states being thermodynamically stable. TiO{sub 2} is one of the most common materials known to support non-volatile RS. In this paper, we report a volatile resistive switching in a titanium dioxide thin film sandwiched by two nickel electrodes. The aim of this work is to understand the underlying physical mechanism that triggers the volatile effect, which is ascribed to the presence of a NiO layer at the bottom interface. The NiO layer alters the equilibrium between electric field driven filament formation and thermal enhanced ion diffusion, resulting in the volatile behaviour. Although the volatility is not ideal for non-volatile memory applications, it shows merit for access devices in crossbar arrays due to its high LRS/HRS ratio, which are also briefly discussed.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗