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,585 records · Page 88

Cautionary remarks on the moduli space metric for multidyon simulations

We perform a detailed numerical investigation of the approximate moduli space metric proposed by Diakonov and Petrov [Phys. Rev. D 76, 056001 (2007)] for a confining model of dyons. Our findings strongly indicate that this metric is positive definite (and, therefore, a valid moduli space metric) throughout a considerable part of configuration space only for a small number of dyons at sufficiently low density. This poses strong limitations on results obtained by an unrestricted integration over collective coordinates in this model. It also indicates that strong correlations between collective coordinates will be essential for the physical content of a dyon model, which could be exhibited by a suitable simulation algorithm.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Quantum many-body effects in x-ray spectra efficiently computed using a basic graph algorithm

The mounting interest in using x-ray spectroscopy for refined materials characterization calls for an accurate electronic-structure theory to interpret the x-ray near-edge fine structure. Here, we propose an efficient and unified framework to describe all the many-electron processes in a Fermi liquid after a sudden perturbation (such as a core hole). This problem has been visited by the Mahan-Noziéres-De Dominicis (MND) theory, but it is intractable to implement various Feynman diagrams within first-principles calculations. In our report, we adopt a nondiagrammatic approach and treat all the many-electron processes in the MND theory on an equal footing. Starting from a recently introduced determinant formalism [Phys. Rev. Lett. 118, 096402 (2017)], we exploit the linear dependence of determinants describing different final states involved in the spectral calculations. An elementary graph algorithm, breadth-first search, can be used to quickly identify the important determinants for shaping the spectrum, which avoids the need to evaluate a great number of vanishingly small terms. This search algorithm is performed over the tree-structure of the many-body expansion, which mimics a path-finding process. We demonstrate that the determinantal approach is computationally inexpensive even for obtaining x-ray spectra of extended systems. Using Kohn-Sham orbitals from two self-consistent fields (ground and core-excited state) as input for constructing the determinants, the calculated x-ray spectra for a number of transition metal oxides are in good agreement with experiments. Many-electron aspects beyond the Bethe-Salpeter equation, as captured by this approach, are also discussed, such as shakeup excitations and many-body wave function overlap considered in Anderson's orthogonality catastrophe.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Application of Quantum Machine Learning to High Energy Physics Analysis at LHC using IBM Quantum Computer Simulators and IBM Quantum Computer Hardware

One of the major objectives of the experimental programs at the LHC is the discovery of new physics. This requires the identification of rare signals in immense backgrounds. Using machine learning algorithms greatly enhances our ability to achieve this objective. With the progress of quantum technologies, quantum machine learning could become a powerful tool for data analysis in high energy physics. In this study, using IBM gate-model quantum computing systems, we employ the quantum variational classifier method and the quantum kernel estimator method in two recent LHC flagship physics analyses: $t\bar{t}H$ (Higgs boson production in association with a top quark pair) and $H\rightarrow\mu\mu$ (Higgs boson decays to two muons). We have obtained early results with 10 qubits on the IBM quantum simulator and the IBM quantum hardware. On the quantum simulator, the quantum machine learning methods perform similarly to classical algorithms such as SVM (support vector machine) and BDT (boosted decision tree), which are often employed in LHC physics analyses. On the quantum hardware, the quantum machine learning methods have shown promising discrimination power, comparable to that on the quantum simulator. This study demonstrates that quantum machine learning has the ability to differentiate between signal and background in realistic physics datasets.

Chan, Jay↗

One-loop diagrams in lattice QCD with Wilson fermions

A large number of one-loop integrals emerging in a gauge perturbation theory on a lattice with Wilson fermions at r = 1 are evaluated with the use of the Burgio-Caracciolo-Pelissetto algorithm and the FORMpackage. In the bosonic case, an explicit analytical form of the recursion relations is presented.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Scalable Methods for Electronic Excitations and Optical Responses in Nanostructures: Mathematics to Algorithms to Observables

