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 829 records · Page 46

Coupling constant metamorphosis, the Staeckel transform and superintegrability

This paper is dedicated to the memory of Marcos Moshinsky. In this paper, we discuss the important role that coupling constant metamorphosis (CCM) and the Staeckel transform have played in the analysis of superintegrable systems. We explain the relation between the two and in particular show that they coincide when transforming between second-order superintegrable systems. Unlike in the case of second-order superintegrability, the quantum analog of CCM has only been proven for a subclass of systems with integrals of a specific form. We give the proof and as an application show the mapping of a family of superintegrable deformations of the simple harmonic oscillator to an associated family of superintegrable deformations of the Kepler-Coulomb potential.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Generalized quantum master equations can improve the accuracy of semiclassical predictions of multitime correlation functions

Multitime quantum correlation functions are central objects in physical science, offering a direct link between the experimental observables and the dynamics of an underlying model. While experiments such as 2D spectroscopy and quantum control can now measure such quantities, the accurate simulation of such responses remains computationally expensive and sometimes impossible, depending on the system’s complexity. A natural tool to employ is the generalized quantum master equation (GQME), which can offer computational savings by extending reference dynamics at a comparatively trivial cost. However, dynamical methods that can tackle chemical systems with atomistic resolution, such as those in the semiclassical hierarchy, often suffer from poor accuracy, limiting the credence one might lend to their results. By combining work on the accuracy-boosting formulation of semiclassical memory kernels with recent work on the multitime GQME, here we show for the first time that one can exploit a multitime semiclassical GQME to dramatically improve both the accuracy of coarse mean-field Ehrenfest dynamics and obtain orders of magnitude efficiency gains.

Chemistry↗

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: is qubit tune-up able to 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↗

Density Matrix Quantum Circuit Simulation via the BSP Machine on Modern GPU Clusters

As quantum computers evolve, simulations of quantum programs on classical computers will be essential in validating quantum algorithms, understanding the effect of system noise, and design applications for future quantum computers. In this paper, we propose a novel multi-GPU programming model called MG-BSP that constructs a virtual BSP machine on top of modern multi-GPU platforms, and tweak the programming model to build a multi-GPU density matrix quantum simulator. We propose and evaluated a new formulation minimizing communication and prove that the transformation conserves original semantics when noise is introduced. We build the tool-chain to support quantum assembly open standard, synthesize testing quantum circuit, and enable ultra-deep quantum simulation. We evaluated our design on four state-of-the-art multi-GPU platforms including the latest DGX-1 and DGX-2 systems. We demonstrate simulation of 1 million gates in 94 minutes, far deeper circuits than has been demonstrated in prior work. A roofline-model analysis show that we have reached near-optimal performance under memory bound.

Li, Ang↗

Data decomposition of Monte Carlo particle transport simulations via tally servers

An algorithm for decomposing large tally data in Monte Carlo particle transport simulations is developed, analyzed, and implemented in a continuous-energy Monte Carlo code, OpenMC. The algorithm is based on a non-overlapping decomposition of compute nodes into tracking processors and tally servers. The former are used to simulate the movement of particles through the domain while the latter continuously receive and update tally data. A performance model for this approach is developed, suggesting that, for a range of parameters relevant to LWR analysis, the tally server algorithm should perform with minimal overhead on contemporary supercomputers. An implementation of the algorithm in OpenMC is then tested on the Intrepid and Titan supercomputers, supporting the key predictions of the model over a wide range of parameters. We thus conclude that the tally server algorithm is a successful approach to circumventing classical on-node memory constraints en route to unprecedentedly detailed Monte Carlo reactor simulations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A second-order distributed memory parallel fast sweeping method for the Eikonal equation

The Eikonal equation is used to calculate wave propagation and distance fields, and due to its complexity requires numerical treatment for its solution. In this work, we present a second-order distributed memory parallel fast sweeping method. The second-order solution switches on a two-point stencil when two upwind points are available, and reverts to first-order otherwise. In all examples, the second-order method improves the solution over the first-order, allowing for significant savings in memory while achieving the same accuracy. Parallelization over distributed memory saw good weak scaling with optimal convergence. The computational time for second-order was approximately 2.5 times slower than first-order, where the largest amount of mesh points ran on 144 cores (512 GB) was ≈20 billion. The savings in memory from the second-order method combined with the distributed memory algorithm result in the ability to solve problems much larger than are possible with the serial first-order method.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Leading-order gravitational radiation to all spin orders

