Search NASA⌕ Search

SEARCH · Search NASA

Results for “Matrix exponential”

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 55 records · Page 3
All sourcesNASA NTRSDOE OSTI
DOE OSTI2020

The impact of nanoparticle softness on its tracer diffusion coefficient in all polymer nanocomposites

The diffusion of nanoparticles in a polymer matrix is an area of current interest. However, a complete understanding is still limited as it is often difficult to quantify the much slower motion of nanoparticles in a polymer matrix. To combat this problem, we have developed a protocol to measure the diffusion coefficient of soft nanoparticles in a linear polymer matrix. Recently developed synthetic control over soft nanoparticle structures combined with this protocol provides a pathway to separately elucidate the effects of the molecular weight and nanoparticle softness on its diffusive behavior. These results indicate that the nanoparticle softness and deformability dictate its motion. Increasing the cross-linking density of the nanoparticle for all molecular weights increases its hardness and suppresses its motion in the linear matrix. Additionally, the nanoparticle molecular weight dependence deviates from the exponential dependence for star polymers suggesting that these nanoparticles benefit from the cooperative motion of the matrix to open pathways for the nanoparticle. Finally, comparison of these experimentally determined values to the Stokes–Einstein theory demonstrates that the nanoparticles diffuse much slower than a hard sphere. This is interpreted to indicate that there exist additional interactions between the nanoparticle and polymer matrix that are not captured by Stokes–Einstein, including threading or entanglement of the linear chain with the nanoparticle.

Rostom, Sahar↗
DOE OSTI2020

Dual-cone variational calculation of the two-electron reduced density matrix

The computation of strongly correlated quantum systems is challenging because of its potentially exponential scaling in the number of electron configurations. Variational calculation of the two-electron reduced density matrix (2-RDM) without the many-electron wave function exploits the pairwise nature of the electronic Coulomb interaction to compute a lower bound on the ground-state energy with polynomial computational scaling. Recently, a dual-cone formulation of the variational 2-RDM calculation was shown to generate the ground-state energy, albeit not the 2-RDM, at a substantially reduced computational cost, especially for higher $\textit{N}$-representability conditions such as the T2 constraint. Here we generalize the dual-cone variational 2-RDM method to compute not only the ground-state energy but also the 2-RDM. The central result is that we can compute the 2-RDM from a generalization of the Hellmann-Feynman theorem. Specifically, we prove that in the Lagrangian formulation of the dual-cone optimization the 2-RDM is the Lagrange multiplier. Further, we apply the method to computing the energies and properties of strongly correlated electrons—including atomic charges, electron densities, dipole moments, and orbital occupations—in an illustrative hydrogen chain and the nitrogen-fixation catalyst FeMoco. The dual variational computation of the 2-RDM with T2 or higher N -representability conditions provides a polynomially scaling approach to strongly correlated molecules and materials with significant applications in atomic and molecular and condensed-matter chemistry and physics.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2023

Pauli transfer matrix direct reconstruction: channel characterization without full process tomography

Abstract We present a tomographic protocol for the characterization of multiqubit quantum channels. We discuss a specific class of input states, for which the set of Pauli measurements at the output of the channel directly relates to its Pauli transfer matrix components. We compare our results to those of standard quantum process tomography, showing an exponential reduction in the number of different experimental configurations required by a single matrix element extraction, while keeping the same number of shots. This paves the way for more efficient experimental implementations, whenever a selective knowledge of the Pauli transfer matrix is needed. We provide several examples and simulations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2022

Landau-Zener transition between two levels coupled to continuum

We report for a Landau-Zener transition in a two-level system, the probability for a particle, initially in the first level, i, to survive the transition and to remain in the first level, depends exponentially on the square of the tunnel matrix element between the two levels. This result remains valid when the second level, f, is broadened due to e.g. coupling to continuum (Akulin and Schleich (1992) [26]). If the level, i, is also coupled to continuum, albeit much weaker than the level f, a particle, upon surviving the transition, will eventually escape. However, for shorter times, the probability to find the particle in the level i after crossing f is enhanced due to the coupling to continuum. This, as shown in the present paper, is the result of a second-order process, which is an additional coupling between the levels. The underlying mechanism of this additional coupling is virtual tunneling from i into continuum followed by tunneling back into f.

36 MATERIALS SCIENCE↗
DOE OSTI2024

Electroweak three-body decays in the presence of two- and three-body bound states

