Search NASA⌕ Search

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.

At least 91 records · Page 5

Efficient Step-Merged Quantum Imaginary Time Evolution Algorithm for Quantum Chemistry

In this work, we develop a resource-efficient step-merged quantum imaginary time evolution approach (smQITE) to solve for the ground state of a Hamiltonian on quantum computers. This heuristic method features a fixed shallow quantum circuit depth along the state evolution path. We use this algorithm to determine the binding energy curves of a set of molecules, including H 2 , H 4 , H 6 , LiH, HF, H 2 O, and BeH 2 , and find highly accurate results. The required quantum resources of smQITE calculations can be further reduced by adopting the circuit form of the variational quantum eigensolver (VQE) technique, such as the unitary coupled cluster ansatz. We demonstrate that smQITE achieves a similar computational accuracy as VQE at the same fixed-circuit ansatz, without requiring a generally complicated high-dimensional nonconvex optimization. Finally, smQITE calculations are carried out on Rigetti quantum processing units, demonstrating that the approach is readily applicable on current noisy intermediate-scale quantum devices.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Pressure-tuned quantum criticality in the large-D antiferromagnet DTN

Strongly correlated spin systems can be driven to quantum critical points via various routes. In particular, gapped quantum antiferromagnets can undergo phase transitions into a magnetically ordered state with applied pressure or magnetic field, acting as tuning parameters. These transitions are characterized by z = 1 or z = 2 dynamical critical exponents, determined by the linear and quadratic low-energy dispersion of spin excitations, respectively. Employing high-frequency susceptibility and ultrasound techniques, we demonstrate that the tetragonal easy-plane quantum antiferromagnet NiCl 2 · 4SC(NH 2 ) 2 (aka DTN) undergoes a spin-gap closure transition at about 4.2 kbar, resulting in a pressure-induced magnetic ordering. The studies are complemented by high-pressure-electron spin-resonance measurements confirming the proposed scenario. Powder neutron diffraction measurements revealed that no lattice distortion occurs at this pressure and the high spin symmetry is preserved, establishing DTN as a perfect platform to investigate z = 1 quantum critical phenomena. The experimental observations are supported by DMRG calculations, allowing us to quantitatively describe the pressure-driven evolution of critical fields and spin-Hamiltonian parameters in DTN.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Multitime Landau–Zener model: classification of solvable Hamiltonians

We discuss a class of models that generalize the two-state Landau–Zener Hamiltonian to both the multistate and multitime evolution. It is already known that the corresponding quantum mechanical evolution can be understood in great detail. Here, we present an approach to classify such solvable models, namely, to identify all their independent families for a given number N of interacting states and prove the absence of such families for some types of interactions. We also discuss how, within a solvable family, one can classify the scattering matrices, i.e., the system's dynamics. Furthermore, due to the possibility of such a detailed classification, the multitime Landau–Zener model defines a useful special function of theoretical physics.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Time-dependent variational principle for mixed matrix product states in the thermodynamic limit

Here, we describe a time evolution algorithm for quantum spin chains whose Hamiltonians are composed of an infinite uniform left and right bulk part, and an arbitrary finite region in between. The left and right bulk parts are allowed to be different from each other. The algorithm is based on the time-dependent variational principle (TDVP) of matrix product states. It is inversion-free and very simple to adapt from an existing TDVP code for finite systems. The importance of working in the projective Hilbert space is highlighted. We study the quantum Ising model as a benchmark and an illustrative example. The spread of information after a local quench is studied in both the ballistic and the diffusive case. We also offer a derivation of TDVP directly from symplectic geometry.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Simulating scalar field theories on quantum computers with limited resources

Here we present a quantum algorithm for implementing φ 4 lattice scalar field theory on qubit computers. The field is represented in the discretized field amplitude basis. The number of qubits and elementary gates required by the implementation of the evolution operator is proportional to the lattice size. The algorithm allows efficient φ 4 state preparation for a large range of input parameters in both the normal and broken-symmetry phases. The states are prepared using a combination of variational and adiabatic evolution methods. First, the ground state of a local Hamiltonian, which includes the φ 4 self-interaction, is prepared using short variational circuits. Next, this state is evolved by switching on the coupling between the lattice sites adiabatically. The parameters defining the local Hamiltonian are adjustable and constitute the input of our algorithm. We present a method to optimize these parameters in order to reduce the adiabatic time required for state preparation. For preparing broken-symmetry states, the adiabatic evolution problems caused by crossing the phase transition critical line and by the degeneracy of the broken-symmetry ground state can be addressed using an auxiliary external field which gradually turns off during the adiabatic process. We show that the time dependence of the external field during the adiabatic evolution is important for addressing the broken-symmetry ground state degeneracy. The adiabatic time dependence on the inverse error tolerance can be reduced from quadratic to linear by using a field strength that decreases exponentially in time relative to one that decreases linearly.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Quantum Adiabatic Algorithms and Large Spin Tunnelling

