Search NASA⌕ Search

SEARCH · Search NASA

Results for “subspace correction methods”

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 37 records · Page 2

Uniformly decaying subspaces for error-mitigated quantum computation

Here, we present a general condition to obtain subspaces that decay uniformly in a system governed by the Lindblad master equation and use them to perform error-mitigated quantum computation. The expectation values of dynamics encoded in such subspaces are unbiased estimators of noise-free expectation values. In analogy to the decoherence free subspaces which are left invariant by the action of Lindblad operators, we show that the uniformly decaying subspaces are left invariant (up to orthogonal terms) by the action of the dissipative part of the Lindblad equation. We apply our theory to a system of qubits and qudits undergoing relaxation with varying decay rates and show that such subspaces can be used to eliminate bias up to first-order variations in the decay rates without requiring full knowledge of noise. Since such a bias cannot be corrected through standard symmetry verification, our method can improve error mitigation in dual-rail qubits and, given partial knowledge of noise, can perform better than probabilistic error cancellation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Monte Carlo analysis of critical phenomenon of the Ising model on memory stabilizer structures

We calculate the critical temperature of the Ising model on a set of graphs representing a concatenated three-bit error-correction code. The graphs are derived from the stabilizer formalism used in quantum error correction. The stabilizer for a subspace is defined as the group of Pauli operators whose eigenvalues are +1 on the subspace. The group can be generated by a subset of operators in the stabilizer, and the choice of generators determines the structure of the graph. The Wolff algorithm, together with the histogram method and finite-size scaling, is used to calculate both the critical temperature and the critical exponents of each structure. The simulations show that the choice of stabilizer generators, both the number and the geometry, has a large effect on the critical temperature.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Schrieffer-Wolff transformation for quantum many-body systems

The Schrieffer-Wolff (SW) method is a version of degenerate perturbation theory in which the low-energy effective Hamiltonian H{sub eff} is obtained from the exact Hamiltonian by a unitary transformation decoupling the low-energy and high-energy subspaces. We give a self-contained summary of the SW method with a focus on rigorous results. We begin with an exact definition of the SW transformation in terms of the so-called direct rotation between linear subspaces. From this we obtain elementary proofs of several important properties of H{sub eff} such as the linked cluster theorem. We then study the perturbative version of the SW transformation obtained from a Taylor series representation of the direct rotation. Our perturbative approach provides a systematic diagram technique for computing high-order corrections to H{sub eff}. We then specialize the SW method to quantum spin lattices with short-range interactions. We establish unitary equivalence between effective low-energy Hamiltonians obtained using two different versions of the SW method studied in the literature. Finally, we derive an upper bound on the precision up to which the ground state energy of the nth-order effective Hamiltonian approximates the exact ground state energy. - Highlights: > The Schrieffer-Wolff transformation is specialized to quantum spin lattices with short-range interactions. > We provide a diagram technique for computing high-order corrections to the effective low-energy Hamiltonian. > We derive a rigorous bound on the error up to which the nth-order effective low-energy dynamics approximates the exact dynamics.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Hydrogen-like atom in a superstrong magnetic field: Photon emission and relativistic energy level shift

Following our previous work, additional arguments are presented that in superstrong magnetic fields B ≫ (Zα){sup 2}B{sub 0}, B{sub 0} = m{sup 2}c{sup 3}/eħ ≈ 4.41 × 10{sup 13} G, the Dirac equation and the Schrödinger equation for an electron in the nucleus field following from it become spatially one-dimensional with the only z coordinate along the magnetic field, “Dirac” spinors become two-component, while the 2 × 2 matrices operate in the {0; 3} subspace. Based on the obtained solution of the Dirac equation and the known solution of the “onedimensional” Schrödinger equation by ordinary QED methods extrapolated to the {0; 3} subspace, the probability of photon emission by a “one-dimensional” hydrogen-like atom is calculated, which, for example, for the Lyman-alpha line differs almost twice from the probability in the “three-dimensional” case. Similarly, despite the coincidence of nonrelativistic energy levels, the calculated relativistic corrections of the order of (Zα){sup 4} substantially differ from corrections in the absence of a magnetic field. A conclusion is made that, by analyzing the hydrogen emission spectrum and emission spectra at all, we can judge in principle about the presence or absence of superstrong magnetic fields in the vicinity of magnetars (neutron stars and probably brown dwarfs). Possible prospects of applying the proposed method for calculations of multielectron atoms are pointed out and the possibility of a more reliable determination of the presence of superstrong magnetic fields in magnetars by this method is considered.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Resolving all-order method convergence problems for atomic physics applications