Recently, formalism has been derived for studying electroweak transition amplitudes for three-body systems both in infinite and finite volumes. The formalism provides exact relations that the infinite-volume amplitudes must satisfy, as well as a relationship between physical amplitudes and finite-volume matrix elements, which can be constrained from lattice QCD calculations. This formalism poses additional challenges when compared with the analogous well-studied two-body equivalent one, including the necessary step of solving integral equations of singular functions. In this work, we provide some non-trivial analytical and numerical tests on the aforementioned formalism. In particular, we consider a case where the three-particle system can have three-body bound states as well as bound states in the two-body subsystem. For kinematics below the three-body threshold, we demonstrate that the scattering amplitudes satisfy unitarity. We also check that for these kinematics the finite-volume matrix elements are accurately described by the formalism for two-body systems up to exponentially suppressed corrections. Finally, we verify that in the case of the three-body bound state, the finite-volume matrix element is equal to the infinite-volume coupling of the bound state, up to exponentially suppressed errors.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2020

Quantum Joule expansion of one-dimensional systems

Here, we investigate the Joule expansion of nonintegrable quantum systems that contain bosons or spinless fermions in one-dimensional lattices. A barrier initially confines the particles to be in half of the system in a thermal state described by the canonical ensemble and is removed at time t = 0. We investigate the properties of the time-evolved density matrix, the diagonal ensemble density matrix, and the corresponding canonical ensemble density matrix with an effective temperature determined by the total energy conservation using exact diagonalization. The weights for the diagonal ensemble and the canonical ensemble match well for high initial temperatures that correspond to negative effective final temperatures after the expansion. At long times after the barrier is removed, the time-evolved Rényi entropy of subsystems bigger than half can equilibrate to the thermal entropy with exponentially small fluctuations. The time-evolved reduced density matrix at long times can be approximated by a thermal density matrix for small subsystems. Few-body observables, like the momentum distribution function, can be approximated by a thermal expectation of the canonical ensemble with strongly suppressed fluctuations. The negative effective temperatures for finite systems go to non-negative temperatures in the thermodynamic limit for bosons, but there is a true thermodynamic effect for fermions, which is confirmed by finite-temperature density matrix renormalization group calculations. We propose the Joule expansion as a way to dynamically create negative temperature states for fermion systems with repulsive interactions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2020

Exact two-body expansion of the many-particle wave function

Progress toward the solution of the strongly correlated electron problem has been stymied by the exponential complexity of the wave function. Previous work established an exact two-body exponential product expansion for the ground-state wave function. By developing a reduced density-matrix analog of Dalgarno-Lewis perturbation theory, we prove here that (i) the two-body exponential product expansion is rapidly and globally convergent with each operator representing an order of a renormalized perturbation theory, (ii) the energy of the expansion converges quadratically near the solution, and (iii) the expansion is exact for both ground and excited states. The two-body expansion offers a reduced parametrization of the many-particle wave function as well as the two-particle reduced density matrix with potential applications on both conventional and quantum computers for the study of strongly correlated quantum systems. In this work, we demonstrate the result with the exact solution of the contracted Schrödinger equation for the molecular chains H 4 and H 5 .

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2024

Efficient Unitary Designs from Random Sums and Permutations

A unitary k-design is an ensemble of unitaries that matches the first k moments of the Haar measure. In this work, we provide two efficient constructions of k-designs on n-qubits using new random matrix theory techniques. Our first construction is based on exponentiating sums of random i.i.d. Hermitian matrices and uses O(k2n2)-many gates. In the spirit of central limit theorems, we show that this random sum approximates the Gaussian Unitary Ensemble (GUE). We then show that the product of just two exponentiated GUE matrices is already approximately Haar random. Our second construction is based on products of exponentiated sums of random permutations and uses Õ(k poly (n)) many gates. The k dependence is optimal (up to polylogarithmic factors) and is inherited from the efficiency of existing k-wise independent permutations. Furthermore, replacing random permutations with quantum-secure pseudorandom permutations (PRPs), we also obtain a pseudorandom unitary (PRU) ensemble that is secure under nonadaptive queries. A central feature of both proofs is a new connection between the polynomial method in quantum query complexity and the large-dimension (N) expansion in random matrix theory. In particular, the first construction uses the polynomial method to control high moments of certain random matrix ensembles without requiring delicate Weingarten calculations. In doing so, we define and solve a moment problem on the unit circle, asking whether a finite number of equally weighted points can reproduce a given set of moments. In our second construction, the key step is to exhibit an orthonormal basis for irreducible representations of the partition algebra that has a low-degree large-N expansion. This allows us to show that the distinguishing probability is a low-degree rational polynomial of the dimension N.

algebra↗
DOE OSTI2022

Quantum-inspired method for solving the Vlasov-Poisson equations

