Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “mechanisms for quantum 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 253 records · Page 14

$t\bar{t}b\bar{b}$ at the LHC: on the size of corrections and b -jet definitions

We report on the calculation of the next-to-leading order QCD corrections to the production of a $t\bar t$ pair in association with two heavy-flavour jets. We concentrate on the di-lepton $t\bar t$ decay channel at the LHC with $\sqrt{s}$ = 13 TeV. The computation is based on pp → $e^+ν_eμ^-\bar{ν}_μb\bar{b}b\bar{b}$ matrix elements and includes all resonant and non-resonant diagrams, interferences and off-shell effects of the top quark and the W gauge boson. As it is customary for such studies, results are presented in the form of inclusive and differential fiducial cross sections. We extensively investigate the dependence of our results upon variation of renormalisation and factorisation scales and parton distribution functions in the quest for an accurate estimate of the theoretical uncertainties. We additionally study the impact of the contributions induced by the bottom-quark parton density. Results presented here are particularly relevant for measurements of $t\bar{t}H(H → b\bar{b})$ and the determination of the Higgs coupling to the top quark. In addition, they might be used for precise measurements of the top-quark fiducial cross sections and to investigate top-quark decay modelling at the LHC.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Cheaper and more noise-resilient quantum state preparation using eigenvector continuation

Subspace methods are powerful, noise-resilient methods that can effectively prepare ground states on quantum computers. The challenge is to get a subspace with a small condition number that spans the states of interest using minimal quantum resources. In this work, we will use eigenvector continuation to build a subspace from the low-lying states of a set of Hamiltonians. The basis vectors are prepared using truncated versions of standard state preparation methods such as imaginary-time evolution (ITE), adiabatic state preparation (ASP), and variational quantum eigensolver. By using these truncated methods combined with eigenvector continuation, we can directly improve upon them, obtaining more accurate ground-state energies at a reduced cost. We use several spin systems to demonstrate convergence even when methods like ITE and ASP fail, such as ASP in the presence of level crossings and ITE with vanishing energy gaps. We also showcase the noise resilience of this approach beyond the gains already made by having shallower quantum circuits. Furthermore, our findings suggest that eigenvector continuation can be used to improve existing state preparation methods in the near term.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Quantum approximate optimization of the long-range Ising model with a trapped-ion quantum simulator

Quantum computers and simulators may offer significant advantages over their classical counterparts, providing insights into quantum many-body systems and possibly improving performance for solving exponentially hard problems, such as optimization and satisfiability. Here, we report the implementation of a low-depth Quantum Approximate Optimization Algorithm (QAOA) using an analog quantum simulator. We estimate the ground-state energy of the Transverse Field Ising Model with long-range interactions with tunable range, and we optimize the corresponding combinatorial classical problem by sampling the QAOA output with high-fidelity, single-shot, individual qubit measurements. We execute the algorithm with both an exhaustive search and closed-loop optimization of the variational parameters, approximating the ground-state energy with up to 40 trapped-ion qubits. We benchmark the experiment with bootstrapping heuristic methods scaling polynomially with the system size. We observe, in agreement with numerics, that the QAOA performance does not degrade significantly as we scale up the system size and that the runtime is approximately independent from the number of qubits. We finally give a comprehensive analysis of the errors occurring in our system, a crucial step in the path forward toward the application of the QAOA to more general problem instances.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Real-time quantum calculations of phase shifts using wave packet time delays

We present a method to extract the phase shift of a scattering process using the real-time evolution in the early and intermediate stages of the collision in order to estimate the time delay of a wave packet. This procedure is convenient when using noisy quantum computers for which the asymptotic out-state behavior is unreachable. We demonstrate that the challenging Fourier transforms involved in the state preparation and measurements can be implemented in 1+1 dimensions with current trapped ion devices and IBM quantum computers. We compare quantum computations of the time delays obtained in the one-particle quantum mechanics limit and the scalable quantum field theory formulation with accurate numerical results. We discuss the finite volume effects in the Wigner formula connecting time delays to phase shifts. The results reported involve two- and four-qubit calculations, and we discuss the possibility of larger scale computations in the near future.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Expanded Capabilities and Opportunities for Virtual Beamline Code

