Engineering Papers⌕ Search

SEARCH · Engineering Papers

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 55 records · Page 3

Reduction of the molecular hamiltonian matrix using quantum community detection

Abstract Quantum chemistry is interested in calculating ground and excited states of molecular systems by solving the electronic Schrödinger equation. The exact numerical solution of this equation, frequently represented as an eigenvalue problem, remains unfeasible for most molecules and requires approximate methods. In this paper we introduce the use of Quantum Community Detection performed using the D-Wave quantum annealer to reduce the molecular Hamiltonian matrix in Slater determinant basis without chemical knowledge. Given a molecule represented by a matrix of Slater determinants, the connectivity between Slater determinants (as off-diagonal elements) is viewed as a graph adjacency matrix for determining multiple communities based on modularity maximization. A gauge metric based on perturbation theory is used to determine the lowest energy cluster. This cluster or sub-matrix of Slater determinants is used to calculate approximate ground state and excited state energies within chemical accuracy. The details of this method are described along with demonstrating its performance across multiple molecules of interest and bond dissociation cases. These examples provide proof-of-principle results for approximate solution of the electronic structure problem using quantum computing. This approach is general and shows potential to reduce the computational complexity of post-Hartree–Fock methods as future advances in quantum hardware become available.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Quasibound states in two- and three-dimensional open quantum systems

We derive expressions for the scattering matrix and the Wigner-Smith delay time, applicable to open systems in two and three spatial dimensions, in terms of a non-Hermitian effective Hamiltonian whose complex eigenvalues give the quasibound state energies of the system. These results are illustrated on an exactly solvable two-dimensional scattering problem and are found to be in excellent agreement with the exact solution.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Using an iterative eigensolver to compute vibrational energies with phase-spaced localized basis functions

Although phase-space localized Gaussians are themselves poor basis functions, they can be used to effectively contract a discrete variable representation basis [A. Shimshovitz and D. J. Tannor, Phys. Rev. Lett. 109, 070402 (2012)]. This works despite the fact that elements of the Hamiltonian and overlap matrices labelled by discarded Gaussians are not small. By formulating the matrix problem as a regular (i.e., not a generalized) matrix eigenvalue problem, we show that it is possible to use an iterative eigensolver to compute vibrational energy levels in the Gaussian basis.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Computing singularities of perturbation series

Many properties of current ab initio approaches to the quantum many-body problem, both perturbational and otherwise, are related to the singularity structure of the Rayleigh-Schroedinger perturbation series. A numerical procedure is presented that in principle computes the complete set of singularities, including the dominant singularity which limits the radius of convergence. The method approximates the singularities as eigenvalues of a certain generalized eigenvalue equation which is solved using iterative techniques. It relies on computation of the action of the Hamiltonian matrix on a vector and does not rely on the terms in the perturbation series. The method can be useful for studying perturbation series of typical systems of moderate size, for fundamental development of resummation schemes, and for understanding the structure of singularities for typical systems. Some illustrative model problems are studied, including a helium-like model with {delta}-function interactions for which Moeller-Plesset perturbation theory is considered and the radius of convergence found.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Chebyshev-filtered subspace iteration method free of sparse diagonalization for solving the Kohn–Sham equation

First-principles density functional theory (DFT) calculations for the electronic structure problem require a solution of the Kohn–Sham equation, which requires one to solve a nonlinear eigenvalue problem. Solving the eigenvalue problem is usually the most expensive part in DFT calculations. Sparse iterative diagonalization methods that compute explicit eigenvectors can quickly become prohibitive for large scale problems. The Chebyshev-filtered subspace iteration (CheFSI) method avoids most of the explicit computation of eigenvectors and results in a significant speedup over iterative diagonalization methods for the DFT self-consistent field (SCF) calculations. However, the original formulation of the CheFSI method utilizes a sparse iterative diagonalization at the first SCF step to provide initial vectors for subspace filtering at latter SCF steps. This diagonalization is expensive for large scale problems. We develop a new initial filtering step to avoid completely this diagonalization, thus making the CheFSI method free of sparse iterative diagonalizations at all SCF steps. Our new approach saves memory usage and can be two to three times faster than the original CheFSI method.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

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↗

