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,477 records · Page 82

A speciation solver for cement paste modeling and the semismooth Newton method

The mineral assemblage of a cement paste may vary considerably with its environment. In addition, the water content of a cement paste is relatively low and the ionic strength of the interstitial solution is often high. These conditions are extreme conditions with respect to the common assumptions made in speciation problem. Furthermore the common trial and error algorithm to find the phase assemblage does not provide any guarantee of convergence. We propose a speciation solver based on a semismooth Newton method adapted to the thermodynamic modeling of cement paste. The strong theoretical properties associated with these methods offer practical advantages. Results of numerical experiments indicate that the algorithm is reliable, robust, and efficient.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Early Exploration of a Flexible Framework for Efficient Quantum Linear Solvers in Power Systems

The rapid integration of renewable energy resources presents formidable challenges in managing power grids. While advanced computing and machine learning techniques offer some solutions for accelerating grid modeling and simulation, there remain complex problems that classical computers cannot effectively address. Quantum computing, a promising technology, has the potential to fundamentally transform how we manage power systems, especially in scenarios with a higher proportion of renewable energy sources. One critical aspect is solving linear systems of equations, crucial for power system applications like power flow analysis, for which the Harrow-Hassidim-Lloyd (HHL) algorithm is a well-known quantum solution. However, HHL quantum circuits often exhibit excessive depth, making them impractical for current Noisy-Intermediate-Scale-Quantum (NISQ) devices. In this paper, we introduce a versatile framework, powered by NWQSim, that bridges the gap between power system applications and quantum linear solvers available in Qiskit. This framework empowers researchers to efficiently explore power system applications using quantum linear solvers. Through innovative gate fusion strategies, reduced circuit depth, and GPU acceleration, our simulator significantly enhances resource efficiency. Power flow case studies have demonstrated up to a eight-fold speedup compared to Qiskit Aer, all while maintaining comparable levels of accuracy.

quantum computing, Harrow-Hassidim-Lloyd, high-per↗

Quantum Solver of Contracted Eigenvalue Equations for Scalable Molecular Simulations on Quantum Computing Devices

The accurate computation of ground and excited states of many-fermion quantum systems is one of the most consequential, contemporary challenges in the physical and computational sciences whose solution stands to benefit significantly from the advent of quantum computing devices. Existing methodologies using phase estimation or variational algorithms have potential drawbacks such as deep circuits requiring substantial error correction or non-trivial high-dimensional classical optimization. In this work, we introduce a quantum solver of contracted eigenvalue equations, the quantum analogue of classical methods for the energies and reduced density matrices of ground and excited states. The solver does not require deep circuits or difficult classical optimization and achieves an exponential speed-up over its classical counterpart. We demonstrate the algorithm though computations on both a quantum simulator and two IBM quantum processing units.

97 MATHEMATICS AND COMPUTING↗

Surrogate optimization of variational quantum circuits

Variational quantum eigensolvers are touted as a near-term algorithm capable of impacting many applications. However, the potential has not yet been realized, with few claims of quantum advantage and high resource estimates, especially due to the need for optimization in the presence of noise. Finding algorithms and methods to improve convergence is important to accelerate the capabilities of near-term hardware for VQE or more broad applications of hybrid methods in which optimization is required. To this goal, we look to use modern approaches developed in circuit simulations and stochastic classical optimization, which can be combined to form a surrogate optimization approach to quantum circuits. Using an approximate (classical CPU/GPU) state vector simulator as a surrogate model, we efficiently calculate an approximate Hessian, passed as an input for a quantum processing unit or exact circuit simulator. This method will lend itself well to parallelization across quantum processing units. We demonstrate the capabilities of such an approach with and without sampling noise and a proof-of-principle demonstration on a quantum processing unit utilizing 40 qubits.

