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 235 records · Page 13

TEAM project review, year 1

This note summarizes our research activities within the TEAM project between October 2019 and November 2020, funded by the ASCR Advanced Research in Quantum Computing program. Three research efforts have begun during the review period. The first effort, resulting in the JuQBox software, implemented a novel algorithm for optimal control in closed quantum systems based on symplectic time integration and exact calculations of the gradient of the discretized objective function. In our second effort, resulting in a code called Quandary, we consider the optimal control problem for open quantum systems. Here the evolution of the quantum system is modeled by the Lindblad master equation. In this code, we are considering both the realization of quantum gates as well as the optimal reset problem in which a general mixed quantum state is driven towards its ground state. In our third research effort we have begun the development of computational software for what we call Lindblad learning, i.e. the process of characterizing the equations governing our quantum computing hardware.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Confinement-controlled selective CO 2 insertion into a dicopper dihydride core: A multiscale mechanistic study

CO 2 is an abundant C 1 feedstock for fuel and chemical synthesis. We have previously demonstrated experimentally a stepwise insertion of CO 2 into a [Cu 2 H 2 ] core via a solid–gas in crystallo reaction, forming formate species that are unstable and inaccessible under solution-phase conditions. This work elucidates how structural confinement within the crystal lattice enables such selective reactivity. In particular, co-crystallized tetrahydrofuran molecules induce site asymmetry around the [Cu 2 H 2 ] unit, modulating both the local electronic environment and CO 2 diffusion pathways. Using a multiscale computational approach that combines classical molecular mechanics, hybrid quantum mechanics/molecular mechanics molecular dynamics, and enhanced-sampling free energy calculations, we demonstrate how site asymmetry affects CO 2 binding affinities and reaction pathways. These results provide detailed mechanistic insight into CO 2 insertion and hydride transfer, highlighting key differences between crystal- and solution-phase pathways and offering a general framework for understanding how lattice confinement shapes chemical reactivity.

Chemical bonding↗

Plasticity and Kinky Chemistry of Carbon Nanotubes

Since their discovery in 1991, carbon nanotubes have been the subject of intense research interest based on early predictions of their unique mechanical, electronic, and chemical properties. Materials with the predicted unique properties of carbon nanotubes are of great interest for use in future generations of aerospace vehicles. For their structural properties, carbon nanotubes could be used as reinforcing fibers in ultralight multifunctional composites. For their electronic properties, carbon nanotubes offer the potential of very high-speed, low-power computing elements, high-density data storage, and unique sensors. In a continuing effort to model and predict the properties of carbon nanotubes, Ames accomplished three significant results during FY99. First, accurate values of the nanomechanics and plasticity of carbon nanotubes based on quantum molecular dynamics simulations were computed. Second, the concept of mechanical deformation catalyzed-kinky-chemistry as a means to control local chemistry of nanotubes was discovered. Third, the ease of nano-indentation of silicon surfaces with carbon nanotubes was established. The elastic response and plastic failure mechanisms of single-wall nanotubes were investigated by means of quantum molecular dynamics simulations.

Srivastava, Deepak↗

Separating Physics and Dynamics Grids for Improved Computational Efficiency in Spectral Element Earth System Models

Previous studies have shown that atmospheric models with a spectral element grid can benefit from putting physics calculations on a relatively coarse finite volume grid. Here we demonstrate an alternative high-order, element-based mapping approach used to implement a quasi-equal-area, finite volume physics grid in E3SM. Unlike similar methods, the new method in E3SM requires topology data purely local to each spectral element, which trivially allows for regional mesh refinement. Simulations with physics grids defined by 2 × 2, 3 × 3, and 4 × 4 divisions of each element are shown to verify that the alternative physics grid does not qualitatively alter the model solution. The model performance is substantially affected by the reduction of physics columns when using the 2 × 2 grid, which can increase the throughput of physics calculations by roughly 60%–120% depending on whether the computational resources are configured to maximize throughput or efficiency. A pair of regionally refined cases are also shown to highlight the refinement capability.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Comparing quantum annealing and spiking neuromorphic computing for sampling binary sparse coding QUBO problems

