Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Quantum amplitude estimation”

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 19 records

Reducing the cost of energy estimation in the variational quantum eigensolver algorithm with robust amplitude estimation

Quantum chemistry and materials is one of the most promising applications of quantum computing. Yet much work is still to be done in matching industry-relevant problems in these areas with quantum algorithms that can solve them. Most previous efforts have carried out resource estimations for quantum algorithms run on large-scale fault-tolerant architectures, which include the quantum phase estimation algorithm. In contrast, few have assessed the performance of near-term quantum algorithms, which include the variational quantum eigensolver (VQE) algorithm. Recently, a large-scale benchmark study [Gonthier et al. 2020] found evidence that the performance of the variational quantum eigensolver for a set of industry-relevant molecules may be too inefficient to be of practical use. This motivates the need for developing and assessing methods that improve the efficiency of VQE. In this work, we predict the runtime of the energy estimation subroutine of VQE when using robust amplitude estimation (RAE) to estimate Pauli expectation values. Under conservative assumptions, our resource estimation predicts that RAE can reduce the runtime over the standard estimation method in VQE by one to two orders of magnitude. Despite this improvement, we find that the runtimes are still too large to be practical. These findings motivate two complementary efforts towards quantum advantage: 1) the investigation of more efficient near-term methods for ground state energy estimation and 2) the development of problem instances that are of industrial value and classically challenging, but better suited to quantum computation.

Johnson, Peter D.↗

Classical-Quantum Algorithm for Solving Stochastic Programs

Stochastic programming provides a rigorous mathematical framework for making decisions under uncertainty in a risk-aware manner. Two-stage stochastic programming is, perhaps, the simplest form of this framework. Here the first-stage variables represent decisions that must be made "here and now" in the face of uncertainty, while the second-stage variables are decisions made after uncertain events. However, the broad adoption of stochastic programming has been hindered by computational challenges caused by the two-stage stochastic programming formulation which requires solving an ensemble of optimization problems. Using quantum amplitude estimation (QAE), quantum computers have shown the theoretic ability to compute expectations with Monte-Carlo methods with quadratically fewer samples than classical methods. In this work, we present a quantum algorithm for computing the expectation term using QAE for given first-stage decisions. Further, we detail methods of computing gradient information from the quantum calculation enabling the application of classical gradient-based optimization techniques. The result is a classical-quantum hybrid method of solving two-stage stochastic programs. These techniques are demonstrated with computational experiments based an engineering optimization problem.

97 MATHEMATICS AND COMPUTING↗

Quantum-Inspired Power System Reliability Assessment

To enable an in-depth study of power system operation and planning, the assessment of standard reliability indices is inevitable. The Monte Carlo Simulation (MCS) approach is a broadly used method in replacing the analytical methods in reliability indices assessment. The accuracy of MCS, however, highly depends on the sampling size, and hence, a complicated system with large number of components requires a large sampling size and daunting computational effort. To address this shortcoming, we, in this paper attempt to take advantage of potentials of the quantum computing (QC) for power system reliability assessment by realizing the following contributions: 1) an innovative quantum model designed for reliability assessment; 2) a quantum circuit that achieves the quadratic speed up compared to the classical MCS method; 3) an efficient quantum amplitude estimation (QAE) algorithm to accurately evaluate the reliability indices. The accuracy and efficacy of the quantum reliability method are extensively verified and demonstrated on both radial and mesh distribution systems.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Non-Boolean quantum amplitude amplification and quantum mean estimation

This paper generalizes the quantum amplitude amplification and amplitude estimation algorithms to work with non-Boolean oracles. The action of a non-Boolean oracle $U_\varphi $ on an eigenstate $\mathinner {|{x}\rangle }$ is to apply a state-dependent phase-shift $\varphi (x)$. Unlike Boolean oracles, the eigenvalues $\exp (i\varphi (x))$ of a non-Boolean oracle are not restricted to be $\pm 1$. Two new oracular algorithms based on such non-Boolean oracles are introduced. The first is the non-Boolean amplitude amplification algorithm, which preferentially amplifies the amplitudes of the eigenstates based on the value of $\varphi (x)$. Starting from a given initial superposition state $\mathinner {|{\psi _0}\rangle }$, the basis states with lower values of $\cos (\varphi )$ are amplified at the expense of the basis states with higher values of $\cos (\varphi )$. The second algorithm is the quantum mean estimation algorithm, which uses quantum phase estimation to estimate the expectation $\mathinner {\langle {\psi _0|U_\varphi |\psi _0}\rangle }$, i.e., the expected value of $\exp (i\varphi (x))$ for a random x sampled by making a measurement on $\mathinner {|{\psi _0}\rangle }$. It is shown that the quantum mean estimation algorithm offers a quadratic speedup over the corresponding classical algorithm. Both algorithms are demonstrated using simulations for a toy example. Potential applications of the algorithms are briefly discussed.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Quantum Stochastic Programming [SWR-26-040]

