Search NASA⌕ Search

SEARCH · Search NASA

Results for “Hamiltonian eigenvalue problems”

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 19 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2018

Least-squares solutions of generalized inverse eigenvalue problem over Hermitian–Hamiltonian matrices with a submatrix constraint

In this paper, a gradient-based iterative algorithm is proposed for finding the least-squares solutions of the following constrained generalized inverse eigenvalue problem: given X∈C{sup n×m}, Λ=diag(λ{sub 1},λ{sub 2},…,λ{sub m})∈C{sup m×m}, find A{sup ∗},B{sup ∗}∈C{sup n×n}, such that ∥AX−BXΛ∥ is minimized, where A{sup ∗},B{sup ∗} are Hermitian–Hamiltonian except for a special submatrix. For any initial constrained matrices, a solution pair (A{sup ∗},B{sup ∗}) can be obtained in finite iteration steps by this iterative algorithm in the absence of roundoff errors. The least-norm solution can be obtained by choosing a special kind of initial matrix pencil. In addition, the unique optimal approximation solution to a given matrix pencil in the solution set of the above problem can also be obtained. A numerical example is given to show the efficiency of the proposed algorithm.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1982

A general algorithm for solving the algebraic Riccati equation

The generalized eigenvalue problem provides a suitable framework for reliable solutions of many system theoretic, control, and estimation problems. A general algorithm for solving the matrix algebraic Riccati equation (ARE) which utilizes a pencil structure is described here. This algorithm avoids unnecessary inversion of cost or transition matrices, making it a numerically sound way to solve for the gains and/or ARE with singular quadratic costs, for cases satisfying detectability and stabilizability conditions. Examples are solution with discrete dead-beat control, noiseless measurements in Kalman filters and time-delays in discrete-time systems, which cause difficulties in the Hamiltonian standard eigenvalue problem formulation. The ARE algorithm implementatiton and numerical examples are shown.

Walker, R. A.↗
DOE OSTI2020

Electronic structure with direct diagonalization on a D-wave quantum annealer

Quantum chemistry is regarded to be one of the first disciplines that will be revolutionized by quantum computing. Although universal quantum computers of practical scale may be years away, various approaches are currently being pursued to solve quantum chemistry problems on near-term gate-based quantum computers and quantum annealers by developing the appropriate algorithm and software base. This work implements the general Quantum Annealer Eigensolver (QAE) algorithm to solve the molecular electronic Hamiltonian eigenvalue-eigenvector problem on a D-Wave 2000Q quantum annealer. The approach is based on the matrix formulation, efficiently uses qubit resources based on a power-of-two encoding scheme and is hardware-dominant relying on only one classically optimized parameter. We demonstrate the use of D-Wave hardware for obtaining ground and excited electronic states across a variety of small molecular systems. The approach can be adapted for use by a vast majority of electronic structure methods currently implemented in conventional quantum-chemical packages. The results of this work will encourage further development of software such as qbsolv which has promising applications in emerging quantum information processing hardware and has expectation to address large and complex optimization problems intractable for classical computers.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2017

Properties of definite Bethe–Salpeter eigenvalue problems

The Bethe-Salpeter eigenvalue problem is solved in condensed matter physics to estimate the absorption spectrum of solids. It is a structured eigenvalue problem. Its special structure appears in other approaches for studying electron excitation in molecules or solids also. When the Bethe-Salpeter Hamiltonian matrix is definite, the corresponding eigenvalue problem can be reduced to a symmetric eigenvalue problem. However, its special structure leads to a number of interesting spectral properties. We describe these properties that are crucial for developing efficient and reliable numerical algorithms for solving this class of problems.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
NASA NTRS1966

What is H sub 0/ques/

Zero order Hamiltonian in perturbation theory for eigenvalue problems of atom in magnetic field

EIGENVALUE↗
DOE OSTI2024

Integrating subsystem embedding subalgebras and coupled cluster Green’s function: a theoretical foundation for quantum embedding in excitation manifold

Here, in this study, we introduce a novel approach to coupled-cluster Green's function (CCGF) embedding by seamlessly integrating conventional CCGF theory with the state-of-the-art sub-system embedding sub-algebras coupled cluster (SES-CC) formalism. This integration focuses primarily on delineating the characteristics of the sub-system and the corresponding segments of the Green's function, defined explicitly by active orbitals. Crucially, our work involves the adaptation of the SES-CC paradigm, addressing the left eigenvalue problem through a distinct form of Hamiltonian similarity transformation. This advancement not only facilitates a comprehensive representation of the interaction between the embedded sub-system and its surrounding environment but also paves the way for the quantum mechanical description of multiple embedded domains, particularly by employing the emergent quantum flow algorithms. Our theoretical underpinnings further set the stage for a generalization to multiple embedded sub-systems. This expansion holds significant promise for the exploration and application of non-equilibrium quantum systems, enhancing the understanding of system–environment interactions. In doing so, the research underscores the potential of SES-CC embedding within the realm of quantum computations and multi-scale simulations, promising a good balance between accuracy and computational efficiency.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Valence structures of light and strange mesons from the basis light-front quantization framework