We consider the problem of computing a sparse binary representation of an image. Given an image and an overcomplete, non-orthonormal basis, we aim to find a sparse binary vector indicating the minimal set of basis vectors that when added together best reconstruct the given input. We formulate this problem with an L 2 loss on the reconstruction error, and an L 0 loss on the binary vector enforcing sparsity. First, we solve the sparse representation QUBOs by solving them both on a D-Wave quantum annealer with Pegasus chip connectivity, as well as on the Intel Loihi 2 spiking neuromorphic processor using a stochastic Non-equilibrium Boltzmann Machine (NEBM). Second, using Quantum Evolution Monte Carlo with Reverse Annealing and iterated warm starting on Loihi 2 to evolve the solution quality from the respective machines. We demonstrate that both quantum annealing and neuromorphic computing are suitable for solving binary sparse coding QUBOs.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Scalable Interpolation on GPUs for Thermal Fluids Applications

The need for efficient interpolation arises in many use cases for spectral element simulations. Towards this end, we present a fast and robust GPU-enable interpolation utility for NekRS, a spectral-element, Navier-Stokes solver. This utility is based on the findpts and findpts eval routines from the gslib library. To demonstrate the functionality, we added support for particle tracking. The GPU implementation of the interpolation allows for tracking 100 times more particles for the same computational cost.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

TEAM Project Review, Year 2

This report summarizes our research activities within the TEAM project between December 2020 and December 2021, funded by the ASCR Advanced Research in Quantum Computing program. During the reporting period the LLNL-MSU team has made progress on several fronts. An overarching goal of the team is to provide a comprehensive suite of software tools that can be used for the Characterize-Optimize-Compute loop needed to implement and execute algorithms on quantum devices. We are concurrently developing lightweight solvers that can be used on desktop computers to find optimal control pulses and to characterize small quantum systems (consisting of a few transmons and cavities). However, desktop computers are insufficient for simulating and characterizing larger quantum systems. We have therefore also developed parallel, distributed memory, simulators and optimization solvers, both for open and closed quantum systems. These parallel solvers have, for example, been used to study quantum optimal control for pure-state preparation, utilizing 1000’s of cores on a modern high-performance computing (HPC) platform.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Classical versus quantum models in machine learning: insights from a finance application

Although several models have been proposed towards assisting machine learning (ML) tasks with quantum computers, a direct comparison of the expressive power and efficiency of classical versus quantum models for datasets originating from real-world applications is one of the key milestones towards a quantum ready era. Here, we take a first step towards addressing this challenge by performing a comparison of the widely used classical ML models known as restricted Boltzmann machines (RBMs), against a recently proposed quantum model, now known as quantum circuit Born machines (QCBMs). Both models address the same hard tasks in unsupervised generative modeling, with QCBMs exploiting the probabilistic nature of quantum mechanics and a candidate for near-term quantum computers, as experimentally demonstrated in three different quantum hardware architectures to date. To address the question of the performance of the quantum model on real-world classical data sets, we construct scenarios from a probabilistic version out of the well-known portfolio optimization problem in finance, by using time-series pricing data from asset subsets of the S&P500 stock market index. It is remarkable to find that, under the same number of resources in terms of parameters for both classical and quantum models, the quantum models seem to have superior performance on typical instances when compared with the canonical training of the RBMs. Our simulations are grounded on a hardware efficient realization of the QCBMs on ion-trap quantum computers, by using their native gate sets, and therefore readily implementable in near-term quantum devices.

97 MATHEMATICS AND COMPUTING↗

Fast-forwarding quantum simulation with real-time quantum Krylov subspace algorithms

