SEARCH · Search NASA

Results for “Hamiltonian evolution”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 199 records · Page 11

All sources NASA NTRS DOE OSTI

DOE OSTI2024

Demonstration of the rodeo algorithm on a quantum computer

The rodeo algorithm is an efficient algorithm for eigenstate preparation and eigenvalue estimation for any observable on a quantum computer. This makes it a promising tool for studying the spectrum and structure of atomic nuclei as well as other fields of quantum many-body physics. The only requirement is that the initial state has sufficient overlap probability with the desired eigenstate. While it is exponentially faster than well-known algorithms such as phase estimation and adiabatic evolution for eigenstate preparation, it has yet to be implemented on an actual quantum device. In this work, we apply the rodeo algorithm to determine the energy levels of a random one-qubit Hamiltonian, resulting in a relative error of 0.08% using mid-circuit measurements on the IBM Q device Casablanca. This surpasses the accuracy of directly-prepared eigenvector expectation values using the same quantum device. We take advantage of the high-accuracy energy determination and use the Hellmann-Feynman theorem to compute eigenvector expectation values for a different random one-qubit observable. For the Hellmann-Feynman calculations, we find a relative error of 0.7%. Here, we conclude by discussing possible future applications of the rodeo algorithm for multi-qubit Hamiltonians.

algorithm↗

NASA NTRS1995

Molecular vibrational states during a collision

Alternative algebraic techniques to approximate a given Hamiltonian by a harmonic oscillator are described both for time-independent and time-dependent systems. We apply them to the description of a one dimensional atom-diatom collision. From the resulting evolution operator, we evaluate vibrational transition probabilities as well as other time-dependent properties. As expected, the ground vibrational state becomes a squeezed state during the collision.

Recamier, Jose A.↗

DOE OSTI2022

Local analysis of fast magnetic reconnection

Fast magnetic reconnection is defined by the topology of the magnetic field lines changing on a timescale that is approximately an order of magnitude longer than the topology-conserving ideal-evolution timescale. Fast reconnection is an intrinsic property of Faraday's law when the evolving magnetic field depends non-trivially on all three spatial coordinates and is commonly observed—even when the effects that allow topology breaking are arbitrarily small. The associated current density need only be enhanced by a factor of approximately ten and flows in thin but broad ribbons along the magnetic field. These results follow from the variation in the separation of neighboring pairs of magnetic field lines, which in an ideal evolution typically increases exponentially with time, and the existence of a spatial scale below which magnetic field lines freely change their identities due to non-ideal effects, such as resistivity. Traditional reconnection theory ignores exponentially large variations and relies on the current density reaching a magnitude that is exponentially larger than is actually required. Here, an analysis of the behavior of magnetic field lines in the neighborhood of an arbitrarily chosen line is used to obtain more precise and rigorous results on intrinsic reconnection. The maximum parallel kinetic energy of collisionless charged particles is shown to have an exponential increase in time during a generic magnetic evolution.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

NASA NTRS1987

Computational vortex dynamics in two and three dimensions

A discussion of some solutions and outstanding problems of dissipationless and nearly dissipationless flows in two and three dimensions is presented. In particular, two-dimensional steady-state solutions, linear stability and nonlinear evolutions including axisymmetrization of isolated vortex regions and merger or condensation of like-signed vorticity regions, are reviewed. These results are obtained from pseudo-spectral codes, contour dynamical (CD) codes and a new Hamiltonian moment-model of the Euler equations

Melander, Mogens V.↗

DOE OSTI2022

Footprints of Kitaev spin liquid in the Fano lineshape of Raman-active optical phonons