The work reported here took place at the University of Minnesota from September 15, 2003 to November 14, 2005. This funding resulted in 10 invited articles or book chapters, 37 articles in refereed journals and 13 invited talks. The funding helped train 5 PhD students. The research supported by this grant focused on developing theoretical methods for predicting and understanding the properties of matter at the nanoscale. Within this regime, new phenomena occur that are characteristic of neither the atomic limit, nor the crystalline limit. Moreover, this regime is crucial for understanding the emergence of macroscopic properties such as ferromagnetism. For example, elemental Fe clusters possess magnetic moments that reside between the atomic and crystalline limits, but the transition from the atomic to the crystalline limit is not a simple interpolation between the two size regimes. To capitalize properly on predicting such phenomena in this transition regime, a deeper understanding of the electronic, magnetic and structural properties of matter is required, e.g., electron correlation effects are enhanced within this size regime and the surface of a confined system must be explicitly included. A key element of our research involved the construction of new algorithms to address problems peculiar to the nanoscale. Typically, one would like to consider systems with thousands of atoms or more, e.g., a silicon nanocrystal that is 7 nm in diameter would contain over 10,000 atoms. Previous ab initio methods could address systems with hundreds of atoms whereas empirical methods can routinely handle hundreds of thousands of atoms (or more). However, these empirical methods often rely on ad hoc assumptions and lack incorporation of structural and electronic degrees of freedom. The key theoretical ingredients in our work involved the use of ab initio pseudopotentials and density functional approaches. The key numerical ingredients involved the implementation of algorithms for solving the Kohn-Sham equation without the use of an explicit basis, i.e., a real space grid. We invented algorithms for a solution of the Kohn-Sham equation based on Chebyshev 'subspace filtering'. Our filtering algorithms dramatically enhanced our ability to explore systems with thousands of atoms, i.e., we examined silicon quantum dots with approximately 11,000 atoms (or 40,000 electrons). We applied this algorithm to a number of nanoscale systems to examine the role of quantum confinement on electronic and magnetic properties: (1) Doping of nanocrystals and nanowires, including both magnetic and non-magnetic dopants and the role of self-purification; (2) Optical excitations and electronic properties of nanocrystals; (3) Intrinsic defects in nanostructures; and (4) The emergence of ferromagnetism from atoms to crystals.

36 MATERIALS SCIENCE↗

The Chern–Simons current in time series of knots and links in proteins

A superspace model of knots and links for DNA time series data is proposed to take into account the feedback loop from docking to undocking state of protein–protein interactions. In particular, the direction of interactions between the 8 hidden states of DNA is considered. It is a E{sub 8}×E{sub 8} unified spin model where the genotype, from active and inactive side of DNA time data series, can be considered for any living organism. The mathematical model is borrowed from loop-quantum gravity and adapted to biology. It is used to derive equations for gene expression describing transitions from ground to excited states, and for the 8 coupling states between geneon and anti-geneon transposon and retrotransposon in trash DNA. Specifically, we adopt a modified Grothendieck cohomology and a modified Khovanov cohomology for biology. The result is a Chern–Simons current in (8+3) extradimensions of a given unoriented supermanifold with ghost fields of protein structures. The 8 dimensions come from the 8 hidden states of spinor field of genetic code. The extradimensions come from the 3 types of principle fiber bundle in the secondary protein.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Molecular dynamics on quantum annealers

Abstract In this work we demonstrate a practical prospect of using quantum annealers for simulation of molecular dynamics. A methodology developed for this goal, dubbed Quantum Differential Equations (QDE), is applied to propagate classical trajectories for the vibration of the hydrogen molecule in several regimes: nearly harmonic, highly anharmonic, and dissociative motion. The results obtained using the D-Wave 2000Q quantum annealer are all consistent and quickly converge to the analytical reference solution. Several alternative strategies for such calculations are explored and it was found that the most accurate results and the best efficiency are obtained by combining the quantum annealer with classical post-processing (greedy algorithm). Importantly, the QDE framework developed here is entirely general and can be applied to solve any system of first-order ordinary nonlinear differential equations using a quantum annealer.

74 ATOMIC AND MOLECULAR PHYSICS↗

Sampling on NISQ Devices: "Who’s the Fairest One of All?"

Modern NISQ devices are subject to a variety of biases and sources of noise that degrade the solution quality of computations carried out on these devices. A natural question that arises in the NISQ era, is how fairly do these devices sample ground state solutions. To this end, we run five fair sampling problems (each with at least three ground state solutions) that are based both on quantum annealing and, on the Grover Mixer, -QAOA algorithm for gate-based NISQ hardware. In particular, we use seven IBM Q devices, the Aspen-9 Rigetti device, the IonQ device, and three D-Wave quantum annealers. For each of the fair sampling problems, we measure the ground state probability, the relative fairness of the frequency of each ground state solution with respect to the other ground state solutions, and the aggregate error as given by each hardware provider. Overall, our results show that NISQ devices do not achieve fair sampling yet. Furthermore, we also observe differences in the software stack with a particular focus on compilation techniques that illustrate what work will still need to be done to achieve a seamless integration of frontend (i.e., quantum circuit description) and backend compilation.

Computer Science↗

On the construction of coherent states of position dependent mass Schroedinger equation endowed with effective potential

