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 973 records · Page 54

Self-consistent mean-field quantum approximate optimization

We introduce a self-consistent mean-field quantum optimization algorithm that approximates the ground state of classical Ising Hamiltonians. The algorithm decomposes the problem into independent subproblems and treats the interactions between them in a mean-field manner. These interactions are captured by a common environment, constructed self-consistently through a variational quantum circuit, and which modifies the subproblems to account for mutual influence while maintaining computational independence. Consequently, subproblems can be solved individually, avoiding the computational cost of the full problem. We explore the properties of the generated environment and assess the algorithm's performance through extensive numerical simulations on Sherrington-Kirkpatrick spin glasses. Furthermore, we apply it experimentally to a weighted maximum clique problem applied to molecular docking. This framework enables the solution of problems that would otherwise exceed the qubit and gate counts of current quantum hardware.

Dupont, Maxime [Rigetti Computing] (ORCID:00000001↗

Self-consistent mean-field quantum approximate optimization

We introduce a self-consistent mean-field quantum optimization algorithm that approximates the ground state of classical Ising Hamiltonians. The algorithm decomposes the problem into independent subproblems and treats the interactions between them in a mean-field manner. These interactions are captured by a common environment, constructed self-consistently through a variational quantum circuit, and which modifies the subproblems to account for mutual influence while maintaining computational independence. Consequently, subproblems can be solved individually, avoiding the computational cost of the full problem. We explore the properties of the generated environment and assess the algorithm's performance through extensive numerical simulations on Sherrington-Kirkpatrick spin glasses. Furthermore, we apply it experimentally to a weighted maximum clique problem applied to molecular docking. This framework enables the solution of problems that would otherwise exceed the qubit and gate counts of current quantum hardware.

Dupont, Maxime [Rigetti Computing] (ORCID:00000001↗

Modelling gamma-ray photon emission and pair production in high-intensity laser–matter interactions

In high-intensity (>10{sup 21} Wcm{sup −2}) laser–matter interactions gamma-ray photon emission by the electrons can strongly affect the electron's dynamics and copious numbers of electron–positron pairs can be produced by the emitted photons. We show how these processes can be included in simulations by coupling a Monte Carlo algorithm describing the emission to a particle-in-cell code. The Monte Carlo algorithm includes quantum corrections to the photon emission, which we show must be included if the pair production rate is to be correctly determined. The accuracy, convergence and energy conservation properties of the Monte Carlo algorithm are analysed in simple test problems.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Performance evaluations of signed and unsigned noisy approximate quantum Fourier arithmetic

The Quantum Fourier Transform (QFT) grants competitive advantages, especially in resource usage and circuit approximation, for performing arithmetic operations on quantum computers, and offers a potential route toward a numerical quantum-computational paradigm. In this paper, we utilize efficient techniques to implement QFT-based integer addition and multiplications. These operations are fundamental to various quantum applications including Shor’s algorithm, weighted-sum optimization problems in data processing and machine learning, and quantum algorithms requiring inner products. We carry out performance evaluations of these implementations based on IBM’s superconducting-qubit architecture using different compatible noise models. We isolate the sensitivity of the component quantum circuits on both one-/two-qubit gate error rates, and the number of the arithmetic operands’ superposed integer states. We analyze performance and identify the most effective approximation depths for unsigned quantum addition and quantum multiplication within the given context. We then perform a similar analysis of signed addition and compare to the unsigned results. We observe significant dependency of the optimal approximation depth on the degree of machine noise and the number of superposed states in certain performance regimes. Finally, we elaborate on the algorithmic challenges—relevant to signed, unsigned, modular and non-modular versions—that could also be applied to current implementations of QFT-based subtraction, division, exponentiation, and their potential tensor extensions. Here, we analyze the performance trends in our results and speculate on possible future developments within this computational paradigm.

Computational models↗

Simulating 0+1 Dimensional Quantum Gravity on Quantum Computers: Mini-Superspace Quantum Cosmology and the World Line Approach in Quantum Field Theory

Quantum computers are promising candidates to radically expand the domain of computational science by their increased computing power and more effective algorithms. In particular, quantum computing could have a tremendous impact on the field of quantum cosmology. The goal of quantum cosmology is to describe the evolution of the universe through the Wheeler-DeWitt equation or path integral methods without having to first formulate a full theory of quantum gravity. The quantum computer provides an advantage in this endeavor because it can perform path integrals directly in Lorentzian space and does not require constructing contour integrations in Euclidean gravity. Also, quantum computers can provide advantages in systems with fermions which are difficult to simulate on classical computers. In this study, we first employed classical computational methods to analyze a Friedmann-Robertson-Walker mini-superspace with a scalar field and visualize the calculated wavefunction of the universe for a variety of different values of the curvature of the universe and the cosmological constant. We then used IBM’s Quantum Information Science Kit Python library and the variational quantum eigensolver algorithm to study the same systems on a quantum computer. The framework was extended to the world line approach to quantum field theory.

97 MATHEMATICS AND COMPUTING↗

Seven open problems in applied combinatorics

We present and discuss seven different open problems in applied combinatorics. Additionally, the application areas relevant to this compilation include quantum computing, algorithmic differentiation, topological data analysis, iterative methods, hypergraph cut algorithms, and power systems.

97 MATHEMATICS AND COMPUTING↗

Introduction to Quantum Computing

Quantum computing offers the potential to revolutionize high-performance computing by providing a means to solve certain computational problems asymptotically faster than any classical computer. Quantum computing has advanced recently from merely a theoretical possibility to engineered reality, including commercial entities offering early prototype quantum processors, both special-purpose quantum annealers and general-purpose gate-model processors. The media have been showcasing each new development and implicitly conveying the message that quantum-computing ubiquity is nigh. Here, we will respond to this hype and provide an overview of the exciting but still early state of the field. In this tutorial, we introduce participants to the computational models that give quantum computing its immense computational power. We examine the thought processes that programmers need to map problems to quantum computers. And we discuss hardware and algorithmic challenges that must be overcome before quantum computing becomes a component of every software developer's repertoire.

Quantum computing↗

Introduction to Quantum Computing

Quantum computing offers the potential to revolutionize high-performance computing by providing a means to solve certain computational problems asymptotically faster than any classical computer. Quantum computing has advanced recently from merely a theoretical possibility to engineered reality, including commercial entities offering early prototype quantum processors, both special-purpose quantum annealers and general-purpose gate-model processors. The media have been showcasing each new development and implicitly conveying the message that quantum-computing ubiquity is nigh. Here, we will respond to this hype and provide an overview of the exciting but still early state of the field. In this tutorial, we introduce participants to the computational models that give quantum computing its immense computational power. We examine the thought processes that programmers need to map problems to quantum computers. And we discuss hardware and algorithmic challenges that must be overcome before quantum computing becomes a component of every software developer's repertoire. (Update of 2022 slides)

Quantum computing↗

U(1) fields from qubits: An approach via D-theory algebra

A new quantum link microstructure was proposed for the lattice quantum chromodynamics (QCD) Hamiltonian, replacing the Wilson gauge links with a bilinear of fermionic qubits, later generalized to D-theory. This formalism provides a general framework for building lattice field theory algorithms for quantum computing. We focus mostly on the simplest case of a quantum rotor for a single compact U(1) field. We also make some progress for non-Abelian setups, making it clear that the ideas developed in the U(1) case extend to other groups. These in turn are building blocks for 1 + 0 -dimensional ( 1 + 0 -D) matrix models, 1 + 1 -D sigma models and non-Abelian gauge theories in 2 + 1 and 3 + 1 dimensions. By introducing multiple flavors for the U(1) field, where the flavor symmetry is gauged, we can efficiently approach the infinite-dimensional Hilbert space of the quantum O(2) rotor with increasing flavors. The emphasis of the method is on preserving the symplectic algebra exchanging fermionic qubits by sigma matrices (or hard bosons) and developing a formal strategy capable of generalization to a SU ( 3 ) field for lattice QCD and other non-Abelian 1 + 1 -D sigma models or 3 + 1 -D gauge theories. For U(1), we discuss briefly the qubit algorithms for the study of the discrete 1 + 1 -D sine-Gordon equation. Published by the American Physical Society 2024

Astronomy & Astrophysics↗

Quantum noise properties of CT images with anatomical textured backgrounds across reconstruction algorithms: FBP and SAFIRE

Purpose: Quantum noise properties of CT images are generally assessed using simple geometric phantoms with uniform backgrounds. Such phantoms may be inadequate when assessing nonlinear reconstruction or postprocessing algorithms. The purpose of this study was to design anatomically informed textured phantoms and use the phantoms to assess quantum noise properties across two clinically available reconstruction algorithms, filtered back projection (FBP) and sinogram affirmed iterative reconstruction (SAFIRE). Methods: Two phantoms were designed to represent lung and soft-tissue textures. The lung phantom included intricate vessel-like structures along with embedded nodules (spherical, lobulated, and spiculated). The soft tissue phantom was designed based on a three-dimensional clustered lumpy background with included low-contrast lesions (spherical and anthropomorphic). The phantoms were built using rapid prototyping (3D printing) technology and, along with a uniform phantom of similar size, were imaged on a Siemens SOMATOM Definition Flash CT scanner and reconstructed with FBP and SAFIRE. Fifty repeated acquisitions were acquired for each background type and noise was assessed by estimating pixel-value statistics, such as standard deviation (i.e., noise magnitude), autocorrelation, and noise power spectrum. Noise stationarity was also assessed by examining the spatial distribution of noise magnitude. The noise properties were compared across background types and between the two reconstruction algorithms. Results: In FBP and SAFIRE images, noise was globally nonstationary for all phantoms. In FBP images of all phantoms, and in SAFIRE images of the uniform phantom, noise appeared to be locally stationary (within a reasonably small region of interest). Noise was locally nonstationary in SAFIRE images of the textured phantoms with edge pixels showing higher noise magnitude compared to pixels in more homogenous regions. For pixels in uniform regions, noise magnitude was reduced by an average of 60% in SAFIRE images compared to FBP. However, for edge pixels, noise magnitude ranged from 20% higher to 40% lower in SAFIRE images compared to FBP. SAFIRE images of the lung phantom exhibited distinct regions with varying noise texture (i.e., noise autocorrelation/power spectra). Conclusions: Quantum noise properties observed in uniform phantoms may not be representative of those in actual patients for nonlinear reconstruction algorithms. Anatomical texture should be considered when evaluating the performance of CT systems that use such nonlinear algorithms.

60 APPLIED LIFE SCIENCES↗

Opportunities in full-stack design of low-overhead fault-tolerant quantum computation

Quantum error correction provides a route to realizing large-scale quantum computation but incurs substantial resource overheads. Here, in this work, we highlight recent advances that reduce these overheads by co-designing different levels of the computational stack, including algorithms, quantum-error-correction strategies and hardware architecture. We then discuss opportunities for further optimization such as leveraging flexible qubit connectivity and quantum low-density parity check codes. These strategies can bring useful quantum computation closer to reality as experiments advance in the coming years.

quantum information↗

QCOR; A Language Extension Specification for the Heterogeneous Quantum-Classical Model of Computation

Quantum computing (QC) is an emerging computational paradigm that leverages the laws of quantum mechanics to perform elementary logic operations. Existing programming models for QC were designed with fault-tolerant hardware in mind, envisioning stand-alone applications. However, the susceptibility of near-term quantum computers to noise limits their stand-alone utility. To better leverage limited computational strengths of noisy quantum devices, hybrid algorithms have been suggested whereby quantum computers are used in tandem with their classical counterparts in a heterogeneous fashion. This modus operandi calls out for a programming model and a high-level programming language that natively and seamlessly supports heterogeneous quantum-classical hardware architectures in a single-source-code paradigm. Motivated by the lack of such a model, we introduce a language extension specification, called QCOR, which enables single-source quantum-classical programming. Programs written using the QCOR library–based language extensions can be compiled to produce functional hybrid binary executables. After defining QCOR’s programming model, memory model, and execution model, we discuss how QCOR enables variational, iterative, and feed-forward QC. Additionally, QCOR approaches quantum-classical computation in a hardware-agnostic heterogeneous fashion and strives to build on best practices of high-performance computing. The high level of abstraction in the language extension is intended to accelerate the adoption of QC by researchers familiar with classical high-performance computing.

97 MATHEMATICS AND COMPUTING↗

NASA Tech Briefs, March 2011

Topics covered include: Optimal Tuner Selection for Kalman-Filter-Based Aircraft Engine Performance Estimation; Airborne Radar Interferometric Repeat-Pass Processing; Plug-and-Play Environmental Monitoring Spacecraft Subsystem; Power-Combined GaN Amplifier with 2.28-W Output Power at 87 GHz; Wallops Ship Surveillance System; Source Lines Counter (SLiC) Version 4.0; Guidance, Navigation, and Control Program; Single-Frame Terrain Mapping Software for Robotic Vehicles; Auto Draw from Excel Input Files; Observation Scheduling System; CFDP for Interplanetary Overlay Network; X-Windows Widget for Image Display; Binary-Signal Recovery; Volumetric 3D Display System with Static Screen; MMIC Replacement for Gunn Diode Oscillators; Feature Acquisition with Imbalanced Training Data; Mount Protects Thin-Walled Glass or Ceramic Tubes from Large Thermal and Vibration Loads; Carbon Nanotube-Based Structural Health Monitoring Sensors; Wireless Inductive Power Device Suppresses Blade Vibrations; Safe, Advanced, Adaptable Isolation System Eliminates the Need for Critical Lifts; Anti-Rotation Device Releasable by Insertion of a Tool; A Magnetically Coupled Cryogenic Pump; Single Piezo-Actuator Rotary-Hammering Drill; Fire-Retardant Polymeric Additives; Catalytic Generation of Lift Gases for Balloons; Ionic Liquids to Replace Hydrazine; Variable Emittance Electrochromics Using Ionic Electrolytes and Low Solar Absorptance Coatings; Spacecraft Radiator Freeze Protection Using a Regenerative Heat Exchanger; Multi-Mission Power Analysis Tool; Correction for Self-Heating When Using Thermometers as Heaters in Precision Control Applications; Gravitational Wave Detection with Single-Laser Atom Interferometers; Titanium Alloy Strong Back for IXO Mirror Segments; Improved Ambient Pressure Pyroelectric Ion Source; Multi-Modal Image Registration and Matching for Localization of a Balloon on Titan; Entanglement in Quantum-Classical Hybrid; Algorithm for Autonomous Landing; Quantum-Classical Hybrid for Information Processing; Small-Scale Dissipation in Binary-Species Transitional Mixing Layers; Superpixel-Augmented Endmember Detection for Hyperspectral Images; Coding for Parallel Links to Maximize the Expected Value of Decodable Messages; and Microwave Tissue Soldering for Immediate Wound Closure.

Source record↗

Exploring Network-Related Optimization Problems Using Quantum Heuristics

Network-related connectivity optimization problems are underlying a wide range of applications and are also of high computational complexity. We consider studying network optimization problems using two types of quantum heuristics.One is quantum annealing, and the other Quantum Alternating Operator Ansatz, an extension of the Quantum Approximate Optimization Algorithms for gate-model quantum computation, in which a cost-function based unitary and a non-commuting mixing unitary are applied alternately. We present problem mappings for problems of finding the spanning-tree or spanning-graph of a graph that optimizes certain costs, and a variant that further requires the spanning-tree be degree-bounded. With quantum annealing, all constraints are cast into penalty terms in the cost Hamiltonian, and the solution is encoded as the ground state of the Hamiltonian. We provide three mappings to the quadratic unconstrained binary optimization (QUBO) form, compare the resource requirements, and analyze the tradeoffs. For QAOA, we give special focus on the design of mixers based on the constraints presented in the problem, such that the system evolution remains in a subspace of the full Hilbert space where all constraints are satisfied. In the spanning-tree problem, one such hard constraint is that a mixer applied to a spanning-tree needs also be a spanning tree. This involves checking the connectivity of a subgraph, which is a global condition common for most network-related problems. We show how this feature can be efficiently represented in the mixer in a quantum coherent way, based on manipulation of a descendant-matrix and an adjacent matrix. We further develop a mixer for the spanning-graphs based on the spanning-tree mixer.

Wang, Zhihui↗

Study network-related optimization problems using quantum alternating optimization ansatz

Network-related connectivity optimization problems are underlying a wide range of applications and are also of high computational complexity. We consider studying network optimization problems using two types of quantum heuristics. One is quantum annealing, and the other Quantum Alternating Operator Ansatz, an extension of the Quantum Approximate Optimization Algorithms for gate-model quantum computation, in which a cost-function based unitary and a non-commuting mixing unitary are applied alternately. We present problem mappings for problems of finding the spanning-tree or spanning-graph of a graph that optimizes certain costs, and a variant that further requires the spanning-tree be degree-bounded. With quantum annealing, all constraints are cast into penalty terms in the cost Hamiltonian, and the solution is encoded as the ground state of the Hamiltonian. We provide three mappings to the quadratic unconstrained binary optimization (QUBO) form, compare the resource requirements, and analyze the tradeoffs. For QAOA, we give special focus on the design of mixers based on the constraints presented in the problem, such that the system evolution remains in a subspace of the full Hilbert space where all constraints are satisfied. In the spanning-tree problem, one such hard constraint is that a mixer applied to a spanning-tree needs also be a spanning tree. This involves checking the connectivity of a subgraph, which is a global condition common for most network-related problems. We show how this feature can be efficiently represented in the mixer in a quantum coherent way, based on manipulation of a descendant-matrix and an adjacent matrix. We further develop a mixer for the spanning-graphs based on the spanning-tree mixer.

Zhihui Wang↗

Exponential vanishing of the ground-state gap of the quantum random energy model via adiabatic quantum computing

In this note, we use ideas of Farhi et al. [Int. J. Quantum. Inf. 6, 503 (2008) and Quantum Inf. Comput. 11, 840 (2011)] who link a lower bound on the run time of their quantum adiabatic search algorithm to an upper bound on the energy gap above the ground-state of the generators of this algorithm. We apply these ideas to the quantum random energy model (QREM). Our main result is a simple proof of the conjectured exponential vanishing of the energy gap of the QREM.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Integrating subsystem embedding subalgebras and coupled cluster Green’s function: a theoretical foundation for quantum embedding in excitation manifold

Here, in this study, we introduce a novel approach to coupled-cluster Green's function (CCGF) embedding by seamlessly integrating conventional CCGF theory with the state-of-the-art sub-system embedding sub-algebras coupled cluster (SES-CC) formalism. This integration focuses primarily on delineating the characteristics of the sub-system and the corresponding segments of the Green's function, defined explicitly by active orbitals. Crucially, our work involves the adaptation of the SES-CC paradigm, addressing the left eigenvalue problem through a distinct form of Hamiltonian similarity transformation. This advancement not only facilitates a comprehensive representation of the interaction between the embedded sub-system and its surrounding environment but also paves the way for the quantum mechanical description of multiple embedded domains, particularly by employing the emergent quantum flow algorithms. Our theoretical underpinnings further set the stage for a generalization to multiple embedded sub-systems. This expansion holds significant promise for the exploration and application of non-equilibrium quantum systems, enhancing the understanding of system–environment interactions. In doing so, the research underscores the potential of SES-CC embedding within the realm of quantum computations and multi-scale simulations, promising a good balance between accuracy and computational efficiency.

97 MATHEMATICS AND COMPUTING↗

A NASA Perspective on Quantum Computing, with Ties to Operator Algebras

The talk will survey work done by the NASA Quantum Artificial Intelligence Laboratory (QuAIL), particularly algorithms and protocols in which operator algebras may play a role. The talk will focus on recent work advancing quantum error correction and error mitigation, and will touch on other topics related to quantum algorithms and funda- mental quantum physics.

Quantum Computing↗