The development of the relativistic all-order method where all single, double, and partial triple excitations of the Dirac-Hartree-Fock wave function are included to all orders of perturbation theory led to many important results for the study of fundamental symmetries, development of atomic clocks, ultracold atom physics, and others, as well as provided recommended values of many atomic properties critically evaluated for their accuracy for a large number of monovalent systems. This approach requires iterative solutions of the linearized coupled-cluster equations leading to convergence issues in some cases where correlation corrections are particularly large or lead to an oscillating pattern. Moreover, these issues also lead to similar problems in the configuration-interaction (CI)+all-order method for many-particle systems. In this work, we have resolved most of the known convergence problems by applying two different convergence stabilizer methods, namely, reduced linear equation and direct inversion of iterative subspace. Examples are presented for B, Al, Zn{sup +}, and Yb{sup +}. Solving these convergence problems greatly expands the number of atomic species that can be treated with the all-order methods and is anticipated to facilitate many interesting future applications.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Perturbative readout-error mitigation for near-term quantum computers

Readout errors on near-term quantum computers can introduce significant error to the empirical probability distribution sampled from the output of a quantum circuit. These errors can be mitigated by classical postprocessing given the access of an experimental response matrix that describes the error associated with the measurement of each computational basis state. However, the resources required to characterize a complete response matrix and to compute the corrected probability distribution scale exponentially with the number of qubits, n . In this work, we modify standard matrix inversion techniques using perturbative approximations with significantly reduced complexity and bounded error when the likelihood of high-order bit-flip events is strongly suppressed. Given a characteristic error rate q , we discuss a method to recover the probability of the all-zeros bit string p 0 by sampling only a small subspace of the response matrix before inverting readout error, resulting in a relative speedup of poly [ 2 n / ( n w ) ] , which we motivate using a simplified error model for which the approximation incurs only O ( q w ) error for some integer w . We then provide a generalized technique to efficiently recover full output distributions with O ( q w ) error in the perturbative limit. These approximate techniques for readout-error correction may greatly accelerate near-term quantum computing applications.

97 MATHEMATICS AND COMPUTING↗

Interpreting the Coulomb-field approximation for generalized-Born electrostatics using boundary-integral equation theory.

The importance of molecular electrostatic interactions in aqueous solution has motivated extensive research into physical models and numerical methods for their estimation. The computational costs associated with simulations that include many explicit water molecules have driven the development of implicit-solvent models, with generalized-Born (GB) models among the most popular of these. In this paper, we analyze a boundary-integral equation interpretation for the Coulomb-field approximation (CFA), which plays a central role in most GB models. This interpretation offers new insights into the nature of the CFA, which traditionally has been assessed using only a single point charge in the solute. The boundary-integral interpretation of the CFA allows the use of multiple point charges, or even continuous charge distributions, leading naturally to methods that eliminate the interpolation inaccuracies associated with the Still equation. This approach, which we call boundary-integral-based electrostatic estimation by the CFA (BIBEE/CFA), is most accurate when the molecular charge distribution generates a smooth normal displacement field at the solute-solvent boundary, and CFA-based GB methods perform similarly. Conversely, both methods are least accurate for charge distributions that give rise to rapidly varying or highly localized normal displacement fields. Supporting this analysis are comparisons of the reaction-potential matrices calculated using GB methods and boundary-element-method (BEM) simulations. An approximation similar to BIBEE/CFA exhibits complementary behavior, with superior accuracy for charge distributions that generate rapidly varying normal fields and poorer accuracy for distributions that produce smooth fields. This approximation, BIBEE by preconditioning (BIBEE/P), essentially generates initial guesses for preconditioned Krylov-subspace iterative BEMs. Thus, iterative refinement of the BIBEE/P results recovers the BEM solution; excellent agreement is obtained in only a few iterations. The boundary-integral-equation framework may also provide a means to derive rigorous results explaining how the empirical correction terms in many modern GB models significantly improve accuracy despite their simple analytical forms.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

High-order matrix-free incompressible flow solvers with GPU acceleration and low-order refined preconditioners

