Search NASA⌕ Search

SEARCH · Search NASA

Results for “Quantum, Quantum Algorithms”

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,459 records · Page 81

Qubit Lattice Algorithms Based on the Schrödinger-Dirac Representation of Maxwell Equations and Their Extensions

It is well known that Maxwell equations can be expressed in a unitary Schrodinger-Dirac representation for homogeneous media. However, difficulties arise when considering inhomogeneous media. A Dyson map points to a unitary field qubit basis, but the standard qubit lattice algorithm of interleaved unitary collision-stream operators must be augmented by some sparse non-unitary potential operators that recover the derivatives on the refractive indices. Here, the effect of the steepness of these derivatives on two-dimensional scattering is examined with simulations showing quite complex wavefronts emitted due to transmissions/reflections within the dielectric objects. Maxwell equations are extended to handle dissipation using Kraus operators. Then, our theoretical algorithms are extended to these open quantum systems. A quantum circuit diagram is presented as well as estimates on the required number of quantum gates for implementation on a quantum computer.

2D electromagnetic scattering↗

Hybrid algorithm for the time-dependent Hartree–Fock method using the Yang–Baxter equation on quantum computers *

Abstract The time-dependent Hartree–Fock (TDHF) method is an approach to simulate the mean field dynamics of electrons within the assumption that the electrons move independently in their self-consistent average field and within the space of single Slater determinants. One of the major advantages of performing time dynamics within Hartree–Fock theory is the free fermionic nature of the problem, which makes TDHF classically simulatable in polynomial time. Here, we present a hybrid TDHF implementation for quantum computers. This quantum circuit grows with time; but with our recent work on circuit compression via the Yang–Baxter equation (YBE), the resulting circuit is constant depth. This study provides a new way to simulate TDHF with the aid of a quantum device as well as provides a new direction for the application of YBE symmetry in quantum chemistry simulations.

97 MATHEMATICS AND COMPUTING↗

Measurement of the Three-jet Mass Cross Section in $p\bar{p}$ Collisions at $\sqrt{s}=1.96$ TeV

This thesis describes the measurement of the inclusive three-jet cross section in proton-antiproton collisions at √s = 1.96 TeV measured at the D0 experiment at the Fermilab Tevatron Collider in the Fermi National Accelerator Laboratory, Batavia, Illinois, USA. The cross section as a function of three-jet invariant mass is provided in three regions of the third jet transverse momentum and three regions of jet rapidities. It utilizes a data sample collected in the so called Run IIa data taking period (2002-2006) corresponding to the integrated luminosity of about 0.7 fb -1 . The results are used to test the next-to-leading order predictions of Quantum chromodynamics computed using the latest parton distribution functions.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Time- and frequency-resolved detection of atomic coherence in the regime of strong-field interaction with intense femtosecond laser pulses

Understanding the effect of strong laser pulses on the evolution of an atomic or molecular wave function is important in the context of coherent control in the strong-field regime, when power broadening and dynamic Stark shifts become comparable with or bigger than the bandwidth of the control field. We experimentally demonstrate the method of complete characterization of a complex-valued amplitude of a quantum state driven by a strong two-photon field. The method is based on coherent scattering of a weak probe pulse from the strong-field-induced atomic coherence, followed by the detection of the time- and frequency-resolved parametric four-wave-mixing signal. We show that the proposed technique corresponds to a cross-correlation frequency-resolved optical gating (XFROG) of the highly perturbed evolution of an atomic quantum state. Utilizing the XFROG retrieval algorithm, we determine both the amplitude and phase of an atomic wave function at any time moment throughout the interaction with the driving field. The direct retrieval of the time-dependent phase of the wave function, rather than the population dynamics only, enables us to observe the strong-field effects with arbitrary time and frequency resolution.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

QUCODE: End-to-End Qubit Co-Design

The design of a quantum computer can be broken down into different steps, e.g., the material science aspect of designing qubits and devices, considerations of controlling the state of the qubits and their environment, the computer science aspects of mapping algorithms to the available primitives of the quantum computer, and the programming of an application in terms of the available algorithms. Research in these areas is currently fairly isolated, and there is framework for an end-to-end design approach where a desired application informs the choice of materials for the qubits and their environment, and vice versa.We identify knowledge gaps and opportunities for research that builds on existing PNNL capabilities.

