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,513 records · Page 84

Trivializing Flow in 2D-O(3) model

The two dimensional O(3) sigma model, just as quantum chromodynamics, is an asymptotically free theory with a mass gap. Therefore, it is an interesting and simple toy model to investigate algorithms for Markov Chain Monte Carlo simulations of quantum chromodynamics. In this talk, we discuss the construction of a trivializing map, a field transformation from a given theory to a trivial one, through a suitably chosen gradient flow. An analytic solution for the generating functional of this trivializing flow has been obtained by a perturbative expansion in the flow time. Utilizing this solution allows for new approaches to be considered when proposing updates for a Markov Chain Monte Carlo algorithm.

Chamness, Christopher↗

Contraction Options and Optimal Multiple-Stopping in Spectrally Negative Lévy Models

This paper studies the optimal multiple-stopping problem arising in the context of the timing option to withdraw from a project in stages. The profits are driven by a general spectrally negative Lévy process. This allows the model to incorporate sudden declines of the project values, generalizing greatly the classical geometric Brownian motion model. We solve the one-stage case as well as the extension to the multiple-stage case. The optimal stopping times are of threshold-type and the value function admits an expression in terms of the scale function. A series of numerical experiments are conducted to verify the optimality and to evaluate the efficiency of the algorithm.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Quantum computing for a profusion of postman problem variants

In this paper we study the viability of solving the Chinese Postman Problem, a graph routing optimization problem, and many of its variants on a quantum annealing device. Routing problem variants considered include graph type, directionally varying weights, number of parties involved in routing, among others. We put emphasis on the explanation of how to convert such problems into quadratic unconstrained binary optimization (QUBO) problems. QUBO is one of two equivalent natural paradigms for quantum annealing devices, the other being the Ising Model. We also expand upon a previously discovered algorithm for solving the Chinese Postman Problem on a closed undirected graph to decrease the number of constraints and variables used in the problem. Optimal annealing parameter settings and constraint weight values are discussed based on results from implementation on the D-Wave 2000Q and Advantage. Results from classical, purely quantum, and hybrid algorithms are compared.

97 MATHEMATICS AND COMPUTING↗

Squeezed coherent states of motion for ions confined in quadrupole and octupole ion traps

Quasiclassical dynamics of trapped ions is characterized by applying the time dependent variational principle (TDVP) on coherent state orbits, in case of quadrupole and octupole combined (Paul and Penning) or radiofrequency (RF) traps. A dequantization algorithm is proposed, by which the classical Hamilton (energy) function associated to the system results as the expectation value of the quantum Hamiltonian on squeezed coherent states. We develop such method and particularize the quantum Hamiltonian for both combined and RF nonlinear traps, that exhibit axial symmetry. We also build the classical Hamiltonian functions for the particular traps we considered, and find the classical equations of motion.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Quantum logic gate synthesis as a Markov decision process

Reinforcement learning has witnessed recent applications to a variety of tasks in quantum programming. The underlying assumption is that those tasks could be modeled as Markov decision processes (MDPs). Here, we investigate the feasibility of this assumption by exploring its consequences for single-qubit quantum state preparation and gate compilation. By forming discrete MDPs, we solve for the optimal policy exactly through policy iteration. We find optimal paths that correspond to the shortest possible sequence of gates to prepare a state or compile a gate, up to some target accuracy. Our method works in both the absence and presence of noise and compares favorably to other quantum compilation methods, such as the Ross–Selinger algorithm. This work provides theoretical insight into why reinforcement learning may be successfully used to find optimally short gate sequences in quantum programming.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Central Difference Interval Method for Solving the Wave Equation

This paper presents path of construction the interval method of second order for solving the wave equation. Taken into consideration is the central difference interval method for one-dimensional partial differential equation. Numerical results, obtained by two presented algorithms, in floating-point interval arithmetic are considered.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Guided wave radiation from a point source in the proximity of a pipe bend