We develop a theoretical description of the Raman spectroscopy in the spin-phonon-coupled Kitaev system and show that it can provide observable signatures of fractionalized excitations characteristic of the underlying spin-liquid phase. In particular, we obtain the explicit form of the phonon modes and construct the coupling Hamiltonian based on the D 3d symmetry. We then systematically compute the Raman intensity and show that the spin-phonon coupling renormalizes phonon propagators and generates the salient Fano lineshape. We find that the temperature evolution of the Fano lineshape displays two crossovers, and the low-temperature crossover shows pronounced magnetic-field dependence. We thus identify the observable effect of the Majorana fermions and the Z2 gauge fluxes encoded in the Fano lineshape. Our results are consistent with the phonon Raman scattering experiments in the candidate material α-RuCl 3 .

36 MATERIALS SCIENCE↗

NASA NTRS1994

Evolution of wave function in a dissipative system

For a dissipative system with Ohmic friction, we obtain a simple and exact solution for the wave function of the system plus the bath. It is described by the direct product in two independent Hilbert space. One of them is described by an effective Hamiltonian, the other represents the effect of the bath, i.e., the Brownian motion, thus clarifying the structure of the wave function of the system whose energy is dissipated by its interaction with the bath. No path integral technology is needed in this treatment. The derivation of the Weisskopf-Wigner line width theory follows easily.

Yu, Li-Hua↗

DOE OSTI2026

JIMWLK on a quantum computer

We propose a method for solving the Jalilian-Marian-Iancu-McLerran-Weigert-Leonidov-Kovner (JIMWLK) evolution equation on quantum computers. Our approach exploits the reformulation of the JIMWLK equation as a Lindblad master equation governing the rapidity evolution of the hadronic density matrix, as established in prior work. To render the problem tractable for quantum simulation, we introduce several approximations: the two-dimensional transverse plane is reduced to a one-dimensional radial lattice by assuming azimuthal symmetry of the jump operators; the gauge group is restricted to SU(2); and the infinite Wilson lines of the JIMWLK equation are replaced by finite Wilson links along the light-cone direction. The resulting bosonic Hilbert space is truncated using the electric field basis familiar from Hamiltonian lattice gauge theory, with states restricted to angular momenta 𝑗 ≤ 𝑗 max . We derive the matrix elements of the JIMWLK Lindblad jump operators in this basis. As a benchmark, we demonstrate rapid convergence of the fundamental dipole expectation value with 𝑗 max for both pure and mixed Gaussian initial density matrices. For the simplest truncation, 𝑗 max =1/2, we implement the Lindblad evolution using a quantum simulation algorithm verified with the Qiskit statevector simulator by decomposing the non-unitary evolution operator into a linear combination of unitaries. This work establishes a concrete pathway toward quantum simulation of high-energy quantum chromodynamics evolution equations, with direct relevance to the physics program of the Electron-Ion Collider.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

DOE OSTI2024

Practical Hamiltonian learning with unitary dynamics and Gibbs states

We study the problem of learning the parameters for the Hamiltonian of a quantum many-body system, given limited access to the system. In this work, we build upon recent approaches to Hamiltonian learning via derivative estimation. We propose a protocol that improves the scaling dependence of prior works, particularly with respect to parameters relating to the structure of the Hamiltonian (e.g., its locality k). Furthermore, by deriving exact bounds on the performance of our protocol, we are able to provide a precise numerical prescription for theoretically optimal settings of hyperparameters in our learning protocol, such as the maximum evolution time (when learning with unitary dynamics) or minimum temperature (when learning with Gibbs states). Thanks to these improvements, our protocol has practical scaling for large problems: we demonstrate this with a numerical simulation of our protocol on an 80-qubit system.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2022

A quantum hamiltonian simulation benchmark

Hamiltonian simulation is one of the most important problems in quantum computation, and quantum singular value transformation (QSVT) is an efficient way to simulate a general class of Hamiltonians. However, the QSVT circuit typically involves multiple ancilla qubits and multi-qubit control gates. In order to simulate a certain class of n-qubit random Hamiltonians, we propose a drastically simplified quantum circuit that we refer to as the minimal QSVT circuit, which uses only one ancilla qubit and no multi-qubit controlled gates. We formulate a simple metric called the quantum unitary evolution score (QUES), which is a scalable quantum benchmark and can be verified without any need for classical computation. Under the globally depolarized noise model, we demonstrate that QUES is directly related to the circuit fidelity, and the potential classical hardness of an associated quantum circuit sampling problem. Under the same assumption, theoretical analysis suggests there exists an ‘optimal’ simulation time t opt ≈ 4.81, at which even a noisy quantum device may be sufficient to demonstrate the potential classical hardness.

