Parallel FFT algorithms for high-order approximations on three-dimensional compact stencils
Not Available
SEARCH · Engineering Papers
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.
Not Available
Control algorithms play an important role in energy capture and load mitigation for offshore floating wind turbines (OFWTs). One of the advanced and effective control techniques is the feedforward or model predictive control approach, which requires the forecast of incoming environment conditions. For OFWTs, wave loading is one of the dominant sources to excite structural responses. This study is thus motivated to develop forecasting algorithms for wave elevations and wave excitation forces with the purpose of applying feedforward controllers on OFWTs. Two forecasting algorithms, the approximate Prony Method based on ESPRIT (Estimation of Signal Parameters via Rotational Invariance Techniques) and SVM (Support Vector Machine) regression, are developed and validated using wave records from tank tests. Utilizing the forecasted wave elevations and wave excitation forces, a feedforward LQR controller is designed to mitigate structural loads of an OFWT system.
Not Available
The Cholesky decomposition technique is commonly used to reduce the memory requirement for storing two-particle repulsion integrals in quantum chemistry calculations that use atomic orbital bases. However, when quantum methods use multicomponent bases, such as nuclear–electronic orbitals, additional challenges are introduced due to asymmetric two-particle integrals. This work proposes several multicomponent Cholesky decomposition methods for calculations using nuclear–electronic orbital density functional theory. To analyze the errors in different Cholesky decomposition components, benchmark calculations using water clusters are carried out. The largest benchmark calculation is a water cluster (H 2 O) 27 where all 54 protons are treated quantum mechanically. Furthermore, this study provides energetic and complexity analyses to demonstrate the accuracy and performance of the proposed multicomponent Cholesky decomposition method.
The coupled cluster (CC) ansatz is generally recognized as providing one of the best wave function-based descriptions of electronic correlation in small- and medium-sized molecules. The fact that the CC equations with double excitations (CCD) may be expressed as a handful of dense matrix-matrix multiplications makes it an ideal method to be ported to graphics processing units (GPUs). Here we present our implementation of the spin-free CCD equations in which the entire iterative procedure is evaluated on the GPU. The GPU-accelerated algorithm readily achieves a factor of 4-5 speedup relative to the multithreaded CPU algorithm on same-generation hardware. The GPU-accelerated algorithm is approximately 8-12 times faster than Molpro, 17-22 times faster than NWChem, and 21-29 times faster than GAMESS for each CC iteration. Single-precision GPU-accelerated computations are also performed, leading to an additional doubling of performance. Single-precision errors in the energy are typically on the order of 10 -6 hartrees and can be improved by about an order of magnitude by performing one additional iteration in double precision.
Abstract We show that the quantum approximate optimization algorithm (QAOA) for higher-order, random coefficient, heavy-hex compatible spin glass Ising models has strong parameter concentration across problem sizes from 16 up to 127 qubits for p = 1 up to p = 5, which allows for computationally efficient parameter transfer of QAOA angles. Matrix product state (MPS) simulation is used to compute noise-free QAOA performance. Hardware-compatible short-depth QAOA circuits are executed on ensembles of 100 higher-order Ising models on noisy IBM quantum superconducting processors with 16, 27, and 127 qubits using QAOA angles learned from a single 16-qubit instance using the JuliQAOA tool. We show that the best quantum processors find lower energy solutions up to p = 2 or p = 3, and find mean energies that are about a factor of two off from the noise-free distribution. We show that p = 1 QAOA energy landscapes remain very similar as the problem size increases using NISQ hardware gridsearches with up to a 414 qubit processor.
The quantum approximate optimization algorithm (QAOA) is an approach for near-term quantum computers to potentially demonstrate computational advantage in solving combinatorial optimization problems. However, the viability of the QAOA depends on how its performance and resource requirements scale with problem size and complexity for realistic hardware implementations. Here, we quantify scaling of the expected resource requirements by synthesizing optimized circuits for hardware architectures with varying levels of connectivity. Assuming noisy gate operations, we estimate the number of measurements needed to sample the output of the idealized QAOA circuit with high probability. We show the number of measurements, and hence total time to solution, grows exponentially in problem size and problem graph degree as well as depth of the QAOA ansatz, gate infidelities, and inverse hardware graph degree. These problems may be alleviated by increasing hardware connectivity or by recently proposed modifications to the QAOA that achieve higher performance with fewer circuit layers.
Here, we present some numerical experiments with a reduction method for solving nonlinear semi-infinite programming (SIP) problems. The method relies on a line search technique to ensure a sufficient decrease of a L{sub 2}-exponential merit function. The proposed merit function is continuous for SIP and improves the algorithm efficiency when compared with other previously tested merit functions. A comparison with other reduction methods is also included.
In this paper, a H-infinity fault detection and diagnosis (FDD) scheme for a class of discrete nonlinear system fault using output probability density estimation is presented. Unlike classical FDD problems, the measured output of the system is viewed as a stochastic process and its square root probability density function (PDF) is modeled with B-spline functions, which leads to a deterministic space-time dynamic model including nonlinearities, uncertainties. A weighting mean value is given as an integral function of the square root PDF along space direction, which leads a function only about time and can be used to construct residual signal. Thus, the classical nonlinear filter approach can be used to detect and diagnose the fault in system. A feasible detection criterion is obtained at first, and a new H-infinity adaptive fault diagnosis algorithm is further investigated to estimate the fault. Simulation example is given to demonstrate the effectiveness of the proposed approaches.
Exact procedures that follow Dirac's constraint quantization of gauge theories are usually technically involved and often difficult to implement in practice. We overview an 'effective' scheme for obtaining the leading order semiclassical corrections to the dynamics of constrained quantum systems developed elsewhere. Motivated by the geometrical view of quantum mechanics, our method mimics the classical Dirac-Bergmann algorithm and avoids direct reference to a particular representation of the physical Hilbert space. We illustrate the procedure through the example of a relativistic particle in Minkowski spacetime.
The factorized form of the unitary coupled cluster Ansatz is a popular state preparation Ansatz for electronic structure calculations of molecules on quantum computers. It is often viewed as an approximation (based on the Trotter product formula) for the conventional unitary coupled cluster operator. In this work, we show that the factorized form is quite flexible, allowing one to range from a conventional configuration interaction, to conventional unitary coupled cluster, to efficient approximations that lie in between these two. The variational minimization of the energy often allows simpler factorized unitary coupled cluster approximations to achieve high accuracy, even if they do not accurately approximate the Trotter product formula. This is similar to how quantum approximate optimization algorithms can achieve high accuracy with a small number of levels.
Significance Our experiment prepares two types of nontrivial quantum states on a trapped ion quantum computer: the thermofield double state of the transverse-field Ising model at arbitrary temperature and the quantum critical state of the zero-temperature model. We use techniques motivated by the quantum approximate optimization algorithm, and we implement a hybrid quantum–classical optimization loop to prepare the quantum critical state. Our results pave the way for exploring strongly correlated models at finite temperature and teleportation protocols inspired by black hole physics.
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.
Angular cosmological correlators are infamously difficult to compute due to the highly oscillatory nature of the projection integrals. Motivated by recent development on analytic approaches to cosmological perturbation theory, in this paper we present an efficient method for computing cosmological four-point correlations in angular space, generalizing previous works on lower-point functions. This builds on the FFTLog algorithm that approximates the matter power spectrum as a sum over power-law functions, which makes certain momentum integrals analytically solvable. The computational complexity is drastically reduced for correlators in a "separable" form—we define a suitable notion of separability for cosmological trispectra, and derive formulas for angular correlators of different separability classes. As an application of our formalism, we compute the angular galaxy trispectrum at tree level, with and without primordial non-Gaussianity. This includes effects of redshift space distortion and bias parameters up to cubic order. We also compute the non-Gaussian covariance of the angular matter power spectrum due to the connected four-point function, beyond the Limber approximation. Finally, we demonstrate that, in contrast to the standard lore, the Limber approximation can fail for the non-Gaussian covariance computation even for large multipoles.
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.
The apparent breakdown of unitarity in low order perturbation theory is often is used to place bounds on the parameters of a theory. In this work we give an algorithm for approximately computing the next-to-leading order (NLO) perturbativity bounds on the quartic couplings of a renormalizable theory whose scalar sector is Φ 4 -like. And by this we mean theories where either there are no cubic scalar interactions, or the cubic couplings are related to the quartic couplings through spontaneous symmetry breaking. Furthermore, the quantity that tests where perturbation theory breaks down itself can be written as a perturbative series, and having the NLO terms allows one to test how well the series converges. We also present a simple example to illustrate the effect of considering these bounds at different orders in perturbation theory. For example, there is a noticeable difference in the viable parameter when the square of the NLO piece is included versus when it is not.
The time evolution of the ground state wave function of a zero-temperature Bose-Einstein condensate (BEC) gas is well described by the Hamiltonian Gross-Pitaevskii (GP) equation. Using a set of appropriately interleaved unitary collision-stream operators, a qubit lattice gas algorithm is devised, which on taking moments, recovers the Gross-Pitaevskii (GP) equation under diffusion ordering (time scales as length{sup 2}). Unexpectedly, there is a class of initial states whose Poincare recurrence time is extremely short and which, as the grid resolution is increased, scales with diffusion ordering (and not as length{sup 3}). The spectral results of J. Yepez et al.[Phys. Rev. Lett. 103, 084501 (2009).] for quantum turbulence are revised and it is found that it is the compressible kinetic energy spectrum that exhibits three distinct spectral regions: a small-k classical-like Kolmogorov k{sup -5/3}, a steep semiclassical cascade region, and a large-k quantum vortex spectrum k{sup -3}. For most evolution times the incompressible kinetic energy spectrum exhibits a somewhat robust quantum vortex spectrum of k{sup -3} for an extended range in k with a k{sup -3.4} spectrum for intermediate k. For linear vortices of winding number 1 there is an intermittent loss of the quantum vortex cascade with its signature seen in the time evolution of the kinetic energy E{sub kin}(t), the loss of the quantum vortex k{sup -3} spectrum in the incompressible kinetic energy spectrum as well as the minimalization of the vortex core isosurfaces that would totally inhibit any Kelvin wave vortex cascade. In the time intervals around these intermittencies the incompressible kinetic energy also exhibits a multicascade spectrum.
Tensor-network states (TNS) are a promising but numerically challenging tool for simulating two-dimensional (2D) quantum many-body problems. We introduce an isometric restriction of the TNS ansatz that allows for highly efficient contraction of the network. Here we consider two concrete applications using this ansatz. First, we show that a matrix-product state representation of a 2D quantum state can be iteratively transformed into an isometric 2D TNS. Second, we introduce a 2D version of the time-evolving block decimation algorithm for approximating of the ground state of a Hamiltonian as an isometric TNS-which we demonstrate for the 2D transverse field Ising model.