SEARCH · Search NASA

Results for “quantum”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 757 records · Page 42

All sources NASA NTRS DOE OSTI

NASA NTRS2003

Surface Segregation Energies of BCC Binaries from Ab Initio and Quantum Approximate Calculations

We compare dilute-limit segregation energies for selected BCC transition metal binaries computed using ab initio and quantum approximate energy method. Ab initio calculations are carried out using the CASTEP plane-wave pseudopotential computer code, while quantum approximate results are computed using the Bozzolo-Ferrante-Smith (BFS) method with the most recent parameterization. Quantum approximate segregation energies are computed with and without atomistic relaxation. The ab initio calculations are performed without relaxation for the most part, but predicted relaxations from quantum approximate calculations are used in selected cases to compute approximate relaxed ab initio segregation energies. Results are discussed within the context of segregation models driven by strain and bond-breaking effects. We compare our results with other quantum approximate and ab initio theoretical work, and available experimental results.

Good, Brian S.↗

NASA NTRS2007

Development of a Quantum Dot, 0.6 eV InGaAs Thermophotovoltaic (TPV) Converter

Thermophotovoltaic (TPV) power conversion has to date demonstrated conversion efficiencies exceeding 20% when coupled to a heat source. Current III-V semiconductor TPV technology makes use of planar devices with bandgaps tailored to the heat source. The efficiency can be improved further by increasing the collection efficiency through the incorporation of InAs quantum dots. The use of these dots can provide sub-gap absorption and thus improve the cell short circuit current without the normal increase in dark current associated with lowering the bandgap. We have developed self-assembled InAs quantum dots using the Stranski-Krastanov growth mode on 0.74 eV In0.53GaAs lattice-matched to InP and also on lattice-mismatched 0.6 eV In0.69GaAs grown on InP through the use of a compositionally graded InPAsx buffer structure, by metalorganic vapor phase epitaxy (MOVPE). Atomic force microscopy (AFM) measurements showed that the most reproducible dot pattern was obtained with 5 monolayers of InAs grown at 450 C. The lattice mismatch between InAs and In0.69GaAs is only 2.1%, compared to 3.2% between InAs and In0.53GaAs. The smaller mismatch results in lower strain, making dot formation somewhat more complicated, resulting in quantum dashes, rather than well defined quantum dots in the lattice-mismatched case. We have fabricated 0.6 eV InGaAs planer TPV cells with and without the quantum dashes

Forbes, David↗

NASA NTRS2009

Non-unitary probabilistic quantum computing circuit and method

A quantum circuit performing quantum computation in a quantum computer. A chosen transformation of an initial n-qubit state is probabilistically obtained. The circuit comprises a unitary quantum operator obtained from a non-unitary quantum operator, operating on an n-qubit state and an ancilla state. When operation on the ancilla state provides a success condition, computation is stopped. When operation on the ancilla state provides a failure condition, computation is performed again on the ancilla state and the n-qubit state obtained in the previous computation, until a success condition is obtained.

Williams, Colin P.↗

NASA NTRS2006

Quantum Entanglement Molecular Absorption Spectrum Simulator

Quantum Entanglement Molecular Absorption Spectrum Simulator (QE-MASS) is a computer program for simulating two photon molecular-absorption spectroscopy using quantum-entangled photons. More specifically, QE-MASS simulates the molecular absorption of two quantum-entangled photons generated by the spontaneous parametric down-conversion (SPDC) of a fixed-frequency photon from a laser. The two-photon absorption process is modeled via a combination of rovibrational and electronic single-photon transitions, using a wave-function formalism. A two-photon absorption cross section as a function of the entanglement delay time between the two photons is computed, then subjected to a fast Fourier transform to produce an energy spectrum. The program then detects peaks in the Fourier spectrum and displays the energy levels of very short-lived intermediate quantum states (or virtual states) of the molecule. Such virtual states were only previously accessible using ultra-fast (femtosecond) laser systems. However, with the use of a single-frequency continuous wave laser to produce SPDC photons, and QEMASS program, these short-lived molecular states can now be studied using much simpler laser systems. QE-MASS can also show the dependence of the Fourier spectrum on the tuning range of the entanglement time of any externally introduced optical-path delay time. QE-MASS can be extended to any molecule for which an appropriate spectroscopic database is available. It is a means of performing an a priori parametric analysis of entangled photon spectroscopy for development and implementation of emerging quantum-spectroscopic sensing techniques. QE-MASS is currently implemented using the Mathcad software package.