Starting with on-shell amplitudes compatible with the scattering of Kerr black holes up to Compton-amplitude contact terms, we produce the gravitational waveform and memory effect including spin at their leading post-Minkowskian orders to all orders in the spins of both scattering objects. For the memory effect, we present results at next-to-leading order as well, finding a closed form for all spin orders when the spins are anti-aligned and equal in magnitude. Considering instead generically oriented spins, we produce the next-to-leading-order memory to sixth order in spin. Compton-amplitude contact terms up to sixth order in spin are included throughout our analysis.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Optimizing the Four-Index Integral Transform Using Data Movement Lower Bounds Analysis

The four-index integral transform is a fundamental and computationally demanding calculation used in many computational chemistry suites such as NWChem. It transforms a four-dimensional tensor from an atomic basis to a molecular basis. This transformation is most efficiently implemented as a sequence of four tensor contractions that each contract a four-dimensional tensor with a two-dimensional transformation matrix. Differing degrees of permutation symmetry in the intermediate and final tensors in the sequence of contractions cause intermediate tensors to be much larger than the final tensor and limit the number of electronic states in the modeled systems. Loop fusion, in conjunction with tiling, can be very effective in reducing the total space requirement, as well as data movement. However, the large number of possible choices for loop fusion and tiling, and data/computation distribution across a parallel system, make it challenging to develop an optimized parallel implementation for the four-index integral transform. We develop a novel approach to address this problem, using lower bounds modeling of data movement complexity. We establish relationships between available aggregate physical memory in a parallel computer system and ineffective fusion configurations, enabling their pruning and consequent identification of effective choices and a characterization of optimality criteria. This work has resulted in the development of a significantly improved implementation of the four-index transform that enables higher performance and the ability to model larger electronic systems than the current implementation in the NWChem quantum chemistry software suite.

Rajbhandari, Samyam↗

ELSI: A unified software interface for Kohn–Sham electronic structure solvers

Solving the electronic structure from a generalized or standard eigenproblem is often the bottleneck in large scale calculations based on Kohn-Sham density-functional theory. This problem must be addressed by essentially all current electronic structure codes, based on similar matrix expressions, and by high-performance computation. We here present a unified software interface, ELSI, to access different strategies that address the Kohn-Sham eigenvalue problem. Currently supported algorithms include the dense generalized eigensolver library ELPA, the orbital minimization method implemented in libOMM, and the pole expansion and selected inversion (PEXSI) approach with lower computational complexity for semilocal density functionals. The ELSI interface aims to simplify the implementation and optimal use of the different strategies, by offering (a) a unified software framework designed for the electronic structure solvers in Kohn-Sham density-functional theory; (b) reasonable default parameters for a chosen solver; (c) automatic conversion between input and internal working matrix formats, and in the future (d) recommendation of the optimal solver depending on the specific problem. As a result, comparative benchmarks are shown for system sizes up to 11,520 atoms (172,800 basis functions) on distributed memory supercomputing architectures.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

The Random Ray Method for neutral particle transport

A new approach to solving partial differential equations (PDEs) based on the method of characteristics (MOC) is presented. The Random Ray Method (TRRM) uses a stochastic rather than deterministic discretization of characteristic tracks to integrate the phase space of a problem. TRRM is potentially applicable in a number of transport simulation fields where long characteristic methods are used, such as neutron transport and gamma ray transport in reactor physics as well as radiative transfer in astrophysics. In this study, TRRM is developed and then tested on a series of exemplar reactor physics benchmark problems. The results show extreme improvements in memory efficiency compared to deterministic MOC methods, while also reducing algorithmic complexity, allowing for a sparser computational grid to be used while maintaining accuracy.

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↗

High-temperature thermoelectric transport at small scales: Thermal generation, transport and recombination of minority carriers

Thermoelectric transport in semiconductors is usually considered under small thermal gradients and when it is dominated by the role of the majority carriers. Not much is known about effects that arise under the large thermal gradients that can be established in high-temperature, small-scale electronic devices. Here, we report a surprisingly large asymmetry in self-heating of symmetric highly doped silicon microwires with the hottest region shifted along the direction of minority carrier flow. We show that at sufficiently high temperatures and strong thermal gradients (,1 K/nm), energy transport by generation, transport and recombination of minority carriers along these structures becomes very significant and overcomes convective energy transport by majority carriers in the opposite direction. These results are important for high-temperature nanoelectronics such as emerging phase-change memory devices which also employ highly doped semiconducting materials and in which local temperatures reach ,1000 K and thermal gradients reach ,10–100 K/nm.