97 MATHEMATICS AND COMPUTING↗

NASA NTRS2004

Random Matrix Approach to Quantum Adiabatic Evolution Algorithms

We analyze the power of quantum adiabatic evolution algorithms (Q-QA) for solving random NP-hard optimization problems within a theoretical framework based on the random matrix theory (RMT). We present two types of the driven RMT models. In the first model, the driving Hamiltonian is represented by Brownian motion in the matrix space. We use the Brownian motion model to obtain a description of multiple avoided crossing phenomena. We show that the failure mechanism of the QAA is due to the interaction of the ground state with the "cloud" formed by all the excited states, confirming that in the driven RMT models. the Landau-Zener mechanism of dissipation is not important. We show that the QAEA has a finite probability of success in a certain range of parameters. implying the polynomial complexity of the algorithm. The second model corresponds to the standard QAEA with the problem Hamiltonian taken from the Gaussian Unitary RMT ensemble (GUE). We show that the level dynamics in this model can be mapped onto the dynamics in the Brownian motion model. However, the driven RMT model always leads to the exponential complexity of the algorithm due to the presence of the long-range intertemporal correlations of the eigenvalues. Our results indicate that the weakness of effective transitions is the leading effect that can make the Markovian type QAEA successful.

Boulatov, Alexei↗

DOE OSTI2021

Success of digital adiabatic simulation with large Trotter step

The simulation of adiabatic evolution has deep connections with adiabatic quantum computation, the quantum approximate optimization algorithm, and adiabatic state preparation. Here we address the error analysis problem in quantum simulation of adiabatic process using Trotter formulas. Here we show that with additional conditions, the circuit depth can be linear in simulation time T. The improvement comes from the observation that the fidelity error here can't be estimated by the norm distance between evolution operators. This phenomenon is termed the robustness of discretization in digital adiabatic simulation. It can be explained in three steps, from analytical and numerical evidence: (1) The fidelity error should be estimated by applying adiabatic theorem on the effective Hamiltonian instead. (2) Because of the specialty of Riemann-Lebesgue lemma, most adiabatic process is naturally robust against discretization. (3) As the Trotter step gets larger, the spectral gap of effective Hamiltonian tends to close, which results in the failure of digital adiabatic simulation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2022

Role of non-Gaussian quantum fluctuations in neutrino entanglement

The flavor evolution of neutrinos in environments with large neutrino number densities is an open problem at the nexus of astrophysics and neutrino flavor physics. Among the many unanswered questions pertaining to this problem, it remains to be determined whether neutrino-neutrino coherent scattering can give rise to nontrivial quantum entanglement among neutrinos, and whether this can affect the flavor evolution in a meaningful way. To gain further insight into this question, here we study a simple system of two interacting neutrino beams and obtain the exact phase space explored by this system using the Husimi quasiprobability distribution. We observe that the entanglement induced by the coupling leads to strong delocalization in phase-space with largely non-Gaussian quantum fluctuations. The link between the neutrino entanglement and quantum fluctuations is illustrated using the one- and two-neutrino entropy. In addition, we propose an approximate phase-space method to describe the interacting neutrinos problem, where the exact evolution is replaced by a set of independent mean-field evolutions with a statistical sampling of the initial conditions. The phase-space approach provides a simple and accurate method to describe the gross features of the neutrino entanglement problem. Applications are shown using time-independent and time-dependent Hamiltonians in the nonadiabatic regime.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

DOE OSTI2022

Role of non-gaussian quantum fluctuations in neutrino entanglement

