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,351 records · Page 75

Quantum simulation of massive Thirring and Gross--Neveu models for arbitrary number of flavors

The study of fermionic quantum field theories is an important problem for realizing the standard model of particle physics on a quantum computer. As a step towards this goal, we consider the massive Thirring and Gross--Neveu models with arbitrary number of fermion flavors, $N_f$, discretized on a spatial one-dimensional lattice of size $L$ in the Hamiltonian formulation. We compute the gate complexity using the higher-order product formula and using block-encoding/qubitization and quantum singular value transformations in the limit of large $N_f$ and $L$. We also prepare the ground states of both models with excellent fidelity for system sizes up to 20 qubits with $N_f = 1,2,3,4$ using the adaptive-variational quantum imaginary time algorithm. In addition, we also classify the dynamical Lie algebras of these relativistic fermionic models and show that they belong to the same isomorphism class. Our work is a concrete step towards the quantum simulation of real-time dynamics of large $N_f$ fermionic quantum field theories models relevant for chiral symmetry breaking, understanding dimensional transmutation, and exploring the conformal window of field theories on near-term and early fault-tolerant quantum computers.

FOS: Physical sciences↗

Residual Monte Carlo high-order solver for Moment-Based Accelerated Thermal Radiative Transfer equations

In this article we explore the possibility of replacing Standard Monte Carlo (SMC) transport sweeps within a Moment-Based Accelerated Thermal Radiative Transfer (TRT) algorithm with a Residual Monte Carlo (RMC) formulation. Previous Moment-Based Accelerated TRT implementations have encountered trouble when stochastic noise from SMC transport sweeps accumulates over several iterations and pollutes the low-order system. With RMC we hope to significantly lower the build-up of statistical error at a much lower cost. First, we display encouraging results for a zero-dimensional test problem. Then, we demonstrate that we can achieve a lower degree of error in two one-dimensional test problems by employing an RMC transport sweep with multiple orders of magnitude fewer particles per sweep. We find that by reformulating the high-order problem, we can compute more accurate solutions at a fraction of the cost.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Parallel hybrid quantum-classical machine learning for kernelized time-series classification

Supervised time-series classification garners widespread interest because of its applicability throughout a broad application domain including finance, astronomy, biosensors, and many others. Here, in this work, we tackle this problem with hybrid quantum-classical machine learning, deducing pairwise temporal relationships between time-series instances using a timeseries Hamiltonian kernel (TSHK). A TSHK is constructed with a sum of inner products generated by quantum states evolved using a parameterized time evolution operator. This sum is then optimally weighted using techniques derived from multiple kernel learning. Because we treat the kernel weighting step as a differentiable convex optimization problem, our method can be regarded as an end-to-end learnable hybrid quantum-classical-convex neural network, or QCC-net, whose output is a data set-generalized kernel function suitable for use in any kernelized machine learning technique such as the support vector machine (SVM). Using our TSHK as input to a SVM, we classify univariate and multivariate time-series using quantum circuit simulators and demonstrate the efficient parallel deployment of the algorithm to 127-qubit superconducting quantum processors using quantum multi-programming.

97 MATHEMATICS AND COMPUTING↗

Eulerian Gaussian beams for Schroedinger equations in the semi-classical regime

We propose Gaussian-beam based Eulerian methods to compute semi-classical solutions of the Schroedinger equation. Traditional Gaussian beam type methods for the Schroedinger equation are based on the Lagrangian ray tracing. Based on the first Eulerian Gaussian beam framework proposed in Leung et al. [S. Leung, J. Qian, R. Burridge, Eulerian Gaussian beams for high frequency wave propagation, Geophysics 72 (2007) SM61-SM76], we develop a new Eulerian Gaussian beam method which uses global Cartesian coordinates, level-set based implicit representation and Liouville equations. The resulting method gives uniformly distributed phases and amplitudes in phase space simultaneously. To obtain semi-classical solutions to the Schroedinger equation with different initial wave functions, we only need to slightly modify the summation formula. This yields a very efficient method for computing semi-classical solutions to the Schroedinger equation. For instance, in the one-dimensional case the proposed algorithm requires only O(sNm{sup 2}) operations to compute s different solutions with s different initial wave functions under the influence of the same potential, where N=O(1/h),h is the Planck constant, and m<<N is the number of computed beams which depends on h weakly. Numerical experiments indicate that this Eulerian Gaussian beam approach yields accurate semi-classical solutions even at caustics.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Towards an understanding of complex chemical systems: A scalable molecular simulation approach

