Search NASA⌕ Search

SEARCH · Search NASA

Results for “Hamiltonian simulation”

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 91 records · Page 5

Studying the Collective Functional Response of a Receptor in Alchemical Ligand Binding Free Energy Simulations with Accelerated Solvation Layer Dynamics

Ligand binding free energy simulations (LB-FES) that involve sampling of protein functional conformations have been longstanding challenges in research on molecular recognition. Particularly, modeling of the conformational transition pathway and design of the heuristic biasing mechanism are severe bottlenecks for the existing enhanced configurational sampling (ECS) methods. Inspired by the key role of hydration in regulating conformational dynamics of macromolecules, this report proposes a novel ECS approach that facilitates binding-associated structural dynamics by accelerated hydration transitions in combination with the lambda-exchange of free energy perturbation (FEP). Further, two challenging protein-ligand binding processes involving large configurational transitions of the receptor are studied, with hydration transitions at binding sites accelerated by Hamiltonian-simulated annealing of the hydration layer. Without the need for pathway analysis or ad hoc barrier flattening potential, LB-FES were performed with FEP/lambda-exchange molecular dynamics simulation at a minor overhead for annealing of the hydration layer. The LB-FES studies showed that the accelerated rehydration significantly enhances the collective conformational transitions of the receptor, and convergence of binding affinity calculations is obtained at a sweet-spot simulation time scale. Alchemical LB-FES with the proposed ECS strategy is free from the effort of trial and error for the setup and realizes efficient on-the-fly sampling for the collective functional response of the receptor and bound water and therefore presents a practical approach to high-throughput screening in drug discovery.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Quantum computing for fusion energy science applications

This is a review of recent research exploring and extending present-day quantum computing capabilities for fusion energy science applications. We begin with a brief tutorial on both ideal and open quantum dynamics, universal quantum computation, and quantum algorithms. Then, we explore the topic of using quantum computers to simulate both linear and nonlinear dynamics in greater detail. Because quantum computers can only efficiently perform linear operations on the quantum state, it is challenging to perform nonlinear operations that are generically required to describe the nonlinear differential equations of interest. In this work, we extend previous results on embedding nonlinear systems within linear systems by explicitly deriving the connection between the Koopman evolution operator, the Perron–Frobenius evolution operator, and the Koopman–von Neumann evolution (KvN) operator. We also explicitly derive the connection between the Koopman and Carleman approaches to embedding. Extension of the KvN framework to the complex-analytic setting relevant to Carleman embedding, and the proof that different choices of complex analytic reproducing kernel Hilbert spaces depend on the choice of Hilbert space metric are covered in the appendixes. Finally, we conclude with a review of recent quantum hardware implementations of algorithms on present-day quantum hardware platforms that may one day be accelerated through Hamiltonian simulation. We discuss the simulation of toy models of wave–particle interactions through the simulation of quantum maps and of wave–wave interactions important in nonlinear plasma dynamics.

Joseph, I. (ORCID:0000000255400840)↗

Evidence for Singlet Fission Driven by Vibronic Coherence in Crystalline Tetracene

Singlet fission proceeds rapidly and with high quantum efficiency in both crystalline tetracene and pentacene, which poses a conundrum given that the process in tetracene is disfavored by the electronic energetics. In this work, we use an ab initio exciton model to compute nonadiabatic couplings in the unit cell of tetracene in order to identify the modes that promote this process. Four intramolecular modes in the range of 1400–1600 cm –1 , which are nearly resonant with the single-exciton/multiexciton energy gap, appear to play a key role. Ab initio calculations of the electron/phonon coupling constants for these modes reveal that they are almost entirely of “Holstein” type, modulating the site energies rather than the intersite couplings. The constants are used to parametrize a vibronic Hamiltonian, simulations with which suggest a vibronically coherent singlet fission mechanism that proceeds spontaneously despite unfavorable electronic energetics. In the absence of vibronic coupling, there is no significant fission according to our model.

14 SOLAR ENERGY↗