The flavor evolution of neutrinos in environments with large neutrino number densities is an open problem at the nexus of astrophysics and neutrino flavor physics. Among the many unanswered questions pertaining to this problem, it remains to be determined whether neutrino-neutrino coherent scattering can give rise to nontrivial quantum entanglement among neutrinos, and whether this can affect the flavor evolution in a meaningful way. To gain further insight into this question, here we study a simple system of two interacting neutrino beams, and obtain the exact phase-space explored by this system using the Husimi quasi-probability distribution. We observe that the entanglement induced by the coupling leads to strong delocalization in phase-space with largely non-Gaussian quantum fluctuations. The link between the neutrino entanglement and quantum fluctuations is illustrated using the one- and two-neutrino entropy. In addition, we propose an approximate phase-space method to describe the interacting neutrinos problem, where the exact evolution is replaced by a set of independent mean-field evolutions with a statistical sampling of the initial conditions. The phase-space approach provides a simple and accurate method to describe the gross features of the neutrino entanglement problem. Applications are shown using time-independent and time-dependent Hamiltonians in the non-adiabatic regime.

Patwardhan, Amol↗

DOE OSTI2023

Time-Energy Uncertainty Relation for Noisy Quantum Metrology

Detection of very weak forces and precise measurement of time are two of the many applications of quantum metrology to science and technology. To sense an unknown physical parameter, one prepares an initial state of a probe system, allows the probe to evolve as governed by a Hamiltonian 𝐻 for some time 𝑡, and then measures the probe. If 𝐻 is known, we can estimate 𝑡 by this method; if 𝑡 is known, we can estimate classical parameters on which 𝐻 depends. The accuracy of a quantum sensor can be limited by either intrinsic quantum noise or by noise arising from the interactions of the probe with its environment. In this work, we introduce and study a fundamental trade-off, which relates the amount by which noise reduces the accuracy of a quantum clock to the amount of information about the energy of the clock that leaks to the environment. Specifically, we consider an idealized scenario in which a party Alice prepares an initial pure state of the clock, allows the clock to evolve for a time that is not precisely known, and then transmits the clock through a noisy channel to a party Bob. Meanwhile, the environment (Eve) receives any information about the clock that is lost during transmission. We prove that Bob’s loss of quantum Fisher information about the elapsed time is equal to Eve’s gain of quantum Fisher information about a complementary energy parameter. We also prove a similar, but more general, trade-off that applies when Bob and Eve wish to estimate the values of parameters associated with two noncommuting observables. We derive the necessary and sufficient conditions for the accuracy of the clock to be unaffected by the noise, which form a subset of the Knill-Laflamme error-correction conditions. A state and its local time-evolution direction, if they satisfy these conditions, are said to form a metrological code. We provide a scheme to construct metrological codes in the stabilizer formalism. We show that there are metrological codes that cannot be written as a quantum error-correcting code with similar distance in which the Hamiltonian acts as a logical operator, potentially offering new schemes for constructing states that do not lose any sensitivity upon application of a noisy channel. We discuss applications of the trade-off relation to sensing using a quantum many-body probe subject to erasure or amplitude-damping noise.

metrology↗

DOE OSTI2025

Efficient quantum simulation of QCD jets on the light front

Quark and gluon jets provide one of the best ways to probe the matter produced in ultrarelativistic high-energy collisions, from cold nuclear matter to hot quark-gluon plasma. In this work, we propose a unified framework for efficient quantum simulation of many-body dynamics using the ( 3 + 1 )-dimensional QCD Hamiltonian on the light front, particularly suited for studying the scattering of quark and gluon jets on nuclear matter in heavy-ion collisions. We describe scalable methods for mapping physical degrees of freedom onto qubits and for simulating in-medium jet evolution. We then validate our framework by implementing an algorithm that directly maps second-quantized Fock states onto qubits and uses Trotterized simulation for simulating time dynamics. Using a classical emulator, we investigate the evolution of quark and gluon jets with up to three particles in Fock states, extending prior studies. These calculations enable the study of key observables, including jet momentum broadening, particle production, and parton distribution functions. Published by the American Physical Society 2025

