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 829 records · Page 46

Multireference Embedding and Fragmentation Methods for Classical and Quantum Computers: From Model Systems to Realistic Applications

One of the primary challenges in quantum chemistry is the accurate modeling of strong electron correlation. While multireference methods effectively capture such correlation, their steep scaling with system size prohibits their application to large molecules and extended materials. Quantum embedding offers a promising solution by partitioning complex systems into manageable subsystems. In this Review, we highlight recent advances in multireference density matrix embedding and localized active space self-consistent field approaches for complex molecules and extended materials. We discuss both classical implementations and the emerging potential of these methods on quantum computers. Here, by extending classical embedding concepts to the quantum landscape, these algorithms have the potential to expand the reach of multireference methods in quantum chemistry and materials.

Algorithms↗

Weak Simulation v.0.1

The SPARSIFY algorithm implemented by the code allows for classical simulation of universal quantum computer sample outcomes. The code sparsifies the stabilizer decomposition of a qubit t-tensored T gate magic state to some additive error. This is accomplished by either independent L1 sampling or with correlated L1 sampling to supplement an independent subset, which offers a more efficient decomposition: for a given t, a sparser decomposition is sufficient with correlated L1 sampling to satisfy a given additive error. Sandia National Laboratories is a multimission laboratory managed and operated by National Technology & Engineering Solutions of Sandia, LLC, a wholly owned subsidiary of Honeywell International Inc., for the U.S. Department of Energy’s National Nuclear Security Administration under contract DE-NA0003525. SAND2021-8296 O

SciDAC↗

Poincare recurrence and spectral cascades in three-dimensional quantum turbulence

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.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Cross-platform comparison of arbitrary quantum states

As we approach the era of quantum advantage, when quantum computers (QCs) can outperform any classical computer on particular tasks, there remains the difficult challenge of how to validate their performance. While algorithmic success can be easily verified in some instances such as number factoring or oracular algorithms, these approaches only provide pass/fail information of executing specific tasks for a single QC. On the other hand, a comparison between different QCs preparing nominally the same arbitrary circuit provides an insight for generic validation: a quantum computation is only as valid as the agreement between the results produced on different QCs. Such an approach is also at the heart of evaluating metrological standards such as disparate atomic clocks. In this paper, we report a cross-platform QC comparison using randomized and correlated measurements that results in a wealth of information on the QC systems. We execute several quantum circuits on widely different physical QC platforms and analyze the cross-platform state fidelities.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Noise resilience of variational quantum compiling

Variational hybrid quantum-classical algorithms (VHQCAs) are near-term algorithms that leverage classical optimization to minimize a cost function, which is efficiently evaluated on a quantum computer. Recently VHQCAs have been proposed for quantum compiling, where a target unitary U is compiled into a short-depth gate sequence V. In this work, we report on a surprising form of noise resilience for these algorithms. Namely, we find one often learns the correct gate sequence V (i.e. the correct variational parameters) despite various sources of incoherent noise acting during the cost-evaluation circuit. Our main results are rigorous theorems stating that the optimal variational parameters are unaffected by a broad class of noise models, such as measurement noise, gate noise, and Pauli channel noise. Furthermore, our numerical implementations on IBM's noisy simulator demonstrate resilience when compiling the quantum Fourier transform, Toffoli gate, and W-state preparation. Hence, variational quantum compiling, due to its robustness, could be practically useful for noisy intermediate-scale quantum devices. Finally, we speculate that this noise resilience may be a general phenomenon that applies to other VHQCAs such as the variational quantum eigensolver.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A semi-Lagrangian transport method for kinetic problems with application to dense-to-dilute polydisperse reacting spray flows

For sprays, as described by a kinetic disperse phase model strongly coupled to the Navier–Stokes equations, the resolution strategy is constrained by accuracy objectives, robustness needs, and the computing architecture. In order to leverage the good properties of the Eulerian formalism, we introduce a deterministic particle-based numerical method to solve transport in physical space, which is simple to adapt to the many types of closures and moment systems. The method is inspired by the semi-Lagrangian schemes, developed for Gas Dynamics. We show how semi-Lagrangian formulations are relevant for a disperse phase far from equilibrium and where the particle–particle coupling barely influences the transport; i.e., when particle pressure is negligible. The particle behavior is indeed close to free streaming. The new method uses the assumption of parcel transport and avoids to compute fluxes and their limiters, which makes it robust. It is a deterministic resolution method so that it does not require efforts on statistical convergence, noise control, or post-processing. All couplings are done among data under the form of Eulerian fields, which allows one to use efficient algorithms and to anticipate the computational load. This makes the method both accurate and efficient in the context of parallel computing. After a complete verification of the new transport method on various academic test cases, we demonstrate the overall strategy's ability to solve a strongly-coupled liquid jet with fine spatial resolution and we apply it to the case of high-fidelity Large Eddy Simulation of a dense spray flow. A fuel spray is simulated after atomization at Diesel engine combustion chamber conditions. The large, parallel, strongly coupled computation proves the efficiency of the method for dense, polydisperse, reacting spray flows.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