Throughout the oil and gas industry corrosion and erosion damage monitoring play a central role in managing asset integrity. Recently, the use of guided wave technology in conjunction with tomography techniques has provided the possibility of obtaining point-by-point maps of wall thickness loss over the entire volume of a pipeline section between two ring arrays of ultrasonic transducers. However, current research has focused on straight pipes while little work has been done on pipe bends which are also the most susceptible to developing damage. Tomography of the bend is challenging due to the complexity and computational cost of the 3-D elastic model required to accurately describe guided wave propagation. To overcome this limitation, we introduce a 2-D anisotropic inhomogeneous acoustic model which represents a generalization of the conventional unwrapping used for straight pipes. The shortest-path ray-tracing method is then applied to the 2-D model to compute ray paths and predict the arrival times of the fundamental flexural mode, A0, excited by a point source on the straight section of pipe entering the bend and detected on the opposite side. Good agreement is found between predictions and experiments performed on an 8” diameter (D) pipe with 1.5 D bend radius. The 2-D model also reveals the existence of an acoustic lensing effect which leads to a focusing phenomenon also confirmed by the experiments. The computational efficiency of the 2-D model makes it ideally suited for tomography algorithms.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Solution of two-dimensional electromagnetic scattering problem by FDTD with optimal step size, based on a semi-norm analysis

To solve the electromagnetic scattering problem in two dimensions, the Finite Difference Time Domain (FDTD) method is used. The order of convergence of the FDTD algorithm, solving the two-dimensional Maxwell’s curl equations, is estimated in two different computer implementations: with and without an obstacle in the numerical domain of the FDTD scheme. This constitutes an electromagnetic scattering problem where a lumped sinusoidal current source, as a source of electromagnetic radiation, is included inside the boundary. Confined within the boundary, a specific kind of Absorbing Boundary Condition (ABC) is chosen and the outside of the boundary is in form of a Perfect Electric Conducting (PEC) surface. Inserted in the computer implementation, a semi-norm has been applied to compare different step sizes in the FDTD scheme. First, the domain of the problem is chosen to be the free-space without any obstacles. In the second part of the computer implementations, a PEC surface is included as the obstacle. The numerical instability of the algorithms can be rather easily avoided with respect to the Courant stability condition, which is frequently used in applying the general FDTD algorithm.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Application of the stochastic parallel gradient descent algorithm for numerical simulation and analysis of the coherent summation of radiation from fibre amplifiers

Coherent summation of fibre laser beams, which can be scaled to a relatively large number of elements, is simulated by using the stochastic parallel gradient descent (SPGD) algorithm. The applicability of this algorithm for coherent summation is analysed and its optimisation parameters and bandwidth limitations are studied. (laser applications and other topics in quantum electronics)

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Application of permutation entropy method in the analysis of chaotic, noisy, and chaotic noisy series

We have considered a permutation entropy method for analyzing chaotic, noisy, and chaotic noisy series. We have introduced the concept of permutation entropy from a survey of some features of information entropy (Shannon entropy), described the algorithm for its calculation, and indicated the advantages of this approach in the analysis of time series; the application of this method in the analysis of various model systems and experimental data has also been demonstrated.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

The Secret Life of Quarks: National Computational Infrastructure for Lattice Gauge Theory

The objective of this grant was to develop algorithms and software for the numerical study of quantum chromodynamics (QCD) and of quantum field theories of interest for the understanding of physical phenomena that go beyond the standard model of high energy physics. Thirteen institutions were involved in this effort. The roles of the University of California, Santa Barbara in the project were to supply overall leadership and coordination, and to administer travel funds for participants at institutions that did not receive direct funding from the DOE. The purposes of these trips were to enable collaborative research on algorithms and software, and to report on algorithm and software development, and on scientific results obtained from it, at scientific meetings. These funds were also used to support travel by the Santa Barbara Principal Investigator in support of the project, and by co-Principal Investigators at institutions not receiving DOE funding. A total of 126 trips were supported.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

The density-matrix renormalization group in the age of matrix product states

The density-matrix renormalization group method (DMRG) has established itself over the last decade as the leading method for the simulation of the statics and dynamics of one-dimensional strongly correlated quantum lattice systems. In the further development of the method, the realization that DMRG operates on a highly interesting class of quantum states, so-called matrix product states (MPS), has allowed a much deeper understanding of the inner structure of the DMRG method, its further potential and its limitations. In this paper, I want to give a detailed exposition of current DMRG thinking in the MPS language in order to make the advisable implementation of the family of DMRG algorithms in exclusively MPS terms transparent. I then move on to discuss some directions of potentially fruitful further algorithmic development: while DMRG is a very mature method by now, I still see potential for further improvements, as exemplified by a number of recently introduced algorithms.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Combinatorial theory of the semiclassical evaluation of transport moments II: Algorithmic approach for moment generating functions