We provide a theoretical study of the quantum adiabatic evolution algorithm with different evolution paths proposed in this paper. The algorithm is applied to a random binary optimization problem (a version of the 3-Satisfiability problem) where the n-bit cost function is symmetric with respect to the permutation of individual bits. The evolution paths are produced, using the generic control Hamiltonians H (r) that preserve the bit symmetry of the underlying optimization problem. In the case where the ground state of H(0) coincides with the totally-symmetric state of an n-qubit system the algorithm dynamics is completely described in terms of the motion of a spin-n/2. We show that different control Hamiltonians can be parameterized by a set of independent parameters that are expansion coefficients of H (r) in a certain universal set of operators. Only one of these operators can be responsible for avoiding the tunnelling in the spin-n/2 system during the quantum adiabatic algorithm. We show that it is possible to select a coefficient for this operator that guarantees a polynomial complexity of the algorithm for all problem instances. We show that a successful evolution path of the algorithm always corresponds to the trajectory of a classical spin-n/2 and provide a complete characterization of such paths.

Boulatov, A.↗

Classical optimization with imaginary-time block encoding on quantum computers: The MaxCut problem

Optimization problems in finance, physics, and computer science are typically very hard to tackle in classical computing; quantum computing could help speed up computations and provide efficient methods for tackling large problems. Typically, to treat a problem with a quantum computer, the optimal solution is cast as the ground state of a diagonal Hamiltonian. Here, we develop a method, called imaginary-time evolution block encoding (ITE-BE), based on a recent imaginary-time algorithm, which requires no variational parameter optimization, as all parameters can be derived analytically from the target Hamiltonian. We also demonstrate that our method can be successfully combined with other quantum algorithms such as the quantum approximate optimization algorithm (QAOA). For illustration, here we study the MaxCut problem. We find that the QAOA ansatz increases the postselection success of ITE-BE, and shallow QAOA circuits, when boosted with ITE-BE, achieve better performance than deeper QAOA circuits. For the special case of the transverse initial state, we adapt our block-encoding scheme to allow for a deterministic application of the first layer of the circuit.