Qian, Wenyang (ORCID:0000000155250996)↗

NASA NTRS1990

Chaos in driven Alfven systems

The chaos in a one-dimensional system, which would be nonlinear stationary Alfven waves in the absence of an external driver, is characterized. The evolution equations are numerically integrated for the transverse wave magnetic field amplitude and phase using the derivative nonlinear Schroedinger equation (DNLS), including resistive wave damping and a long-wavelength monochromatic, circularly polarized driver. A Poincare map analysis shows that, for the nondissipative (Hamiltonian) case, the solutions near the phase space (soliton) separatrices of this system become chaotic as the driver amplitude increases, and 'strong' chaos appears when the driver amplitude is large. The dissipative system exhibits a wealth of dynamical behavior, including quasiperiodic orbits, period-doubling bifurcations leading to chaos, sudden transitions to chaos, and several types of strange attractors.

Hada, T.↗

NASA NTRS2019

Exploring Network-Related Optimization Problems Using Quantum Heuristics

Network-related connectivity optimization problems are underlying a wide range of applications and are also of high computational complexity. We consider studying network optimization problems using two types of quantum heuristics.One is quantum annealing, and the other Quantum Alternating Operator Ansatz, an extension of the Quantum Approximate Optimization Algorithms for gate-model quantum computation, in which a cost-function based unitary and a non-commuting mixing unitary are applied alternately. We present problem mappings for problems of finding the spanning-tree or spanning-graph of a graph that optimizes certain costs, and a variant that further requires the spanning-tree be degree-bounded. With quantum annealing, all constraints are cast into penalty terms in the cost Hamiltonian, and the solution is encoded as the ground state of the Hamiltonian. We provide three mappings to the quadratic unconstrained binary optimization (QUBO) form, compare the resource requirements, and analyze the tradeoffs. For QAOA, we give special focus on the design of mixers based on the constraints presented in the problem, such that the system evolution remains in a subspace of the full Hilbert space where all constraints are satisfied. In the spanning-tree problem, one such hard constraint is that a mixer applied to a spanning-tree needs also be a spanning tree. This involves checking the connectivity of a subgraph, which is a global condition common for most network-related problems. We show how this feature can be efficiently represented in the mixer in a quantum coherent way, based on manipulation of a descendant-matrix and an adjacent matrix. We further develop a mixer for the spanning-graphs based on the spanning-tree mixer.

Wang, Zhihui↗

NASA NTRS2019

Study network-related optimization problems using quantum alternating optimization ansatz

Network-related connectivity optimization problems are underlying a wide range of applications and are also of high computational complexity. We consider studying network optimization problems using two types of quantum heuristics. One is quantum annealing, and the other Quantum Alternating Operator Ansatz, an extension of the Quantum Approximate Optimization Algorithms for gate-model quantum computation, in which a cost-function based unitary and a non-commuting mixing unitary are applied alternately. We present problem mappings for problems of finding the spanning-tree or spanning-graph of a graph that optimizes certain costs, and a variant that further requires the spanning-tree be degree-bounded. With quantum annealing, all constraints are cast into penalty terms in the cost Hamiltonian, and the solution is encoded as the ground state of the Hamiltonian. We provide three mappings to the quadratic unconstrained binary optimization (QUBO) form, compare the resource requirements, and analyze the tradeoffs. For QAOA, we give special focus on the design of mixers based on the constraints presented in the problem, such that the system evolution remains in a subspace of the full Hilbert space where all constraints are satisfied. In the spanning-tree problem, one such hard constraint is that a mixer applied to a spanning-tree needs also be a spanning tree. This involves checking the connectivity of a subgraph, which is a global condition common for most network-related problems. We show how this feature can be efficiently represented in the mixer in a quantum coherent way, based on manipulation of a descendant-matrix and an adjacent matrix. We further develop a mixer for the spanning-graphs based on the spanning-tree mixer.

Zhihui Wang↗