Nguyen, Quang-Viet↗

NASA NTRS2010

Optimal and Local Connectivity Between Neuron and Synapse Array in the Quantum Dot/Silicon Brain

This innovation is used to connect between synapse and neuron arrays using nanowire in quantum dot and metal in CMOS (complementary metal oxide semiconductor) technology to enable the density of a brain-like connection in hardware. The hardware implementation combines three technologies: 1. Quantum dot and nanowire-based compact synaptic cell (50x50 sq nm) with inherently low parasitic capacitance (hence, low dynamic power approx.l0(exp -11) watts/synapse), 2. Neuron and learning circuits implemented in 50-nm CMOS technology, to be integrated with quantum dot and nanowire synapse, and 3. 3D stacking approach to achieve the overall numbers of high density O(10(exp 12)) synapses and O(10(exp 8)) neurons in the overall system. In a 1-sq cm of quantum dot layer sitting on a 50-nm CMOS layer, innovators were able to pack a 10(exp 6)-neuron and 10(exp 10)-synapse array; however, the constraint for the connection scheme is that each neuron will receive a non-identical 10(exp 4)-synapse set, including itself, via its efficacy of the connection. This is not a fully connected system where the 100x100 synapse array only has a 100-input data bus and 100-output data bus. Due to the data bus sharing, it poses a great challenge to have a complete connected system, and its constraint within the quantum dot and silicon wafer layer. For an effective connection scheme, there are three conditions to be met: 1. Local connection. 2. The nanowire should be connected locally, not globally from which it helps to maximize the data flow by sharing the same wire space location. 3. Each synapse can have an alternate summation line if needed (this option is doable based on the simple mask creation). The 10(exp 3)x10(exp 3)-neuron array was partitioned into a 10-block, 10(exp 2)x10(exp 3)-neuron array. This building block can be completely mapped within itself (10,000 synapses to a neuron).

Duong, Tuan A.↗

NASA NTRS2005

Scheme for Entering Binary Data Into a Quantum Computer

A quantum algorithm provides for the encoding of an exponentially large number of classical data bits by use of a smaller (polynomially large) number of quantum bits (qubits). The development of this algorithm was prompted by the need, heretofore not satisfied, for a means of entering real-world binary data into a quantum computer. The data format provided by this algorithm is suitable for subsequent ultrafast quantum processing of the entered data. Potential applications lie in disciplines (e.g., genomics) in which one needs to search for matches between parts of very long sequences of data. For example, the algorithm could be used to encode the N-bit-long human genome in only log2N qubits. The resulting log2N-qubit state could then be used for subsequent quantum data processing - for example, to perform rapid comparisons of sequences.

Williams, Colin↗

NASA NTRS2003

Quantum Search in Hilbert Space

A proposed quantum-computing algorithm would perform a search for an item of information in a database stored in a Hilbert-space memory structure. The algorithm is intended to make it possible to search relatively quickly through a large database under conditions in which available computing resources would otherwise be considered inadequate to perform such a task. The algorithm would apply, more specifically, to a relational database in which information would be stored in a set of N complex orthonormal vectors, each of N dimensions (where N can be exponentially large). Each vector would constitute one row of a unitary matrix, from which one would derive the Hamiltonian operator (and hence the evolutionary operator) of a quantum system. In other words, all the stored information would be mapped onto a unitary operator acting on a quantum state that would represent the item of information to be retrieved. Then one could exploit quantum parallelism: one could pose all search queries simultaneously by performing a quantum measurement on the system. In so doing, one would effectively solve the search problem in one computational step. One could exploit the direct- and inner-product decomposability of the unitary matrix to make the dimensionality of the memory space exponentially large by use of only linear resources. However, inasmuch as the necessary preprocessing (the mapping of the stored information into a Hilbert space) could be exponentially expensive, the proposed algorithm would likely be most beneficial in applications in which the resources available for preprocessing were much greater than those available for searching.

Zak, Michail↗

NASA NTRS2017

Quantum Approximate Optimization with Hard and Soft Constraints

Challenging computational problems arising in the practical world are frequently tackled by heuristic algorithms. Small universal quantum computers will emerge in the next year or two, enabling a substantial broadening of the types of quantum heuristics that can be investigated beyond quantum annealing. The immediate question is What experiments should we prioritize that will give us insight into quantum heuristics? One leading candidate is the quantum approximate optimization algorithm (QAOA) metaheuristic. Here, we provide a framework for designing QAOA circuits for a variety of combinatorial optimization problems with both hard constraints that must be met and soft constraints whose violation we wish to minimize. We work through a number of examples, and discuss design principles and implementation considerations.