Kinetic simulations of collisionless (or weakly collisional) plasmas using the Vlasov equation are often infeasible due to high-resolution requirements and the exponential scaling of computational cost with respect to dimension. Recently, it has been proposed that matrix product state (MPS) methods, a quantum-inspired but classical algorithm, can be used to solve partial differential equations with exponential speed-up, provided that the solution can be compressed and efficiently represented as a MPS within some tolerable error threshold. Here, in this work, we explore the practicality of MPS methods for solving the Vlasov-Poisson equations for systems with one coordinate in space and one coordinate in velocity, and find that important features of linear and nonlinear dynamics, such as damping or growth rates and saturation amplitudes, can be captured while compressing the solution significantly. Furthermore, by comparing the performance of different mappings of the distribution functions onto the MPS, we develop an intuition of the MPS representation and its behavior in the context of solving the Vlasov-Poisson equations, which will be useful for extending these methods to higher-dimensional problems.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2021

Microstate distinguishability, quantum complexity, and the eigenstate thermalization hypothesis

In this work, we use quantum complexity theory to quantify the difficulty of distinguishing eigenstates obeying the eigenstate thermalization hypothesis (ETH). After identifying simple operators with an algebra of low-energy observables and tracing out the complementary high-energy Hilbert space, the ETH leads to an exponential suppression of trace distance between the coarse grained eigenstates. Conversely, we show that an exponential hardness of distinguishing between states implies ETH-like matrix elements. Finally, the BBBV lower bound on the query complexity of Grover search then translates directly into a complexity-theoretic statement lower bounding the hardness of distinguishing these reduced states

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

Integration of EDWARD readout architecture in full-field fluorescence imaging detector

Data bandwidth, timing resolution and resource utilization in readouts of radiation detectors are a constant challenge. Event driven solutions are pushing against well-trenched framed solutions. The idea for an asynchronous readout architecture called EDWARD ( E vent- D riven W ith A ccess and R eset D ecoder) was presented at the TWEPP 2021 conference. Here we show the progress of our work which resulted in two chip prototypes. The first one, named 3FI65P1, is a full device with the analog pixel circuitry suited for full-field fluorescence imaging. It is already manufactured, and preliminary results are presented. Finally, the second chip, named EDWARD65P1, contains digital pulse generators with Poisson-exponential distribution in each pixel for extraction of the performance matrix of the EDWARD architecture alone.

47 OTHER INSTRUMENTATION↗
DOE OSTI2022

Exact matrix product state representation and convergence of a fully correlated electronic wavefunction in the infinite-basis limit

Here In this paper we present the exact representation of a fully correlated electronic wavefunction as the single-particle basis approaches completeness. It consists of a half-infinite chain of matrices of exponentially increasing size. The complete basis limit is illustrated numerically using the density-matrix renormalization-group method by computing the core-valence entanglement in the C 2 ground state in increasing subsets of cc-pVTZ and pVQZ bases until convergence is reached.

36 MATERIALS SCIENCE↗
DOE OSTI2024

Chaos in inhomogeneous neutrino fast flavor instability

In dense neutrino gases, the neutrino-neutrino coherent forward scattering gives rise to a complex flavor oscillation phenomenon not fully incorporated in simulations of neutron star mergers (NSM) and core collapse supernovae (CCSNe). Moreover, it has been proposed to be chaotic, potentially limiting our ability to predict neutrino flavor transformations in simulations. To address this issue, we explore how small flavor perturbations evolve in the nonlinear regime of the neutrino quantum kinetic equation within a narrow centimeter-scale region inside a NSM and a toy neutrino distribution. Our findings reveal that paths in the flavor state space of solutions with similar initial conditions diverge exponentially, exhibiting chaos. This inherent chaos makes the microscopic scales of neutrino flavor transformations unpredictable. However, the domain-averaged neutrino density matrix remains relatively stable, with chaos minimally affecting it. This particular property suggests that domain-averaged quantities remain reliable despite the exponential amplification of errors. Published by the American Physical Society 2024

Astronomy & Astrophysics↗
DOE OSTI2025

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 ↗
DOE OSTI2024

The accuracies of effective interactions in downfolding coupled-cluster approaches for small-dimensionality active spaces

Here, this paper evaluates the accuracy of the Hermitian form of the downfolding procedure using the double unitary coupled cluster (DUCC) ansatz on the benchmark systems of linear chains of hydrogen atoms, H6 and H8. The computational infrastructure employs the occupation-number-representation codes to construct the matrix representation of arbitrary second-quantized operators, allowing for the exact representation of exponentials of various operators. The tests demonstrate that external amplitudes from standard single-reference coupled cluster methods that sufficiently describe external (out-of-active-space) correlations reliably parameterize the Hermitian downfolded effective Hamiltonians in the DUCC formalism. The results show that this approach can overcome the problems associated with losing the variational character of corresponding energies in the corresponding SR-CC theories.

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

A Tensor Network-Based Quantum Algorithm for the Nonlinear 1D Burgers' Equation