36 MATERIALS SCIENCE↗

Neural network accelerator for quantum control

Efficient quantum control is necessary for practical quantum computing implementations with current technologies. Conventional algorithms for determining optimal control parameters are computationally expensive, largely excluding them from use outside of the simulation. Existing hardware solutions structured as lookup tables are imprecise and costly. By designing a machine learning model to approximate the results of traditional tools, a more efficient method can be produced. Such a model can then be synthesized into a hardware accelerator for use in quantum systems. In this study, we demonstrate a machine learning algorithm for predicting optimal pulse parameters. This algorithm is lightweight enough to fit on a low-resource FPGA and perform inference with a latency of 175 ns and pipeline interval of 5 ns with > 0.99 gate fidelity. In the long term, such an accelerator could be used near quantum computing hardware where traditional computers cannot operate, enabling quantum control at a reasonable cost at low latencies without incurring large data bandwidths outside of the cryogenic environment.

43 PARTICLE ACCELERATORS↗

Exact-Factorization-Based Surface Hopping without Velocity Adjustment

While surface hopping has emerged as a powerful method for simulating non-adiabatic dynamics in large molecules, the ad hoc nature of the necessary velocity adjustments and decoherence corrections in the algorithm somewhat reduces its reliability. Here we propose a new scheme that eliminates these aspects by combining the nuclear equation from the quantum-trajectory surface-hopping approach with the electronic equation derived from the exact-factorization approach. Furthermore, the resulting method, denoted QTSH-XF, yields a surface-hopping method on firmer ground than previous and is shown to successfully capture dynamics in Tully models and in a linear vibronic coupling model of the photoexcited uracil cation.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Symmetry-conserving purification of quantum states within the density matrix renormalization group

The density matrix renormalization group (DMRG) algorithm was originally designed to efficiently compute the zero-temperature or ground-state properties of one-dimensional strongly correlated quantum systems. The development of the algorithm at finite temperature has been a topic of much interest, because of the usefulness of thermodynamics quantities in understanding the physics of condensed matter systems, and because of the increased complexity associated with efficiently computing temperature-dependent properties. The ancilla method is a DMRG technique that enables the computation of these thermodynamic quantities. In this paper, we review the ancilla method, and improve its performance by working on reduced Hilbert spaces and using canonical approaches. Furthermore we explore its applicability beyond spins systems to t-J and Hubbard models.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Near-optimal ground state preparation

Preparing the ground state of a given Hamiltonian and estimating its ground energy are important but computationally hard tasks. However, given some additional information, these problems can be solved efficiently on a quantum computer. We assume that an initial state with non-trivial overlap with the ground state can be efficiently prepared, and the spectral gap between the ground energy and the first excited energy is bounded from below. With these assumptions we design an algorithm that prepares the ground state when an upper bound of the ground energy is known, whose runtime has a logarithmic dependence on the inverse error. When such an upper bound is not known, we propose a hybrid quantum-classical algorithm to estimate the ground energy, where the dependence of the number of queries to the initial state on the desired precision is exponentially improved compared to the current state-of-the-art algorithm proposed in [Ge et al. 2019]. These two algorithms can then be combined to prepare a ground state without knowing an upper bound of the ground energy. We also prove that our algorithms reach the complexity lower bounds by applying it to the unstructured search problem and the quantum approximate counting problem.

97 MATHEMATICS AND COMPUTING↗

Optimizing temperature distributions for training neural quantum states using parallel tempering