Shift-and-invert parallel spectral transformation eigensolver: Massively parallel performance for density-functional based tight-binding

The Shift-and-invert parallel spectral transformations (SIPs), a computational approach to solve sparse eigenvalue problems, is developed for massively parallel architectures with exceptional parallel scalability and robustness. The capabilities of SIPs are demonstrated by diagonalization of density-functional based tight-binding (DFTB) Hamiltonian and overlap matrices for single-wall metallic carbon nanotubes, diamond nanowires, and bulk diamond crystals. The largest (smallest) example studied is a 128,000 (2000) atom nanotube for which ~330,000 (~5600) eigenvalues and eigenfunctions are obtained in ~190 (~5) seconds when parallelized over 266,144 (16,384) Blue Gene/Q cores. Weak scaling and strong scaling of SIPs are analyzed and the performance of SIPs is compared with other novel methods. Different matrix ordering methods are investigated to reduce the cost of the factorization step, which dominates the time-to-solution at the strong scaling limit. As a result, a parallel implementation of assembling the density matrix from the distributed eigenvectors is demonstrated.

36 MATERIALS SCIENCE↗

On the Neutrino Self Refraction Problem from a Many-Body Perspective

We consider a dense neutrino gas as a many body system by taking into account both vacuum oscillations and self interactions of neutrinos. We show that the exact many body Hamiltonian which describes the flavor oscillations of such a dense neutrino gas has many constants of motion whose eigenvalues represent a set of good quantum numbers. However, if one adopts the random phase approximation as an effective one particle description, these operators are no longer conserved (i.e. they cease to represent good quantum numbers) although their expectation values are still conserved.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Enhancing scalability of a matrix-free eigensolver for studying many-body localization

We propose several techniques to enhance the parallel scalability of a matrix-free eigensolver designed for studying many-body localization (MBL) of quantum spin chain models with nearest-neighbor interactions and on-site disorder. This type of problem is computationally challenging because the dimension of the associated Hamiltonian matrix grows exponentially with respect to the number of spins L, and we need to average over different realizations of the random disorder to obtain relevant statistical behavior. For each disorder realization, we need to compute eigenvalues from different regions of the spectrum and their corresponding eigenvectors. In previous work, the interior eigenstates for a single eigenvalue problem are computed via the shift-and-invert Lanczos algorithm. Due to the extremely high memory footprint of the LU factorizations, this technique is not well suited for large L’s. For example, we need thousands of compute nodes on modern high performance computing infrastructures to go beyond L = 24. The matrix-free approach does not suffer from this memory bottleneck, however, its scalability is limited by a computation and communication load imbalance. To reduce this imbalance and to significantly enhance the scalability of the matrix-free eigensolver, we reorder the matrix and leverage the consistent space runtime, CSPACER. We also show its efficiency in managing irregular communication patterns at scale compared to optimized MPI non-blocking two-sided and one-sided RMA implementation variants. This effort enables us to study MBL for spin chains with a larger number of spins. The efficiency and effectiveness of the proposed algorithm is demonstrated by computing eigenstates on a massively parallel many-core high performance computer.

METIS↗

MiniApp for Density Matrix Renormalization Group Hamiltonian Application Kernel