In this paper, we propose an algorithm to construct coherent states for an exactly solvable position dependent mass Schroedinger equation. We use point canonical transformation method and obtain ground state eigenfunction of the position dependent mass Schroedinger equation. We fix the ladder operators in the deformed form and obtain explicit expression of the deformed superpotential in terms of mass distribution and its derivative. We also prove that these deformed operators lead to minimum uncertainty relations. Further, we illustrate our algorithm with two examples, in which the coherent states given for the second example are new.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Quantum Key Distribution with Temporal Coding of Time-Bin Qubits

In this study, we demonstrate the possibility of realizing the quantum key distribution system by temporal coding of time-bin qubits that are prepared and measured using unbalanced Mach-Zehnder interferometers. We also show that, to exclude a clear a priori identification of time-bin qubits with equal bases, their encoding with the symbols 0 and 1 can be accomplished by delaying one of them by half the clock interval. The uniqueness of measurements of qutrits in this algorithm is shown to be based on the ability of quantum particles in β-states to interfere with the probability amplitudes at the ports of the system interferometers, as well as the absence of collisions of signaling states of the qutrits in adjacent clock intervals. We describe a method for controlling such collisions, including those that are based on qubits prepared from quasi-one-photon coherent laser states.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Composite-dimensional topological codes with boundaries and defects

We introduce new algorithms and provide example constructions of stabilizer models for the gapped boundaries, domain walls, and 0D defects of Abelian composite-dimensional twisted quantum doubles. Using the physically intuitive concept of condensation, our algorithm explicitly describes how to construct the boundary and domain-wall stabilizers starting from the bulk model. This extends the utility of Pauli stabilizer models in describing nontranslationally invariant topological orders with gapped boundaries. To highlight this utility, we provide a series of examples, including a new family of quantum error-correcting codes where the double of ℤ4 is coupled to instances of the double semion (DS) phase. We discuss the codes' utility in the burgeoning area of quantum error correction with an emphasis on the interplay between deconfined anyons, logical operators, error rates, and decoding. We also augment our construction, built using algorithmic tools to describe the properties of explicit stabilizer layouts at the microscopic lattice level, with dimensional counting arguments and macroscopic-level constructions building on pants decompositions. The latter outlines how such codes' representation and design can be automated. Our results are validated by a series of error-correcting threshold calculations comparing our codes' performance with that of standard surface codes. To do so, we introduce a composite-dimensional belief-propagation decoder with ordered statistics that utilizes combination sweeps. Going beyond our worked-out examples, we expect our explicit step-by-step algorithms to pave the path for higher-dimensional codes to be discovered and implemented in near-future architectures that take advantage of various hardware platforms.

Mousa, Mohamad [Purdue University]↗

Phase Transitions in Planning Problems: Design and Analysis of Parameterized Families of Hard Planning Problems

There are two common ways to evaluate algorithms: performance on benchmark problems derived from real applications and analysis of performance on parametrized families of problems. The two approaches complement each other, each having its advantages and disadvantages. The planning community has concentrated on the first approach, with few ways of generating parametrized families of hard problems known prior to this work. Our group's main interest is in comparing approaches to solving planning problems using a novel type of computational device - a quantum annealer - to existing state-of-the-art planning algorithms. Because only small-scale quantum annealers are available, we must compare on small problem sizes. Small problems are primarily useful for comparison only if they are instances of parametrized families of problems for which scaling analysis can be done. In this technical report, we discuss our approach to the generation of hard planning problems from classes of well-studied NP-complete problems that map naturally to planning problems or to aspects of planning problems that many practical planning problems share. These problem classes exhibit a phase transition between easy-to-solve and easy-to-show-unsolvable planning problems. The parametrized families of hard planning problems lie at the phase transition. The exponential scaling of hardness with problem size is apparent in these families even at very small problem sizes, thus enabling us to characterize even very small problems as hard. The families we developed will prove generally useful to the planning community in analyzing the performance of planning algorithms, providing a complementary approach to existing evaluation methods. We illustrate the hardness of these problems and their scaling with results on four state-of-the-art planners, observing significant differences between these planners on these problem families. Finally, we describe two general, and quite different, mappings of planning problems to QUBOs, the form of input required for a quantum annealing machine such as the D-Wave II.

Problems↗

Analysis of Properties of Quantum Hashing

We analyze a method of binary quantum hashing that allows one to represent binary sets as quantum states. We show that this method is very stable with respect to the recovery of preimages. Moreover, we propose heuristic approaches to small-bias sets on which the construction of quantum hash-functions is based and show that they are stable with respect to collisions.

97 MATHEMATICS AND COMPUTING↗

Temporal coarse-graining method to simulate the movement of atoms