State Preparation in Quantum Algorithms for Fragment-Based Quantum Chemistry

State preparation for quantum algorithms is crucial for achieving high accuracy in quantum chemistry and competing with classical algorithms. The localized active space–unitary coupled cluster (LAS–UCC) algorithm iteratively loads a fragment-based multireference wave function onto a quantum computer. Here, in this study, we compare two state preparation methods, quantum phase estimation (QPE) and direct initialization (DI), for each fragment. We test the two state preparation methods on three systems, ranging from a model system, a set of interacting hydrogen molecules, to more realistic chemical problems, like the C–C double bond breaking in transbutadiene and the spin ladder in a bimetallic system. We analyze the impact of QPE parameters, such as the number of ancilla qubits and Trotter steps, on the prepared state. We find a trade-off between the methods, where DI requires fewer resources for smaller fragments, while QPE is more efficient for larger fragments. Our resource estimates highlight the benefits of system fragmentation in state preparation for subsequent quantum chemical calculations. These findings have broad applications for preparing multireference quantum chemical wave functions on quantum circuits that can be used for realistic chemical applications.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Efficiently embedding QUBO problems on adiabatic quantum computers

Adiabatic quantum computers like the D-Wave 2000Q can approximately solve the QUBO problem, which is an NP-hard problem, and have been shown to outperform classical computers on several instances. Solving the QUBO problem literally means solving virtually any NP-hard problem like the traveling salesman problem, airline scheduling problem, protein folding problem, genotype imputation problem, thereby enabling significant scientific progress, and potentially saving millions/billions of dollars in logistics, airlines, healthcare and many other industries. Yet, before QUBO problems are solved on quantum computers, they must be embedded (or compiled) onto the hardware of quantum computers, which in itself is a very hard problem. Here, we propose an efficient embedding algorithm, that lets us embed QUBO problems fast, uses less qubits and gets the objective function value close to the global minimum value. We then compare the performance of our embedding algorithm to that of D-Wave’s embedding algorithm, which is the current state of the art, and show that our embedding algorithm convincingly outperforms D-Wave’s embedding algorithm. Our embedding approach works with perfect Chimera graphs, i.e., Chimera graphs with no missing qubits.

97 MATHEMATICS AND COMPUTING↗

Large-scale simulations of Floquet physics on near-term quantum computers

Abstract Periodically driven quantum systems exhibit a diverse set of phenomena but are more challenging to simulate than their equilibrium counterparts. Here, we introduce the Quantum High-Frequency Floquet Simulation (QHiFFS) algorithm as a method to simulate fast-driven quantum systems on quantum hardware. Central to QHiFFS is the concept of a kick operator which transforms the system into a basis where the dynamics is governed by a time-independent effective Hamiltonian. This allows prior methods for time-independent simulation to be lifted to simulate Floquet systems. We use the periodically driven biaxial next-nearest neighbor Ising (BNNNI) model, a natural test bed for quantum frustrated magnetism and criticality, as a case study to illustrate our algorithm. We implemented a 20-qubit simulation of the driven two-dimensional BNNNI model on Quantinuum’s trapped ion quantum computer. Our error analysis shows that QHiFFS exhibits not only a cubic advantage in driving frequency ω but also a linear advantage in simulation time t compared to Trotterization.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Image reconstruction of single photon emission computed tomography (SPECT) on a pebble bed reactor (PBR) using expectation maximization and exact inversion algorithms: Comparison study by means of numerical phantom

Single Photon Emission Computed Tomography (SPECT) is a well-known imaging technique used in medical application, and it is part of medical imaging modalities that made the diagnosis and treatment of disease possible. However, SPECT technique is not only limited to the medical sector. Many works are carried out to adapt the same concept by using high-energy photon emission to diagnose process malfunctions in critical industrial systems such as in chemical reaction engineering research laboratories, as well as in oil and gas, petrochemical and petrochemical refining industries. Motivated by vast applications of SPECT technique, this work attempts to study the application of SPECT on a Pebble Bed Reactor (PBR) using numerical phantom of pebbles inside the PBR core. From the cross-sectional images obtained from SPECT, the behavior of pebbles inside the core can be analyzed for further improvement of the PBR design. As the quality of the reconstructed image is largely dependent on the algorithm used, this work aims to compare two image reconstruction algorithms for SPECT, namely the Expectation Maximization Algorithm and the Exact Inversion Formula. The results obtained from the Exact Inversion Formula showed better image contrast and sharpness, and shorter computational time compared to the Expectation Maximization Algorithm.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A semi-agnostic ansatz with variable structure for variational quantum algorithms