In this work, we apply the basis light-front quantization (BLFQ) framework to solve for the structures of mesons with light and strange valence quarks. Our approach treats mesons as relativistic bound states with quarks confined in both the transverse direction and the light-front longitudinal direction. The spin-orbit interactions of these confined quarks are further specified by the Nambu–Jona-Lasinio model. We address the U(1)A axial anomaly by including the Kobayashi-Maskawa-’t Hooft interaction regularized by our basis. We present the structures of the pion, the kaon, the eta meson, and the eta-prime meson in terms of their valence light-front wave functions obtained from the eigenvalue problem of our light-front Hamiltonian.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2021

Efficient phase-factor evaluation in quantum signal processing

Quantum signal processing (QSP) is a powerful quantum algorithm to exactly implement matrix polynomials on quantum computers. Asymptotic analysis of quantum algorithms based on QSP has shown that asymptotically optimal results can in principle be obtained for a range of tasks, such as Hamiltonian simulation and the quantum linear system problem. A further benefit of QSP is that it uses a minimal number of ancilla qubits, which facilitates its implementation on near-to-intermediate term quantum architectures. However, there is so far no classically stable algorithm allowing computation of the phase factors that are needed to build QSP circuits. Existing methods require the use of variable precision arithmetic and can only be applied to polynomials of a relatively low degree. We present here an optimization-based method that can accurately compute the phase factors using standard double precision arithmetic operations. We demonstrate the performance of this approach with applications to Hamiltonian simulation, eigenvalue filtering, and quantum linear system problems. Furthermore, our numerical results show that the optimization algorithm can find phase factors to accurately approximate polynomials of a degree larger than 10000 with errors below 10 -12 .

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

Grand Unification of Quantum Algorithms

Quantum algorithms offer significant speed-ups over their classical counterparts for a variety of problems. The strongest arguments for this advantage are borne by algorithms for quantum search, quantum phase estimation, and Hamiltonian simulation, which appear as subroutines for large families of composite quantum algorithms. A number of these quantum algorithms have recently been tied together by a novel technique known as the quantum singular value transformation (QSVT), which enables one to perform a polynomial transformation of the singular values of a linear operator embedded in a unitary matrix. In the seminal GSLW’19 paper on the QSVT [Gilyén et al., ACM STOC 2019], many algorithms are encompassed, including amplitude amplification, methods for the quantum linear systems problem, and quantum simulation. Here, we provide a pedagogical tutorial through these developments, first illustrating how quantum signal processing may be generalized to the quantum eigenvalue transform, from which the QSVT naturally emerges. Paralleling GSLW’19, we then employ the QSVT to construct intuitive quantum algorithms for search, phase estimation, and Hamiltonian simulation, and also showcase algorithms for the eigenvalue threshold problem and matrix inversion. This overview illustrates how the QSVT is a single framework comprising the three major quantum algorithms, suggesting a grand unification of quantum algorithms.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2018

The virtual element method for eigenvalue problems with potential terms on polytopic meshes

In this work, we extend the conforming virtual element method (VEM) to the numerical resolution of eigenvalue problems with potential terms on a polytopic mesh. An important application is that of the Schrödinger equation with a pseudopotential term. This model is a fundamental element in the numerical resolution of more complex problems from the Density Functional Theory. The VEM is based on the construction of the discrete bilinear forms of the variational formulation through certain polynomial projection operators that are directly computable from the degrees of freedom. The method shows a great flexibility with respect to the meshes and provides a correct spectral approximation with optimal convergence rates. This point is discussed from both the theoretical and the numerical viewpoint. The performance of the method is numerically investigated by solving the quantum harmonic oscillator problem with the harmonic potential and a singular eigenvalue problem with zero potential for the first eigenvalues.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

Downfolding of many-body Hamiltonians using active-space models: Extension of the sub-system embedding sub-algebras approach to unitary coupled cluster formalisms

