Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “quantum algorithms and computation”

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,495 records · Page 83

Method, system and computer-readable media for measuring impedance of an energy storage device

Real-time battery impedance spectrum is acquired using a one-time record. Fast Summation Transformation (FST) is a parallel method of acquiring a real-time battery impedance spectrum using a one-time record that enables battery diagnostics. An excitation current to a battery is a sum of equal amplitude sine waves of frequencies that are octave harmonics spread over a range of interest. A sample frequency is also octave and harmonically related to all frequencies in the sum. A time profile of this sampled signal has a duration that is a few periods of the lowest frequency. A voltage response of the battery, average deleted, is an impedance of the battery in a time domain. Since the excitation frequencies are known and octave and harmonically related, a simple algorithm, FST, processes the time profile by rectifying relative to sine and cosine of each frequency. Another algorithm yields real and imaginary components for each frequency.

25 ENERGY STORAGE↗

Trapped Ion Qubits

Qubits can be encoded in clock states of trapped ions. These states are well isolated from the environment resulting in long coherence times [1] while enabling efficient high-fidelity qubit interactions mediated by the Coulomb coupled motion of the ions in the trap. Quantum states can be prepared with high fidelity and measured efficiently using fluorescence detection. State preparation and detection with 99.93% fidelity have been realized in multiple systems [1,2]. Single qubit gates have been demonstrated below rigorous fault-tolerance thresholds [1,3]. Two qubit gates have been realized with more than 99.9% fidelity [4,5]. Quantum algorithms have been demonstrated on systems of 5 to 15 qubits [6–8].

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Efficient evaluation of the Breit operator in the Pauli spinor basis

The frequency-independent Coulomb–Breit operator gives rise to the most accurate treatment of two-electron interaction in the non-quantum-electrodynamics regime. The Breit interaction in the Coulomb gauge consists of magnetic and gauge contributions. The high computational cost of the gauge term limits the application of the Breit interaction in relativistic molecular calculations. In this work, we apply the Pauli component integral–density matrix contraction scheme for gauge interaction with a maximum spin- and component separation scheme. We also present two different computational algorithms for evaluating gauge integrals. One is the generalized Obara–Saika algorithm, where the Laplace transformation is used to transform the gauge operator into Gaussian functions and the Obara–Saika recursion is used for reducing the angular momentum. The other algorithm is the second derivative of Coulomb interaction evaluated with Rys-quadrature. This work improves the efficiency of performing Dirac–Hartree–Fock with the variational treatment of Breit interaction for molecular systems. In conclusion, we use this formalism to examine relativistic trends in the Periodic Table and analyze the relativistic two-electron interaction contributions in heavy-element complexes.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Partitioning Quantum Chemistry Simulations with Clifford Circuits

Current quantum computing hardware is restricted by the availability of only few, noisy qubits which limits the investigation of larger, more complex molecules in quantum chemistry calculations on quantum computers in the near term. Here, in this work, we investigate the limits of their classical and near-classical treatment while staying within the framework of quantum circuits and the variational quantum eigensolver. To this end, we consider naive and physically motivated, classically efficient product ansatz for the parametrized wavefunction adapting the separable-pair ansatz form. We combine it with post-treatment to account for interactions between subsystems originating from this ansatz. The classical treatment is given by another quantum circuit that has support between the enforced subsystems and is folded into the Hamiltonian. To avoid an exponential increase in the number of Hamiltonian terms, the entangling operations are constructed from purely Clifford or near-Clifford circuits. While Clifford circuits can be simulated efficiently classically, they are not universal. In order to account for missing expressibility, near-Clifford circuits with only few, selected non-Clifford gates are employed. The exact circuit structure to achieve this objective is molecule-dependent and is constructed using simulated annealing and genetic algorithms. We demonstrate our approach on a set of molecules of interest and investigate the extent of our methodology’s reach.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Semimetal–Mott insulator quantum phase transition of the Hubbard model on the honeycomb lattice