We propose a novel method to simulate the movement of atoms at finite temperature. The main idea of our method is to derive “renormalized,” or coarse-grained in time, dynamics from the Euler–Maruyama scheme, which is the standard method for solving the stochastic differential equations numerically. Based on this renormalization, we propose a new algorithm for solving overdamped Langevin equations. We test our renormalization scheme on two models and demonstrate that the results obtained by this method are consistent with those obtained by the standard method. Our algorithm performs better than the standard scheme, especially at low temperatures and with multiple processors.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Least Squares Shadowing sensitivity analysis of chaotic limit cycle oscillations

The adjoint method, among other sensitivity analysis methods, can fail in chaotic dynamical systems. The result from these methods can be too large, often by orders of magnitude, when the result is the derivative of a long time averaged quantity. This failure is known to be caused by ill-conditioned initial value problems. This paper overcomes this failure by replacing the initial value problem with the well-conditioned “least squares shadowing (LSS) problem”. The LSS problem is then linearized in our sensitivity analysis algorithm, which computes a derivative that converges to the derivative of the infinitely long time average. We demonstrate our algorithm in several dynamical systems exhibiting both periodic and chaotic oscillations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A high-order relativistic two-fluid electrodynamic scheme with consistent reconstruction of electromagnetic fields and a multidimensional Riemann solver for electromagnetism

In various astrophysics settings it is common to have a two-fluid relativistic plasma that interacts with the electromagnetic field. While it is common to ignore the displacement current in the ideal, classical magnetohydrodynamic limit, when the flows become relativistic this approximation is less than absolutely well-justified. In such a situation, it is more natural to consider a positively charged fluid made up of positrons or protons interacting with a negatively charged fluid made up of electrons. The two fluids interact collectively with the full set of Maxwell's equations. As a result, a solution strategy for that coupled system of equations is sought and found here. Our strategy extends to higher orders, providing increasing accuracy. The primary variables in the Maxwell solver are taken to be the facially-collocated components of the electric and magnetic fields. Consistent with such a collocation, three important innovations are reported here. The first two pertain to the Maxwell solver. In our first innovation, the magnetic field within each zone is reconstructed in a divergence-free fashion while the electric field within each zone is reconstructed in a form that is consistent with Gauss' law. In our second innovation, a multidimensionally upwinded strategy is presented which ensures that the magnetic field can be updated via a discrete interpretation of Faraday's law and the electric field can be updated via a discrete interpretation of the generalized Ampere's law. This multidimensional upwinding is achieved via a multidimensional Riemann solver. The multidimensional Riemann solver automatically provides edge-centered electric field components for the Stokes law-based update of the magnetic field. It also provides edge-centered magnetic field components for the Stokes law-based update of the electric field. The update strategy ensures that the electric field is always consistent with Gauss' law and the magnetic field is always divergence-free. This collocation also ensures that electromagnetic radiation that is propagating in a vacuum has both electric and magnetic fields that are exactly divergence-free. Coupled relativistic fluid dynamic equations are solved for the positively and negatively charged fluids. The fluids' numerical fluxes also provide a self-consistent current density for the update of the electric field. Our reconstruction strategy ensures that fluid velocities always remain sub-luminal. Our third innovation consists of an efficient design for several popular IMEX schemes so that they provide strong coupling between the finite-volume-based fluid solver and the electromagnetic fields at high order. This innovation makes it possible to efficiently utilize high order IMEX time update methods for stiff source terms in the update of high order finite-volume methods for hyperbolic conservation laws. We also show that this very general innovation should extend seamlessly to Runge–Kutta discontinuous Galerkin methods. The IMEX schemes enable us to use large CFL numbers even in the presence of stiff source terms. Several accuracy analyses are presented showing that our method meets its design accuracy in the MHD limit as well as in the limit of electromagnetic wave propagation. Several stringent test problems are also presented. We also present a relativistic version of the GEM problem, which shows that our algorithm can successfully adapt to challenging problems in high energy astrophysics.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

An automated miniature robotic vehicle inspection system

A novel, autonomous reconfigurable robotic inspection system for quantitative NDE mapping is presented. The system consists of a fleet of wireless (802.11g) miniature robotic vehicles, each approximately 175 × 125 × 85 mm with magnetic wheels that enable them to inspect industrial structures such as storage tanks, chimneys and large diameter pipe work. The robots carry one of a number of payloads including a two channel MFL sensor, a 5 MHz dry coupled UT thickness wheel probe and a machine vision camera that images the surface. The system creates an NDE map of the structure overlaying results onto a 3D model in real time. The authors provide an overview of the robot design, data fusion algorithms (positioning and NDE) and visualization software.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