Axion Insulator State in a Ferromagnet/Topological Insulator/Antiferromagnet Heterostructure

We propose the use of ferromagnetic insulator MnBi 2 Se 4 /Bi 2 Se 3 /antiferromagnetic insulator Mn 2 Bi 2 Se 5 heterostructures for the realization of the axion insulator state. Importantly, the axion insulator state in such heterostructures only depends on the magnetization of the ferromagnetic insulator and, hence, can be observed in a wide range of external magnetic fields. Using density functional calculations and model Hamiltonian simulations, we find that the top and bottom surfaces have opposite half-quantum Hall conductances, σ$^{t}_{xy}$ = e 2 /2h and σ$^{b}_{xy}$ = –e 2 /2h, with a sizable global spin gap of 5.1 meV opened for the topological surface states of Bi 2 Se 3 . Furthermore, our work provides a new strategy for the search of axion insulators by using van der Waals antiferromagnetic insulators along with three-dimensional topological insulators.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

JARVIS-Leaderboard: a large scale benchmark of materials design methods

Abstract Lack of rigorous reproducibility and validation are significant hurdles for scientific development across many fields. Materials science, in particular, encompasses a variety of experimental and theoretical approaches that require careful benchmarking. Leaderboard efforts have been developed previously to mitigate these issues. However, a comprehensive comparison and benchmarking on an integrated platform with multiple data modalities with perfect and defect materials data is still lacking. This work introduces JARVIS-Leaderboard, an open-source and community-driven platform that facilitates benchmarking and enhances reproducibility. The platform allows users to set up benchmarks with custom tasks and enables contributions in the form of dataset, code, and meta-data submissions. We cover the following materials design categories: Artificial Intelligence (AI), Electronic Structure (ES), Force-fields (FF), Quantum Computation (QC), and Experiments (EXP). For AI, we cover several types of input data, including atomic structures, atomistic images, spectra, and text. For ES, we consider multiple ES approaches, software packages, pseudopotentials, materials, and properties, comparing results to experiment. For FF, we compare multiple approaches for material property predictions. For QC, we benchmark Hamiltonian simulations using various quantum algorithms and circuits. Finally, for experiments, we use the inter-laboratory approach to establish benchmarks. There are 1281 contributions to 274 benchmarks using 152 methods with more than 8 million data points, and the leaderboard is continuously expanding. The JARVIS-Leaderboard is available at the website: https://pages.nist.gov/jarvis_leaderboard/

36 MATERIALS SCIENCE↗

Solving differential‐algebraic equations in power system dynamic analysis with quantum computing

Abstract Power system dynamics are generally modeled by high dimensional non‐linear differential‐algebraic equations (DAEs) given a large number of components forming the network. These DAEs' complexity can grow exponentially due to the increasing penetration of distributed energy resources, whereas their computation time becomes sensitive due to the increasing interconnection of the power grid with other energy systems. This paper demonstrates the use of quantum computing algorithms to solve DAEs for power system dynamic analysis. We leverage a symbolic programming framework to equivalently convert the power system's DAEs into ordinary differential equations (ODEs) using index reduction methods and then encode their data into qubits using amplitude encoding. The system non‐linearity is captured by Hamiltonian simulation with truncated Taylor expansion so that state variables can be updated by a quantum linear equation solver. Our results show that quantum computing can solve the power system's DAEs accurately with a computational complexity polynomial in the logarithm of the system dimension. We also illustrate the use of recent advanced tools in scientific machine learning for implementing complex computing concepts, that is, Taylor expansion, DAEs/ODEs transformation, and quantum computing solver with abstract representation for power engineering applications.

computational complexity↗

Random circuit block-encoded matrix and a proposal of quantum LINPACK benchmark