Electronic transport through chaotic quantum dots exhibits universal behaviour which can be understood through the semiclassical approximation. Within the approximation, calculation of transport moments reduces to codifying classical correlations between scattering trajectories. These can be represented as ribbon graphs and we develop an algorithmic combinatorial method to generate all such graphs with a given genus. This provides an expansion of the linear transport moments for systems both with and without time reversal symmetry. The computational implementation is then able to progress several orders further than previous semiclassical formulae as well as those derived from an asymptotic expansion of random matrix results. The patterns observed also suggest a general form for the higher orders.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Mixed time slicing in path integral simulations

A simple and efficient scheme is presented for using different time slices for different degrees of freedom in path integral calculations. This method bridges the gap between full quantization and the standard mixed quantum-classical (MQC) scheme and, therefore, still provides quantum mechanical effects in the less-quantized variables. Underlying the algorithm is the notion that time slices (beads) may be 'collapsed' in a manner that preserves quantization in the less quantum mechanical degrees of freedom. The method is shown to be analogous to multiple-time step integration techniques in classical molecular dynamics. The algorithm and its associated error are demonstrated on model systems containing coupled high- and low-frequency modes; results indicate that convergence of quantum mechanical observables can be achieved with disparate bead numbers in the different modes. Cost estimates indicate that this procedure, much like the MQC method, is most efficient for only a relatively few quantum mechanical degrees of freedom, such as proton transfer. In this regime, however, the cost of a fully quantum mechanical simulation is determined by the quantization of the least quantum mechanical degrees of freedom.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Improvements on the minimax algorithm for the Laplace transformation of orbital energy denominators

We present a robust and non-heuristic algorithm that finds all extremum points of the error distribution function of numerically Laplace-transformed orbital energy denominators. The extremum point search is one of the two key steps for finding the minimax approximation. If pre-tabulation of initial guesses is supposed to be avoided, strategies for a sufficiently robust algorithm have not been discussed so far. We compare our non-heuristic approach with a bracketing and bisection algorithm and demonstrate that 3 times less function evaluations are required altogether when applying it to typical non-relativistic and relativistic quantum chemical systems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Simulation of Non-Markovian Dynamics on IBM QX

Currently available quantum computers allow us to run proof of principle algorithms that are unitary in their nature. Therefore, this architecture is unoptimized for simulation of an open quantum system. Here we present a method that helps us to overcome unitarity. We show how to run a non-Markovian evolution of a qubit system. We discuss all the discrepancies from theoretical predictions.

Wudarski, Filip A.↗

Quantum Computing Technology Roadmaps and Capability Assessment for Scientific Computing - An analysis of use cases from the NERSC workload

The National Energy Research Scientific Computing Center (NERSC), as the high-performance computing (HPC) facility for the Department of Energy’s Office of Science, recognizes the essential role of quantum computing in its future mission. In this report, we analyze the NERSC workload and identify materials science, quantum chemistry, and high-energy physics as the science domains and application areas that stand to benefit most from quantum computers. These domains jointly make up over 50% of the current NERSC production workload, which is illustrative of the impact quantum computing could have on NERSC’s mission going forward. We perform an extensive literature review and determine the quantum resources required to solve classically intractable problems within these science domains. This review also shows that the quantum resources required have consistently decreased over time due to algorithmic improvements and a deeper understanding of the problems. At the same time, public technology roadmaps from a collection of ten quantum computing companies predict a dramatic increase in capabilities over the next five to ten years. Our analysis reveals a significant overlap emerging in this time frame between the technological capabilities and the algorithmic requirements in these three scientific domains. We anticipate that the execution time of large-scale quantum workflows will become a major performance parameter and propose a simple metric, the Sustained Quantum System Performance (SQSP), to compare system-level performance and throughput for a heterogeneous workload.

97 MATHEMATICS AND COMPUTING↗

Time-evolution methods for matrix-product states

Highlights: • Introductory review of time-evolution methods for matrix-product states. • Detailed description of five state-of-the-art algorithms. • Extended comparison of numerical examples. • Extended error analysis of each algorithm. • Pseudo-code examples towards an implementation where necessary. - Abstract: Matrix-product states have become the de facto standard for the representation of one-dimensional quantum many body states. During the last few years, numerous new methods have been introduced to evaluate the time evolution of a matrix-product state. Here, we will review and summarize the recent work on this topic as applied to finite quantum systems. We will explain and compare the different methods available to construct a time-evolved matrix-product state, namely the time-evolving block decimation, the MPO W{sup I,II} method, the global Krylov method, the local Krylov method and the one- and two-site time-dependent variational principle. We will also apply these methods to four different representative examples of current problem settings in condensed matter physics.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