We present two miniapps that implement the core computational kernel of the DMRG++ application, a generic C++ code that implements the Density Matrix Renormalization Group (DMRG) algorithm. The DMRG++ core Kronecker multiplication kernel is formulated using a batched BLAS approach, with implementation that targets both multi-core CPUs using OpenMP and GPGPU using the MAGMA library. The kernel evaluates the matrix-vector multiplication of the target Hamiltonian matrix used in Lanczos algorithm for computing the lowest eigenvalue and eigenvector. The Hamiltonian matrix is expressed compactly as sums of Kronecker products of small dense matrices. We demonstrate improved performance of the miniapp on synthetic problem, and show the performance of the DMRG++ application using a plugin based on the miniapp. We also present an OpenMP miniapp that explores the use of nested parallel constructs to implement the Kronecker multiplication kernel, exploring the use of nested OpenMP worksharing and tasking abstractions to implement the multi-level parallel multiplication algorithm. The miniapp has been used as a co-design vehicle for evaluating features in the OpenMP-4.5 and upcoming OpenMP-5.0 standards.

Elwasif, Wael↗

First-order quantum phase transition in adiabatic quantum computation

We investigate the connection between local minima in the problem Hamiltonian and first-order quantum phase transitions during adiabatic quantum computation. We demonstrate how some properties of the local minima can lead to an extremely small gap that is exponentially sensitive to the Hamiltonian parameters. Using perturbation expansion, we derive an analytical formula that cannot only predict the behavior of the gap, but also provide insight on how to controllably vary the gap size by changing the parameters. We show agreement with numerical calculations for a weighted maximum independent set problem instance.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Witnessing eigenstates for quantum simulation of Hamiltonian spectra

The efficient calculation of Hamiltonian spectra, a problem often intractable on classical machines, can find application in many fields, from physics to chemistry. We introduce the concept of an “eigenstate witness” and, through it, provide a new quantum approach that combines variational methods and phase estimation to approximate eigenvalues for both ground and excited states. This protocol is experimentally verified on a programmable silicon quantum photonic chip, a mass-manufacturable platform, which embeds entangled state generation, arbitrary controlled unitary operations, and projective measurements. Both ground and excited states are experimentally found with fidelities >99%, and their eigenvalues are estimated with 32 bits of precision. We also investigate and discuss the scalability of the approach and study its performance through numerical simulations of more complex Hamiltonians. This result shows promising progress toward quantum chemistry on quantum computers.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Nonsupersymmetric strong coupling background from the large N quantum mechanics of two matrices coupled via a Yang-Mills interaction

We derive a planar sector of the large N nonsupersymmetric background of the quantum mechanical Hamiltonian of two Hermitian matrices coupled via a Yang-Mills interaction, in terms of the density of eigenvalues of one of the matrices. This background satisfies an implicit nonlinear integral equation, with a perturbative small coupling expansion and a solvable large coupling solution, which is obtained. The energy of system and the expectation value of several correlators are obtained in this strong coupling limit. They are free of infrared divergences.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

On quark-antiquark approximation in light front QCD with zero gluon modes

We consider a transition to the light front Hamiltonian from theories quantized on spacelike planes approaching to the light front. In this approach we preserve the dynamics of zero mode present in the theories near the light front. We make the limit transition differently for zero and nonzero modes. This leads to the appearance of some phenomenological parameter which can be used to describe vacuum effects. Also we use a lattice gauge invariant regularization in transverse coordinate space. As an illustration of our scheme we consider the quark-antiquark bound states problem in 2+1 dimensions. We construct basis states in the light front Fock space and provide detailed computations of the Hamiltonian matrix in this basis. These steps allow us to construct the matrix eigenvalue equation. In conclusion we discuss the nuances of obtained results.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Effect of emitters on quantum state transfer in coupled cavity arrays

Over the last decade, conditions for perfect state transfer in quantum spin chains have been discovered and their experimental realizations addressed, as have their extensions to more complex geometries of coupled cavity-emitter arrays. In this paper we further consider such studies and situations in which quantum state transfer can occur with high fidelity, even when the cavity-cavity coupling rates and cavity-emitter interaction rates are comparable. This is accomplished through the development and use of a Monte Carlo approach to the inverse eigenvalue problem, which allows the determination of coupling rates which optimize quantum state transfer fidelity and subsequent time evolution of the polariton wave function through exact diagonalization of the resulting Jaynes-Cummings-Hubbard Hamiltonian. The effect of inhomogeneous emitter locations is also evaluated. Furthermore, our key results include the demonstration that our methodology can be used successfully to establish Hamiltonian parameters for high-fidelity state transfer in more general lattice geometries and excitation number sectors, and also a determination of the effects of fluctuations in those parameters about their optimal values.