In this work, we present a matrix-free flow solver for high-order finite element discretizations of the incompressible Navier-Stokes and Stokes equations with GPU acceleration. For high polynomial degrees, assembling the matrix for the linear systems resulting from the finite element discretization can be prohibitively expensive, both in terms of computational complexity and memory. For this reason, it is necessary to develop matrix-free operators and preconditioners, which can be used to efficiently solve these linear systems without access to the matrix entries themselves. The matrix-free operator evaluations utilize GPU-accelerated sum-factorization techniques to minimize memory movement and maximize throughput. The preconditioners developed in this work are based on a low-order refined methodology with parallel subspace corrections, as described for diffusion problems in [1]. The saddle-point Stokes system is solved using block-preconditioning techniques, which are robust in mesh size, polynomial degree, time step, and viscosity. For the incompressible Navier-Stokes equations, we make use of projection (fractional step) methods, which require Helmholtz and Poisson solves at each time step. The performance of our flow solvers is assessed on several benchmark problems in two and three spatial dimensions.

97 MATHEMATICS AND COMPUTING↗

Boundary dual of bulk local operators

We provide a procedure to determine if a given nonlocal operator in a large N holographic CFT is dual to a local bulk operator on the geometry associated with a particular code subspace of the CFT. This procedure does not presuppose knowledge of the bulk geometry. We are able to pick out local operators in a large region of the bulk, called the "localizable region,"' that can extend beyond event horizons in certain cases. The method relies heavily on the quantum-error correcting structure of AdS/CFT and, in particular, on entanglement wedge reconstruction. As a byproduct of this machinery, we are able to reconstruct the metric in the localizable region up to a conformal factor. This suggests a connection between our program and the recent light-cone cut approach to bulk reconstruction.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Low-Rank Correction Methods for Algebraic Domain Decomposition Preconditioners

This study presents a parallel preconditioning method for distributed sparse linear systems, based on an approximate inverse of the original matrix, that adopts a general framework of distributed sparse matrices and exploits domain decomposition (DD) and low-rank corrections. The DD approach decouples the matrix and, once inverted, a low-rank approximation is applied by exploiting the Sherman--Morrison--Woodbury formula, which yields two variants of the preconditioning methods. The low-rank expansion is computed by the Lanczos procedure with reorthogonalizations. Numerical experiments indicate that, when combined with Krylov subspace accelerators, this preconditioner can be efficient and robust for solving symmetric sparse linear systems. Comparisons with pARMS, a DD-based parallel incomplete LU (ILU) preconditioning method, are presented for solving Poisson's equation and linear elasticity problems.

97 MATHEMATICS AND COMPUTING↗

What is the gradient of a scalar function defined on a subspace of square matrices?

We illustrate a technique to calculate the gradient of scalar functions that are defined on any arbitrary matrix subspace. It generalizes our earlier work titled “What is the gradient of a scalar function of a symmetric matrix ?”(Indian Journal of Pure and Applied Mathematics (2022), doi:10.1007/s13226-022-00313-x), in which we considered the special case of the subspace of symmetric matrices. Extant methods to calculate the gradient in such cases have an inherent flaw which leads to spurious results that populate several publications, as well as respected textbooks and handbooks on matrix calculus. We examine these sources and results in a rigorous and concrete mathematical setting of a finite-dimensional inner-product space and discover the inherent flaw and also a remedy. We demonstrate two ways to calculate the derivative/gradient and second derivative for scalar functions of matrices defined over an arbitrary matrix subspace; the first method is by considering any (differentiable) extension to the space of square matrices and projection of its gradient onto the given subspace. The second method utilizes an ordered basis and computes each component of the gradient through evaluation of the directional derivative. All the ideas presented are illustrated by non-trivial examples, namely, considering the subspace of 3 × 3 circulant and Toeplitz matrices and presenting the results of gradient-descent with both the spurious and correct gradients. Moreover, our bibliography makes it clear that a rigorous approach to matrix calculus is not common in practice, and our presentation of matrix calculus in the language of inner-product spaces will be significant and meaningful for applied mathematicians, engineers and researchers working in inter-disciplinary fields to avoid the conceptual pitfalls that exist.

97 MATHEMATICS AND COMPUTING↗

What is the gradient of a scalar function defined on a subspace of square matrices?