Quantum machine learning—and specifically Variational Quantum Algorithms (VQAs)—offers a powerful, flexible paradigm for programming near-term quantum computers, with applications in chemistry, metrology, materials science, data science, and mathematics. Here, one trains an ansatz, in the form of a parameterized quantum circuit, to accomplish a task of interest. However, challenges have recently emerged suggesting that deep ansatzes are difficult to train, due to flat training landscapes caused by randomness or by hardware noise. This motivates our work, where we present a variable structure approach to build ansatzes for VQAs. Our approach, called VAns (Variable Ansatz), applies a set of rules to both grow and (crucially) remove quantum gates in an informed manner during the optimization. Consequently, VAns is ideally suited to mitigate trainability and noise-related issues by keeping the ansatz shallow. We employ VAns in the variational quantum eigensolver for condensed matter and quantum chemistry applications, in the quantum autoencoder for data compression and in unitary compilation problems showing successful results in all cases.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

In situ plasma removal of surface contaminants from ion trap electrodes

In this thesis, the construction and implementation of an in situ plasma discharge designed to remove surface contaminants from electrodes in an ion trapping experimental system is presented with results. In recent years, many advances have been made in using ion traps for quantum information processing. All of the criteria defined by DiVincenzo for using ion traps for implementing a quantum computer have been individually demonstrated, and in particular surface traps provide a scalable platform for ions. In order to be used for quantum algorithms, trapped ions need to be cooled to their motional (quantum mechanical) ground state. One of the hurdles in integrating surface ion traps for a quantum computer is minimizing electric field noise, which causes the ion to heat out of its motional ground state and which increases with smaller ion-to-electrode distances realized with surface traps. Surface contamination of trap electrodes is speculated to be the primary source of electric field noise. The main goal achieved by this work was to implement an in situ surface cleaning solution for surface electrode ion traps, which would not modify the ion trap electrode surface metal. Care was taken in applying the RF power in order to localize a plasma near the trap electrodes. A method for characterizing the energy of the plasma ions arriving at the ion trap surface is presented and results for plasma ion energies are shown. Finally, a method for quantifying the effectiveness of plasma cleaning of trap electrodes, using the surface analysis technique of X-ray photoelectron spectroscopy for measuring the amount and kind of surface contaminants, is described. A significant advantage of the trap electrode surface cleaning method presented here is the minimal changes necessary for implementation on a working ion trap experimental system.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Multiscale deformable registration for dual-energy x-ray imaging

Dual-energy (DE) imaging of the chest improves the conspicuity of subtle lung nodules through the removal of overlying anatomical noise. Recent work has shown double-shot DE imaging (i.e., successive acquisition of low- and high-energy projections) to provide detective quantum efficiency, spectral separation (and therefore contrast), and radiation dose superior to single-shot DE imaging configurations (e.g., with a CR cassette). However, the temporal separation between high-energy (HE) and low-energy (LE) image acquisition can result in motion artifacts in the DE images, reducing image quality and diminishing diagnostic performance. This has motivated the development of a deformable registration technique that aligns the HE image onto the LE image before DE decomposition. The algorithm reported here operates in multiple passes at progressively smaller scales and increasing resolution. The first pass addresses large-scale motion by means of mutual information optimization, while successive passes (2-4) correct misregistration at finer scales by means of normalized cross correlation. Evaluation of registration performance in 129 patients imaged using an experimental DE imaging prototype demonstrated a statistically significant improvement in image alignment. Specific to the cardiac region, the registration algorithm was found to outperform a simple cardiac-gating system designed to trigger both HE and LE exposures during diastole. Modulation transfer function (MTF) analysis reveals additional advantages in DE image quality in terms of noise reduction and edge enhancement. This algorithm could offer an important tool in enhancing DE image quality and potentially improving diagnostic performance.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Mathematical foundation of quantum annealing

Quantum annealing is a generic name of quantum algorithms that use quantum-mechanical fluctuations to search for the solution of an optimization problem. It shares the basic idea with quantum adiabatic evolution studied actively in quantum computation. The present paper reviews the mathematical and theoretical foundations of quantum annealing. In particular, theorems are presented for convergence conditions of quantum annealing to the target optimal state after an infinite-time evolution following the Schroedinger or stochastic (Monte Carlo) dynamics. It is proved that the same asymptotic behavior of the control parameter guarantees convergence for both the Schroedinger dynamics and the stochastic dynamics in spite of the essential difference of these two types of dynamics. Also described are the prescriptions to reduce errors in the final approximate solution obtained after a long but finite dynamical evolution of quantum annealing. It is shown there that we can reduce errors significantly by an ingenious choice of annealing schedule (time dependence of the control parameter) without compromising computational complexity qualitatively. A review is given on the derivation of the convergence condition for classical simulated annealing from the view point of quantum adiabaticity using a classical-quantum mapping.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Quantum discord of two-qubit X states