In the 25 years since LLNL broke ground on the National Ignition Facility (NIF) - a cornerstone of the National Nuclear Security Administration’s Stockpile Stewardship Program - the NIF and Photon Science (NIF&PS) Directorate has steadily pushed the boundaries of laser physics, nonlinear optics, and photonics in service of inertial confinement fusion experiments, and advanced photon sources development. Beyond the 192 beamlines of the primary laser facility with its world-record energy and fusion yields, NIF&PS capabilities have expanded to include chirped-pulse amplification, kilojoule petawatt-class short-pulse systems to generate hard x-ray radiographic probes, high-average power lasers as secondary sources for generation or wake field particle acceleration along directed energy applications, and other scientific pursuits. The Computing Directorate partners with NIF&PS on numerous projects and technologies from diagnostic measurements and high performance control systems to data analysis, information technology infrastructure, and scientific simulation code development. “This strong collaboration enables cutting-edge science, particularly with regard to physics-based modeling and simulation,” says physicist Jean-Michel Di Nicola. One crucial capability for NIF&PS is the Virtual Beamline (VBL) laser simulation code. It can model all the major laser physics and technology involved in the design optimization, commissioning, and operations of advanced laser architectures from tabletop to NIF-scale. VBL provides researchers with high-fidelity models and high-resolution calculations of laser performance predictions—including for the entire NIF laser system, the Advanced Radiographic Capability, parts of the High Repetition-Rate Advanced Petawatt Laser System laser delivered to the Czech Republic, and the Optical Science Laser. After more than two decades of experimentally verified physics and computing enhancements, this unique workhorse code is wrapping up another major milestone: migration from Java to C++ with a flurry of user interface and optimization features, as well as laser physics and high-resolution enhancements thanks to parallel execution on Livermore Computing platforms.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Consistency-Enhanced Evolution for Variable Selection Can Identify Key Chemical Information from Spectroscopic Data

In the last few decades, spectroscopic techniques such as near-infrared (NIR) spectroscopy have gained wide applications in several industries, such as the pharmaceutical, agricultural, oil, and gas industries. As a result, various soft sensors have been developed to predict sample properties from spectroscopic readings. Because the spectroscopic readings at different wavelengths, especially at the adjacent wavelengths, are highly correlated, it has been shown that variable selection could significantly improve a soft sensor’s prediction performance while reducing the model complexity. To improve the prediction performance, most variable selection methods focus on identifying the variables (i.e., wavelengths or wavelength segments) that are strongly correlated with the dependent variable. Although many successful applications have been reported, these variable selection methods do have their limitations. Specifically, the selected wavelengths sometimes show little connection to the chemical bounds or functional groups presenting in the sample. In addition, the selected variables can be quite sensitive to the choice of the training samples. In this work, we address these limitations from a different perspective: if a variable selection algorithm can identify the truly relevant input variables, it should consistently identify the same subset of variables regardless of the choice of the training samples. Therefore, we propose a variable selection method that aims to improve the consistency of variable selection resulting from different training samples. Furthermore, the new algorithm is termed consistency-enhanced evolution for variable selection (CEEVS). To demonstrate the performance and robustness of CEEVS, we compare the proposed method with three representative variable selection methods using five published NIR data sets. These case studies clearly demonstrate that by improving the variable selection consistency, we can not only achieve improved prediction performance, but also identify key chemical information from spectroscopic data.

42 ENGINEERING↗

Significance of Energy Conservation in Coupled-Trajectory Approaches to Nonadiabatic Dynamics

Practical methods for simulating photo-induced dynamics of molecules often rely on a trajectory-description of the nuclear dynamics, incorporating approximate electron-nuclear feedback. Through approximating electron–nuclear correlation terms in the exact factorization approach, trajectory-based methods have been derived and successfully applied to the dynamics of a variety of light-induced molecular processes, capturing quantum (de)coherence effects rigorously. These terms account for the coupling among the trajectories, recovering the nonlocal nature of quantum nuclear dynamics that is completely overlooked in traditional independent-trajectory algorithms. Nevertheless, some of the approximations introduced in the derivation of some of these methods do not conserve the total energy. We analyze energy conservation in the coupled trajectory mixed quantum-classical (CTMQC) algorithm and explore the performance of a modified algorithm, CTMQC-E, where some of the terms are redefined to restore energy conservation. Here, a set of molecular models is used as a test, namely, 2-cis-penta-2,4-dienimium cation, bis(methylene) adamantyl radical cation, butatriene cation, uracil radical cation, and neutral pyrazine.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Characterizing Defect Dynamics in Silicon Carbide Using Symmetry-Adapted Collective Variables and Machine Learning Interatomic Potentials

Silicon carbide (SiC) divacancies are attractive candidates for spin-defect qubits possessing long coherence times and optical addressability. The high activation barriers associated with SiC defect formation and motion pose challenges for their study by first-principles molecular dynamics. In this work, we develop and deploy machine learning interatomic potentials (MLIPs) to accelerate defect dynamics simulations while retaining ab initio accuracy. We employ an active learning strategy comprising symmetry-adapted collective variable discovery and enhanced sampling to compile configurationally diverse training data, calculation of energies and forces using density functional theory (DFT), and training of an E(3)-equivariant MLIP based on the Allegro model. Here, the trained MLIP reproduces DFT-level accuracy in defect transition activation free energy barriers, enables the efficient and stable simulation of multidefect 216-atom supercells, and permits an analysis of the temperature dependence of defect thermodynamic stability and formation/annihilation kinetics to propose an optimal annealing temperature to maximally stabilize VV divacancies.

