Search NASA⌕ Search

Engineering topics

Freericks, James K.

Publications and source records attributed to Freericks, James K..

7 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

Computational projects with the Landau–Zener problem in the quantum mechanics classroom

The Landau–Zener problem, where a minimum energy separation is passed with constant rate in a two-state quantum-mechanical system, is an excellent model quantum system for a computational project. It requires a low-level computational effort, but has a number of complex numerical and algorithmic issues that can be resolved through dedicated work. It can be used to teach computational concepts, such as accuracy, discretization, and extrapolation, and it reinforces quantum concepts of time-evolution via a time-ordered product and of extrapolation to infinite time via time-dependent perturbation theory. Additionally, we discuss the concept of compression algorithms, which are employed in many advanced quantum computing strategies, and easy to illustrate with the Landau–Zener problem.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2023

Efficient Application of the Factorized form of the Unitary Coupled-Cluster Ansatz for the Variational Quantum Eigensolver Algorithm by Using Linear Combination of Unitaries

The variational quantum eigensolver is one of the most promising algorithms for near-term quantum computers. It has the potential to solve quantum chemistry problems involving strongly correlated electrons with relatively low-depth circuits, which are otherwise difficult to solve on classical computers. The variational eigenstate is constructed from a number of factorized unitary coupled-cluster terms applied onto an initial (single-reference) state. Current algorithms for applying one of these operators to a quantum state require a number of operations that scale exponentially with the rank of the operator. We exploit a hidden SU(2) symmetry to allow us to employ the linear combination of unitaries approach, Our Prepare subroutine uses n+2 ancilla qubits for a rank-n operator. Our Select (U) scheme uses O(n) Cnot gates. This results in a full algorithm that scales like the cube of the rank of the operator n 3 , a significant reduction in complexity for rank five or higher operators. This approach, when combined with other algorithms for lower-rank operators (when compared to the standard implementation), will make the factorized form of the unitary coupled-cluster approach much more efficient to implement on all types of quantum computers.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Robust measurement of wave function topology on NISQ quantum computers

Topological quantum phases of quantum materials are defined through their topological invariants. These topological invariants are quantities that characterize the global geometrical properties of the quantum wave functions and thus are immune to local noise. Here, we present a strategy to measure topological invariants on quantum computers. We show that our strategy can be easily integrated with the variational quantum eigensolver (VQE) so that the topological properties of generic quantum many-body states can be characterized on current quantum hardware. We demonstrate the robust nature of the method by measuring topological invariants for both non-interacting and interacting models, and map out interacting quantum phase diagrams on quantum simulators and IBM quantum hardware.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

Exact solution of two simple non-equilibrium electron-phonon and electron-electron coupled systems: The atomic limit of the Holstein-Hubbard model and the generalized Hatsugai-Komoto model

One of the challenges in many-body physics is determining the effects of phonons on strongly correlated electrons. The difficulty arises from strong correlations at differing energy scales—for band metals, Migdal-Eliashberg theory accurately determines electron-phonon coupling effects due to the absence of vertex corrections, but strongly correlated electrons require a more complex description, and the standard Migdal-Eliashberg approach does not necessarily apply. In this work, we solve for the atomic limit Green's function of the Holstein-Hubbard model with both time-dependent electron-electron and electron-phonon couplings. Then, we examine the photoemission spectra of this model in and out of equilibrium. Next, we use similar methods to exactly solve an extended version of the Hatsugai-Komoto model and examine its behavior in and out of equilibrium. These calculations lead us to propose using the first moment of the photoemission spectra to signal non-equilibrium changes in electron-electron and electron-phonon couplings.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2020

Application of Quantum Computing to Biochemical Systems: A Look to the Future

Chemistry is considered as one of the more promising applications to science of near-term quantum computing. Recent work in transitioning classical algorithms to a quantum computer has led to great strides in improving quantum algorithms and illustrating their quantum advantage. Because of the limitations of near-term quantum computers, the most effective strategies split the work over classical and quantum computers. There is a proven set of methods in computational chemistry and materials physics that has used this same idea of splitting a complex physical system into parts that are treated at different levels of theory to obtain solutions for the complete physical system for which a brute force solution with a single method is not feasible. These methods are variously known as embedding, multi-scale, and fragment techniques and methods. We review these methods and then propose the embedding approach as a method for describing complex biochemical systems, with the parts not only treated with different levels of theory, but computed with hybrid classical and quantum algorithms. Such strategies are critical if one wants to expand the focus to biochemical molecules that contain active regions that cannot be properly explained with traditional algorithms on classical computers. While we do not solve this problem here, we provide an overview of where the field is going to enable such problems to be tackled in the future.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