Hadfield, Stuart↗

NASA NTRS2021

Quantum Computing to Accelerate High Fidelity Computational Materials Modeling

In this CIF we worked to develop quantum algorithms for material science simulations based on new ideas recently proposed on plane wave basis sets. Many body simulations are not generally performed in plane wave basis sets on classical hardware, but with newly proposed quantum algorithms, it is possible this will be a highly efficient basis set to run quantum simulations on quantum hardware. Using state of the art classical simulations we ran small test simulations to estimate the resources that will be needed to run such plane wave algorithms on quantum hardware. We demonstrate our approach for a series of atoms and molecular systems.

Norman Tubman↗

NASA NTRSDate not supplied

Accelerating the Deployment of Space-Based Quantum Sensors

Quantum sensors rely on quantum mechanical properties, such as wave-particle duality, atomic energy levels, or entanglement, to measure physical, optical, or electromagnetic information from a target. Examples include Rydberg sensors, nitrogen-vacancy magnetometers, HOM (Hong-Ou-Mandel) interferometers, and SQUIDs (Superconducting Quantum Interference Devices). In general, as quantum sensors rely on interrogation at the atomic and photonic level rather than on classical mechanical measurements, these technologies promise advantages over their traditional counterparts in sensitivity, accuracy, and SWaP (Size, Weight, and Power). Conceptually, the use of quantum sensors unlocks the new phenomenology of sensor entanglement. While an ultra-low TRL (Technology Readiness Level) prospect for most sensor types, multi-sensor entanglement is a high risk, high reward strategy with a potential for exquisite sensitivity and SWaP improvements entirely inaccessible to classical sensors.

Grace Caroline Wusk↗

DOE OSTI2024

Crossing The Gap Using Variational Quantum Eigensolver: A Comparative Study

Within the evolving domain of quantum computational chemistry, the Variational Quantum Eigensolver (VQE) has been developed to explore not only the ground state but also the excited states of molecules. In this study, we compare the performance of Variational Quantum Deflation (VQD) and Subspace-Search Variational Quantum Eigensolver (SSVQE) methods in determining the low-lying excited states of $LiH$. Our investigation reveals that while VQD exhibits a slight advantage in accuracy, SSVQE stands out for its efficiency, allowing the determination of all low-lying excited states through a single parameter optimization procedure. We further evaluate the effectiveness of optimizers, including Gradient Descent (GD), Quantum Natural Gradient (QNG), and Adam optimizer, in obtaining $LiH$'s first excited state, with the Adam optimizer demonstrating superior efficiency in requiring the fewest iterations. Moreover, we propose a novel approach combining Folded Spectrum VQE (FS-VQE) with either VQD or SSVQE, enabling the exploration of highly excited states. We test the new approaches for finding all three $H_4$'s excited states. Folded Spectrum SSVQE (FS-SSVQE) can find all three highly excited states near $-1.0$ Ha with only one optimizing procedure, but the procedure converges slowly. In contrast, although Folded spectrum VQD (FS-VQD) gets highly excited states with individual optimizing procedures, the optimizing procedure converges faster.

Chen, I-Chi↗

DOE OSTI2024

QFw: A Quantum Framework for Large-scale HPC Ecosystems

This work extends Quantum Framework (QFw) by integrating it with Northwest Quantum Simulator (NWQ-Sim) and by introducing a lightweight python library that allows multiple frontends (e.g., Qiskit) to interact with QFw. This extension enables QFw to flexibly decouple frontends from backends (e.g., NWQ-Sim). We demonstrate this capability by executing a Greenberger-Horne-Zeilinger (GHZ) circuit using Qiskit and Pennylane with NWQ-Sim and Tensor-Network Quantum Virtual-Machine (TN-QVM). QFw enables easy scaling to multiple nodes. We showcase this with scaling tests using GHZ with up to 32 qubits for different number of nodes on the Frontier supercomputer. And, to demonstrate the use of QFw for real world problems, we solve a metamaterial optimization problem, using a Quantum Approximate Optimization Algorithm (QAOA). We observe that QFw over NWQ-Sim marginally improves Qiskit-aer’s accuracy in reaching the lowest energy state. These additions to QFw prepare it to run hybrid applications in a hybrid resource environment since it treats actual quantum hardware and simulators alike.

Chundury, Srikar↗

DOE OSTI2025