Here, we discuss the extension of the recently introduced subsystem embedding subalgebra coupled cluster (SES-CC) formalism to unitary CC formalisms. In analogy to the standard single-reference SES-CC formalism, its unitary CC extension allows one to include the dynamical (outside the active space) correlation effects in an SES induced complete active space (CAS) effective Hamiltonian. In contrast to the standard single-reference SES-CC theory, the unitary CC approach results in a Hermitian form of the effective Hamiltonian. Additionally, for the double unitary CC (DUCC) formalism, the corresponding CAS eigenvalue problem provides a rigorous separation of external cluster amplitudes that describe dynamical correlation effects—used to define the effective Hamiltonian—from those corresponding to the internal (inside the active space) excitations that define the components of eigenvectors associated with the energy of the entire system. The proposed formalism can be viewed as an efficient way of downfolding many-electron Hamiltonian to the low-energy model represented by a particular choice of CAS. In principle, this technique can be extended to any type of CAS representing an arbitrary energy window of a quantum system. The Hermitian character of low-dimensional effective Hamiltonians makes them an ideal target for several types of full configuration interaction type eigensolvers. As an example, we also discuss the algebraic form of the perturbative expansions of the effective DUCC Hamiltonians corresponding to composite unitary CC theories and discuss possible algorithms for hybrid classical and quantum computing. Given growing interest in quantum computing, we provide energies for H 2 and Be systems obtained with the quantum phase estimator algorithm available in the Quantum Development Kit for the approximate DUCC Hamiltonians.

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

Supersymmetric symplectic quantum mechanics

Symplectic Quantum Mechanics SQM considers a non-commutative algebra of functions on a phase space Γ and an associated Hilbert space H{sub Γ} to construct a unitary representation for the Galilei group. From this unitary representation the Schrödinger equation is rewritten in phase space variables and the Wigner function can be derived without the use of the Liouville–von Neumann equation. In this article we extend the methods of supersymmetric quantum mechanics SUSYQM to SQM. With the purpose of applications in quantum systems, the factorization method of the quantum mechanical formalism is then set within supersymmetric SQM. A hierarchy of simpler hamiltonians is generated leading to new computation tools for solving the eigenvalue problem in SQM. We illustrate the results by computing the states and spectra of the problem of a charged particle in a homogeneous magnetic field as well as the corresponding Wigner function.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2017

Bethe-Salpeter Eigenvalue Solver Package (BSEPACK) v0.1

The BSEPACK contains a set of subroutines for solving the Bethe-Salpeter Eigenvalue (BSE) problem. This type of problem arises in this study of optical excitation of nanoscale materials. The BSE problem is a structured non-Hermitian eigenvalue problem. The BSEPACK software can be used to compute all or subset of eigenpairs of a BSE Hamiltonian. It can also be used to compute the optical absorption spectrum without computing BSE eigenvalues and eigenvectors explicitly. The package makes use of the ScaLAPACK, LAPACK and BLAS.

SHAO, MEIYUE↗
DOE OSTI2023

A solvable model of a nonlinear extension of quantum mechanics

We introduce a particular nonlinear generalization of quantum mechanics which has the property that it is exactly solvable in terms of the eigenvalues and eigenfunctions of the Hamiltonian of the usual linear quantum mechanics problem. Here, we hope that this simple example will elucidate some of the issues of interpreting nonlinear generalization of quantum mechanics that have been put forth to resolve questions about quantum measurement theory.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

Geometric Interpretation of a Non-Linear Extension of Quantum Mechanics

We recently introduced a particular non-linear generalization of quantum mechanics that has the property that it is exactly solvable in terms of the eigenvalues and eigenfunctions of the Hamiltonian of the usual linear quantum mechanics problem. In this paper, we suggest that the two components of the wave function represent the system described by the Hamiltonian H in two different asymptotic regions of spacetime and we show that the non-linear terms can be viewed as giving rise to gravitational effects.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2016

Stochastic Schrödinger evolution over piecewise enlarged filtrations

This paper constructs a nonlinear filtering framework that admits appearances of new information processes at random times by introducing piecewise enlargements of filtrations and proposes a new energy-based Schrodinger evolution expressed as a stochastic differential equation on a complex Hilbert space. Each information process is modeled as the sum of a random variable taking the eigenvalues of a Hamiltonian and an independent Brownian bridge noise. It is shown that under a piecewise enlarged filtration, the wave function is a jump-diffusion process until it collapses at some terminal time. In between discontinuities, the dynamics of the state vector are governed by different Wiener processes and diffusion coefficients. This motivates the introduction of an inclusive chain of Kolmogorov probability spaces or a *-isomorphic chain of commutative von Neumann probability spaces, on which the quantum system evolves differently based on the number of active information processes. The expectation of the Hamiltonian at a given state is the solution of a second-order nonlinear differential equation determined by one of the possible regimes that the quantum system belongs to. It is shown that the collapse rate is a submartingale with positive jumps and the Shannon entropy process is a supermartingale with expected negative jumps when passing to higher-order probability spaces. The framework is extended to the case when the Hamiltonian is modeled as a function of a set of commutative operators, where each operator is associated with a different piecewise enlarged filtration.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