Search NASA⌕ Search

SEARCH · Search NASA

Results for “Quantum, Quantum Algorithms”

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 1,567 records · Page 87

Fast inversion, preconditioned quantum linear system solvers, fast Green's-function computation, and fast evaluation of matrix functions

Preconditioning is the most widely used and effective way for treating ill-conditioned linear systems in the context of classical iterative linear system solvers. We introduce a quantum primitive called fast inversion, which can be used as a preconditioner for solving quantum linear systems. The key idea of fast inversion is to directly block encode a matrix inverse through a quantum circuit implementing the inversion of eigenvalues via classical arithmetics. We demonstrate the application of preconditioned linear system solvers for computing single-particle Green's functions of quantum many-body systems, which are widely used in quantum physics, chemistry, and materials science. We analyze the complexities in three scenarios: the Hubbard model, the quantum many-body Hamiltonian in the plane-wave-dual basis, and the Schwinger model. We also provide a method for performing Green's function calculation in second quantization within a fixed-particle manifold and note that this approach may be valuable for simulation more broadly. Aside from solving linear systems, fast inversion also allows us to develop fast algorithms for computing matrix functions, such as the efficient preparation of Gibbs states. Furthermore, we introduce two efficient approaches for such a task, based on the contour-integral formulation and the inverse transform, respectively.

97 MATHEMATICS AND COMPUTING↗

Monotonically convergent optimization in quantum control using Krotov's method

The non-linear optimization method developed by A. Konnov and V. Krotov [Autom. Remote Cont. (Engl. Transl.) 60, 1427 (1999)] has been used previously to extend the capabilities of optimal control theory from the linear to the non-linear Schroedinger equation [S. E. Sklarz and D. J. Tannor, Phys. Rev. A 66, 053619 (2002)]. Here we show that based on the Konnov-Krotov method, monotonically convergent algorithms are obtained for a large class of quantum control problems. It includes, in addition to nonlinear equations of motion, control problems that are characterized by non-unitary time evolution, nonlinear dependencies of the Hamiltonian on the control, time-dependent targets, and optimization functionals that depend to higher than second order on the time-evolving states. We furthermore show that the nonlinear (second order) contribution can be estimated either analytically or numerically, yielding readily applicable optimization algorithms. We demonstrate monotonic convergence for an optimization functional that is an eighth-degree polynomial in the states. For the ''standard'' quantum control problem of a convex final-time functional, linear equations of motion and linear dependency of the Hamiltonian on the field, the second-order contribution is not required for monotonic convergence but can be used to speed up convergence. We demonstrate this by comparing the performance of first- and second-order algorithms for two examples.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Uniformity measurements and new positioning algorithms for wavelength-shifting fiber neutron detectors

Wavelength-shifting (WLS) fiber scintillator detectors were successfully installed at two neutron powder diffractometers at the Spallation Neutron Source (SNS). But, they have the following second-order disadvantages: (i). they cannot have both high efficiency and images free of ghosting (position misassignment) concomitantly; (ii). the apparent detection efficiency and spatial resolution are not uniform. These issues are related to the diffusion of scintillation photons and the fluctuation in the number of photons (quantum noise) collected by photo-multiplier tubes (PMTs). Therefore, to mitigate these two issues, we developed two statistics-based positioning algorithms, i.e., a centroid algorithm (CEA) and a correlation algorithm (CA). Compared with the generally used maximum-photon algorithm (MPA), CEA eliminates the ghosting with only about a 10% loss in detection efficiency, and provides better uniformity in detection efficiency and intrinsic background. CA can effectively eliminate ghosting too, but the loss of efficiency at the group boundaries of PMTs is large. Our results indicate that both algorithms can reduce the influence of quantum noise on the neutron positioning.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Hardware-Efficient Quantum Phase Estimation via Local Control

Quantum phase estimation plays a central role in quantum simulation as it enables the study of spectral properties of many-body quantum systems. Most variants of the phase estimation algorithm require the application of the global unitary evolution conditioned on the state of one or more auxiliary qubits, posing a significant challenge for current quantum devices. In this work, we present an approach to quantum phase estimation that uses only locally controlled operations, resulting in a significantly reduced circuit depth. At the heart of our approach are efficient routines to measure the complex phase of the expectation value of the time-evolution operator, the so-called Loschmidt echo, for both circuit dynamics and Hamiltonian dynamics. By tracking changes in the phase during the dynamics, the routines trade circuit depth for increased sampling cost and classical postprocessing. Our approach does not rely on reference states and is applicable to any efficiently preparable state, regardless of its correlations. We provide a comprehensive analysis of the sample complexity and illustrate the results with numerical simulations. Our methods offer a practical pathway for measuring spectral properties in large many-body quantum systems using current quantum devices.