Game Strategies for Entanglement Paths in Quantum Network Infrastructure

Entanglement distribution is a core function of quantum networks, and the paths used for this purpose are composed of quantum and conventional network components and are routed through physical facility sites. A game theoretic model is formulated for the defense of entanglement paths in a quantum network infrastructure by modeling the correlations and probabilities of reinforcement and failure of its components. A sum-form utility function is used to capture the cost-benefit trade-offs in reinforcing the entanglement path components to defend against their failures and attacks. Under Nash Equilibrium criteria, estimates of survival probabilities of entanglement paths are derived using the parameters and correlations of quantum, conventional, hybrid, and facility components. They provide insights into the dependencies of entanglement paths on its components, including cross-boundary effects of conventional, quantum, and facility components.

Rao, Nageswara [ORNL] (ORCID:0000000234085941)↗

DOE OSTI2025

Power and Limitations of Linear Programming Decoder for Quantum LDPC Codes

Decoding quantum error-correcting codes is a key challenge in enabling fault-tolerant quantum computation. In the classical setting, linear programming (LP) decoders offer provable performance guarantees and can leverage fast practical optimization algorithms. Although LP decoders have been proposed for quantum codes, their performance and limitations remain relatively underexplored. In this work, we uncover a key limitation of LP decoding for quantum low-density parity-check (LDPC) codes: certain constant-weight error patterns lead to ambiguous fractional solutions that cannot be resolved through independent rounding. To address this issue, we incorporate a post-processing technique known as ordered statistics decoding (OSD), which significantly enhances LP decoding performance in practice. Our results show that LP decoding, when augmented with OSD, can outperform belief propagation with the same post-processing for intermediate code sizes of up to hundreds of qubits. These findings suggest that LP-based decoders, equipped with effective post-processing, offer a promising approach for decoding near-term quantum LDPC codes.

Gu, Shouzhen [Yale U.]↗

DOE OSTI2025

Power and Limitations of Linear Programming Decoder for Quantum LDPC Codes

Gu, Shouzhen [Yale U.]↗

DOE OSTI2025

Power and Limitations of Linear Programming Decoder for Quantum LDPC Codes

Gu, Shouzhen [Yale U.]↗

DOE OSTI2025

Covariant Quantum Error-Correcting Codes with Metrological Entanglement Advantage

Here, we show that a subset of the basis for the irreducible representations of a tensor-product SU(2) rotation forms a covariant approximate quantum error-correcting code with transversal U(1) logical gates. Generalizing previous work on “thermodynamic codes” to general local spin and different irreducible representations using only properties of the angular momentum algebra, we obtain bounds on the code inaccuracy under generic noise on any known 𝑑 sites, under independent and identically distributed noise, and under heralded 𝑑-local erasures. We demonstrate that this family of codes protects a probe state with quantum Fisher information surpassing the standard quantum limit when the sensing parameter couples to the generator of the U(1) logical gate.

quantum error correction↗

DOE OSTI2024

Noncentrosymmetric Triangular Magnet CaMnTeO 6 : Strong Quantum Fluctuations and Role of s 0 versus s 2 Electronic States in Competing Exchange Interactions

Abstract Noncentrosymmetric triangular magnets offer a unique platform for realizing strong quantum fluctuations. However, designing these quantum materials remains an open challenge attributable to a knowledge gap in the tunability of competing exchange interactions at the atomic level. Here, a new noncentrosymmetric triangular S = 3/2 magnet CaMnTeO 6 is created based on careful chemical and physical considerations. The model material displays competing magnetic interactions and features nonlinear optical responses with the capability of generating coherent photons. The incommensurate magnetic ground state of CaMnTeO 6 with an unusually large spin rotation angle of 127°(1) indicates that the anisotropic interlayer exchange is strong and competing with the isotropic interlayer Heisenberg interaction. The moment of 1.39(1) µB , extracted from low‐temperature heat capacity and neutron diffraction measurements, is only 46% of the expected value of the static moment 3 µB . This reduction indicates the presence of strong quantum fluctuations in the half‐integer spin S = 3/2 CaMnTeO 6 magnet, which is rare. By comparing the spin‐polarized band structure, chemical bonding, and physical properties of AMnTeO 6 ( A = Ca, Sr, Pb), how quantum‐chemical interpretation can illuminate insights into the fundamentals of magnetic exchange interactions, providing a powerful tool for modulating spin dynamics with atomically precise control is demonstrated.

36 MATERIALS SCIENCE↗