Energy production and security are among the major challenges facing the nation. Technological breakthroughs must occur for production, storage, and use of energy with performance levels far beyond what is now possible. Only with these breakthroughs will we be able to ensure energy independence, environmental sustainability, and continued economic opportunities. To accomplish our goals will require us to have the ability to design and control matter at the molecular level of electrons and nuclei. Through quantum mechanics we can understand the chemical, electrical, and physical properties of materials. Computational chemistry allows us to examine questions that are not possible or are very difficult to examine in the laboratory. Only with the ability to carry out the computations required for the explicit treatment of quantum mechanics can we hope to pave the way for highly efficient energy technologies needed for the future. Increasingly powerful computational capabilities allows for increasing sophisticated analyses. Scientists at the Pacific Northwest National Laboratory and the University of Zurich are conducting research and developing state-of-the-art molecular simulation tools, combined with increasingly powerful supercomputers, to enable a greater understanding and manipulation of complex chemical processes. Researchers are applying efficient algorithms to obtain the dynamics of atoms and nuclei interacting under the laws of quantum mechanics to develop a new understanding of chemical reactions in solutions and at interfaces, especially as they relate to hydrogen storage and catalysis. The insights gained from these calculations will enable technological advances capable of addressing the U.S. Department of Energy’s (DOE) energy mission and keeping the US at the forefront of technology development.

Mundy, Christopher J.↗

Low-overhead transversal fault tolerance for universal quantum computation

Fast, reliable logical operations are essential for realizing useful quantum computers. By redundantly encoding logical qubits into many physical qubits and using syndrome measurements to detect and correct errors, we can achieve low logical error rates. However, for many practical quantum error correction codes such as the surface code, owing to syndrome measurement errors, standard constructions require multiple extraction rounds—of the order of the code distance d—for fault-tolerant computation, particularly considering fault-tolerant state preparation. Here we show that logical operations can be performed fault-tolerantly with only a constant number of extraction rounds for a broad class of quantum error correction codes, including the surface code with magic state inputs and feedforward, to achieve ‘transversal algorithmic fault tolerance’. Through the combination of transversal operations7 and new strategies for correlated decoding, despite only having access to partial syndrome information, we prove that the deviation from the ideal logical measurement distribution can be made exponentially small in the distance, even if the instantaneous quantum state cannot be made close to a logical codeword because of measurement errors. We supplement this proof with circuit-level simulations in a range of relevant settings, demonstrating the fault tolerance and competitive performance of our approach. Furthermore, our work sheds new light on the theory of quantum fault tolerance and has the potential to reduce the space–time cost of practical fault-tolerant quantum computation by over an order of magnitude.

Zhou, Hengyun [QuEra Computing, Boston, MA (United↗

Systematic reduction of sign errors in many-body problems: generalization of self-healing diffusion Monte Carlo to excited states

A recently developed Self-Healing Diffusion Monte Carlo Algorithm [PRB {\bf 79}, 195117 ] is extended to the calculation of excited states. The formalism is based on a excited-state fixed-node approximation and the mixed estimator of the excited-state probability density. The fixed-node ground state wave-functions of inequivalent nodal pockets are found simultaneously using a recursive approach. The decay of the wave-function into lower energy states is prevented using two methods: i) The projection of the improved trial-wave function into previously calculated eigenstates is removed. ii) The reference energy for each nodal pocket is adjusted in order to create a kink in the global fixed-node wave-function which, when locally smoothed out, increases the volume of the higher energy pockets at the expense of the lower energy ones until the energies of every pocket become equal. This reference energy method is designed to find nodal structures that are local minima for arbitrary fluctuations of the nodes within a given nodal topology. We demonstrate in a model system that the algorithm converges to many-body eigenstates in bosonic-like and fermionic cases.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Near-optimal routing of noisy quantum states

Placement, routing, and scheduling are essential tasks for near-optimal performance of programs for noisy quantum processors. Reliable execution of an arbitrary quantum circuit on current devices requires routing methods that overcome connectivity limitations while meeting data locality requirements. However, current devices also express highly variable noise levels in both the quantum gates and quantum registers. This requires any routing algorithm to be adaptive to both the circuit and the operating conditions. We demonstrate near-optimal routing methods of noisy quantum states that minimize the overall error of data movement while also limiting the computational complexity of routing decisions. We evaluate our methods against the noise characteristics of a 20-qubit superconducting quantum processor.

