Engineering PapersSearch

SEARCH · Engineering Papers

Results for “Hamiltonians”

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 37 records · Page 2

Discrete Superconvergence Analysis for Quantum Magnus Algorithms of Unbounded Hamiltonian Simulation

Motivated by various applications, unbounded Hamiltonian simulation has recently garnered great attention. Quantum Magnus algorithms, designed to achieve commutator scaling for time-dependent Hamiltonian simulation, have been found to be particularly efficient for such applications. When applied to unbounded Hamiltonian simulation in the interaction picture, they exhibit an unexpected superconvergence phenomenon. However, existing proofs are limited to the spatially continuous setting and do not extend to discrete spatial discretizations. Here, in this work, we provide the first superconvergence estimate in the fully discrete setting with a finite number of spatial discretization points N, and show that it holds with an error constant uniform in N. The proof is based on the two-parameter symbol class, which, to our knowledge, is applied for the first time in algorithm analysis. The key idea is to establish a semiclassical framework by identifying two parameters through the discretization number and the time step size rescaled by the operator norm, such that the semiclassical uniformity guarantees the uniformity of both. This approach may have broader applications in numerical analysis beyond the specific context of this work.

Borns-Weil, Yonah [University of California, Berke

Leveraging Hamiltonian simulation techniques to compile operations on bosonic devices

Circuit quantum electrodynamics enables the combined use of qubits and oscillator modes. Despite a variety of available gate sets, many hybrid qubit-boson (i.e. qubit-oscillator) operations are realizable only through optimal control theory, which is oftentimes intractable and uninterpretable. We introduce an analytic approach with rigorously proven error bounds for realizing specific classes of operations via two matrix product formulas commonly used in Hamiltonian simulation, the Lie–Trotter–Suzuki and Baker–Campbell–Hausdorff product formulas. We show how this technique can be used to realize a number of operations of interest, including polynomials of annihilation and creation operators, namely (a) p (a † ) q for integer p, q. We show examples of this paradigm including obtaining universal control within a subspace of the entire Fock space of an oscillator, state preparation of a fixed photon number in the cavity, simulation of the Jaynes–Cummings Hamiltonian, and simulation of the Hong-Ou-Mandel effect. This work demonstrates how techniques from Hamiltonian simulation can be applied to better control hybrid qubit-boson devices.

bosonic qubits

Improved honeycomb and hyperhoneycomb lattice Hamiltonians for quantum simulations of non-Abelian gauge theories

Improved Kogut-Susskind Hamiltonians for quantum simulations of non-Abelian Yang-Mills gauge theories are developed for honeycomb (2+1⁢D) and hyperhoneycomb (3+1⁢D) spatial tessellations. This is motivated by the desire to identify lattices for quantum simulations that involve only 3-link vertices among the gauge field group spaces in order to reduce the complexity in applications of the plaquette operator. For the honeycomb lattice, we derive a classically 𝒪⁡(𝑏 2 )-improved Hamiltonian, with 𝑏 being the lattice spacing. Tadpole improvement via the mean-field value of the plaquette operator is used to provide the corresponding quantum improvements. We have identified the (nonchiral) hyperhoneycomb as a candidate spatial tessellation for 3+1⁢D quantum simulations of gauge theories, and determined the associated 𝒪⁡(𝑏)-improved Hamiltonian.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC

Systematic Construction of Time-Dependent Hamiltonians for Microwave-Driven Josephson Circuits

Time-dependent electromagnetic drives are fundamental for controlling complex quantum systems, including superconducting Josephson circuits. In these devices, accurate time-dependent Hamiltonian models are imperative for predicting their dynamics and designing high-fidelity quantum operations. Existing numerical methods, such as black-box quantization (BBQ) and energy-participation ratio (EPR), excel at modeling the static Hamiltonians of Josephson circuits. However, these techniques do not fully capture the behavior of driven circuits stimulated by external microwave drives, nor do they include a generalized approach to account for the inevitable noise and dissipation that enter through microwave ports. Here, we introduce numerical techniques that leverage classical microwave simulations, efficiently executable in finite-element solvers, to obtain the time-dependent Hamiltonian of microwave-driven superconducting circuits with arbitrary geometries under charge, flux, or mixed electromagnetic modulation. Importantly, our techniques do not rely on a lumped-element description of the superconducting circuit, in contrast to previous approaches to tackling this problem. We demonstrate the versatility of our approach by characterizing the driven properties of realistic circuit devices in complex electromagnetic environments, including coherent dynamics due to charge and flux modulation, as well as drive-induced relaxation and dephasing. Our techniques offer a powerful toolbox for optimizing circuit designs and advancing practical applications in superconducting quantum computing.

Lu, Yao [Yale U.; Yale U. (main); Fermilab] (ORCID

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

Hamiltonian learning using machine-learning models trained with continuous measurements

Here, we build upon recent work on the use of machine-learning models to estimate Hamiltonian parameters using continuous weak measurement of qubits as input. We consider two settings for the training of our model: (1) supervised learning, where the weak-measurement training record can be labeled with known Hamiltonian parameters, and (2) unsupervised learning, where no labels are available. The first has the advantage of not requiring an explicit representation of the quantum state, thus potentially scaling very favorably to a larger number of qubits. The second requires the implementation of a physical model to map the Hamiltonian parameters to a measurement record, which we implement using an integrator of the physical model with a recurrent neural network to provide a model-free correction at every time step to account for small effects not captured by the physical model. We test our construction on a system of two qubits and demonstrate accurate prediction of multiple physical parameters in both the supervised context and the unsupervised context. We demonstrate that the model benefits from larger training sets, establishing that it is “learning,” and we show robustness regarding errors in the assumed physical model by achieving accurate parameter estimation in the presence of unanticipated single-particle relaxation.

97 MATHEMATICS AND COMPUTING

Compressing Hamiltonians with ab initio downfolding for simulating strongly-correlated materials on quantum computers

The accurate first-principles description of strongly correlated materials is an important and challenging problem in condensed matter physics. Ab initio downfolding has emerged as a way of deriving compressed many-body Hamiltonians that maintain the essential physics of strongly correlated materials. The solution of these material-specific models is still exponentially difficult to generate on classical computers, but quantum algorithms allow for a significant speed-up in obtaining the ground states of these compressed Hamiltonians. Here, we demonstrate that using quantum algorithms to obtain the properties of downfolded Hamiltonians can indeed yield high-fidelity solutions. By combining ab initio downfolding and variational quantum eigensolvers, we correctly predict the antiferromagnetic state of one-dimensional cuprate Ca 2 Cu O 3 , the excitonic ground state of monolayer W Te 2 , and the charge-ordered state of correlated metal Sr VO 3 . Numerical simulations using a classical tensor network implementation of variational quantum eigensolvers allow us to simulate large models with up to 54 qubits and encompassing up to four bands in the correlated subspace, which is indicative of the complexity that our framework can address. Through these methods we demonstrate the potential of classical preoptimization and downfolding techniques for enabling efficient materials simulation using quantum algorithms.

Alvertis, Antonios M. [NASA, Ames; LBNL, Berkeley]

Efficient Hamiltonian encoding algorithms for extracting quantum control mechanism as interfering pathway amplitudes in the Dyson series

Hamiltonian encoding is a methodology for revealing the mechanism behind the dynamics governing controlled quantum systems. In this paper, following Mitra and Rabitz \cite{abhra_1}, we define mechanism via pathways of eigenstates that describe the evolution of the system, where each pathway is associated with a complex-valued amplitude corresponding to a term in the Dyson series. The evolution of the system is determined by the constructive and destructive interference of these pathway amplitudes. Pathways with similar attributes can be grouped together into pathway classes. The amplitudes of pathway classes are computed by modulating the Hamiltonian matrix elements and decoding the subsequent evolution of the system rather than by direct computation of the individual terms in the Dyson series. The original implementation of Hamiltonian encoding was computationally intensive and became prohibitively expensive in large quantum systems. This paper presents two new encoding algorithms that calculate the amplitudes of pathway classes by using techniques from graph theory and algebraic topology to exploit patterns in the set of allowed transitions, greatly reducing the number of matrix elements that need to be modulated. These new algorithms provide an exponential decrease in both computation time and memory utilization with respect to the Hilbert space dimension of the system. To demonstrate the use of these techniques, they are applied to two illustrative state-to-state transition problems.

Abrams, Erez [Princeton University, Massachusetts

The electronic Hamiltonian for cuprates

A realistic many-body Hamiltonian for the cuprate superconductors should include both copper d and oxygen p states, hopping matrix elements between them, and Coulomb energies, both on-site and inter-site. We have developed a novel computational scheme for deriving the relevant parameters ab initio from a constrained occupation local density functional. The scheme includes numerical calculation of appropriate Wannier functions for the copper and oxygen states. Explicit parameter values are given for La2CuO4. These parameters are generally consistent with other estimates and with the observed superexchange energy. Secondly, we address whether this complicated multi-band Hamiltonian can be reduced to a simpler one with fewer basis states per unit cell. We propose a mapping onto a new two-band effective Hamiltonian with one copper d and one oxygen p derived state per unit cell. This mapping takes into account the large oxygen-oxygen hopping given by the ab initio calculations.

Annett, James F.

Minimum Hamiltonian Ascent Trajectory Evaluation (MASTRE) program (update to automatic flight trajectory design, performance prediction, and vehicle sizing for support of Shuttle and Shuttle derived vehicles) engineering manual

The Minimum Hamiltonian Ascent Trajectory Evaluation (MASTRE) program and its predecessors, the ROBOT and the RAGMOP programs, have had a long history of supporting MSFC in the simulation of space boosters for the purpose of performance evaluation. The ROBOT program was used in the simulation of the Saturn 1B and Saturn 5 vehicles in the 1960's and provided the first utilization of the minimum Hamiltonian (or min-H) methodology and the steepest ascent technique to solve the optimum trajectory problem. The advent of the Space Shuttle in the 1970's and its complex airplane design required a redesign of the trajectory simulation code since aerodynamic flight and controllability were required for proper simulation. The RAGMOP program was the first attempt to incorporate the complex equations of the Space Shuttle into an optimization tool by using an optimization method based on steepest ascent techniques (but without the min-H methodology). Development of the complex partial derivatives associated with the Space Shuttle configuration and using techniques from the RAGMOP program, the ROBOT program was redesigned to incorporate these additional complexities. This redesign created the MASTRE program, which was referred to as the Minimum Hamiltonian Ascent Shuttle TRajectory Evaluation program at that time. Unique to this program were first-stage (or booster) nonlinear aerodynamics, upper-stage linear aerodynamics, engine control via moment balance, liquid and solid thrust forces, variable liquid throttling to maintain constant acceleration limits, and a total upgrade of the equations used in the forward and backward integration segments of the program. This modification of the MASTRE code has been used to simulate the new space vehicles associated with the National Launch Systems (NLS). Although not as complicated as the Space Shuttle, the simulation and analysis of the NLS vehicles required additional modifications to the MASTRE program in the areas of providing additional flexibility in the use of the program, allowing additional optimization options, and providing special options for the NLS configuration.

Lyons, J. T.

Optimizing lossy state preparation for quantum sensing using Hamiltonian engineering

One of the most prominent platforms for demonstrating quantum sensing below the standard quantum limit is the spinor Bose–Einstein condensate. While a quantum advantage using several tens of thousands of atoms has been demonstrated in this platform, it faces an important challenge: atom loss. Atom loss is a Markovian error process modeled by Lindblad jump operators, and a no-go theorem, which we also show here, states that the loss of atoms in all spin components reduces the quantum advantage to a constant factor. Here, we show that this no-go theorem can be circumvented if we constrain atom losses to a single spin component. Moreover, we show that in this case, the maximum quantum Fisher information with N atoms scales as N 3/2 , establishing that a scalable quantum advantage can be achieved despite atom loss. Although Lindblad jump operators are generally non-Hermitian and non-invertible, we use their Moore–Penrose inverse to develop a framework for constructing several states with this scaling of Fisher information in the presence of losses. We use Hamiltonian engineering with realistic Hamiltonians to develop experimental protocols for preparing these states. Finally, we discuss possible experimental techniques to constrain the losses to a single spin mode.

74 ATOMIC AND MOLECULAR PHYSICS

SympGNNs: Symplectic Graph Neural Networks for identifying high-dimensional Hamiltonian systems and node classification

Existing neural network models to learn Hamiltonian systems, such as SympNets, although accurate in low-dimensions, struggle to learn the correct dynamics for high-dimensional many-body systems. Herein, we introduce Symplectic Graph Neural Networks (SympGNNs) that can effectively handle system identification in high-dimensional Hamiltonian systems, as well as node classification. SympGNNs combine symplectic maps with permutation equivariance, a property of graph neural networks. Specifically, we propose two variants of SympGNNs: (i) G-SympGNN and (ii) LA-SympGNN, arising from different parameterizations of the kinetic and potential energy. We demonstrate the capabilities of SympGNN on two physical examples: a 40-particle coupled Harmonic oscillator, and a 2000-particle molecular dynamics simulation in a two-dimensional Lennard-Jones potential. Furthermore, we demonstrate the performance of SympGNN in the node classification task, achieving accuracy comparable to the state-of-the-art. Finally, we also empirically show that SympGNN can overcome the oversmoothing and heterophily problems, two key challenges in the field of graph neural networks.

Deep learning

Systematic many-fermion Hamiltonian input scheme and spectral calculations on quantum computers

We present a novel input scheme for general second-quantized Hamiltonians of relativistic or non-relativistic many-fermion systems. This input scheme incorporates the fermionic anticommutation relations, particle number variations, and respects the symmetries of the Hamiltonian. Based on our input scheme, we propose a hybrid quantum-classical framework for spectral calculations on future quantum hardwares. We provide explicit circuit designs and the associated gate cost. We demonstrate our hybrid framework by solving the low-lying spectra of 42 Ca and 46 Ca. Our input scheme provides new pathways to solving the spectra and dynamics of the relativistic and nonrelativistic many-fermion systems via first-principles approaches.

Hybrid spectral calculation framework

More about the lattice Hamiltonian for Adjoint QCD 2

In our earlier work [1], we introduced a lattice Hamiltonian for Adjoint QCD 2 using staggered Majorana fermions. We found the gauge invariant space of states explicitly for the gauge group SU(2) and used them for numerical calculations of observables, such as the spectrum and the expectation value of the fermion bilinear. In this paper, we carry out a more in-depth study of our lattice model, extending it to any compact and simply-connected gauge group G. We show how to find the gauge invariant space of states and use it to study various observables. We also use the lattice model to calculate the mixed ’t Hooft anomalies of Adjoint QCD 2 for arbitrary G. We show that the matrix elements of the lattice Hamiltonian can be expressed in terms of the Wigner 6j-symbols of G. For G = SU(3), we perform exact diagonalization for lattices of up to six sites and study the low-lying spectrum, the fermion bilinear condensate, and the string tension. We also show how to write the lattice strong coupling expansion for ground state energies and operator expectation values in terms of the Wigner 6j-symbols. For SU(3) we carry this out explicitly and find good agreement with the exact diagonalizations, and for SU(4) we give expansions that can be compared with future numerical studies.

confinement

Hamiltonian switching control of noisy bipartite qubit systems

Abstract We develop a Hamiltonian switching ansatz for bipartite control that is inspired by the quantum approximate optimization algorithm, to mitigate environmental noise on qubits. We demonstrate the control for a central spin coupled to bath spins via isotropic Heisenberg interactions, and then make physical applications to the protection of quantum gates performed on superconducting transmon qubits coupling to environmental two-level-systems (TLSs) through dipole-dipole interactions, as well as on such qubits coupled to both TLSs and a Lindblad bath. The control field is classical and acts only on the system qubits. We use reinforcement learning with policy gradient to optimize the Hamiltonian switching control protocols, using a fidelity objective for specific target quantum gates. We use this approach to demonstrate effective suppression of both coherent and dissipative noise, with numerical studies achieving target gate implementations with fidelities over 0.9999 (four nines) in the majority of our test cases and showing improvement beyond this to values of 0.999 999 999 (nine nines) upon a subsequent optimization by GRadient Ascent Pulse Engineering (GRAPE). We analyze how the control depth, total evolution time, number of environmental TLS, and choice of optimization method affect the fidelity achieved by the optimal protocols and reveal some critical behaviors of bipartite control of quantum gates.

Physics

Topological triviality of flat Hamiltonians

Landau levels play a key role in theoretical models of the quantum Hall effect. Each Landau level is degenerate, flat, and topologically nontrivial. Motivated by Landau levels, we study tight-binding Hamiltonians whose energy levels are all flat. Here, we demonstrate that in two dimensions, for such Hamiltonians, the flat bands must be topologically trivial. To that end, we show that the projector onto each flat band is necessarily strictly local. Our conclusions do not need the assumption of lattice translational invariance.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND

Neutrino many-body flavor evolution: The full Hamiltonian

We study neutrino flavor evolution in the quantum many-body approach using the full neutrino-neutrino Hamiltonian, including the usually neglected terms that mediate nonforward scattering processes. Working in the occupation number representation with plane waves as single-particle states, we explore the time evolution of simple initial states with up to N = 10 neutrinos. We discuss the time evolution of the Loschmidt echo, one body flavor and kinetic observables, and the one-body entanglement entropy. For the small systems considered, we observe “thermalization” of both flavor and momentum degrees of freedom on comparable time scales, with results converging towards expectation values computed within a microcanonical ensemble. We also observe that the inclusion of nonforward processes generates a faster flavor evolution compared to the one induced by the truncated (forward) Hamiltonian. Published by the American Physical Society 2024

Cirigliano, Vincenzo (ORCID:000000029056754X)

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