Optimal Scaling Quantum Linear-Systems Solver via Discrete Adiabatic Theorem
Not Available
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
SEARCH · Search NASA
Results for “Adiabatic theorem”
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.
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↗
Lower Bounds on Quantum Annealing Times
The adiabatic theorem provides sufficient conditions for the time needed to prepare a target ground state. While it is possible to prepare a target state much faster with more general quantum annealing protocols, rigorous results beyond the adiabatic regime are rare. Here, we provide such a result, deriving lower bounds on the time needed to successfully perform quantum annealing. The bounds are asymptotically saturated by three toy models where fast annealing schedules are known: the Roland and Cerf unstructured search model, the Hamming spike problem, and the ferromagnetic p-spin model. Our bounds demonstrate that these schedules have optimal scaling. Herein, our results also show that rapid annealing requires coherent superpositions of energy eigenstates, singling out quantum coherence as a computational resource.
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
Asymptotic errors in adiabatic evolution
The adiabatic theorem in quantum mechanics implies that if a system is in a discrete eigenstate of a Hamiltonian and the Hamiltonian evolves in time arbitrarily slowly, the system will remain in the corresponding eigenstate of the evolved Hamiltonian. Understanding corrections to the adiabatic result that arise when the evolution of the Hamiltonian is slow—but not arbitrarily slow—has become increasingly important, especially since adiabatic evolution has been proposed as a method of state preparation in quantum computing. Here, this paper identifies two regimes, an adiabatic regime in which corrections are generically small and can depend on details of the evolution throughout the path, and a hyperadiabatic regime in which the error is given by a form similar to an asymptotic expansion in the inverse of the evolution time with the coefficients depending principally on the behavior at the endpoints. However, the error in this hyperadiabatic regime is neither given by a true asymptotic series nor solely dependent on the endpoints: the coefficients combine the contributions from both endpoints, with relative phase factors that depend on the average spectral gaps along the trajectory, multiplied by the evolution time. The central result of this paper is to identify a quantity, referred to as the typical error, which is obtained by appropriately averaging the error over evolution times that are small compared to the evolution time itself. This typical error is characterized by an asymptotic series and depends solely on the endpoints of the evolution, remaining independent of the details of the intermediate evolution.
adiabatic approximation↗
Numerical quantum clock simulations for measuring tunneling times
Here, we numerically study two methods of measuring tunneling times using a quantum clock. In the conventional method using the Larmor clock, we show that the Larmor tunneling time can be shorter for higher tunneling barriers. In the second method, we study the probability of a spin-flip of a particle when it is transmitted through a potential barrier including a spatially rotating field interacting with its spin. According to the adiabatic theorem, the probability depends on the velocity of the particle inside the barrier. It is numerically observed that the probability increases for higher barriers, which is consistent with the result obtained by the Larmor clock. By comparing outcomes for different initial spin states, we suggest that one of the main causes of the apparent decrease in the tunneling time can be the filtering effect occurring at the end of the barrier.
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
Short-Depth QAOA circuits and Quantum Annealing on Higher-Order Ising Models (Rev.2)
The Quantum Alternating Operator Ansatz (QAOA) and Quantum Annealing (QA) are quantum algorithms that are both based on the adiabatic theorem and both have the goal of sampling the optimal solution(s) of combinatorial optimization problems. Quantum annealing has been physically instantiated on D-Wave devices using superconducting flux qubits, and QAOA can be programmed on digital gate-model quantum computers such as the programmable superconducting transmon qubits devices of the IBMQ series, for instance ibm washington. QAOA and QA address the same types of problems, but it is unclear how they will scale to large problem sizes and to larger and higher-fidelity quantum computers. In this article, we present a direct comparison between QAOA, one and two rounds, run on all 127 qubits of ibm washington and QA run on D-Wave Advantage system4.1 and Advantage system6.1. The problems which allow for this comparison are random Ising model problems whose connectivity matches the heavy hexagonal lattice topology of ibm washington and the Pegasus graph connectivity of the two D-Wave devices. We create two classes of problem instances for this comparison: one with higher order terms (ZZZ variable interactions), linear terms, and quadratic terms, and a separate problem type with only linear and quadratic terms. Our QAOA circuits are novel and extremely short depth, with a CNOT depth of 6 per round, which allows whole chip usage of ibm washington’s heavy hexagonal lattice and can be applied to future heavy-hex chips. We also test the effectiveness of the error suppression technique digital dynamical decoupling on the QAOA circuits. The QAOA circuits compiled to ibm washington are composed of several thousand circuit instructions, approximately 3, 000 depending on the details of the circuit, making these some the largest quantum circuits ever executed on a digital quantum processor. QAOA and QA are compared against the classical heuristic algorithm of simulated annealing and all problem instances are exactly solved using CPLEX in order to evaluate which samplers, if any, correctly found the ground state solution(s) of the problem instances. We find that (i) QA outperforms QAOA on all problem instances, (ii) QAOA samples the problems better than random sampling, and (iii) QAOA angle computation exhibits clear parameter concentration across the ensemble of Ising models.
127 Qubits↗
Axion Perturbations: A General Analytical Treatment
Cosmological data provides us two key constraints on dark matter (DM): it must have a particular abundance, and it must have an adiabatic spectrum of density perturbations in the early universe. Many different cosmological scenarios have been proposed that establish the abundance of axion DM in qualitatively different ways. In this paper we emphasize that, despite this variety of backgrounds, the perturbations in axion DM can be understood from universal principles. How does a feebly interacting axion field acquire perturbations proportional to those of photons? How do the isocurvature power spectrum and non-Gaussianity depend on the background evolution of the universe? We answer these questions for a completely general choice of cosmological background and temperature-dependent axion potential. We show that the most general solution to the axion field equation on super-horizon scales is entirely determined by the family of background solutions for different initial field values . This holds for both the component in the field perturbation solution contributing to the DM isocurvature perturbation (enhanced at late times by the sensitivity of the DM abundance to the initial condition, , which can be large for initial conditions near the hilltop), and the other component that contributes to the DM curvature perturbation. In particular, we explain that an unperturbed axion field in the early universe evolving into one with nontrivial adiabatic perturbations is guaranteed by Weinberg's theorem on adiabatic modes. These results have been derived before with various assumptions, such as a radiation dominated background or a quadratic potential. Our aim is to give a clear, simple derivation that is manifestly independent of those assumptions, and thus can be applied to any cosmological axion scenario.
Cosmology and Nongalactic Astrophysics (astro-ph.C↗
Potential energy surfaces for high-energy N + O 2 collisions
Potential energy surfaces for high-energy collisions between an oxygen molecule and a nitrogen atom are useful for modeling chemical dynamics in shock waves. In the present work, we present doublet, quartet, and sextet potential energy surfaces that are suitable for studying collisions of O 2 ( 3 Σ$^{–}_{g}$) with N( 4 S) in the electronically adiabatic approximation. Two sets of surfaces are developed, one using neural networks (NNs) with permutationally invariant polynomials (PIPs) and one with the least-squares many-body (MB) method, where a two-body part is an accurate diatomic potential and the three-body part is expressed with connected PIPs in mixed-exponential-Gaussian bond order variables (MEGs). We find, using the same dataset for both fits, that the fitting performance of the PIP-NN method is significantly better than that of the MB-PIP-MEG method, even though the MB-PIP-MEG fit uses a higher-order PIP than those used in previous MB-PIP-MEG fits of related systems (such as N 4 and N 2 O 2 ). However, the evaluation of the PIP-NN fit in trajectory calculations requires about 5 times more computer time than is required for the MB-PIP-MEG fit.
37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
Machine learning framework for quantum sampling of highly constrained, continuous optimization problems
In recent years, there is growing interest in using quantum computers for solving combinatorial optimization problems. In this work, we developed a generic, machine learning-based framework for mapping continuous-space inverse design problems into surrogate quadratic unconstrained binary optimization (QUBO) problems by employing a binary variational autoencoder and a factorization machine. The factorization machine is trained as a low-dimensional, binary surrogate model for the continuous design space and sampled using various QUBO samplers. Using the D-Wave Advantage hybrid sampler and simulated annealing, we demonstrate that by repeated resampling and retraining of the factorization machine, our framework finds designs that exhibit figures of merit exceeding those of its training set. We showcase the framework’s performance on two inverse design problems by optimizing (i) thermal emitter topologies for thermophotovoltaic applications and (ii) diffractive meta-gratings for highly efficient beam steering. This technique can be further scaled to leverage future developments in quantum optimization to solve advanced inverse design problems for science and engineering applications.
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
Nonadiabatic transitions during a passage near a critical point
The passage through a critical point of a many-body quantum system leads to abundant nonadiabatic excitations. Here, we explore a regime, in which the critical point is not crossed although the system is passing slowly very close to it. Here, we show that the leading exponent for the excitation probability can then be obtained by standard arguments of the Dykhne formula, but the exponential prefactor is no longer simple and behaves as a power law on the characteristic transition rate. We derive this prefactor for the nonlinear Landau–Zener model by adjusting Dykhne’s approach. Then, we introduce an exactly solvable model of the transition near a critical point in the Stark ladder. We derive the number of excitations for it without approximations and find qualitatively similar results for the excitation scaling.
37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
Nearly Periodic Maps and Geometric Integration of Noncanonical Hamiltonian Systems
Abstract M. Kruskal showed that each continuous-time nearly periodic dynamical system admits a formal U (1)-symmetry, generated by the so-called roto-rate. When the nearly periodic system is also Hamiltonian, Noether’s theorem implies the existence of a corresponding adiabatic invariant. We develop a discrete-time analog of Kruskal’s theory. Nearly periodic maps are defined as parameter-dependent diffeomorphisms that limit to rotations along a U (1)-action. When the limiting rotation is non-resonant, these maps admit formal U (1)-symmetries to all orders in perturbation theory. For Hamiltonian nearly periodic maps on exact presymplectic manifolds, we prove that the formal U (1)-symmetry gives rise to a discrete-time adiabatic invariant using a discrete-time extension of Noether’s theorem. When the unperturbed U (1)-orbits are contractible, we also find a discrete-time adiabatic invariant for mappings that are merely presymplectic, rather than Hamiltonian. As an application of the theory, we use it to develop a novel technique for geometric integration of non-canonical Hamiltonian systems on exact symplectic manifolds.
97 MATHEMATICS AND COMPUTING↗
Jarzynski Equality for Conditional Stochastic Work
It has been established that the inclusive work for classical, Hamiltonian dynamics is equivalent to the two-time energy measurement paradigm in isolated quantum systems. However, a plethora of other notions of quantum work has emerged, and thus the natural question arises whether any other quantum notion can provide motivation for purely classical considerations. In the present analysis, we propose the conditional stochastic work for classical, Hamiltonian dynamics, which is inspired by the one-time measurement approach. This novel notion is built upon the change of expectation value of the energy conditioned on the initial energy surface. As main results, we obtain a generalized Jarzynski equality and a sharper maximum work theorem, which account for how non-adiabatic the process is. Our findings are illustrated with the parametric harmonic oscillator.
75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
Lectures on statistical mechanics
Presented here is a transcription of the lecture notes from Professor Allan N. Kaufman’s graduate statistical mechanics course Physics 212A and 212B at the University of California Berkeley from the 1972–1973 academic year. 212A addressed equilibrium statistical mechanics with topics: fundamentals (micro-canonical and sub-canonical ensembles, adiabatic law and action conservation, fluctuations, pressure, and virial theorem), classical fluids and other systems (equation of state, deviations from ideality, virial coefficients and van der Waals potential, canonical ensemble and partition function, quasistatic evolution, grand-canonical ensemble and partition function, chemical potential, simple model of a phase transition, quantum virial expansion, numerical simulation of equations of state, and phase transition), chemical equilibrium (systems with multiple species and chemical reactions, law of mass action, Saha equation, chemical equilibrium including ionization and excited states), and long-range interactions (including Coulomb, dipole, and gravitational interactions, Debye–Hückel theory, and shielding). 212B addressed nonequilibrium statistical mechanics with topics: fundamentals (definitions: realizations, moments, characteristic function, and discrete variables), Brownian motion (Langevin equation, fluctuation–dissipation theorem, spatial diffusion, Boltzmann’s H-theorem), Liouville and Klimontovich equations, Landau equation (derivation, elaboration, and H-theorem, and irreversibility), Markov processes and Fokker–Planck equation (derivations of the Fokker–Planck equation and a master equation), linear response and transport theory (linear Boltzmann equation, linear response theory of Kubo and Mori, relation of entropy production to electrical conductivity, transport relations and coefficients, normal mode solutions of the transport equations, sketch of a generalized Langevin equation method for transport theory), and an introduction to nonequilibrium quantum statistical mechanics.
plasma dynamics↗
Theorem on extensive spectral degeneracy for systems with rigid higher symmetries in general dimensions
We establish, in the spirit of the Lieb-Schultz-Mattis theorem, lower bounds on the spectral degeneracy of quantum systems with higher (gaugelike) symmetries with rather generic physical boundary conditions in an arbitrary number of spatial dimensions. Contrary to applying twists or equivalent adiabatic operations, we exploit the effects of modified boundary conditions. We find that when a general choice of boundary geometry is immaterial in determining spectral degeneracies while approaching the thermodynamic limit, systems that exhibit rigid noncommuting gaugelike symmetries, such as the orbital compass model, must have an exponential (in the size of the boundary) degeneracy of each of their spectral levels.
75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
Electron kinetics in a high- Z plasmoid
The problem of the electron dynamics on a closed magnetic field line passing through a high-Z plasmoid is considered. The electron kinetic equation is integrated over bounce motion and pitch angle, reducing the independent variables to a single adiabatic invariant plus time. Integration of the full Landau self-collision operator is carried out exactly, resulting in a nonlinear integro-differential operator in the new invariant. Conservation laws and the H theorem of the integrated self-collision operator are proven. Numerical solutions of the integrated kinetic equation are obtained with a self-consistent quasineutral electric potential, given the initial condition of a cold plasmoid immersed in a hot ambient plasma. The fact that cold electrons are deeply trapped in a potential with a parabolic peak leads to exactly 3/4 the usual rate of collisional heating by the ambient plasma, independent of any other parameters.
70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
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↗