77 NANOSCIENCE AND NANOTECHNOLOGY↗

Unleashed from constrained optimization: quantum computing for quantum chemistry employing generator coordinate inspired method

Hybrid quantum-classical approaches offer potential solutions to quantum chemistry problems, yet they often manifest as constrained optimization problems. Here, we explore the interconnection between constrained optimization and generalized eigenvalue problems through the Unitary Coupled Cluster (UCC) excitation generators. Inspired by the generator coordinate method, we employ these UCC excitation generators to construct non-orthogonal, overcomplete many-body bases, projecting the system Hamiltonian into an effective Hamiltonian, which bypasses issues such as barren plateaus that heuristic numerical minimizers often encountered in standard variational quantum eigensolver (VQE). Diverging from conventional quantum subspace expansion methods, we introduce an adaptive scheme that robustly constructs the many-body basis sets from a pool of the UCC excitation generators. This scheme supports the development of a hierarchical ADAPT quantum-classical strategy, enabling a balanced interplay between subspace expansion and ansatz optimization to address complex, strongly correlated quantum chemical systems cost-effectively, setting the stage for more advanced quantum simulations in chemistry.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Quantum computation of nanosheets in a background magnetic field for external control of nanosystems

We ran quantum simulations on lattices of interacting fermions in a background magnetic field [1]. We created discretized Hamiltonian matrices for each system and pre-processed them so that they could be read by the quantum simulator implemented in IBM's Qiskit package [2]. The simulator uses the variational quantum eigensolver (VQE) algorithm [3] to approximate the ground state energy of the input Hamiltonian, which is then compared to the classically-calculated exact value. This classical evaluation is possible because the systems studied are still within the grasp of classical computers. We also investigated ways to simplify the system before the pre-processing step. We found that in almost all cases these simplifications made our quantum calculations converge to better answers using simpler starting conditions. We are exploring other ways to interface with IBM's quantum computing software so that we no longer need to explicitly define the Hamiltonian matrices for our systems, a problem which will itself soon become intractable.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Split kinetic energy method for quantum systems with competing potentials

For quantum systems with competing potentials, the conventional perturbation theory often yields an asymptotic series and the subsequent numerical outcome becomes uncertain. To tackle such a kind of problems, we develop a general solution scheme based on a new energy dissection idea. Instead of dividing the potential energy into 'unperturbed' and 'perturbed' terms, a partition of the kinetic energy is performed. By distributing the kinetic energy term in part into each individual potential, the Hamiltonian can be expressed as the sum of the subsystem Hamiltonians with respective competing potentials. The total wavefunction is expanded by using a linear combination of the basis sets of respective subsystem Hamiltonians. We first illustrate the solution procedure using a simple system consisting of a particle under the action of double {delta}-function potentials. Next, this method is applied to the prototype systems of a charged harmonic oscillator in strong magnetic field and the hydrogen molecule ion. Compared with the usual perturbation approach, this new scheme converges much faster to the exact solutions for both eigenvalues and eigenfunctions. When properly extended, this new solution scheme can be very useful for dealing with strongly coupling quantum systems. - Highlights: Black-Right-Pointing-Pointer A new basis set expansion method is proposed. Black-Right-Pointing-Pointer Split kinetic energy method is proposed to solve quantum eigenvalue problems. Black-Right-Pointing-Pointer Significant improvement has been obtained in converging to exact results. Black-Right-Pointing-Pointer Extension of such methods is promising and discussed.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