Parametrized artificial neural networks (ANNs) can be very expressive ansatzes for variational algorithms, reaching state-of-the-art energies on many quantum many-body Hamiltonians. Nevertheless, the training of the ANN can be slow and stymied by the presence of local minima in the parameter landscape. One approach to mitigate this issue is to use parallel tempering methods, and in this work, we focus on the role played by the temperature distribution of the parallel tempering replicas. Using an adaptive method that adjusts the temperatures in order to equate the exchange probability between neighboring replicas, we show that this temperature optimization can significantly increase the success rate of the variational algorithm with negligible computational cost by eliminating bottlenecks in the replicas' random walk. Furthermore, we demonstrate this using two different neural networks, a restricted Boltzmann machine and a feedforward network, which we use to study a toy problem based on a permutation invariant Hamiltonian with a pernicious local minimum and the 𝐽 1 −𝐽 2 model on a rectangular lattice.

Neural network simulations↗

Lattice QCD with Domain Decomposition on Intel Xeon Phi Co-Processors

The gap between the cost of moving data and the cost of computing continues to grow, making it ever harder to design iterative solvers on extreme-scale architectures. This problem can be alleviated by alternative algorithms that reduce the amount of data movement. We investigate this in the context of Lattice Quantum Chromodynamics and implement such an alternative solver algorithm, based on domain decomposition, on Intel Xeon Phi co-processor (KNC) clusters. We demonstrate close-to-linear on-chip scaling to all 60 cores of the KNC. With a mix of single- and half-precision the domain-decomposition method sustains 400-500 Gflop/s per chip. Compared to an optimized KNC implementation of a standard solver [1], our full multi-node domain-decomposition solver strong-scales to more nodes and reduces the time-to-solution by a factor of 5.

Heybrock, Simon↗

Quantum-Inspired Bayesian Sampling for Uncertainty Quantification and Machine Learning (Final Technical Report)

With increasing simulation and measurement data, machine learning and artificial intelligence have been widely used in computational decision-making of complex engineering systems. The resulting tools, such as uncertainty quantification solvers, reinforcement learning, and physics-informed machine learning, have achieved great success in critical DOE tasks such as material discovery and design, energy system modeling and control, and numerical weather and climate prediction. A core topic in scientific machine learning and artificial intelligence is Bayesian inference: given an observed data set, people want to estimate the posterior distribution of a (possibly large) number of hidden parameters. Due to the flexibility and weak assumptions, Bayesian sampling has been the mainstream Bayesian inference solvers despite the rapid progress of approximate Bayesian inference. Classical Bayesian sampling methods such as Markov-chain Monte Carlo suffer from a low-acceptance rate due to the random walk nature, therefore state-of-the-art techniques use Hamiltonian Monte Carlo and its variants to efficiently draw posterior samples in a high dimension. The key idea of Hamiltonian Monte Carlo and its variants is to simulate the Hamiltonian dynamics of a classical particle with a fixed mass, and their performance significantly degrades when the posterior distribution is highly spiky or has multiple modes. Leveraging the idea of quantum physics, this project has investigated new theory, algorithms and applications of Bayesian inference (especially Bayesian sampling). The main results include: (1) novel quantum-inspired Bayesian sampling methods that can lead to better accuracy for challenging multi-modal or spiky distributions, (2) more scalable machine learning framework leveraging tensor-compressed Bayesian inference, and (3) Bayesian and sampling approaches for verifying the robustness of continuous and binary neural networks.

97 MATHEMATICS AND COMPUTING↗

The computer-based model of quantum measurements

Quantum theory of measurements is an extremely important part of quantum mechanics. Currently perturbations by quantum measurements of observable quantities of atomic systems are rarely taken into account in computing algorithms and calculations. In the previous studies of the authors, constructive model of quantum measurements has been developed and implemented in the form of symbolic and numerical calculations for the hydrogen-like atoms. This work describes a generalization of these results to the alkali metal atoms.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Experimental detection of nonclassical correlations in mixed-state quantum computation

We report on an experiment to detect nonclassical correlations in a highly mixed state. The correlations are characterized by the quantum discord and are observed using four qubits in a liquid-state nuclear magnetic resonance quantum information processor. The state analyzed is the output of a DQC1 computation, whose input is a single quantum bit accompanied by n maximally mixed qubits. This model of computation outperforms the best known classical algorithms and, although it contains vanishing entanglement, it is known to have quantum correlations characterized by the quantum discord. This experiment detects nonvanishing quantum discord, ensuring the existence of nonclassical correlations as measured by the quantum discord.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Geometric descriptions of entangled states by auxiliary varieties