Sadlier III, Ronald↗

Ising-Traffic: Using Ising Machine Learning to Predict Traffic Congestion under Uncertainty

This paper addresses the challenges in accurate and realtime traffic congestion prediction with uncertainty by proposing Ising-Traffic, a novel quantum-inspired dual-model Ising based traffic prediction framework which delivers higher accuracy and lower latency than SOTA solutions. While traditional and deep learning methods face the trade-off between algorithm complexity and computational efficiency, our Ising-based method leverages Ising’s inherent and unique capability of finding the state of a system with the lowest energy and applying it to traffic prediction. In this work, traffic prediction under uncertainty is formulated into two separate Ising models: Reconstruct-Ising and Predict-Ising. Reconstruct-Ising is mapped onto modern Ising machine and handles uncertainty in traffic accurately with negligible latency and energy consumption, while Predict-Ising is mapped onto traditional processors and predicts future congestion precisely with only at most 1.8% computational demands of existing solutions. Our evaluation shows Ising-Traffic delivers on average 98× speedups and 5% accuracy improvement over SOTA.

traffic flow control, Ising↗

Spin-transparent storage rings for quantum computing

Spin-transparent storage rings, where any spin direction repeats after one full turn, can be used in conjunction with ion traps as a new quantum computing platform [1]. Advantages of spin-transparent rings for quantum computing include: large numbers of stored qubits; long quantum coherence times of up to several hours; long storage lifetimes; and room temperature operation. These exceptional qualities mean rings could provide a scalable way to implement algorithms with deep complexity requiring many quantum operations while simultaneously providing a large number of qubits. This new platform where the qubit has long quantum coherence time can also be used as a quantum sensor or a part of a quantum memory.

Accelerator Physics↗

Summary paragraphs for recently-awarded DOE-SC projects at Sandia in Quantum Information Science

Sandia National Laboratories was recently awarded 3 new projects in Quantum Information Science (QIS) by the Department of Energy's Advanced Scientific Computing Research (ASCR) program and 2 new projects in quantum technologies both DOE's Basic Energy Sciences. Two of the ASCR projects are for work in quantum testbeds, while the third is in the area of quantum algorithms. A fourth QIS project was awarded in FY17, also in the area of quantum algorithms.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Computational Modeling of Vertical-Cavity Surface-Emitting Lasers

Vertical-Cavity Surface-Emitting Lasers (VCSELs) have become increasingly important for many applications, such as optical interconnects and optical data storages. In many applications, critical requirements are very often high beam quality and/or high output powers. To help the design and optimization of VCSELs for such applications, it is essential to have a simulation model that includes the time evolution of the transverse space dependence of the hewn. Such models allow arbitrary transverse profiles of laser intensity or carrier density to develop in time without any a priori assumption about the number and types of transverse modes. In addition, extensive research in the past has shown that many-body effects are important in influencing the optical gain and the refractive index of semiconductor quantum wells. It is thus important to include the key many-body effects in simulation models for semiconductor lasers. A computational model, called the Maxwell-Effective Bloch Equations (MEBE) was developed recently that simulates the above features and effects. This model combines the space-time resolution with microscopic many-body effects in a way that is both accurate enough and computationally manageable. This model has been used to simulate edge-emitting high power lasers recently. A new finite-difference algorithm has been developed for solving these equations and will be shown in the presentation. That algorithm will be used to calculate the detailed time evolution of the transverse mode profiles of VCSELs. The VCSELs are based on InGaAs/GaAs quantum well structures. Effects of pumping current and refractive index profiles will be investigated in detail. The simulation results will be compared with other results the use the rate-equation model.

Goorjian, Peter M.↗

Computational Nonlinear of Vertical-Cavity Surface-Emitting Lasers

