Real-Time Evolution for Ultracompact Hamiltonian Eigenstates on Quantum Hardware
Not Available
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
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.
Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.
Lie–Poisson Neural Networks (LPNets): Data-based computing of Hamiltonian systems with symmetries
An accurate data-based prediction of the long-term evolution of Hamiltonian systems requires a network that preserves the appropriate structure under each time step. Every Hamiltonian system contains two essential ingredients: the Poisson bracket and the Hamiltonian. Hamiltonian systems with symmetries, whose paradigm examples are the Lie–Poisson systems, have been shown to describe a broad category of physical phenomena, from satellite motion to underwater vehicles, fluids, geophysical applications, complex fluids, and plasma physics. The Poisson bracket in these systems comes from the symmetries, while the Hamiltonian comes from the underlying physics. We view the symmetry of the system as primary, hence the Lie–Poisson bracket is known exactly, whereas the Hamiltonian is regarded as coming from physics and is considered not known, or known approximately. Using this approach, we develop a network based on transformations that exactly preserve the Poisson bracket and the special functions of the Lie–Poisson systems (Casimirs) to machine precision. We present two flavors of such systems: one, where the parameters of transformations are computed from data using a dense neural network (LPNets), and another, where the composition of transformations is used as building blocks (G-LPNets). We also show how to adapt these methods to a larger class of Poisson brackets. We apply the resulting methods to several examples, such as rigid body (satellite) motion, underwater vehicles, a particle in a magnetic field, and others. The methods developed in this paper are important for the construction of accurate data-based methods for simulating the long-term dynamics of physical systems.
Data-based modeling↗
Programmable simulations of molecules and materials with reconfigurable quantum processors
Simulations of quantum chemistry and quantum materials are believed to be among the most important applications of quantum information processors. However, realizing practical quantum advantage for such problems is challenging because of the prohibitive computational cost of programming typical problems into quantum hardware. Here we introduce a simulation framework for strongly correlated quantum systems represented by model spin Hamiltonians that uses reconfigurable qubit architectures to simulate real-time dynamics in a programmable way. Our approach also introduces an algorithm for extracting chemically relevant spectral properties via classical co-processing of quantum measurement results. We develop a digital–analogue simulation toolbox for efficient Hamiltonian time evolution using digital Floquet engineering and hardware-optimized multi-qubit operations to accurately realize complex spin–spin interactions. As an example, we propose an implementation based on Rydberg atom arrays. In addition, we show how detailed spectral information can be extracted from the dynamics through snapshot measurements and single-ancilla control, enabling the evaluation of excitation energies and finite-temperature susceptibilities from a single dataset. To illustrate the approach, we show how to use the method to compute key properties of a polynuclear transition-metal catalyst and two-dimensional magnetic materials.
74 ATOMIC AND MOLECULAR PHYSICS↗
Promise of Graph Sparsification and Decomposition for Noise Reduction in QAOA: Analysis for Trapped-Ion Compilations
We develop new approximate compilation schemes that significantly reduce the expense of compiling the Quantum Approximate Optimization Algorithm (QAOA) for solving the Max-Cut problem. Our main focus is on compilation with trapped-ion simulators using Pauli-X operations and all-to-all Ising Hamiltonian HIsing evolution generated by Molmer-Sorensen or optical dipole force interactions, though some of our results also apply to standard gate-based compilations. Our results are based on principles of graph sparsification and decomposition; the former reduces the number of edges in a graph while maintaining its cut structure, while the latter breaks a weighted graph into a small number of unweighted graphs. Though these techniques have been used as heuristics in various hybrid quantum algorithms, there have been no guarantees on their performance, to the best of our knowledge. This work provides the first provable guarantees using sparsification and decomposition to improve quantum noise resilience and reduce quantum circuit complexity. For quantum hardware that uses edge-by-edge QAOA compilations, sparsification leads to a direct reduction in circuit complexity. For trapped-ion quantum simulators implementing all-to-all HIsing pulses, we show that for a (1−ϵ) factor loss in the Max-Cut approximation (ϵ>0), our compilations improve the (worst-case) number of HIsing pulses from O(n2) to O(nlog(n/ϵ)) and the (worst-case) number of Pauli-X bit flips from O(n2) to O(nlog(n/ϵ)ϵ2) for n-node graphs. This is an asymptotic improvement for any constant ϵ>0. We demonstrate that significant improvements to the approximation ratio are obtained using decomposition in simulated trapped-ion experiments with dephasing noise. We further present a generic argument showing that sparsification results in an exponentially improved circuit fidelity lower bound in digital computing schemes based on one- and two-qubit gates, which are relevant to a wide variety of hardwares such as superconducting qubits and certain neutral atom or trapped ion setups, and more sophisticated noise models. We anticipate these approximate compilation techniques will be useful tools in a variety of future quantum computing experiments.
Moondra, Jai [Georgia Institute of Technology]↗
On the Approximability of Random-Hypergraph MAX-3-XORSAT Problems with Quantum Algorithms
Constraint satisfaction problems are an important area of computer science. Many of these problems are in the complexity class NP which is exponentially hard for all known methods, both for worst cases and often typical. Fundamentally, the lack of any guided local minimum escape method ensures the hardness of both exact and approximate optimization classically, but the intuitive mechanism for approximation hardness in quantum algorithms based on Hamiltonian time evolution is poorly understood. We explore this question using the prototypically hard MAX-3-XORSAT problem class. We conclude that the mechanisms for quantum exact and approximation hardness are fundamentally distinct. We qualitatively identify why traditional methods such as quantum adiabatic optimization are not good approximation algorithms. We propose a new spectral folding optimization method that does not suffer from these issues and study it analytically and numerically. We consider random rank-3 hypergraphs including extremal planted solution instances, where the ground state satisfies an anomalously high fraction of constraints compared to truly random problems. We show that, if we define the energy to be $E = N_{unsat}-N_{sat}$, then spectrally folded quantum optimization will return states with energy $E \leq A E_{GS}$ (where $E_{GS}$ is the ground state energy) in polynomial time, where conservatively, $A \simeq 0.6$. We thoroughly benchmark variations of spectrally folded quantum optimization for random classically approximation-hard (planted solution) instances in simulation, and find performance consistent with this prediction. We do not claim that this approximation guarantee holds for all possible hypergraphs, though our algorithm's mechanism can likely generalize widely. These results suggest that quantum computers are more powerful for approximate optimization than had been previously assumed.
Kapit, Eliot↗
Adiabatic quantum imaginary time evolution
We introduce an adiabatic state preparation protocol which implements quantum imaginary time evolution under the Hamiltonian of the system. Unlike the original quantum imaginary time evolution algorithm, adiabatic quantum imaginary time evolution does not require quantum state tomography during its runtime and, unlike standard adiabatic state preparation, the final Hamiltonian is not the system Hamiltonian. Instead, the algorithm obtains the adiabatic Hamiltonian by integrating a classical differential equation that ensures that one follows the imaginary time evolution state trajectory. We introduce some heuristics that allow this protocol to be implemented on quantum architectures with limited resources. We explore the performance of this algorithm via classical simulations in a one-dimensional spin model and highlight essential features that determine its cost, performance, and implementability for longer times, and compare to the original quantum imaginary time evolution for ground-state preparation. More generally, our algorithm expands the range of states accessible to adiabatic state preparation methods beyond those that are expressed as ground states of simple explicit Hamiltonians. Published by the American Physical Society 2024
Hejazi, Kasra (ORCID:000000032349478X)↗
Efficient Berry phase calculation via adaptive variational quantum computing approach
We present an adaptive variational quantum algorithm to estimate the Berry phase accumulated by a nondegenerate ground state under cyclic, adiabatic evolution of a time-dependent Hamiltonian. Our method leverages cyclic adiabatic evolution of the Hamiltonian and employs adaptive variational quantum algorithms for state preparation and evolution, optimizing circuit efficiency while maintaining high accuracy. We benchmark our approach on dimerized Fermi–Hubbard chains with four sites, demonstrating precise Berry phase simulations in both noninteracting and interacting regimes. Our results show that circuit depths reach up to 106 layers for noninteracting systems and increase to 279 layers for interacting systems due to added complexity. In addition, we demonstrate the robustness of our scheme across a wide range of parameters governing adiabatic evolution and variational algorithms. These findings highlight the potential of adaptive variational quantum algorithms for advancing quantum simulations of topological materials and computing geometric phases in strongly correlated systems.
Mootz, Martin [Ames Laboratory (AMES), Ames, IA (U↗
Krylov Subspace Methods for Quantum Dynamics with Time-Dependent Generators
Krylov subspace methods in quantum dynamics identify the minimal subspace in which a process unfolds. To date, their use is restricted to time evolutions governed by time-independent generators. Here, we introduce a generalization valid for driven quantum systems governed by a time-dependent Hamiltonian that maps the evolution to a diffusion problem in a one-dimensional lattice with nearest-neighbor hopping probabilities that are inhomogeneous and time dependent. This representation is used to establish a novel class of fundamental limits to the quantum speed of evolution and operator growth. We also discuss generalizations of the algorithm, adapted to discretized time evolutions and periodic Hamiltonians, with applications to many-body systems.
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
Classical and quantum evolution in a simple coherent neutrino problem
The extraordinary neutrino flux produced in extreme astrophysical environments like the early Universe, core-collapse supernovae and neutron star mergers may produce coherent quantum neutrino oscillations on macroscopic length scales. The Hamiltonian describing this evolution can be mapped into quantum spin models with all-to-all couplings arising from neutrino-neutrino forward scattering. To date many studies of these oscillations have been performed in a mean-field limit where the neutrinos time evolve in a product state. In this paper we examine a simple two-beam model evolving from an initial product state and compare the mean-field and many-body evolution. The symmetries in this model allow us to solve the real-time evolution for the quantum many-body system for hundreds or thousands of spins, far beyond what would be possible in a more general case with an exponential number (2 N ) of quantum states. We compare mean-field and many-body solutions for different initial product states and ratios of one- and two-body couplings, and find that in all cases in the limit of infinite spins the mean-field (product state) and many-body solutions coincide for simple observables. This agreement can be understood as a consequence of the fact that the typical initial condition represents a very local but dense distribution about a mean energy in the spectrum of the Hamiltonian. We explore quantum information measures like entanglement entropy and purity of the many-body solutions, finding intriguing relationships between the quantum information measures and the dynamical behavior of simple physical observables.
72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
Understanding squeezing of quantum states with the Wigner function
The Wigner function is argued to be the only natural phase space function evolving classically under quadratic Hamiltonians with time-dependent bilinear part. This is used to understand graphically how certain quadratic time-dependent Hamiltonians induce squeezing of quantum states. The Wigner representation is also used to generalize Ehrenfest's theorem to the quantum uncertainties. This makes it possible to deduce features of the quantum evolution, such as squeezing, from the classical evolution, whatever the Hamiltonian.
Royer, Antoine↗
Rodeo Algorithm for Quantum Computing
We present a stochastic quantum computing algorithm that can prepare any eigenvector of a quantum Hamiltonian within a selected energy interval $\ [E-\epsilon, E+\epsilon]$. In order to reduce the spectral weight of all other eigenvectors by a suppression factor δ, the required computational effort scales as $\ O[|\log \delta|/(p \epsilon)]$, where p s the squared overlap of the initial state with the target eigenvector. The method, which we call the rodeo algorithm, uses auxiliary qubits to control the time evolution of the Hamiltonian minus some tunable parameter E . In this manner, we converge to the target eigenvector with exponential accuracy in the number of measurements. In addition to preparing eigenvectors, the method can also compute the full spectrum of the Hamiltonian. We illustrate the performance with several examples. For energy eigenvalue determination with error $\epsilon$, the computational scaling is $\ O[(\log \epsilon)^2/(p \epsilon)]$. For eigenstate preparation, the computational scaling is $\ O(\log \Delta/p)$, where $\Delta$ is the magnitude of the orthogonal component of the residual vector. The speed for eigenstate preparation is exponentially faster than that for phase estimation or adiabatic evolution.
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
Quantum error mitigation for Fourier moment computation
Hamiltonian moments in Fourier space—expectation values of the unitary evolution operator under a Hamiltonian at different times—provide a convenient framework to understand quantum systems. They offer insights into the energy distribution, higher-order dynamics, response functions, correlation information, and physical properties. This paper focuses on the computation of Fourier moments within the context of a nuclear effective field theory on superconducting quantum hardware. The study integrates echo verification and noise renormalization into Hadamard tests using control reversal gates. These techniques, combined with purification and error suppression methods, effectively address quantum hardware decoherence. The analysis, conducted using noise models, reveals a significant reduction in noise strength by two orders of magnitude. Moreover, quantum circuits involving up to 266 gates over five qubits demonstrate high accuracy under these methodologies when run on IBM superconducting quantum devices. Published by the American Physical Society 2025
Kiss, Oriel (ORCID:0000000174613342)↗
Diagonal state designs with reconfigurable real-time circuits
Unitary designs are widely used in quantum computation, but in many practical settings it suffices to construct a diagonal state design generated with unitary gates diagonal in the computational basis. In this work, we introduce a simple and efficient diagonal state 3-design based on real-time evolutions under 2-local Hamiltonians. Our construction is inspired by the classical Girard-Hutchinson trace estimator in that it involves the stochastic preparation of many random-phase states. Though the exact Girard-Hutchinson states are not tractably implementable on a quantum computer, we can construct states that match the statistical moments of the Girard-Hutchinson states with real-time evolution. Importantly, our random states are all generated using the same Hamiltonians for real-time evolution, with the randomness arising solely from stochastic variations in the durations of the evolutions. In this sense, the circuit is fully reconfigurable and thus suited for near-term realizations on both digital and analog platforms. Moreover, we show how to extend our construction to achieve diagonal state designs of arbitrarily high order.
Shen, Yizhi [LBL, Berkeley] (ORCID:000000024160548↗
Measuring the Loschmidt Amplitude for Finite-Energy Properties of the Fermi-Hubbard Model on an Ion-Trap Quantum Computer
Calculating the equilibrium properties of condensed-matter systems is one of the promising applications of near-term quantum computing. Recently, hybrid quantum-classical time-series algorithms have been proposed to efficiently extract these properties from a measurement of the Loschmidt amplitude ⟨ ψ | e − i H ^ t | ψ ⟩ from initial states | ψ ⟩ and a time evolution under the Hamiltonian H ^ up to short times t . In this work, we study the operation of this algorithm on a present-day quantum computer. Specifically, we measure the Loschmidt amplitude for the Fermi-Hubbard model on a 16 -site ladder geometry (32 orbitals) on the Quantinuum H2-1 trapped-ion device. We assess the effect of noise on the Loschmidt amplitude and implement algorithm-specific error-mitigation techniques. By using a thus-motivated error model, we numerically analyze the influence of noise on the full operation of the quantum-classical algorithm by measuring expectation values of local observables at finite energies. Finally, we estimate the resources needed for scaling up the algorithm. Published by the American Physical Society 2024
Physics↗
Improved Fermion Hamiltonians for Quantum Simulation
We developed a Hamiltonian inspired by ASQTAD and highly improved staggered quark (HISQ) actions and show how these Hamiltonians can be used for quantum simulations. Gate costs for the time evolution of these improved Hamiltonians are provided as well as a demonstration of the reduction of lattice spacing errors using the 1+1d lattice Schwinger model.
Gustafson, Erik↗
Quench dynamics of two-component dipolar fermions subject to a quasiperiodic potential
Motivated by recent experiments in fermionic polar gases, we study the nonequilibrium dynamics of two-component dipolar fermions subject to a quasiperiodic potential. We investigate the localization of charge and spin degrees of freedom time evolving with a long-range spin-SU(2) symmetric fermionic Hamiltonian by calculating experimentally accessible dynamical observables. To study the nonequilibrium dynamics, we start the time evolution with two initial states at half-filling: (i) product state with doublons |↑↓0↑↓0↑↓0↑↓0↑↓$\rangle$ and (ii) product state with singlons |↑↓↑↓↑↓↑↓↑↓$\rangle$. We carried out the real-time evolution via the fermionic Hamiltonian using exact diagonalization (ED) and the time-dependent variational principle (TDVP) for finite matrix product states (MPS), within experimentally relevant timescales. For the product state with doublons, we observe a delocalized to localized phase transition varying disorder strengths by monitoring the decay of charge imbalance with time. For the long-range interacting Hamiltonian of our focus, and in the presence of strong enough disorder, starting the time evolution with singlons we find a strong reduction in the spin delocalization, contrary to results of previous studies using the disordered short-range (on-site) Hubbard model with SU(2) symmetry. In addition to the quench dynamics, we also demonstrate the localization of charge and spin in the full energy spectrum of the long-range spin-SU(2) symmetric Hamiltonian by monitoring spin and charge autocorrelation functions. Finally, our predictions for localization of both charge and spin should be observable in ultracold experiments with fermionic dipolar atoms subject to a quasiperiodic potential.
75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
Fast-forwarding quantum evolution
We investigate the problem of fast-forwarding quantum evolution, whereby the dynamics of certain quantum systems can be simulated with gate complexity that is sublinear in the evolution time. We provide a definition of fast-forwarding that considers the model of quantum computation, the Hamiltonians that induce the evolution, and the properties of the initial states. Our definition accounts for any asymptotic complexity improvement of the general case and we use it to demonstrate fast-forwarding in several quantum systems. In particular, we show that some local spin systems whose Hamiltonians can be taken into block diagonal form using an efficient quantum circuit, such as those that are permutation-invariant, can be exponentially fast-forwarded. We also show that certain classes of positive semidefinite local spin systems, also known as frustration-free, can be polynomially fast-forwarded, provided the initial state is supported on a subspace of sufficiently low energies. Last, we show that all quadratic fermionic systems and number-conserving quadratic bosonic systems can be exponentially fast-forwarded in a model where quantum gates are exponentials of specific fermionic or bosonic operators, respectively. Our results extend the classes of physical Hamiltonians that were previously known to be fast-forwarded, while not necessarily requiring methods that diagonalize the Hamiltonians efficiently. We further develop a connection between fast-forwarding and precise energy measurements that also accounts for polynomial improvements.
97 MATHEMATICS AND COMPUTING↗
Quantum dynamics of cold atomic gas with SU(1,1) symmetry
Motivated by recent advances in quantum dynamics, we investigate the dynamics of the system with SU(1,1) symmetry. Instead of performing the time-ordered integral for the evolution operator of the time-dependent Hamiltonian, we show that the time evolution operator can be expressed as an SU(1,1) group element. Since the SU(1,1) group describes the “rotation” on a hyperbolic surface, the dynamics can be visualized on a Poincaré disk, a stereographic projection of the upper hyperboloid. As an example, we present the trajectory of the revival of Bose-Einstein condensation and that of the scale-invariant Fermi gas on the Poincaré disk. Further considering quantum gases in an oscillating lattice, we also study the dynamics of the system with time-dependent single-particle dispersion.
74 ATOMIC AND MOLECULAR PHYSICS↗