We take advantage of recent improvements in the grand canonical hybrid Monte Carlo algorithm, to perform a precision study of the single-particle gap in the hexagonal Hubbard model, with on-site electron-electron interactions. After carefully controlled analyses of the Trotter error, the thermodynamic limit, and finite-size scaling with inverse temperature, we find a critical coupling of U c /κ = 3.834(14) and the critical exponent zν = 1.185(43). Under the assumption that this corresponds to the expected antiferromagnetic Mott transition, we are also able to provide a preliminary estimate β = 1.095(37) for the critical exponent of the order parameter. We consider our findings in view of the SU(2) Gross-Neveu, or chiral Heisenberg, universality class. Here, we also discuss the computational scaling of the hybrid Monte Carlo algorithm, and possible extensions of our work to carbon nanotubes, fullerenes, and topological insulators.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Comparative Analysis of Simulated Annealing (SA) and Simplified Generalized SA (SGSA) for Estimation Optimal of Parametric Functional in CATIVIC

Application of simulated annealing (SA) and simplified GSA (SGSA) techniques for parameter optimization of parametric quantum chemistry method (CATIVIC) was performed. A set of organic molecules were selected for test these techniques. Comparison of the algorithms was carried out for error function minimization with respect to experimental values. Results show that SGSA is more efficient than SA with respect to computer time. Accuracy is similar in both methods; however, there are important differences in the final set of parameters.

74 ATOMIC AND MOLECULAR PHYSICS↗

Determining topological order from infinite projected entangled pair states

In this work, we present a method of extracting information about the topological order from the ground state of a strongly correlated two-dimensional system computed with the infinite projected entangled pair state (iPEPS). For topologically ordered systems, the iPEPS wrapped on a torus becomes a superposition of degenerate, locally indistinguishable ground states. Projectors in the form of infinite matrix product operators onto states with well-defined anyon flux are used to compute topological S and T matrices (encoding mutual and self-statistics of emergent anyons). The algorithm is shown to be robust against a perturbation driving string-net toric code across a phase transition to a ferromagnetic phase. Our approach provides accurate results near quantum phase transition, where the correlation length is prohibitively large for other numerical methods. Moreover, we used numerically optimized iPEPS describing the ground state of the Kitaev honeycomb model in the toric code phase and obtained topological data in excellent agreement with theoretical prediction.

36 MATERIALS SCIENCE↗

Explicit integration with GPU acceleration for large kinetic networks

We demonstrate the first implementation of recently-developed fast explicit kinetic integration algorithms on modern graphics processing unit (GPU) accelerators. Taking as a generic test case a Type Ia supernova explosion with an extremely stiff thermonuclear network having 150 isotopic species and 1604 reactions coupled to hydrodynamics using operator splitting, we demonstrate the capability to solve of order 100 realistic kinetic networks in parallel in the same time that standard implicit methods can solve a single such network on a CPU. This orders-of-magnitude decrease in computation time for solving systems of realistic kinetic networks implies that important coupled, multiphysics problems in various scientific and technical fields that were intractable, or could be simulated only with highly schematic kinetic networks, are now computationally feasible.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A time-parallel multiple-shooting method for large-scale quantum optimal control