We illustrate a technique to calculate the gradient of scalar functions that are defined on any arbitrary matrix subspace. It generalizes our earlier work titled “What is the gradient of a scalar function of a symmetric matrix ?”(Indian Journal of Pure and Applied Mathematics (2022), https://doi.org/10.1007/s13226-022-00313-x), in which we considered the special case of the subspace of symmetric matrices. Extant methods to calculate the gradient in such cases have an inherent flaw which leads to spurious results that populate several publications, as well as respected textbooks and handbooks on matrix calculus. Here, we examine these sources and results in a rigorous and concrete mathematical setting of a finite-dimensional inner-product space and discover the inherent flaw and also a remedy. We demonstrate two ways to calculate the derivative/gradient and second derivative for scalar functions of matrices defined over an arbitrary matrix subspace; the first method is by considering any (differentiable) extension to the space of square matrices and projection of its gradient onto the given subspace. The second method utilizes an ordered basis and computes each component of the gradient through evaluation of the directional derivative. All the ideas presented are illustrated by non-trivial examples, namely, considering the subspace of 3 x 3 circulant and Toeplitz matrices and presenting the results of gradient-descent with both the spurious and correct gradients. Moreover, our bibliography makes it clear that a rigorous approach to matrix calculus is not common in practice, and our presentation of matrix calculus in the language of inner-product spaces will be significant and meaningful for applied mathematicians, engineers and researchers working in inter-disciplinary fields to avoid the conceptual pitfalls that exist.

97 MATHEMATICS AND COMPUTING↗

Group Projected subspace pursuit for IDENTification of variable coefficient differential equations (GP-IDENT)

We propose an effective and robust algorithm for identifying partial differential equations (PDEs) with space-time varying coefficients from the noisy observation of a single solution trajectory. Identifying unknown differential equations from noisy data is a difficult task, and it is even more challenging with space and time varying coefficients in the PDE. The proposed algorithm, GP-IDENT, has three ingredients: (i) we use B-spline bases to express the unknown space and time varying coefficients, (ii) we propose Group Projected Subspace Pursuit (GPSP) to find a sequence of candidate PDEs with various levels of complexity, and (iii) we propose a new criterion for model selection using the Reduction in Residual (RR) to choose an optimal one among a pool of candidates. The new GPSP considers group projected subspaces which is more robust than existing methods in distinguishing correlated group features. We test GP-IDENT on a variety of PDEs and PDE systems, and compare it with the state-of-the-art parametric PDE identification algorithms under different settings to illustrate its outstanding performance. Furthermore, our experiments show that GP-IDENT is effective in identifying the correct terms from a large dictionary, and our model selection scheme is robust to noise.

Data-driven method↗

Importance of charge self-consistency in first-principles description of strongly correlated systems

First-principles approaches have been successful in solving many-body Hamiltonians for real materials to an extent when correlations are weak or moderate. As the electronic correlations become stronger often embedding methods based on first-principles approaches are used to better treat the correlations by solving a suitably chosen many-body Hamiltonian with a higher level theory. The success of such embedding theories, often referred to as second-principles, is commonly measured by the quality of self-energy Σ which is either a function of energy or momentum or both. However, Σ should, in principle, also modify the electronic eigenfunctions and thus change the real space charge distribution. While such practices are not prevalent, some works that use embedding techniques do take into account these effects. In such cases, choice of partitioning, of the parameters defining the correlated Hamiltonian, of double-counting corrections, and the adequacy of low-level Hamiltonian hosting the correlated subspace hinder a systematic and unambiguous understanding of such effects. Further, for a large variety of correlated systems, strong correlations are largely confined to the charge sector. Then an adequate nonlocal low-order theory is important, and the high-order local correlations embedding contributes become redundant. Here we study the impact of charge self-consistency within two example cases, TiSe 2 and CrBr 3 , and show how real space charge re-distribution due to correlation effects taken into account within a first-principles Green’s function-based many-body perturbative approach is key in driving qualitative changes to the final electronic structure of these materials.

36 MATERIALS SCIENCE↗

Compressing Hamiltonians with ab initio downfolding for simulating strongly-correlated materials on quantum computers

The accurate first-principles description of strongly correlated materials is an important and challenging problem in condensed matter physics. Ab initio downfolding has emerged as a way of deriving compressed many-body Hamiltonians that maintain the essential physics of strongly correlated materials. The solution of these material-specific models is still exponentially difficult to generate on classical computers, but quantum algorithms allow for a significant speed-up in obtaining the ground states of these compressed Hamiltonians. Here, we demonstrate that using quantum algorithms to obtain the properties of downfolded Hamiltonians can indeed yield high-fidelity solutions. By combining ab initio downfolding and variational quantum eigensolvers, we correctly predict the antiferromagnetic state of one-dimensional cuprate Ca 2 Cu O 3 , the excitonic ground state of monolayer W Te 2 , and the charge-ordered state of correlated metal Sr VO 3 . Numerical simulations using a classical tensor network implementation of variational quantum eigensolvers allow us to simulate large models with up to 54 qubits and encompassing up to four bands in the correlated subspace, which is indicative of the complexity that our framework can address. Through these methods we demonstrate the potential of classical preoptimization and downfolding techniques for enabling efficient materials simulation using quantum algorithms.

Alvertis, Antonios M. [NASA, Ames; LBNL, Berkeley]↗

Accurate and efficient description of interacting carriers in quantum nanostructures by selected configuration interaction and perturbation theory

In this paper, we present a method to accurately and efficiently calculate many-body states of interacting carriers in quantum nanostructures based on a combination of iterative selection of configurations and perturbation theory. This method enables investigations of large excitonic complexes and multielectron systems with near full configuration interaction accuracy, even though only a small subspace of the full many-body Hilbert space is sampled, thus saving orders of magnitudes in computational resources. Important advantages of this method are that the convergence is controlled by a single parameter, the threshold, and that ground and excited states can be treated on an equal footing. On the example of InAsP nanowire quantum dots described using a million-atom tight-binding approach, we demonstrate the extreme efficiency of the method by numerical studies of large excitonic complexes filling up to the fourth electronic shell. We find that the method generally converges fast as a function of the threshold, profiting from a significant acceleration due to the perturbative corrections. The role of the choice of single-particle basis states is discussed. It is found that the algorithm converges faster in the Hartree-Fock basis only for highly charged systems, where Coulomb repulsion dominates. Finally, based on the observation that second-order perturbative energy corrections only depend on off-diagonal elements of the many-body Hamiltonian, we present a way to accurately calculate many-body states that requires only a relatively small number of Coulomb matrix elements.

36 MATERIALS SCIENCE↗

Solving Coupled Cluster Equations by the Newton Krylov Method

We describe using the Newton Krylov method to solve the coupled cluster equation. The method uses a Krylov iterative method to compute the Newton correction to the approximate coupled cluster amplitude. The multiplication of the Jacobian with a vector, which is required in each step of a Krylov iterative method such as the Generalized Minimum Residual (GMRES) method, is carried out through a finite difference approximation, and requires an additional residual evaluation. The overall cost of the method is determined by the sum of the inner Krylov and outer Newton iterations. We discuss the termination criterion used for the inner iteration and show how to apply pre-conditioners to accelerate convergence. We will also examine the use of regularization technique to improve the stability of convergence and compare the method with the widely used direct inversion of iterative subspace (DIIS) methods through numerical examples.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Analysis of diagonal G and subspace W approximations within fully self-consistent GW calculations for bulk semiconducting systems

Fully self-consistent GW (sc-GW) methods are now available to evaluate quasiparticle and spectral properties of various molecular and bulk systems. However, such techniques based on the full matrix of G and W are computationally demanding. Additionally, the routinely used single-shot GW approximation (G 0 W 0 ) has an undesirable dependency on the choice of initial exchange-correlation functional. In the literature, many so-called self-consistent GW methods are based on diagonal approximation of G and low-ranking approximation of W. It is thus worth checking how good such approximations are in comparison with the full matrix method. In this work, we consider AlAs, AlP, GaP, and ZnS as the prototype systems to perform sc-GW calculations by expressing the full G matrix using a plane-wave basis set. We compared our sc-GW results with the diagonal G and subspace W approximated sc-GW results (sc-GW-diagG and sc-GW-subW methods). In the sc-GW-diagG method, interacting G is expanded in the eigenvectors of noninteracting G such that only diagonal elements are retained, whereas the number of eigenmodes is truncated in sc-GW-subW calculations. A systematic analysis of the results obtained from the above techniques is presented. The differences in the quasiparticle band gap between the approximated and the full matrix sc-GW approaches are mostly less than 1.7%, which validates such widely adopted approximations, and also shows how such low-ranking approximation can be used to include higher-order terms such as the vertex correction.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