The aim of the paper is to propose geometric descriptions of multipartite entangled states using algebraic geometry. In the context of this paper, geometric means each stratum of the Hilbert space, corresponding to an entangled state, is an open subset of an algebraic variety built by classical geometric constructions (tangent lines, secant lines) from the set of separable states. In this setting, we describe well-known classifications of multipartite entanglement such as 2 Multiplication-Sign 2 Multiplication-Sign (n+ 1), for n Greater-Than-Or-Slanted-Equal-To 1, quantum systems and a new description with the 2 Multiplication-Sign 3 Multiplication-Sign 3 quantum system. Our results complete the approach of Miyake and make stronger connections with recent work of algebraic geometers. Moreover, for the quantum systems detailed in this paper, we propose an algorithm, based on the classical theory of invariants, to decide to which subvariety of the Hilbert space a given state belongs.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Parameter estimation for chaotic systems using a hybrid adaptive cuckoo search with simulated annealing algorithm

This paper introduces a novel hybrid optimization algorithm to establish the parameters of chaotic systems. In order to deal with the weaknesses of the traditional cuckoo search algorithm, the proposed adaptive cuckoo search with simulated annealing algorithm is presented, which incorporates the adaptive parameters adjusting operation and the simulated annealing operation in the cuckoo search algorithm. Normally, the parameters of the cuckoo search algorithm are kept constant that may result in decreasing the efficiency of the algorithm. For the purpose of balancing and enhancing the accuracy and convergence rate of the cuckoo search algorithm, the adaptive operation is presented to tune the parameters properly. Besides, the local search capability of cuckoo search algorithm is relatively weak that may decrease the quality of optimization. So the simulated annealing operation is merged into the cuckoo search algorithm to enhance the local search ability and improve the accuracy and reliability of the results. The functionality of the proposed hybrid algorithm is investigated through the Lorenz chaotic system under the noiseless and noise condition, respectively. The numerical results demonstrate that the method can estimate parameters efficiently and accurately in the noiseless and noise condition. Finally, the results are compared with the traditional cuckoo search algorithm, genetic algorithm, and particle swarm optimization algorithm. Simulation results demonstrate the effectiveness and superior performance of the proposed algorithm.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Metals and Quantum Materials with Spin-orbit Interactions by Quantum Monte Carlo methods

The key goals of this project were as follows: 1) Analysis and benchmarks of electron correlation effects recovered in the fixed-node approximation that is inherent to quantum Monte Carlo (QMC) method as applied to metallic states; 2) development of new algorithms for electron spin-degrees of freedom to be treated as explicit quantum variables; 3) designing electronic structure QMC algorithm for efficient evaluation of spin-orbit effects in systems with heavy atoms; 4) adapting the algorithm to complex wave functions and developing corresponding fixed-phase approximation; 5) design and testing of algorithm for valence-only non-local spin-orbit operators; 6) analysis of fixed-node vs fixed-phase errors and their comparisons. The key accomplishments: i) We carried out a systematic study of Li systems by the fixed-node diffusion Monte Carlo method. This involved Li atom, molecule, cluster and solid calculated by the full range of QMC methods including fixed-node QMC.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Quantum phase diagram of fermion mixtures with population imbalance in one-dimensional optical lattices

With a recently developed time-evolving block decimation algorithm, we numerically study the ground-state quantum phase diagram of Fermi mixtures with attractive interspecies interactions loaded in one-dimensional optical lattices. For our study, we adopt a general asymmetric Hubbard model with species-dependent tunneling rates to incorporate the possibility of mass imbalance in the mixtures. We find clear signatures for the existence of a Fulde-Ferrell-Larkin-Ovchinnikov (FFLO) phase in this model in the presence of population imbalance. Our simulation also reveals that in the presence of mass imbalance, the parameter space for FFLO states shrinks or even completely vanishes depending on the strength of the attractive interaction and the degree of mass imbalance.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