Quantum optimal control plays a crucial role in quantum computing by providing the interface between compiler and hardware. Solving the optimal control problem is particularly challenging for multi-qubit gates, due to the exponential growth in computational complexity with the system's dimensionality and the deterioration of optimization convergence. To ameliorate the computational complexity of time-integration, this paper introduces a multiple-shooting approach in which the time domain is divided into multiple windows and the intermediate states at window boundaries are treated as additional optimization variables. Further, this enables parallel computation of state evolution across time-windows, significantly accelerating objective function and gradient evaluations. Since the initial state matrix in each window is only guaranteed to be unitary upon convergence of the optimization algorithm, the conventional gate trace infidelity is replaced by a generalized infidelity that is convex for non-unitary state matrices. Continuity of the state across window boundaries is enforced by equality constraints. A quadratic penalty optimization method is used to solve the constrained optimal control problem, and an efficient adjoint technique is employed to calculate the gradients in each iteration. We demonstrate the effectiveness of the proposed method through numerical experiments on quantum Fourier transform gates in systems with 2, 3, and 4 qubits, noting a speedup of 80x for evaluating the gradient in the 4-qubit case, highlighting the method's potential for optimizing control pulses in multi-qubit quantum systems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Quantification of electron correlation for approximate quantum calculations

State-of-the-art many-body wave function techniques rely on heuristics to achieve high accuracy at an attainable computational cost to solve the many-body Schrödinger equation. By far, the most common property used to assess accuracy has been the total energy; however, total energies do not give a complete picture of electron correlation. In this work, we assess the von Neumann entropy of the one-particle reduced density matrix (1-RDM) to compare selected configuration interaction (CI), coupled cluster, variational Monte Carlo, and fixed-node diffusion Monte Carlo for benchmark hydrogen chains. A new algorithm, the circle reject method, is presented, which improves the efficiency of evaluating the von Neumann entropy using quantum Monte Carlo by several orders of magnitude. The von Neumann entropy of the 1-RDM and the eigenvalues of the 1-RDM are shown to distinguish between the dynamic correlation introduced by the Jastrow and the static correlation introduced by determinants with large weights, confirming some of the lore in the field concerning the difference between the selected CI and Slater–Jastrow wave functions.

Chemistry↗

Machine learning and algebraic approaches towards complete matter spectra in 4d F-theory

Motivated by engineering vector-like (Higgs) pairs in the spectrum of 4d F-theory compactifications, we combine machine learning and algebraic geometry techniques to analyze line bundle cohomologies on families of holomorphic curves. To quantify jumps of these cohomologies, we first generate 1.8 million pairs of line bundles and curves embedded in dP 3 , for which we compute the cohomologies. A white-box machine learning approach trained on this data provides intuition for jumps due to curve splittings, which we use to construct additional vector-like Higgs-pairs in an F-Theory toy model. We also find that, in order to explain quantitatively the full dataset, further tools from algebraic geometry, in particular Brill-Noether theory, are required. Using these ingredients, we introduce a diagrammatic way to express cohomology jumps across the parameter space of each family of matter curves, which reflects a stratification of the F-theory complex structure moduli space in terms of the vector-like spectrum. Furthermore, these insights provide an algorithmically efficient way to estimate the possible cohomology dimensions across the entire parameter space.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

High-fidelity parallel entangling gates on a neutral-atom quantum computer

The ability to perform entangling quantum operations with low error rates in a scalable fashion is a central element of useful quantum information processing. Neutral-atom arrays have recently emerged as a promising quantum computing platform, featuring coherent control over hundreds of qubits and any-to-any gate connectivity in a flexible, dynamically reconfigurable architecture. The main outstanding challenge has been to reduce errors in entangling operations mediated through Rydberg interactions. Here we report the realization of two-qubit entangling gates with 99.5% fidelity on up to 60 atoms in parallel, surpassing the surface-code threshold for error correction. Our method uses fast, single-pulse gates based on optimal control, atomic dark states to reduce scattering and improvements to Rydberg excitation and atom cooling. We benchmark fidelity using several methods based on repeated gate applications, characterize the physical error sources and outline future improvements. Finally, we generalize our method to design entangling gates involving a higher number of qubits, which we demonstrate by realizing low-error three-qubit gates. By enabling high-fidelity operation in a scalable, highly connected system, these advances lay the groundwork for large-scale implementation of quantum algorithms, error-corrected circuits and digital simulations.

97 MATHEMATICS AND COMPUTING↗

Automated laser-based barely visible impact damage detection in honeycomb sandwich composite structures