The Quantum Stochastic Programming tool contains quantum computing algorithms for two-stage stochastic optimization, with a focus on the Unit Commitment (UC) problem in power systems. The algorithms combine Discrete Quantum Annealing (DQA) with Quantum Amplitude Estimation (QAE) to compute expected-value objective functions over a probability distribution of wind-power scenarios. Based on: arXiv 2402.15029 - "Quantum algorithms for the two-stage stochastic unit commitment problem"

Maack, Jonathan [National Laboratory of the Rockie↗

Enhancing teleportation fidelity by means of weak measurements or reversal

The enhancement of teleportation fidelity by weak measurement or quantum measurement reversal is investigated. One qubit of a maximally entangled state undergoes the amplitude damping, and the subsequent application of weak measurement or quantum measurement reversal could improve the teleportation fidelity beyond the classical region. The improvement could not be attributed to the increasing of entanglement, quantum discord, classical correlation or total correlation. We declare that it should be owed to the probabilistic nature of the method. - Highlights: • The method’s probabilistic nature should be responsible for the improvement. • Quantum or classical correlation cannot explain the improvement. • The receiver cannot apply weak measurements. • The sender’s quantum measurement reversal is only useful for |Ψ{sup ±}〉.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A practical approach to determine minimal quantum gate durations using amplitude-bounded quantum controls

Here, we present an iterative scheme to estimate the minimal duration in which a quantum gate can be realized while satisfying hardware constraints on the control pulse amplitudes. The scheme performs a sequence of unconstrained numerical optimal control cycles that each minimize the gate fidelity for a given gate duration alongside an additional penalty term for the control pulse amplitudes. After each cycle, the gate duration is adjusted based on the inverse of the resulting maximum control pulse amplitudes by re-scaling the dynamics to a new duration where control pulses satisfy the amplitude constraints. Those scaled controls then serve as an initial guess for the next unconstrained optimal control cycle, using the adjusted gate duration. We provide multiple numerical examples that each demonstrate fast convergence of the scheme toward a gate duration that is close to the quantum speed limit, given the control pulse amplitude bound. The proposed technique is agnostic to the underlying system and control Hamiltonian models, as well as the target unitary gate operation, making the time-scaling iteration an easy to implement and practically useful scheme for reducing the durations of quantum gate operations.

97 MATHEMATICS AND COMPUTING↗

Low depth quantum circuits for Ising models

A scheme for measuring complex temperature partition functions of Ising models is introduced. Two applications of this scheme are presented. First, through appropriate Wick rotations, those amplitudes can be analytically continued to yield estimates for partition functions of Ising models. Bounds on the estimated error are provided through a central-limit theorem whose validity extends beyond the present context; it holds for example for estimations of the Jones polynomial. The kind of state preparations and measurements involved in this application can be made independent of the system size or the parameters of the system being simulated. Second, the scheme allows to accurately estimate non-trivial invariants of links. Another result concerns the computational power of estimations of partition functions for real temperature classical ferromagnetic Ising models. We provide conditions under which estimating such partition functions allows to reconstruct scattering amplitudes of quantum circuits, making the problem BQP-hard. We also show fidelity overlaps for ground states of quantum Hamiltonians, which serve as a witness to quantum phase transitions, can be estimated from classical Ising model partition functions. Finally, we discuss how accurate corner magnetisation measurements on thermal states of two-dimensional Ising models lead to fully polynomial random approximation schemes (FPRAS) for the partition function.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Koopman–von Neumann approach to quantum simulation of nonlinear classical dynamics

Quantum computers can be used to simulate nonlinear non-Hamiltonian classical dynamics on phase space by using the generalized Koopman–von Neumann formulation of classical mechanics. The Koopman–von Neumann formulation implies that the conservation of the probability distribution function on phase space, as expressed by the Liouville equation, can be recast as an equivalent Schrödinger equation on Hilbert space with a Hermitian Hamiltonian operator and a unitary propagator. This Schrödinger equation is linear in the momenta because it derives from a constrained Hamiltonian system with twice the classical phase-space dimension. A quantum computer with finite resources can be used to simulate a finite-dimensional approximation of this unitary evolution operator. Quantum simulation of classical dynamics is exponentially more efficient than a deterministic Eulerian discretization of the Liouville equation if the Koopman–von Neumann Hamiltonian is sparse. Utilizing quantum walk techniques for state preparation and amplitude estimation for the calculation of observables leads to a quadratic improvement over classical probabilistic Monte Carlo algorithms.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Dark energy induced anisotropy in cosmic expansion

In order to understand the nature of the accelerating expansion of the late-time universe, it is important to experimentally determine whether dark energy is a cosmological constant or dynamical in nature. If dark energy already exists prior to inflation, which is a reasonable assumption, then one expects that a dynamical dark energy would leave some footprint in the anisotropy of the late-time accelerated expansion. To demonstrate the viability of this notion, we invoke the quintessence field with the exponential potential as one of the simplest dynamical dark energy models allowed by observations. We investigate the effects of its quantum fluctuations (the physical origin of the perturbation being isocurvature) generated during inflation and having fully positive correlation with the primordial curvature perturbations, and estimate the anisotropy of the cosmic expansion so induced. We show that the primordial amplitude of quantum fluctuations of quintessence field δΦ P can be related to the tensor-to-scalar ratio r, and we calculate the perturbed luminosity distance to first order and the associated luminosity distance power spectrum, which is an estimator of anisotropy of late-time accelerated expansion. We find that the gravitational potential at large scales and late times is less decayed in QCDM compared to that in ΛCDM so that the smaller the redshift and multipole, the more relative deficit of power in QCDM. In conclusion, our results of luminosity distance power spectrum also show the similar conclusions of suppression as that of the previous investigation regarding the effect of quantum fluctuations of quintessence field on the CMB temperature anisotropies.

79 ASTRONOMY AND ASTROPHYSICS↗

Quantum algorithms for systems of linear equations inspired by adiabatic quantum computing

We present two quantum algorithms based on evolution randomization, a simple variant of adiabatic quantum computing, to prepare a quantum state |x⟩ that is proportional to the solution of the system of linear equations $A\overrightarrow{x} = \overrightarrow{b}$. The time complexities of our algorithms are O(κ 2 log(κ)/ε) and O(κ log(κ)/ε), where κ is the condition number of A and ε is the precision. Both algorithms are constructed using families of Hamiltonians that are linear combinations of products of A, the projector onto the initial state |b⟩, and single-qubit Pauli operators. The algorithms are conceptually simple and easy to implement. They are not obtained from equivalences between the gate model and adiabatic quantum computing. They do not use phase estimation or variable-time amplitude amplification, and do not require large ancillary systems. We discuss a gate-based implementation via Hamiltonian simulation and prove that our second algorithm is almost optimal in terms of κ. Like previous methods, our techniques yield an exponential quantum speed-up under some assumptions. Our results emphasize the role of Hamiltonian-based models of quantum computing for the discovery of important algorithms.

97 MATHEMATICS AND COMPUTING↗

Dynamical transitions in a modulated Landau–Zener model with finite driving fields

Highlights: •The rigorous dynamics of a modulated Landau–Zener model is investigated. •Nonadiabatic evolution of the model could realize complete population transfer. •Imperfect effects caused by both the amplitude and phase damping are estimated. -- Abstract: We investigate a special time-dependent quantum model which assumes the Landau–Zener driving form but with an overall modulation of the intensity of the pulsing field. We demonstrate that the dynamics of the system, including the two-level case as well as its multi-level extension, is exactly solvable analytically. Differing from the original Landau–Zener model, the nonadiabatic effect of the evolution in the present driving process does not destroy the desired population transfer. As the sweep protocol employs only the finite driving fields which tend to zero asymptotically, the cutoff error due to the truncation of the driving pulse to the finite time interval turns out to be negligibly small. Furthermore, we investigate the noise effect on the driving protocol due to the dissipation of the surrounding environment. The losses of the fidelity in the protocol caused by both the phase damping process and the random spin flip noise are estimated by solving numerically the corresponding master equations within the Markovian regime.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Optimal polynomial based quantum eigenstate filtering with application to solving quantum linear systems

We present a quantum eigenstate filtering algorithm based on quantum signal processing (QSP) and minimax polynomials. The algorithm allows us to efficiently prepare a target eigenstate of a given Hamiltonian, if we have access to an initial state with non-trivial overlap with the target eigenstate and have a reasonable lower bound for the spectral gap. We apply this algorithm to the quantum linear system problem (QLSP), and present two algorithms based on quantum adiabatic computing (AQC) and quantum Zeno effect respectively. Both algorithms prepare the final solution as a pure state, and achieves the near optimal $\mathcal{\tilde{O}}$(dκlog(1/ϵ)) query complexity for a d -sparse matrix, where κ is the condition number, and ϵ is the desired precision. Neither algorithm uses phase estimation or amplitude amplification.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Electrostatic gate-controlled quantum interference in a high-mobility two-dimensional electron gas at the (La 0.3 ⁢Sr 0.7 )(Al 0.65 ⁢Ta 0.35 )O 3 /SrTiO 3 interface

Here, we report quantum oscillations in magnetoresistance that are periodic in magnetic field (𝐵), observed at the interface between (La 0.3 ⁢Sr 0.7 )(Al 0.65 ⁢Ta 0.35 )O 3 and SrTiO 3 . Unlike Shubnikov–de Haas oscillations, which appear at magnetic fields > 7 T and diminish quickly as the temperature rises, these 𝐵-periodic oscillations emerge at low fields and persist up to 10 K. Their amplitude decays exponentially with both temperature and field, specifying dephasing of quantum interference. Increasing the carrier density through electrostatic gating results in a systematic reduction in both the amplitude and frequency of the oscillations, with complete suppression beyond a certain gate voltage. We attribute these oscillations to the Altshuler-Aronov-Spivak effect, likely arising from naturally formed closed-loop paths due to the interconnected quasi-one-dimensional conduction channels along SrTiO 3 domain walls. The relatively long phase coherence length (≃ 1.8 µ⁢m at 0.1 K), estimated from the oscillation amplitude, highlights the potential of complex oxide interfaces as a promising platform for exploring quantum interference effects and advancing device concepts in quantum technologies, such as mesoscopic interferometers and quantum sensors.

36 MATERIALS SCIENCE↗

Analyzing Prospects for Quantum Advantage in Topological Data Analysis

Lloyd [Nat. Commun. , 10138 (2016)] were first to demonstrate the promise of quantum algorithms for computing Betti numbers, a way to characterize topological features of data sets. Here, we propose, analyze, and optimize an improved quantum algorithm for topological data analysis (TDA) with reduced scaling, including a method for preparing Dicke states based on inequality testing, a more efficient amplitude estimation algorithm using Kaiser windows, and an optimal implementation of eigenvalue projectors based on Chebyshev polynomials. We compile our approach to a fault-tolerant gate set and estimate constant factors in the Toffoli complexity. Our analysis reveals that superquadratic quantum speedups are only possible for this problem when targeting a multiplicative error approximation and the Betti number grows asymptotically. Further, we propose a dequantization of the quantum TDA algorithm that shows that having exponentially large dimension and Betti number are necessary, but insufficient conditions, for superpolynomial advantage. We then introduce and analyze specific problem examples which have parameters in the regime where superpolynomial advantages may be achieved, and argue that quantum circuits with tens of billions of Toffoli gates can solve seemingly classically intractable instances. Published by the American Physical Society 2024

97 MATHEMATICS AND COMPUTING↗

Efficient verification of anticoncentrated quantum states

I present a method for estimating the fidelity F(μ, τ) between a preparable quantum state μ and a classically specified pure target state τ=|τ> <τ|, using simple quantum circuits and on-the-fly classical calculation (or lookup) of selected amplitudes of |τ>. The method is sample efficient for anticoncentrated states (including many states that are hard to simulate classically), with approximate cost 4ϵ –2 (1 – F)dpcoll where ϵ is the desired precision of the estimate, d is the dimension of the Hilbert space, and pcoll is the collision probability of the target distribution. Furthermore, this scaling is exponentially better than that of any method based on classical sampling. I also present a more sophisticated version of the method that uses any efficiently preparable and well-characterized quantum state as an importance sampler to further reduce the number of copies of μ needed. Though some challenges remain, this work takes a significant step toward scalable verification of complex states produced by quantum processors.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Energy gain of an electron by a laser pulse in the presence of radiation reaction

A well-known no-energy-gain theorem states that an electron cannot gain energy when being overrun by a plane (transverse) laser pulse of finite length. The theorem is based on symmetries which are broken when radiation reaction (RR) is included. It is shown here that an electron, e.g., being initially at rest, will gain a positive velocity component in the laser propagation direction after being overrun by an intense laser pulse (of finite duration and with intensity of order 5x10{sup 22} W/cm{sup 2} or larger). The velocity increment is due to RR effects. The latter are incorporated in the Landau-Lifshitz form. Both linear as well as circular polarization of the laser pulse are considered. It is demonstrated that the velocity gain is proportional to the pulse length and the square of the peak amplitude of the laser pulse. The results of numerical simulations are supported by analytical estimates.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Large curvature perturbations near horizon crossing in single-field inflation models

We consider the examples of single-field inflation models predicting large amplitudes of the curvature perturbation power spectrum at relatively small scales. It is shown that in models with an inflationary potential of double-well type the peaks in the power spectrum, having, in maximum, the amplitude P{sub R}{approx}0.1, can exist (if parameters of the potential are chosen appropriately). It is shown also that the spectrum amplitude of the same magnitude (at large k values) is predicted in the model with the running mass potential, if the positive running, n{sup '}, exists and is about 0.005 at cosmological scales. Estimates of the quantum diffusion effects during inflation in models with the running mass potential are given.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