Computer simulations↗

Evidence of Skewness and Sub-Gaussian Character in Temperature-Dependent Distributions of One Million Electronic Excitation Energies in PbS Quantum Dots

Obtaining statistical distributions by sampling a large number of conformations is vital for an accurate description of temperature-dependent properties of chemical systems. However, constructing distributions with 105??106 samples is computationally challenging because of the prohibitively high computational cost of performing rst-principles quantum-mechanical calculations. In this work, we present a new technique called the Eective Stochastic Potential Conguration Interaction Singles (ESP-CIS) method to obtain excitation energies. The ESP-CIS method uses random matrix theory for the construction of an eective stochastic representation of the Fock operator and combines it with linear-response theory. Here, we perform excitation calculations on PbS quantum dots (0.75-1.75 nm) at temperatures of 200-400 K. Results from a total of 15 million excitation energy calculations (1 million samples for each of the three dots at ve dierent temperatures) revealed the distributions to be sub-Gaussian in nature with negative skewness. The distributions progressively became red-shifted with increasing temperature. The study shows that random distortions in structure from the minimum-energy geometry of these quantum dots are more likely to lower the excitation energies.

Scher, Jeremy A.↗

Scaling patch analysis of planar turbulent mixing layers

Proper scales for the mean flow and Reynolds shear stress in planar turbulent mixing layers are determined from a scaling patch analysis of the mean continuity and momentum equations. By seeking an admissible scaling of the mean continuity equation, a proper scale for the mean transverse flow is determined as V ref =(dδ/dx)U ref , where dδ/dx is the growth rate of the mixing layer width and U ref =U h –U l is the difference between the velocity of the high speed stream U h and the velocity of the low speed stream U l . By seeking an admissible scaling for the mean momentum equation, a proper scale for the kinematic Reynolds shear stress is determined as R uv,ref =U avg V ref =[$\frac{1}{2A_u}$$\frac{dδ}{dx}$]$U^{2}_{ref}$ where A u $_{=}^{def}$(U h –U l )/(U h +U l ) is the normalized velocity difference that emerges naturally in the admissible scaling of the mean momentum equation. Self-similar equations for the scaled mean transverse flow V* and Reynolds shear stress $R^{*}_{uv}$=R uv /R uv,ref are derived from the mean continuity and mean momentum equations. Finally, approximate equations for V* and $R^{*}_{uv}$ are developed and found to agree well with experimental data.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Techniques for improved statistical convergence in quantification of eddy diffusivity moments

While recent approaches, such as the macroscopic forcing method (MFM) or Green's function-based approaches, can be used to compute Reynolds-averaged Navier-Stokes closure operators using forced direct numerical simulations, MFM can also be used to directly compute moments of the effective nonlocal and anisotropic eddy diffusivities. The low-order spatial and temporal moments contain limited information about the eddy diffusivity but are often sufficient for quantification and modeling of nonlocal and anisotropic effects. However, when using MFM to compute eddy diffusivity moments, the statistical convergence can be slow for higher-order moments. In this work, we demonstrate that using the same direct numerical simulation (DNS) for all forced MFM simulations improves statistical convergence of the eddy diffusivity moments. We present its implementation in conjunction with a decomposition method that handles the MFM forcing semianalytically and allows for consistent boundary condition treatment, which we develop for both scalar and momentum transport. We demonstrate that for a two-dimensional Rayleigh-Taylor instability case study, using the same DNS for all forced MFM simulations results in convergence with 𝒪⁡(100) simulations rather than 𝒪⁡(1000) simulations. In conclusion, we then demonstrate the impacts of improved convergence on the quantification of the eddy diffusivity.

general physics↗

Non-commutative disintegrations: Existence and uniqueness in finite dimensions

Motivated by advances in categorical probability, we introduce non-commutative almost everywhere (a.e.) equivalence and disintegrations in the setting of C*-algebras. We show that C*-algebras (resp. W*-algebras) and a.e. equivalence classes of 2-positive (resp. positive) unital maps form a category. We prove non-commutative disintegrations are a.e. unique whenever they exist. We provide an explicit characterization for when disintegrations exist in the setting of finite-dimensional C*-algebras, and we give formulas for the associated disintegrations.

97 MATHEMATICS AND COMPUTING↗

Complexity of the Quantum Adiabatic Algorithm

The Quantum Adiabatic Algorithm (QAA) has been proposed as a mechanism for efficiently solving optimization problems on a quantum computer. Since adiabatic computation is analog in nature and does not require the design and use of quantum gates, it can be thought of as a simpler and perhaps more profound method for performing quantum computations that might also be easier to implement experimentally. While these features have generated substantial research in QAA, to date there is still a lack of solid evidence that the algorithm can outperform classical optimization algorithms.

Hen, Itay↗