The LINPACK benchmark reports the performance of a computer for solving a system of linear equations with dense random matrices. Although this task was not designed with a real application directly in mind, the LINPACK benchmark has been used to define the list of TOP500 supercomputers since the debut of the list in 1993. We propose that a similar benchmark, called the quantum LINPACK benchmark, could be used to measure the whole machine performance of quantum computers. The success of the quantum LINPACK benchmark should be viewed as the minimal requirement for a quantum computer to perform a useful task of solving linear algebra problems, such as linear systems of equations. We propose an input model called the Random Circuit Block-Encoded Matrix (RACBEM), which is a proper generalization of a dense random matrix in the quantum setting. The RACBEM model is efficient to be implemented on a quantum computer and can be designed to optimally adapt to any given quantum architecture, with relying on a black-box quantum compiler. Besides solving linear systems, the RACBEM model can be used to perform a variety of linear algebra tasks relevant to many physical applications, such as computing spectral measures, time series generated by a Hamiltonian simulation, and thermal averages of the energy. We implement these linear algebra operations on IBM Q quantum devices as well as quantum virtual machines, and demonstrate their performance in solving scientific computing problems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Generalized Quantum Signal Processing

Quantum signal processing (QSP) and quantum singular value transformation (QSVT) currently stand as the most efficient techniques for implementing functions of block-encoded matrices, a central task that lies at the heart of most prominent quantum algorithms. However, current QSP approaches face several challenges, such as the restrictions imposed on the family of achievable polynomials and the difficulty of calculating the required phase angles for specific transformations. In this paper, we present a generalized quantum signal processing (GQSP) approach, employing general SU(2) rotations as our signal-processing operators, rather than relying solely on rotations in a single basis. Our approach lifts all practical restrictions on the family of achievable transformations, with the sole remaining condition being that | P | ≤ 1 , a restriction necessary due to the unitary nature of quantum computation. Furthermore, GQSP provides a straightforward recursive formula for determining the rotation angles needed to construct the polynomials in cases where P and Q are known. In cases where only P is known, we provide an efficient optimization algorithm capable of identifying in under a minute of GPU time, a corresponding Q for polynomials of degree on the order of 10 7 . We further illustrate GQSP simplifies QSP-based strategies for Hamiltonian simulation, offer an optimal solution to the ϵ -approximate fractional query problem that requires O ( ( 1 / δ ) + log ( 1 / ϵ ) ) queries to perform where O ( 1 / δ ) is a proved lower bound, and introduces novel approaches for implementing bosonic operators. Moreover, we propose a novel framework for the implementation of normal matrices, demonstrating its applicability through synthesis of diagonal matrices, as well as the development of a new algorithm for convolution through synthesis of circulant matrices using only O ( d log N + log 2 N ) 1 and 2-qubit gates for a filter of lengths d . Published by the American Physical Society 2024

Motlagh, Danial↗

Sampling-based Sublinear Low-rank Matrix Arithmetic Framework for Dequantizing Quantum Machine Learning

We present an algorithmic framework for quantum-inspired classical algorithms on close-to-low-rank matrices, generalizing the series of results started by Tang’s breakthrough quantum-inspired algorithm for recommendation systems [STOC’19]. Motivated by quantum linear algebra algorithms and the quantum singular value transformation (SVT) framework of Gilyén et al. [STOC’19], we develop classical algorithms for SVT that run in time independent of input dimension, under suitable quantum-inspired sampling assumptions. Our results give compelling evidence that in the corresponding QRAM data structure input model, quantum SVT does not yield exponential quantum speedups. Since the quantum SVT framework generalizes essentially all known techniques for quantum linear algebra, our results, combined with sampling lemmas from previous work, suffice to generalize all prior results about dequantizing quantum machine learning algorithms. In particular, our classical SVT framework recovers and often improves the dequantization results on recommendation systems, principal component analysis, supervised clustering, support vector machines, low-rank regression, and semidefinite program solving. We also give additional dequantization results on low-rank Hamiltonian simulation and discriminant analysis. Our improvements come from identifying the key feature of the quantum-inspired input model that is at the core of all prior quantum-inspired results: ℓ 2 -norm sampling can approximate matrix products in time independent of their dimension. We reduce all our main results to this fact, making our exposition concise, self-contained, and intuitive.

Computer Science↗