In this work, we implement a tensor network-based quantum algorithm to solve unsteady, nonlinear partial differential equations (PDEs). The challenge lies in how to effectively represent, encode, process, and evolve the nonlinear system of PDEs on quantum computers. We will discuss the new techniques using the compressible 1-dimensional (1D) Burgers' equation as an example, because it represents the fundamental nonlinear feature and yet removes certain complexity in physics, allowing us to focus on the design of quantum algorithms. Previous attempts to solve nonlinear PDEs in quantum computation have often involved storing multiple copies of solutions or employing linearizations. Neither is practical due to exponential scaling with evolution time or insufficient solution accuracy. Our framework is based on matrix product states (MPSs) and matrix product operators (MPOs). For example, the velocity field is represented by MPS, whereas the linear and nonlinear spatial differential terms of the velocity field are processed by MPOs. Our primary focus herein is to verify and validate the various tensor network components of the algorithm using solutions obtained by the classical algorithms on high performance computing (HPC) architectures. We use a classical time marching method to demonstrate the functionality of the tensor network operations to model the PDE and their robustness with the time evolution of the system. Our classical simulation results demonstrate the utility of tensor network-based operations in modeling nonlinear PDEs and highlight the necessity as well as potential advantages of using quantum simulations for these techniques.

Gopalakrishnan Meena, Murali [ORNL] (ORCID:0000000↗
DOE OSTI2020

Quantum Fourier transform revisited

Summary The fast Fourier transform (FFT) is one of the most successful numerical algorithms of the 20th century and has found numerous applications in many branches of computational science and engineering. The FFT algorithm can be derived from a particular matrix decomposition of the discrete Fourier transform (DFT) matrix. In this paper, we show that the quantum Fourier transform (QFT) can be derived by further decomposing the diagonal factors of the FFT matrix decomposition into products of matrices with Kronecker product structure. We analyze the implication of this Kronecker product structure on the discrete Fourier transform of rank‐1 tensors on a classical computer. We also explain why such a structure can take advantage of an important quantum computer feature that enables the QFT algorithm to attain an exponential speedup on a quantum computer over the FFT algorithm on a classical computer. Further, the connection between the matrix decomposition of the DFT matrix and a quantum circuit is made. We also discuss a natural extension of a radix‐2 QFT decomposition to a radix‐ d QFT decomposition. No prior knowledge of quantum computing is required to understand what is presented in this paper. Yet, we believe this paper may help readers to gain some rudimentary understanding of the nature of quantum computing from a matrix computation point of view.

Camps, Daan↗
DOE OSTI2021

Activated penetrant dynamics in glass forming liquids: size effects, decoupling, slaving, collective elasticity and correlation with matrix compressibility

In this work, we employ the microscopic self-consistent cooperative hopping theory of penetrant activated dynamics in glass forming viscous liquids and colloidal suspensions to address new questions over a wide range of high matrix packing fractions and penetrant-to-matrix particle size ratios. The focus is on the mean activated relaxation time of smaller tracers in a hard sphere fluid of larger particle matrices. This quantity also determines the penetrant diffusion constant and connects directly with the structural relaxation time probed in an incoherent dynamic structure factor measurement. The timescale of the non-activated fast dissipative process is also studied and is predicted to follow power laws with the contact value of the penetrant–matrix pair correlation function and the penetrant–matrix size ratio. For long time penetrant relaxation, in the relatively lower packing fraction metastable regime the local cage barriers are dominant and matrix collective elasticity effects unimportant. As packing fraction and/or penetrant size grows, much higher barriers emerge and the collective elasticity associated with the correlated matrix dynamic displacement that facilitates penetrant hopping becomes important. This results in a non-monotonic variation with packing fraction of the degree of decoupling between the matrix and penetrant alpha relaxation times. The conditions required for penetrant hopping to become slaved to the matrix alpha process are determined, which depend mainly on the penetrant to matrix particle size ratio. By analyzing the absolute and relative importance of the cage and elastic barriers we establish a mechanistic understanding of the origin of the predicted exponential growth of the penetrant hopping time with size ratio predicted at very high packing fractions. A dynamics-thermodynamics power law connection between the penetrant activation barrier and the matrix dimensionless compressibility is established as a prediction of theory, with different scaling exponents depending on whether matrix collective elasticity effects are important. Quantitative comparisons with simulations of the penetrant relaxation time, diffusion constant, and transient localization length of tracers in dense colloidal suspensions and cold viscous liquids reveal good agreements. Multiple new predictions are made that are testable via future experiments and simulations. Extension of the theoretical approach to more complex systems of high experimental interest (nonspherical molecules, semiflexible polymers, crosslinked networks) interacting via variable hard or soft repulsions and/or short range attractions is possible, including under external deformation.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