Zhong, Dawei [University of Southern California, L↗

Not all that is β0 is β-function: the DGLAP resummation and the running coupling in NLO JIMWLK

Abstract We reanalyze the origin of the large transverse logarithms associated with the QCD one loopβfunction coefficient in the NLO JIMWLK Hamiltonian. We show that some of these terms are not associated with the running of the QCD coupling constant but rather with the DGLAP evolution. The DGLAP-like resummation of these logarithms is mandatory within the JIMWLK Hamiltonian, as long as the color correlation length in the projectile is larger than that in the target. This regime in fact covers the whole range of rapidities at which JIMWLK evolution is supposed to be applicable. We derive the RG equation that resums these logarithms to all orders inα s in the JIMWLK Hamiltonian. This is a nonlinear equation for the eikonal scattering matrixS(x). We solve this equation, and perform the DGLAP resummation in two simple cases: the dilute limit, where both the projectile and the target are far from saturation, and the saturated regime, where the target correlation length also determines its saturation momentum.

Physics↗

Trotter Errors from Dynamical Structural Instabilities of Floquet Maps in Quantum Simulation

We study the behavior of errors in the quantum simulation of spin systems with long-range multibody interactions resulting from the Trotter-Suzuki decomposition of the time-evolution operator. We identify a regime where the Floquet operator underlying the Trotter decomposition undergoes sharp changes even for small variations in the simulation step size. This results in a time evolution operator that is very different from the dynamics generated by the targeted Hamiltonian, which leads to a proliferation of errors in the quantum simulation. These regions of sharp change in the Floquet operator, referred to as structural instability regions, appear typically at intermediate Trotter step sizes and in the weakly interacting regime, and are thus complementary to recently revealed quantum chaotic regimes of the Trotterized evolution [L. M. Sieberer et al. npj Quantum Inf. 5, 78 (2019); M. Heyl, P. Hauke, and P. Zoller, Sci. Adv. 5, eaau8342 (2019)]. We characterize these structural instability regimes in p-spin models, transverse-field Ising models with all-to-all p-body interactions, and analytically predict their occurrence based on unitary perturbation theory. We further show that the effective Hamiltonian associated with the Trotter decomposition of the unitary time-evolution operator, when the Trotter step size is chosen to be in the structural instability region, is very different from the target Hamiltonian, which explains the large errors that can occur in the simulation in the regions of instability. These results have implications for the reliability of near-term gate-based quantum simulators, and reveal an important interplay between errors and the physical properties of the system being simulated.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Adaptive Variational Quantum Imaginary Time Evolution Approach for Ground State Preparation

Abstract An adaptive variational quantum imaginary time evolution (AVQITE) approach is introduced that yields efficient representations of ground states for interacting Hamiltonians on near‐term quantum computers. It is based on McLachlan's variational principle applied to imaginary time evolution of variational wave functions. The variational parameters evolve deterministically according to equations of motions that minimize the difference to the exact imaginary time evolution, which is quantified by the McLachlan distance. Rather than working with a fixed variational ansatz, where the McLachlan distance is constrained by the quality of the ansatz, the AVQITE method iteratively expands the ansatz along the dynamical path to keep the McLachlan distance below a chosen threshold. This ensures the state is able to follow the quantum imaginary time evolution path in the system Hilbert space rather than in a restricted variational manifold set by a predefined fixed ansatz. AVQITE is used to prepare ground states of H 4 , H 2 O, and BeH 2 molecules, where it yields compact variational ansätze and ground state energies within chemical accuracy. Polynomial scaling of circuit depth with system size is shown through a set of AVQITE calculations of quantum spin models. Finally, quantum Lanczos calculations are demonstrated alongside AVQITE without additional quantum resource costs.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Origin of the arrow of time in quantum mechanics

We point out that time’s arrow is naturally induced by quantum mechanical evolution, whenever the systems have a very large number [Formula: see text] of nondegenerate states and a Hamiltonian bounded from below. When [Formula: see text] is finite, the arrow is imperfect, since evolution can resurrect past states. In the limit [Formula: see text] the arrow is fixed by the “tooth of time”: the decay of excited states induced by spontaneous emission to the ground state, mediated by interactions and a large number of decay products which carry energy and information to infinity. This applies to individual isolated atoms, and does not require a coupling to a separate large heath bath.

Astronomy & Astrophysics↗

A detailed analysis of the dynamics of fast neutrino flavor conversions with scattering effects

We calculate the dynamics of fast neutrino flavor conversions with Boltzmann collisions of neutrino scatterings in a homogeneous system. We find the enhancement or suppression of the flavor conversions in various setups of the collision terms. We analyze the mechanism of fast flavor conversions based on the motion of polarization vectors in the cylindrical coordinate analogous to a pendulum motion. The phases of the all the polarization vectors synchronize in the linear evolution phase, and the phase deviation from the Hamiltonian governs the neutrino flavor conversions. In a non-linear regime of flavor conversions, the collision terms induce a spiral motion of the polarization vector and gradually make the phase space smaller. The collision terms align all of the polarization vectors, and the flavor conversions eventually settle into equilibrium when the distributions of neutrinos become isotropic. Though our current analysis does not fully clarify the non-linear phenomena of fast flavor conversions, the framework of the pendulum motion gives a new insight into this complicated phenomenon that will be helpful in further studies.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Quantum time dynamics employing the Yang-Baxter equation for circuit compression

Quantum time dynamics (QTD) is considered a promising problem for quantum supremacy on near-term quantum computers. However, QTD quantum circuits grow with increasing time simulations. This study focuses on simulating the time dynamics of one-dimensional (1D) integrable spin chains with nearest-neighbor interactions. We have proved the existence of a reflection symmetry in the quantum circuit employed for simulating the time evolution of certain classes of 1D Heisenberg model Hamiltonians by virtue of the quantum Yang-Baxter equation, and how this symmetry can be exploited to compress and produce a shallow quantum circuit. With this compression scheme, the depth of the quantum circuit becomes independent of step size and only depends on the number of spins. We show that the depth of the compressed circuit is rigorously a linear function of the system size for the studied Heisenberg model Hamiltonians in the present work. As a consequence, the number of CNOT gates in the compressed circuit only scales quadratically with the system size, which allows for the simulations of time dynamics of very large 1D spin chains. We derive the compressed circuit representations for different special cases of the Heisenberg Hamiltonian. We compare and demonstrate the effectiveness of this approach by performing simulations on quantum computers.

1-dimensional spin chains↗

Learning to Predict Arbitrary Quantum Processes

We present an efficient machine-learning (ML) algorithm for predicting any unknown quantum process ℰ over 𝑛 qubits. For a wide range of distributions 𝒟 on arbitrary 𝑛-qubit states, we show that this ML algorithm can learn to predict any local property of the output from the unknown process ℰ, with a small average error over input states drawn from 𝒟. The ML algorithm is computationally efficient even when the unknown process is a quantum circuit with exponentially many gates. Our algorithm combines efficient procedures for learning properties of an unknown state and for learning a low-degree approximation to an unknown observable. The analysis hinges on proving new norm inequalities, including a quantum analogue of the classical Bohnenblust-Hille inequality, which we derive by giving an improved algorithm for optimizing local Hamiltonians. Numerical experiments on predicting quantum dynamics with evolution time up to 10 6 and system size up to 50 qubits corroborate our proof. Overall, our results highlight the potential for ML models to predict the output of complex quantum dynamics much faster than the time needed to run the process itself.

quantum computation↗

Finite-element time evolution operator for the anharmonic oscillator

The finite-element approach to lattice field theory is both highly accurate (relative errors approximately 1/N(exp 2), where N is the number of lattice points) and exactly unitary (in the sense that canonical commutation relations are exactly preserved at the lattice sites). In this talk I construct matrix elements for dynamical variables and for the time evolution operator for the anharmonic oscillator, for which the continuum Hamiltonian is H = p(exp 2)/2 + lambda q(exp 4)/4. Construction of such matrix elements does not require solving the implicit equations of motion. Low order approximations turn out to be extremely accurate. For example, the matrix element of the time evolution operator in the harmonic oscillator ground state gives a results for the anharmonic oscillator ground state energy accurate to better than 1 percent, while a two-state approximation reduces the error to less than 0.1 percent.

Milton, Kimball A.↗

Circumventing superexponential runtimes for hard instances of quantum adiabatic optimization

Classical optimization problems can be solved by adiabatically preparing the ground state of a quantum Hamiltonian that encodes the problem. The performance of this approach is determined by the smallest gap encountered during the evolution. Here, we consider the maximum independent set problem, which can be efficiently encoded in the Hamiltonian describing a Rydberg atom array. We present a general construction of instances of the problem for which the minimum gap decays superexponentially with system size, implying a superexponentially large time to solution via adiabatic evolution. The small gap arises from locally independent choices which cause the system to initially evolve and localize into a configuration far from the solution in terms of Hamming distance. We investigate remedies to this problem. Specifically, we show that quantum quenches in these models can exhibit signatures of quantum many-body scars, which in turn, can circumvent the superexponential gaps. By quenching from a suboptimal configuration, states with a larger ground-state overlap can be prepared, illustrating the utility of quantum quenches as an algorithmic tool. Published by the American Physical Society 2024

Schiffer, Benjamin F. (ORCID:0000000189512157)↗

Quantum Algorithm for Simulating Hamiltonian Dynamics with an Off-diagonal Series Expansion

We propose an efficient quantum algorithm for simulating the dynamics of general Hamiltonian systems. Our technique is based on a power series expansion of the time-evolution operator in its off-diagonal terms. The expansion decouples the dynamics due to the diagonal component of the Hamiltonian from the dynamics generated by its off-diagonal part, which we encode using the linear combination of unitaries technique. Our method has an optimal dependence on the desired precision and, as we illustrate, generally requires considerably fewer resources than the current state-of-the-art. We provide an analysis of resource costs for several sample models.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Cross-shell excited configurations in the structure of 34 Si

The cross-shell excited states of 34 Si have been investigated via β decays of the 4 − ground state and the 1 + isomeric state of 34 Al. Since the valence protons and valence neutrons occupy different major shells in the ground state as well as the intruder 1 + isomeric state of 34 Al, intruder levels of 34 Si are populated via allowed β decays. Spin assignments to such intruder levels of 34 Si were established through γ-γ angular correlation analysis for the negative-parity states. The configurations of such intruder states play crucial roles in our understanding of the N = 20 shell gap evolution. A configuration interaction model derived from the FSU Hamiltonian was utilized in order to interpret the intruder states in 34 Si. Furthermore, shell model interaction derived from a more fundamental theory with the valence space in medium similarity renormalization group method was also employed to interpret the structure of 34 Si.

20 ≤ A ≤ 38↗