Schiffer, Benjamin F. [Max Planck Institute of Qua↗

Attosecond Streaking Enables the Measurement of Quantum Phase

Attosecond streaking, as a measurement technique, was originally conceived as a means to characterize attosecond light pulses, which is a good approximation if the relevant transition matrix elements are approximately constant within the bandwidth of the light pulse. Our analysis of attosecond streaking measurements on systems with a complex response to the photoionizing pulse reveals the relation between the momentum-space wave function of the outgoing electron and the result of conventional retrieval algorithms. This finding enables the measurement of the quantum phase associated with bound-continuum transitions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Nonlinear automatic landing control of unmanned aerial vehicles on moving platforms via a 3D laser radar

This paper presents a motion tracking and control system for automatically landing Unmanned Aerial Vehicles (UAVs) on an oscillating platform using Laser Radar (LADAR) observations. The system itself is assumed to be mounted on a ship deck. A full nonlinear mathematical model is first introduced for the UAV. The ship motion is characterized by a Fourier transform based method which includes a realistic characterization of the sea waves. LADAR observation models are introduced and an algorithm to process those observations for yielding the relative state between the vessel and the UAV is presented, from which the UAV's state relative to an inertial frame can be obtained and used for feedback purposes. A sliding mode control algorithm is derived for tracking a landing trajectory defined by a set of desired waypoints. An extended Kalman filter (EKF) is proposed to account for process and observation noises in the design of a state estimator. The effectiveness of the control algorithm is illustrated through a simulation example.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

R-matrix and inverse Shapovalov form

We construct the inverse Shapovalov form of a simple complex quantum group from its universal R-matrix based on a generalized Nagel-Moshinsky approach to lowering operators. We establish a connection between this algorithm and the ABRR equation for dynamical twist.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

An analysis of model proton-coupled electron transfer reactions via the mixed quantum-classical Liouville approach

The nonadiabatic dynamics of model proton-coupled electron transfer (PCET) reactions is investigated for the first time using a surface-hopping algorithm based on the solution of the mixed quantum-classical Liouville equation (QCLE). This method provides a rigorous treatment of quantum coherence/decoherence effects in the dynamics of mixed quantum-classical systems, which is lacking in the molecular dynamics with quantum transitions surface-hopping approach commonly used for simulating PCET reactions. Within this approach, the protonic and electronic coordinates are treated quantum mechanically and the solvent coordinate evolves classically on both single adiabatic surfaces and on coherently coupled pairs of adiabatic surfaces. Both concerted and sequential PCET reactions are studied in detail under various subsystem-bath coupling conditions and insights into the dynamical principles underlying PCET reactions are gained. Notably, an examination of the trajectories reveals that the system spends the majority of its time on the average of two coherently coupled adiabatic surfaces, during which a phase enters into the calculation of an observable. In general, the results of this paper demonstrate the applicability of QCLE-based surface-hopping dynamics to the study of PCET and emphasize the importance of mean surface evolution and decoherence effects in the calculation of PCET rate constants.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Exact-Factorization-Based Surface Hopping for Multistate Dynamics

A surface-hopping algorithm recently derived from the exact factorization approach, SHXF, introduces an additional term in the electronic equation of surface hopping that couples electronic states through the quantum momentum. Furthermore, this term not only provides a first-principles description of decoherence, but here we show it is crucial to accurately capture nonadiabatic dynamics when more than two states are occupied at any given time. Using a vibronic coupling model of the uracil cation, we show that the lack of this term in traditional surface-hopping methods, including those with decoherence corrections, leads to failure to predict the dynamics through a three-state intersection, while SHXF performs similarly to the multiconfiguration time-dependent Hartree quantum dynamics benchmark.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Time-reversal of an unknown quantum state

For decades, researchers have sought to understand how the irreversibility of the surrounding world emerges from the seemingly time-symmetric, fundamental laws of physics. Quantum mechanics conjectured a clue that final irreversibility is set by the measurement procedure and that the time-reversal requires complex conjugation of the wave function, which is overly complex to spontaneously appear in nature. Building on this Landau-Wigner conjecture, it became possible to demonstrate that time-reversal is exponentially improbable in a virgin nature and to design an algorithm artificially reversing a time arrow for a given quantum state on the IBM quantum computer. However, the implemented arrow-of-time reversal embraced only the known states initially disentangled from the thermodynamic reservoir. Here we develop a procedure for reversing the temporal evolution of an arbitrary unknown quantum state. This opens the route for general universal algorithms sending temporal evolution of an arbitrary system backward in time.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Simple algorithm for computing the geometric measure of entanglement

We present an easy implementable algorithm for approximating the geometric measure of entanglement from above. The algorithm can be applied to any multipartite mixed state. It involves only the solution of an eigenproblem and finding a singular value decomposition; no further numerical techniques are needed. To provide examples, the algorithm was applied to the isotropic states of three qubits and the three-qubit XX model with external magnetic field.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Chaotic dynamics of flexible Euler-Bernoulli beams

Mathematical modeling and analysis of spatio-temporal chaotic dynamics of flexible simple and curved Euler-Bernoulli beams are carried out. The Kármán-type geometric non-linearity is considered. Algorithms reducing partial differential equations which govern the dynamics of studied objects and associated boundary value problems are reduced to the Cauchy problem through both Finite Difference Method with the approximation of O(c{sup 2}) and Finite Element Method. The obtained Cauchy problem is solved via the fourth and sixth-order Runge-Kutta methods. Validity and reliability of the results are rigorously discussed. Analysis of the chaotic dynamics of flexible Euler-Bernoulli beams for a series of boundary conditions is carried out with the help of the qualitative theory of differential equations. We analyze time histories, phase and modal portraits, autocorrelation functions, the Poincaré and pseudo-Poincaré maps, signs of the first four Lyapunov exponents, as well as the compression factor of the phase volume of an attractor. A novel scenario of transition from periodicity to chaos is obtained, and a transition from chaos to hyper-chaos is illustrated. In particular, we study and explain the phenomenon of transition from symmetric to asymmetric vibrations. Vibration-type charts are given regarding two control parameters: amplitude q{sub 0} and frequency ω{sub p} of the uniformly distributed periodic excitation. Furthermore, we detected and illustrated how the so called temporal-space chaos is developed following the transition from regular to chaotic system dynamics.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Quantum Computing [Slides]

Introduction: At the last CHEP we heard a talk about Quantum Computing from a hardware perspective.; Jim is a software algorithm person and he will concentrate more on that.; 20 months is a long time in Quantum Information Science, QIS; The Josephson Junction technology we heard about then has evolved as predicted and we now have “mid-range” devices available on the cloud.

97 MATHEMATICS AND COMPUTING↗

Parametrized process characterization with reduced resource requirements

Quantum process tomography (QPT) is a powerful tool to characterize quantum operations, but it requires considerable resources, making it impractical for more than two-qubit systems. This study proposes an alternative approach that requires significantly fewer resources for unitary process characterization with a built-in method for state preparation and measurement error mitigation. By measuring the quantum process as rotated through the X and Y axes on the Bloch sphere, we can acquire enough information to reconstruct the quantum process matrix χ and measure its fidelity. We test the algorithm's performance against standard QPT using simulated and physical experiments on several IBM quantum processors and compare the resulting process matrices. We demonstrate with numerical experiments that the method can improve gate fidelity via a noise reduction in the imaginary part of the process matrix, along with a stark decrease in the number of experiments needed to perform the characterization.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Double sweep preconditioner for optimized Schwarz methods applied to the Helmholtz problem

This paper presents a preconditioner for non-overlapping Schwarz methods applied to the Helmholtz problem. Starting from a simple analytic example, we show how such a preconditioner can be designed by approximating the inverse of the iteration operator for a layered partitioning of the domain. The preconditioner works by propagating information globally by concurrently sweeping in both directions over the subdomains, and can be interpreted as a coarse grid for the domain decomposition method. The resulting algorithm is shown to converge very fast, independently of the number of subdomains and frequency. The preconditioner has the advantage that, like the original Schwarz algorithm, it can be implemented as a matrix-free routine, with no additional preprocessing.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A novel SPH method for sedimentation in a turbulent fluid

A novel method for simulating sedimentation is described and applied to the sedimentation of dust in a turbulent fluid. We assume the dust grains are sufficiently numerous that they may be treated as a fluid and modelled by SPH particles. A different set of SPH particles describes the fluid. The equations of motion are therefore similar to those of Monaghan and Kocharyan [14] with the exception that the sedimentation of dust onto a solid surface is treated as if the surface mimics a sink for the dust fluid. The continuity equation for the dust then contains a sink term that can be modelled in the SPH formulation by allowing the mass of each SPH dust particle to decrease when it is sufficiently close to the boundary. We apply this method both to sedimentation in a nearly static fluid, and to sedimentation in a turbulent fluid. In the latter case we produce the turbulence by both a mechanical stirrer and by a stochastic algorithm. Our results agree very closely with the experiments of Martin and Nokes.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

On the solution of elliptic partial differential equations on regions with corners

In this paper we investigate the solution of boundary value problems on polygonal domains for elliptic partial differential equations. We observe that when the problems are formulated as the boundary integral equations of classical potential theory, the solutions are representable by series of elementary functions. In addition to being analytically perspicuous, the resulting expressions lend themselves to the construction of accurate and efficient numerical algorithms. The results are illustrated by a number of numerical examples.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Note: Large rotation measurement using half shaded square patterns

As the manufacturing technology ranging from micrometer to nanometer scale requires more planar motion devices, the demand for sensor measuring the planar motion is increasing. However, the previous sensors measuring the planar motion had a drawback in the measurement of rotation, especially regarding yaw angle. In this article, we present a novel method to measure large yaw angle with the planar position sensor based on the half shaded square patterns. The measuring range of the yaw angle is restricted to 45 deg. in this article, but it can be expanded to as much as 360 deg. with an improvement of the algorithm.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