Gustafson, Erik J. [RIACS, Mtn. View] (ORCID:00000↗

Simultaneous estimation of multiple eigenvalues with short-depth quantum circuit on early fault-tolerant quantum computers

We introduce a multi-modal, multi-level quantum complex exponential least squares (MM-QCELS) method to simultaneously estimate multiple eigenvalues of a quantum Hamiltonian on early fault-tolerant quantum computers. Our theoretical analysis demonstrates that the algorithm exhibits Heisenberg-limited scaling in terms of circuit depth and total cost. Notably, the proposed quantum circuit utilizes just one ancilla qubit, and with appropriate initial state conditions, it achieves significantly shorter circuit depths compared to circuits based on quantum phase estimation (QPE). Numerical results suggest that compared to QPE, the circuit depth can be reduced by around two orders of magnitude under several settings for estimating ground-state and excited-state energies of certain quantum systems.

97 MATHEMATICS AND COMPUTING↗

HRSSA – Efficient hybrid stochastic simulation for spatially homogeneous biochemical reaction networks

This paper introduces HRSSA (Hybrid Rejection-based Stochastic Simulation Algorithm), a new efficient hybrid stochastic simulation algorithm for spatially homogeneous biochemical reaction networks. HRSSA is built on top of RSSA, an exact stochastic simulation algorithm which relies on propensity bounds to select next reaction firings and to reduce the average number of reaction propensity updates needed during the simulation. HRSSA exploits the computational advantage of propensity bounds to manage time-varying transition propensities and to apply dynamic partitioning of reactions, which constitute the two most significant bottlenecks of hybrid simulation. A comprehensive set of simulation benchmarks is provided for evaluating performance and accuracy of HRSSA against other state of the art algorithms.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Resolving Wave-Particle Duality Could Accelerate the Mass Production of Quantum Computers

Quantum computers, hypothesized in 1980s, use concepts of superposition and entanglement phenomena. Although theoretical propositions and associated search algorithms for accurate measurements are being generated, the development of practical quantum computers themselves are advancing very slowly requiring enormous time and investments. The underlying concepts of a quantum computer are not new to the optical domain. However, the crucial enabling concepts of Entanglement and Superposition Principle are remaining clouded under the unresolved postulates, Wave-Particle Duality (WPD), and Wave Packet Reduction (WPR), implicating incompleteness in the interpretations of the mathematical formalism behind Quantum Mechanics. The WPD debate started during late1600 between Newton and Huygens. Young’s resolution of WPD through his double-slit experiment in 1802 was effectively overturned by Einstein’s interpretation of photoelectric effect as due to “indivisible light quanta”. However, Einstein disowned his “light quanta” postulate shortly before his death in1955, even though it had earned him the Nobel Prize. We resolve WPD by synthesizing Newton’s and Maxwell’s concepts and assume atoms do emit quanta but propagate as time-finite exponential pulses. This assumption also resolves WPR for light-matter interaction with the assumption that Schrodinger’s ψ represents atom’s internal dipolar amplitude stimulations. This over-turns Born’s interpretation that ψ only represents the abstract mathematical probability amplitude, rather than the physical “internal amplitude stimulation” of the quantum entity. However, our concept of atomic pulse emission forces us to re-derive the expression for the N-slit grating-spectrometer response since the classical derivation uses CW light, which does not exist. This pulsespectrometric response function strengthens our postulate since the grating response to the exponential pulse appears to be the convolution of a Lorentzian spectrum with the classical CW response function of the grating. The Fourier Transform of an exponential function is Lorentzian and QM predicts spontaneous emission line width to be Lorentzian. Then, conceptually one can extend the grating-expression (with N=2) to get the double-slit pattern. This approach preserves the classical causality that each of the two slits, like the N-signals out of a grating, are physically real and jointly stimulate the quantum detector array at the far field to generate the “Local” cosine fringes. The detector array executes the square modulus operation on its imposed dipolar amplitude stimulation and absorbs the necessary energy to fill up their quantum cups. Hence the double-slit pattern must also be “Local”, just as the N-slit grating spectrum is generated locally at the exit spectral-plane of the spectrometer. This removes the need to believe that “single photons” mysteriously generate the double slit pattern. Quantum computers, hypothesized in 1980s, use concepts of superposition and entanglement phenomena. Although theoretical propositions and associated search algorithms for accurate measurements are being generated, the development of practical quantum computers themselves are advancing very slowly requiring enormous time and investments. The underlying concepts of a quantum computer are not new to the optical domain. However, the crucial enabling concepts of Entanglement and Superposition Principle are remaining clouded under the unresolved postulates, Wave-Particle Duality (WPD), and Wave Packet Reduction (WPR), implicating incompleteness in the interpretations of the mathematical formalism behind Quantum Mechanics. The WPD debate started during late1600 between Newton and Huygens. Young’s resolution of WPD through his double-slit experiment in 1802 was effectively overturned by Einstein’s interpretation of photoelectric effect as due to “indivisible light quanta”. However, Einstein disowned his “light quanta” postulate shortly before his death in1955, even though it had earned him the Nobel Prize. We resolve WPD by synthesizing Newton’s and Maxwell’s concepts and assume atoms do emit quanta but propagate as time-finite exponential pulses. This assumption also resolves WPR for light-matter interaction with the assumption that Schrodinger’s ψ represents atom’s internal dipolar amplitude stimulations. This over-turns Born’s interpretation that ψ only represents the abstract mathematical probability amplitude, rather than the physical “internal amplitude stimulation” of the quantum entity. However, our concept of atomic pulse emission forces us to re-derive the expression for the N-slit grating-spectrometer response since the classical derivation uses CW light, which does not exist. This pulsespectrometric response function strengthens our postulate since the grating response to the exponential pulse appears to be the convolution of a Lorentzian spectrum with the classical CW response function of the grating. The Fourier Transform of an exponential function is Lorentzian and QM predicts spontaneous emission line width to be Lorentzian. Then, conceptually one can extend the grating-expression (with N=2) to get the double-slit pattern. This approach preserves the classical causality that each of the two slits, like the N-signals out of a grating, are physically real and jointly stimulate the quantum detector array at the far field to generate the “Local” cosine fringes. The detector array executes the square modulus operation on its imposed dipolar amplitude stimulation and absorbs the necessary energy to fill up their quantum cups. Hence the double-slit pattern must also be “Local”, just as the N-slit grating spectrum is generated locally at the exit spectral-plane of the spectrometer. This removes the need to believe that “single photons” mysteriously generate the double slit pattern.

Quantum Computer↗

Surrogate Optimization for Quantum Circuits

Variational quantum Eigensolvers are touted as a near-term algorithm capable of impacting many applications. However, the potential has yet to be realized with few claims of quantum advantage and high resource estimates mainly due to the need for optimization in the presence of noise. Finding algorithms and methods to improve the convergence is essential to accelerate the capabilities of near-term hardware for VQE or more broad applications of hybrid methods in which optimization is required. To this goal we look to use modern approaches recently developed in circuit simulations and stochastic classical optimization that can be combined in a surrogate optimization approach to classical circuits. Using an approximate state vector simulator, we efficiently calculate an approximate Hessian, fed as an input for a detailed quantum circuit simulator. We demonstrate the capabilities of such an approach with and without sampling noise. We also show that this method outperforms Powell in the presence of quantum circuit shot noise by a factor of 2-4

quantum computing↗

Let Each Quantum Bit Choose Its Basis Gates

Near-term quantum computers are primarily limited by errors in quantum operations (or gates) between two quantum bits (or qubits). A physical machine typically provides a set of basis gates that include primitive 2-qubit (2Q) and 1-qubit (1Q) gates that can be implemented in a given technology. 2Q entangling gates, coupled with some 1Q gates, allow for universal quantum computation. In superconducting technologies, the current state of the art is to implement the same 2Q gate between every pair of qubits (typically an XX-or XY-type gate). This strict hardware uniformity requirement for 2Q gates in a large quantum computer has made scaling up a time and resource-intensive endeavor in the lab. We propose a radical idea – allow the 2Q basis gate(s) to differ between every pair of qubits, selecting the best entangling gates that can be calibrated between given pairs of qubits. This work aims to give quantum scientists the ability to run meaningful algorithms with qubit systems that are not perfectly uniform. Scientists will also be able to use a much broader variety of novel 2Q gates for quantum computing. We develop a theoretical framework for identifying good 2Q basis gates on “nonstandard” Cartan trajectories that deviate from “standard” trajectories like XX. We then introduce practical methods for calibration and compilation with nonstandard 2Q gates, and discuss possible ways to improve the compilation. To demonstrate our methods in a case study, we simulated both standard XY-type trajectories and faster, nonstandard trajectories using an entangling gate architecture with far-detuned transmon qubits. We identify efficient 2Q basis gates on these nonstandard trajectories and use them to compile a number of standard benchmark circuits such as QFT and QAOA. Furthermore, our results demonstrate an 8x improvement over the baseline 2Q gates with respect to speed and coherence-limited gate fidelity.

quantum computing↗

Towards quantum machine learning with tensor networks

Machine learning is a promising application of quantum computing, but challenges remain for implementation today because near-term devices have a limited number of physical qubits and high error rates. Motivated by the usefulness of tensor networks for machine learning in the classical context, we propose quantum computing approaches to both discriminative and generative learning, with circuits based on tree and matrix product state tensor networks, that could already have benefits with such near-term devices. The result is a unified framework in which classical and quantum computing can benefit from the same theoretical and algorithmic developments, and the same model can be trained classically then transferred to the quantum setting for additional optimization. Tensor network circuits can also provide qubit-efficient schemes in which, depending on the architecture, the number of physical qubits required scales only logarithmically with, or independently of the input or output data sizes. Here, we demonstrate our proposals with numerical experiments, training a discriminative model to perform handwriting recognition using a hybrid quantum-classical optimization procedure that could be carried out on quantum hardware today, and testing the noise resilience of the trained model.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Calculation of QCD loops using tree-level matrix elements

The possibility of treating colour in one-loop amplitude calculations alike the other quantum numbers is briefly discussed for semi-numerical algorithms based on generalized unitarity and parametric integration techniques. Numerical results are presented for the calculation of virtual corrections in multi-gluon scattering.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Edge Modes and Teleportation in a Topologically Insulating Quantum Wire

We find a simple model of an insulating state of a quantum wire which has a single isolated edge mode. We argue that, when brought to proximity, the edge modes on independent wires naturally form Bell entangled states which could be used for elementary quantum processes such as teleportation. We give an example of an algorithm which teleports the spin state of an electron from one quantum wire to another.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

On the no-signaling approach to quantum nonlocality

The no-signaling approach to nonlocality deals with separable and inseparable multiparty correlations in the same set of probability states without conflicting causality. The set of half-spaces describing the polytope of no-signaling probability states that are admitted by the most general class of Bell scenarios is formulated in full detail. An algorithm for determining the skeleton that solves the no-signaling description is developed upon a new strategy that is partially pivoting and partially incremental. The algorithm is formulated rigorously and its implementation is shown to be effective to deal with the highly degenerate no-signaling descriptions. Several applications of the algorithm as a tool for the study of quantum nonlocality are mentioned. Applied to a large set of bipartite Bell scenarios, we found that the corresponding no-signaling polytopes have a striking high degeneracy that grows up exponentially with the size of the Bell scenario.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Canonical forms for single-qutrit Clifford+T operators

We introduce canonical forms for single qutrit Clifford+T circuits and prove that every single-qutrit Clifford+T operator admits a unique such canonical form. We show that our canonical forms are T-optimal in the sense that among all the single-qutrit Clifford+T circuits implementing a given operator our canonical form uses the least number of T gates. Finally, we provide an algorithm which inputs the description of an operator (as a matrix or a circuit) and constructs the canonical form for this operator. The algorithm runs in time linear in the number of T gates. Our results provide a higher-dimensional generalization of prior work by Matsumoto and Amano who introduced similar canonical forms for single-qubit Clifford+T circuits.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

On the asymptotic distribution of block-modified random matrices

We study random matrices acting on tensor product spaces which have been transformed by a linear block operation. Using operator-valued free probability theory, under some mild assumptions on the linear map acting on the blocks, we compute the asymptotic eigenvalue distribution of the modified matrices in terms of the initial asymptotic distribution. Moreover, using recent results on operator-valued subordination, we present an algorithm that computes, numerically but in full generality, the limiting eigenvalue distribution of the modified matrices. Our analytical results cover many cases of interest in quantum information theory: we unify some known results and we obtain new distributions and various generalizations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Pinning impulsive control algorithms for complex network

In this paper, we further investigate the synchronization of complex dynamical network via pinning control in which a selection of nodes are controlled at discrete times. Different from most existing work, the pinning control algorithms utilize only the impulsive signals at discrete time instants, which may greatly improve the communication channel efficiency and reduce control cost. Two classes of algorithms are designed, one for strongly connected complex network and another for non-strongly connected complex network. It is suggested that in the strongly connected network with suitable coupling strength, a single controller at any one of the network's nodes can always pin the network to its homogeneous solution. In the non-strongly connected case, the location and minimum number of nodes needed to pin the network are determined by the Frobenius normal form of the coupling matrix. In addition, the coupling matrix is not necessarily symmetric or irreducible. Illustrative examples are then given to validate the proposed pinning impulsive control algorithms.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Quantum neuromorphic computing

Quantum neuromorphic computing physically implements neural networks in brain-inspired quantum hardware to speed up their computation. In this perspective article, we show that this emerging paradigm could make the best use of the existing and near future intermediate size quantum computers. Some approaches are based on parametrized quantum circuits and use neural network-inspired algorithms to train them. Other approaches, closer to classical neuromorphic computing, take advantage of the physical properties of quantum oscillator assemblies to mimic neurons and synapses to compute. In this work, we discuss the different implementations of quantum neuromorphic networks with digital and analog circuits, highlight their respective advantages, and review exciting recent experimental results.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