Nondestructive evaluation (NDE) for detection and quantification of damage in composite materials is fundamental in the assessment of the overall structural integrity of modern aerospace systems. Conventional NDE systems have been extensively used to detect the location and size of damages by propagating ultrasonic waves normal to the surface. However they usually require physical contact with the structure and are time consuming and labor intensive. An automated, contactless laser ultrasonic imaging system for barely visible impact damage (BVID) detection in advanced composite structures has been developed to overcome these limitations. Lamb waves are generated by a Q-switched Nd:YAG laser, raster scanned by a set of galvano-mirrors over the damaged area. The out-of-plane vibrations are measured through a laser Doppler Vibrometer (LDV) that is stationary at a point on the corner of the grid. The ultrasonic wave field of the scanned area is reconstructed in polar coordinates and analyzed for high resolution characterization of impact damage in the composite honeycomb panel. Two methodologies are used for ultrasonic wave-field analysis: scattered wave field analysis (SWA) and standing wave energy analysis (SWEA) in the frequency domain. The SWA is employed for processing the wave field and estimate spatially dependent wavenumber values, related to discontinuities in the structural domain. The SWEA algorithm extracts standing waves trapped within damaged areas and, by studying the spectrum of the standing wave field, returns high fidelity damage imaging. While the SWA can be used to locate the impact damage in the honeycomb panel, the SWEA produces damage images in good agreement with X-ray computed tomographic (X-ray CT) scans. The results obtained prove that the laser-based nondestructive system is an effective alternative to overcome limitations of conventional NDI technologies.

36 MATERIALS SCIENCE↗

Complex generalized minimal residual algorithm for iterative solution of quantum-mechanical reactive scattering equations

Complex dense matrices corresponding to the D + H2 and O + HD reactions were solved using a complex generalized minimal residual (GMRes) algorithm described by Saad and Schultz (1986) and Saad (1990). To provide a test case with a different structure, the H + H2 system was also considered. It is shown that the computational effort for solutions with the GMRes algorithm depends on the dimension of the linear system, the total energy of the scattering problem, and the accuracy criterion. In several cases with dimensions in the range 1110-5632, the GMRes algorithm outperformed the LAPACK direct solver, with speedups for the linear equation solution as large as a factor of 23.

Chatfield, David C.↗

Computer Visualization of Many-Particle Quantum Dynamics

In this paper I show the importance of computer visualization in researching of many-particle quantum dynamics. Such a visualization becomes an indispensable illustrative tool for understanding the behavior of dynamic swarm-based quantum systems. It is also an important component of the corresponding simulation framework, and can simplify the studies of underlying algorithms for multi-particle quantum systems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Spin Glass Patch Planting

In this paper, we propose a patch planting method for creating arbitrarily large spin glass instances with known ground states. The scaling of the computational complexity of these instances with various block numbers and sizes is investigated and compared with random instances using population annealing Monte Carlo and the quantum annealing DW2X machine. The method can be useful for benchmarking tests for future generation quantum annealing machines, classical and quantum mechanical optimization algorithms.

Quantum Annealing↗

First order nonadiabatic coupling matrix elements between excited states: Implementation and application at the TD-DFT and pp-TDA levels

The recently proposed rigorous yet abstract theory of first order nonadiabatic coupling matrix elements (fo-NACME) between electronically excited states [Z. Li and W. Liu, J. Chem. Phys. 141, 014110 (2014)] is specified in detail for two widely used models: The time-dependent density functional theory and the particle-particle Tamm-Dancoff approximation. The actual implementation employs a Lagrangian formalism with atomic-orbital based direct algorithms, which makes the computation of fo-NACME very similar to that of excited-state gradients. Although the methods have great potential in investigating internal conversions and nonadiabatic dynamics between excited states of large molecules, only prototypical systems as a first pilot application are considered here to illustrate some conceptual aspects.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