cyquandyn

CyQuanDyn is a collection of codes developed for modelling the phonon-induced carrier pumping in ZrTe5 system. Codes in the collection include 1) TLS: time-dependent two-orbital spinless fermion Bogoliubov-de Gennes Hamiltonian simulation, 2) TDSE: ab initio time-dependent Schrödinger equation simulation of the ZrTe5 system under the periodic modulation of A1g Raman mode. Associated publication is T. Jiang, P. P. Orth, L. Luo, L.-L. Wang, F. Zhang, C.-Z. Wang, J. Zhao, K.-M. Ho, J. Wang, and Y.-X. Yao, Ab-Initio Simulations of Coherent Phonon-Induced Pumping of Carriers in ZrTe5. [arXiv:2304.08449 (2023).](https://arxiv.org/abs/2304.08449)

Yao, Yongxin↗

Quantum Computing Algorithms and Applications for Coherent and Strongly Correlated Chemical Systems

This project advanced quantum algorithms, quantum information theory, strongly correlated electronic structure methods, molecular quantum materials, and exciton transport imaging in coherent condensed phase systems. Across the award period, the team developed new methods for open-quantum-system simulation, Hamiltonian learning, state tomography, reduced-density-matrix and contracted-quantum eigensolver approaches, and quantum diagnostics for device capability and openness.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Quantum algorithms for Gibbs sampling and hitting-time estimation

In this paper, we present quantum algorithms for solving two problems regarding stochastic processes. The first algorithm prepares the thermal Gibbs state of a quantum system and runs in time almost linear in √Nβ/Ζ and polynomial in log(1/ϵ), where N is the Hilbert space dimension, β is the inverse temperature, Ζ is the partition function, and ϵ is the desired precision of the output state. Our quantum algorithm exponentially improves the dependence on 1/ϵ and quadratically improves the dependence on β of known quantum algorithms for this problem. The second algorithm estimates the hitting time of a Markov chain. For a sparse stochastic matrix Ρ, it runs in time almost linear in 1/(ϵΔ 3/2 ), where ϵ is the absolute precision in the estimation and Δ is a parameter determined by Ρ, and whose inverse is an upper bound of the hitting time. Our quantum algorithm quadratically improves the dependence on 1/ϵ and 1/Δ of the analog classical algorithm for hitting-time estimation. Finally, both algorithms use tools recently developed in the context of Hamiltonian simulation, spectral gap amplification, and solving linear systems of equations.

97 MATHEMATICS AND COMPUTING↗

Fully gauge-fixed SU(2) Hamiltonian for quantum simulations

Here, we demonstrate how to construct a fully gauge-fixed lattice Hamiltonian for a pure SU(2) gauge theory. Our work extends upon previous work, where a formulation of an SU(2) lattice gauge theory was developed that is efficient to simulate at all values of the gauge coupling. That formulation utilized maximal-tree gauge, where all local gauge symmetries are fixed and a residual global gauge symmetry remains. By using the geometric picture of an SU(2) lattice gauge theory as a system of rotating rods, we demonstrate how to fix the remaining global gauge symmetry. In particular, the quantum numbers associated with total charge can be isolated by rotating between the lab and body frames using the three Euler angles. The Hilbert space in this new “sequestered” basis partitions cleanly into sectors with differing total angular momentum, which makes gauge-fixing to a particular total charge sector trivial, particularly for the charge-zero sector. In addition to this sequestered basis inheriting the property of being efficient at all values of the coupling, we show that, despite the global nature of the final gauge-fixing procedure, this Hamiltonian can be simulated using quantum resources scaling only polynomially with the lattice volume.

Lattice gauge theory↗

Improved Fermion Hamiltonians for Quantum Simulation

The Symanzik improvement program has been quite successful in classical simulations of quantum chromodynamics allowing calculations to be performed at coarser lattice spacings and with reduced computational resource costs. It is expected that improved Hamiltonians will be essential to simulate lattice field theories using quantum computers. In this work I will discuss the formulation of an ASQTAD and HISQ Hamiltonian amenable for quantum simulations. I will also show preliminary results that demonstrate significant tree-level contributions are removed in the spectrum of the 1 flavor Schwinger model.

quantum computing↗

Molecular Mechanics Simulations and Improved Tight-Binding Hamiltonians for Artificial Light Harvesting Systems: Predicting Geometric Distributions, Disorder, and Spectroscopy of Chromophores in a Protein Environment

We present molecular mechanics and spectroscopic calculations on prototype artificial light harvesting systems consisting of chromophores attached to a tobacco mosaic virus (TMV) protein scaffold. These systems have been synthesized and characterized spectroscopically, but information about the microscopic configurations and geometry of these TMV-templated chromophore assemblies is largely unknown. We use a Monte Carlo conformational search algorithm to determine the preferred positions and orientations of two chromophores, Coumarin 343 together with its linker and Oregon Green 488, when these are attached at two different sites (104 and 123) on the TMV protein. The resulting geometric information shows that the extent of disorder and aggregation properties and therefore the optical properties of the TMV-templated chromophore assembly are highly dependent on both the choice of chromophores and the protein site to which they are bound. We use the results of the conformational search as geometric parameters together with an improved tight-binding Hamiltonian to simulate the linear absorption spectra and compare with experimental spectral measurements. The ideal dipole approximation to the Hamiltonian is not valid because the distance between chromophores can be very small. Finally, we found that using the geometries from the conformational search is necessary to reproduce the features of the experimental spectral peaks.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Strategies for simulating the time evolution of Hamiltonian lattice field theories

Simulating the time evolution of quantum field theories given some Hamiltonian H requires developing algorithms for implementing the unitary operator e -iHt . A variety of techniques exist that accomplish this task, with the most common technique used so far being Trotterization, which is a special case of the application of a product formula. However, other techniques exist that promise better asymptotic scaling in certain parameters of the theory being simulated, the most efficient of which are based on the concept of block encoding. In this work we study the performance of such algorithms in simulating lattice field theories. We derive and compare the asymptotic gate complexities of several commonly used simulation techniques in application to Hamiltonian lattice field theories. Using the scalar $\hat{φ}$ 4 theory as a test, we also perform numerical studies and compare the gate costs required by product formulas and signal-processing-based techniques to simulate time evolution. For the latter, we use the linear combination of unitaries (LCU) construction augmented with the quantum Fourier transform circuit to switch between the field and momentum eigenbases, which leads to immediate order-of-magnitude improvement in the cost of preparing the block encoding. Further, this paper also includes a pedagogical review of the techniques used, in particular product formulas, LCU, qubitization, quantum signal processing, as well as the technique for simulating geometrically-local Hamiltonians developed by Haah, Hastings, Kothari, and Low.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Simulating typical entanglement with many-body Hamiltonian dynamics

We study the time evolution of the amount of entanglement generated by one-dimensional spin-1/2 Ising-type Hamiltonians composed of many-body interactions. We investigate sets of states randomly selected during the time evolution generated by several types of time-independent Hamiltonians by analyzing the distributions of the amount of entanglement of the sets. We compare such entanglement distributions with that of typical entanglement, entanglement of a set of states randomly selected from a Hilbert space with respect to the unitarily invariant measure. We show that the entanglement distribution obtained by a time-independent Hamiltonian can simulate the average and standard deviation of the typical entanglement, if the Hamiltonian contains suitable many-body interactions. We also show that the time required to achieve such a distribution is polynomial in the system size for certain types of Hamiltonians.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Simple Hamiltonian for quantum simulation of strongly coupled $(2+1)D$ SU(2) lattice gauge theory on a honeycomb lattice

Here, we find a simple spin Hamiltonian to describe physical states of $(2+1)$-dimensional SU(2) lattice gauge theory on a honeycomb lattice with a truncation of the electric field representation at $j_{max}=\frac{1}{2}$. The simple spin Hamiltonian contains only local products of Pauli matrices, even though Gauss’s law has been completely integrated out.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