Quantum discord provides a measure for quantifying quantum correlations beyond entanglement and is very hard to compute even for two-qubit states because of the minimization over all possible measurements. Recently a simple algorithm to evaluate the quantum discord for two-qubit X states was proposed by Ali, Rau, and Alber [Phys. Rev. A 81, 042105 (2010)] with minimization taken over only a few cases. Here we shall at first identify a class of X states, whose quantum discord can be evaluated analytically without any minimization, for which their algorithm is valid, and also identify a family of X states for which their algorithm fails. And then we demonstrate that this special family of X states provides furthermore an explicit example for the inequivalence between the minimization over positive operator-valued measures and that over von Neumann measurements.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A High-Efficiency Delayed Update Algorithm for Evaluating Slater Determinants in Quantum Monte Carlo

For quantum Monte Carlo simulations of molecular systems or supercells with thousands of electrons, matrix operations related to Slater determinants lead the computational cost. McDaniel et al. [J. Chem. Phys. 2017, 147, 174107] proposed a delayed update algorithm to increase computational efficiency by using matrix–matrix multiplication when updating the inverse matrices of Slater determinants. However, preparing intermediate matrices for applying the Sherman–Morrison–Woodbury formula remained a bottleneck. Here, in this work, we introduce an improved algorithm for CPUs and GPUs that (1) reduces this bottleneck by iteratively updating the intermediate matrices and (2) is efficient at any acceptance ratio, with no cost for rejected moves on CPUs and minimal cost on GPUs. We show the full scheme of integrating the delayed update algorithm into a single-electron move. The high efficiency of our algorithm is demonstrated on CPUs and GPUs for a 512 atom/6144 valence electron calculation, with 12× and 2× overall speed-up compared to traditional rank-1 update schemes in diffusion quantum Monte Carlo, respectively.

Luo, Ye [Argonne National Laboratory (ANL), Argonn↗

The Rise and Fall of Type Ia Supernova Light Curves in the SDSS-II Supernova Survey

We analyze the rise and fall times of Type Ia supernova (SN Ia) light curves discovered by the Sloan Digital Sky Survey-II (SDSS-II) Supernova Survey. From a set of 391 light curves k-corrected to the rest-frame B and V bands, we find a smaller dispersion in the rising portion of the light curve compared to the decline. This is in qualitative agreement with computer models which predict that variations in radioactive nickel yield have less impact on the rise than on the spread of the decline rates. The differences we find in the rise and fall properties suggest that a single 'stretch' correction to the light curve phase does not properly model the range of SN Ia light curve shapes. We select a subset of 105 light curves well observed in both rise and fall portions of the light curves and develop a '2-stretch' fit algorithm which estimates the rise and fall times independently. We find the average time from explosion to B-band peak brightness is 17.38 {+-} 0.17 days, but with a spread of rise times which range from 13 days to 23 days. Our average rise time is shorter than the 19.5 days found in previous studies; this reflects both the different light curve template used and the application of the 2-stretch algorithm. The SDSS-II supernova set and the local SNe Ia with well-observed early light curves show no significant differences in their average rise-time properties. We find that slow-declining events tend to have fast rise times, but that the distribution of rise minus fall time is broad and single peaked. This distribution is in contrast to the bimodality in this parameter that was first suggested by Strovink (2007) from an analysis of a small set of local SNe Ia. We divide the SDSS-II sample in half based on the rise minus fall value, t{sub r} - t{sub f} {approx}< 2 days and t{sub r} - t{sub f} > 2 days, to search for differences in their host galaxy properties and Hubble residuals; we find no difference in host galaxy properties or Hubble residuals in our sample.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

XY vs X Mixer in Quantum Alternating Operator Ansatz for Optimization Problems with Constraints

Quantum Approximate Optimization Algorithm, further generalized as Quantum Alternating Operator Ansatz (QAOA), is a family of algorithms for combinatorial optimization problems. It is a leading candidate to run on emerging universal quantum computers to gain insight into quantum heuristics. In constrained optimization, penalties are often introduced so that the ground state of the cost Hamiltonian encodes the solution (a standard practice in quantum annealing). An alternative is to choose a mixing Hamiltonian such that the constraint corresponds to a constant of motion and the quantum evolution stays in the feasible subspace. Better performance of the algorithm is speculated due to a much smaller search space. We consider problems with a constant Hamming weight as the constraint. We also compare different methods of generating the generalized W-state, which serves as a natural initial state for the Hamming-weight constraint. Using graph-coloring as an example, we compare the performance of using XY model as a mixer that preserves the Hamming weight with the performance of adding a penalty term in the cost Hamiltonian.

quantum computing↗