APPLIED PHYSICS↗

The joint space-time statistics of macroweather precipitation, space-time statistical factorization and macroweather models

Over the range of time scales from about 10 days to 30–100 years, in addition to the familiar weather and climate regimes, there is an intermediate “macroweather” regime characterized by negative temporal fluctuation exponents: implying that fluctuations tend to cancel each other out so that averages tend to converge. We show theoretically and numerically that macroweather precipitation can be modeled by a stochastic weather-climate model (the Climate Extended Fractionally Integrated Flux, model, CEFIF) first proposed for macroweather temperatures and we show numerically that a four parameter space-time CEFIF model can approximately reproduce eight or so empirical space-time exponents. In spite of this success, CEFIF is theoretically and numerically difficult to manage. We therefore propose a simplified stochastic model in which the temporal behavior is modeled as a fractional Gaussian noise but the spatial behaviour as a multifractal (climate) cascade: a spatial extension of the recently introduced ScaLIng Macroweather Model, SLIMM. Both the CEFIF and this spatial SLIMM model have a property often implicitly assumed by climatologists that climate statistics can be “homogenized” by normalizing them with the standard deviation of the anomalies. Physically, it means that the spatial macroweather variability corresponds to different climate zones that multiplicatively modulate the local, temporal statistics. This simplified macroweather model provides a framework for macroweather forecasting that exploits the system's long range memory and spatial correlations; for it, the forecasting problem has been solved. We test this factorization property and the model with the help of three centennial, global scale precipitation products that we analyze jointly in space and in time.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Discrete photon implementation for plasma simulations

The self-produced light emission from pulsed plasma discharges and its impact on plasma development are challenging to characterize through simulation and modeling, chiefly due to the large number of radiating species and limited computer memory. Often, photo-processes, such as photo-ionization or photo-emission of electrons, are implemented through over-simplifying approximations or neglected altogether. Here, a method applicable to plasma simulations is implemented in a Particle-in-Cell /Monte Carlo Collision model, which is capable of discretely tracking photons and their corresponding wavelengths. Combined with the appropriate cross sections or quantum yields, a wavelength dependent model for photo-ionization or photo-emission may be implemented. Additionally, by resolving the wavelengths of each photon, an emission spectrum for a region of interest may be generated. Simulations for a pure nitrogen environment reveal that the calculated emission profile of the second positive system agrees well with the experimental spectrum of a pulsed, nanosecond discharge in the same spectral region.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Schwinger-Dyson equations in large-N quantum field theories and nonlinear random processes

We propose a stochastic method for solving Schwinger-Dyson equations in large-N quantum field theories. Expectation values of single-trace operators are sampled by stationary probability distributions of the so-called nonlinear random processes. The set of all the histories of such processes corresponds to the set of all planar diagrams in the perturbative expansions of the expectation values of singlet operators. We illustrate the method on examples of the matrix-valued scalar field theory and the Weingarten model of random planar surfaces on the lattice. For theories with compact field variables, such as sigma models or non-Abelian lattice gauge theories, the method does not converge in the physically most interesting weak-coupling limit. In this case one can absorb the divergences into a self-consistent redefinition of expansion parameters. A stochastic solution of the self-consistency conditions can be implemented as a 'memory' of the random process, so that some parameters of the process are estimated from its previous history. We illustrate this idea on the two-dimensional O(N) sigma model. The extension to non-Abelian lattice gauge theories is discussed.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

A Communication-Optimal Framework for Contracting Distributed Tensors

Tensor contractions are extremely compute intensive generalized matrix multiplication operations encountered in many computational science fields, such as quantum chemistry and nuclear physics. Unlike distributed matrix multiplication, which has been extensively studied, limited work has been done in understanding distributed tensor contractions. In this paper, we characterize distributed tensor contraction algorithms on torus networks. We develop a framework with three fundamental communication operators to generate communication-efficient contraction algorithms for arbitrary tensor contractions. We show that for a given amount of memory per processor, our framework is communication optimal for all tensor contractions. We demonstrate performance and scalability of our framework on up to 262,144 cores of BG/Q supercomputer using five tensor contraction examples.

communication efficiency↗