Quantum subspace diagonalization (QSD) algorithms have emerged as a competitive family of algorithms that avoid many of the optimization pitfalls associated with parameterized quantum circuit algorithms. While the vast majority of the QSD algorithms have focused on solving the eigenpair problem for ground, excited-state, and thermal observable estimation, there has been a lot less work in considering QSD algorithms for the problem of quantum dynamical simulation. In this work, we propose several quantum Krylov fast-forwarding (QKFF) algorithms capable of predicting long-time dynamics well beyond the coherence time of current quantum hardware. Our algorithms use real-time evolved Krylov basis states prepared on the quantum computer and a multi-reference subspace method to ensure convergence towards high-fidelity, long-time dynamics. In particular, we show that the proposed multi-reference methodology provides a systematic way of trading off circuit depth with classical post-processing complexity. Further, we also demonstrate the efficacy of our approach through numerical implementations for several quantum chemistry problems including the calculation of the auto-correlation and dipole moment correlation functions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Imaginary Time Propagation on a Quantum Chip

We report evolution in imaginary time is a prominent technique for finding the ground state of quantum many-body systems, and the heart of a number of numerical methods that have been used with great success in quantum chemistry, condensed matter, and nuclear physics. We propose an algorithm to implement imaginary time propagation on a quantum computer. Our algorithm is devised in the context of an efficient encoding into an optimized gate, drawing on the underlying characteristics of the quantum device of a unitary operation in an extended Hilbert space. However, we prove that for simple problems it can also be successfully applied to standard digital quantum machines. This work paves the way for porting quantum many-body methods based on imaginary-time propagation to near-term quantum devices, enabling the future quantum simulation of the ground states of a broad class of microscopic systems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Approximate quantum circuit synthesis using block encodings

One of the challenges in quantum computing is the synthesis of unitary operators into quantum circuits with polylogarithmic gate complexity. Exact synthesis of generic unitaries requires an exponential number of gates in general. We propose a novel approximate quantum circuit synthesis technique by relaxing the unitary constraints and interchanging them for ancilla qubits via block encodings. This approach combines smaller block encodings, which are easier to synthesize, into quantum circuits for larger operators. Due to the use of block encodings, our technique is not limited to unitary operators and can be applied for the synthesis of arbitrary operators. Overall, we show that operators which can be approximated by a canonical polyadic expression with a polylogarithmic number of terms can be synthesized with polylogarithmic gate complexity with respect to the matrix dimension.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Nuclear Weapons Computational Physics [Slides]

This presentation provides an overview of computational physics, the role LANL played in the history of computational physics, and how computational physics differs at LANL. Next, the presentation addresses computational physics as part of the LANL weapons program. Finally, the computational physics structure at LANL is addressed.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Counterdiabatic Driving with Performance Guarantees

Counterdiabatic (CD) driving has the potential to speed up adiabatic quantum state preparation by suppressing unwanted excitations. However, existing approaches either require intractable classical computations or are based on approximations that do not have performance guarantees. We propose and analyze a nonvariational, system-agnostic CD expansion method and analytically show that it converges exponentially quickly in the expansion order. In finite systems, the required resources scale inversely with the spectral gap, which we argue is asymptotically optimal. To extend our method to the thermodynamic limit and suppress errors stemming from high-frequency transitions, we leverage finite-time adiabatic protocols. In particular, we show that a time determined by the quantum speed limit is sufficient to prepare the desired ground state, without the need to optimize the adiabatic trajectory. Numerical tests of our method on the quantum Ising chain show that our method can outperform state-of-the-art variational CD approaches.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Non-equilibrium plasma generation via nano-second multi-mode laser pulses

The formation and growth of plasma kernels generated via nano-second mode-beating laser pulses is investigated here via a non-equilibrium self-consistent computational model. Chemically reactive Navier–Stokes equations are used to describe the hydrodynamics, and non-equilibrium effects are taken into account with a two-temperature model. Inverse Bremsstrahlung and multiphoton ionization are included self-consistently in the model via a coupled solution of the plasma governing equations and the radiative transfer equation (that describes the laser beam propagation and attenuation). A self-consistent approach (despite carrying additional challenges) minimizes the empiricism and it allows for a more accurate description since it prevents both the utilization of artificial plasma seeds to trigger the breakdown and the implementation of tuning parameters to simulate the laser-energy deposition. The advantages of this approach are confirmed by the good agreement between the numerically predicted and the experimentally measured plasma boundary evolution and absorbed energy. This also holds true for the periodic plasma kernel structures that, as suggested by the experiments and confirmed by the simulations presented here, are connected to the modulating frequency.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

$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↗