Vertical-Cavity Surface-Emitting Lasers (VCSELs) have become increasingly important for many applications, such as optical interconnects and optical data storages. In many applications, critical requirements are very often high beam quality and/or high output powers. To help the design and optimization of VCSELs for such applications, it is essential to have a simulation model that includes the time evolution of the transverse space dependence of the beam. Such models allow arbitrary transverse profiles of laser intensity or carrier density to develop in time without any a priori assumption about the number and types of transverse modes. In addition, extensive research in the past has shown that many-body effects are important in influencing the optical gain and the refractive index of semiconductor quantum wells. It is thus important to include the key many-body effects in simulation models for semiconductor lasers. A computational model, called the Maxwell-Effective Bloch Equations (MEBE) was developed recently that simulates the above features and effects. This model combines the space-time resolution with microscopic many-body effects in a way that is both accurate enough and computationally manageable. This model has been used to simulate edge-emitting high power lasers recently. A new finite-difference algorithm has been developed for solving these equations and will be shown in the presentation. That algorithm will be used to calculate the detailed time evolution of the transverse mode profiles of VCSELs. The VCSELs are based on InGaAs/GaAs quantum well structures. Effects of pumping current and refractive index profiles will be investigated in detail. The simulation results will be compared with other results the use the rate-equation model.

Goorjian, Peter M.↗

Well-balanced Component-wise Scheme for Shallow Water System

This paper presents a well-balanced numerical scheme for solving free surface flows involving wetting and drying. The proposed algorithm combines a component-wise approach with hydrostatic reconstruction strategy to compute flows over wet or dry surfaces and to satisfy the steady state condition of still water. The robustness of the proposed scheme is verified under several benchmark hydraulic tests.

42 ENGINEERING↗

Numerical method for computing Maass cusp forms on triply punctured two-sphere

A quantum mechanical system on a punctured surface modeled on hyperbolic space has always been an important subject of research in mathematics and physics. This corresponding quantum system is governed by the Schrödinger equation whose solutions are the Maass waveforms. Spectral studies on these Maass waveforms are known to contain both continuous and discrete eigenvalues. The discrete eigenfunctions are usually called the Maass Cusp Forms (MCF) where their discrete eigenvalues are not known analytically. We introduce a numerical method based on Hejhal and Then algorithm using GridMathematica for computing MCF on a punctured surface with three cusps namely the triply punctured two-sphere. We also report on a pullback algorithm for the punctured surface and a point locater algorithm to facilitate the complete pullback which are essential parts of the main algorithm.

97 MATHEMATICS AND COMPUTING↗

Quantum Accurate Prediction of Plutonium–Plutonium Dihydride Phase Equilibrium Using a Lattice Gas Model

Plutonium-based materials are vital for use as nuclear fuels and as portable power sources for space vehicles. However, elucidating their sensitivity to hydriding corrosion represents an extreme challenge because of the toxicity of Pu as well as their anomalous magnetic properties. In this work, we develop a lattice gas model of plutonium–plutonium dihydride (Pu–PuH 2 ) phase equilibrium that retains the accuracy of density functional theory, while yielding many orders of magnitude improvement in computational efficiency. Using Monte Carlo and free-energy sampling algorithms, we compute a number of Pu–PuH 2 equilibrium properties that are difficult to probe experimentally, including equilibrium pressures and phase compositions and the PuH 2 heat of formation. In conclusion, our method will have particular impact on these types of materials studies, where there is a strong need for computationally efficient approaches to bridge time and length scale gaps between quantum calculations and experiments.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Quantum algorithm for the Laughlin wave function

We construct a quantum algorithm that creates the Laughlin state for an arbitrary number n of particles for a filling fraction of one. This quantum circuit is efficient since it only uses n(n-1)/2 local qudit gates and its depth scales as 2n-3. Furthermore, we prove the optimality of the circuit using permutation theory arguments and we compute exactly how entanglement develops along the action of each gate. Finally, we discuss its experimental feasibility by decomposing the qudits and the gates in terms of qubits and two qubit-gates, as well as its generalization to arbitrary filling fraction.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Structure identification methods for atomistic simulations of crystalline materials

Here, we discuss existing and new computational analysis techniques to classify local atomic arrangements in large-scale atomistic computer simulations of crystalline solids. This article includes a performance comparison of typical analysis algorithms such as common neighbor analysis (CNA), centrosymmetry analysis, bond angle analysis, bond order analysis and Voronoi analysis. In addition we propose a simple extension to the CNA method that makes it suitable for multi-phase systems. Finally, we introduce a new structure identification algorithm, the neighbor distance analysis, which is designed to identify atomic structure units in grain boundaries.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