SEARCH · Engineering Papers

Results for “quantum probability”

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 145 records · Page 8

All sources NASA NTRS DOE OSTI

DOE OSTI2023

Recommended Nuclear Structure and Decay Data for A = 200 Isobars

Evaluated nuclear structure and decay data for all nuclei with mass number A = 200 ( 200 Os, 200 Ir, 200 Pt, 200 Au, 200 Hg, 200 Tl, 200 Pb, 200 Bi, 200 Po, 200 At, 200 Rn, and 200 Fr), are presented. All available experimental data are compiled and evaluated, and best values for level and gamma-ray energies, quantum numbers, lifetimes, gamma-ray intensities and transition probabilities, as well as other nuclear properties, are recommended. Inconsistencies and discrepancies that exist in the literature are discussed. A number of computer codes (https://www-nds.iaea.org/public/ensdf pgm/) developed by members of the NSDD network were used during the evaluation process. In conclusion, this work supersedes the earlier evaluation by F.G. Kondev and S. Lalkovski (2007Ko42), published in Nuclear Data Sheets 108, 1471 (2007).

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

DOE OSTI2025

Recommended Nuclear Structure and Decay Data for A=206 Isobars

Here, evaluated nuclear structure and decay data for all nuclei with mass number A=206 ( 206 Pt, 206 Au, 206 Hg, 206 Tl, 206 Pb, 206 Bi, 206 Po, 206 At, 206 Rn, 206 Fr, 206 Ra and 206 Ac), are presented. All available experimental data are compiled and evaluated, and best values for level and γ-ray energies, quantum numbers, lifetimes, γ-ray intensities and transition probabilities, as well as other nuclear properties, are recommended. Inconsistencies and discrepancies that exist in the literature are discussed. A number of computer codes (https://www-nds.iaea.org/public/ensdf_pgm/) developed by members of the NSDD network were used during the evaluation process. This work supersedes the earlier evaluation by F.G. Kondev (2008Ko21), published in Nuclear Data Sheets 109, 1527 (2008).

Kondev, F. G. [Argonne National Laboratory (ANL), ↗

NASA NTRS1993

The nature and role of quantized transition states in the accurate quantum dynamics of the reaction O + H2 yields OH + H

Accurate quantum mechanical dynamics calculations are reported for the reaction probabilities of O(3P) + H2 yields OH + H with zero total angular momentum on a single potential energy surface. The results show that the reactive flux is gated by quantized transition states up to the highest energy studied, which corresponds to a total energy of 1.90 eV. The quantized transition states are assigned and compared to vibrationally adiabatic barrier maxima; their widths and transmission coefficients are determined; and they are classified as variational, supernumerary of the first kind, and supernumerary of the second kind. Their effects on state-selected and state-to-state reactivity are discussed in detail.

Chatfield, David C.↗

DOE OSTI2022

Applying Quantum Tomography to Hadronic Interactions

A proper description of inclusive reactions is expressed with density matrices. Quantum tomography reconstructs density matrices from experimental observables. We review recent work that applies quantum tomography to practical experimental data analysis. Almost all field-theoretic formalism and modeling used in a traditional approach is circumvented with great efficiency. Tomographically-determined density matrices can express information about quantum systems which cannot in principle be expressed with distributions defined by classical probability. Topics such as entanglement and von Neumann entropy can be accessed using the same natural language where they are defined. A deep relation exists between separability, as defined in quantum information science, and factorization, as defined in high energy physics. Factorization acquires a non-perturbative definition when expressed in terms of a conditional form of separability. An example illustrates how to go from data for momentum 4-vectors to a density matrix while bypassing almost all the formalism of the Standard Model.

Martens, J. C.↗

DOE OSTI2020

Is the Kok effect a respiratory phenomenon? Metabolic insight using 13 C labeling in Helianthus annuus leaves

The Kok effect is a well-known phenomenon in which the quantum yield of photosynthesis changes abruptly at low light. This effect has often been interpreted as a shift in leaf respiratory metabolism and thus used widely to measure day respiration. However, there is still no formal evidence that the Kok effect has a respiratory origin. Here, both gas exchange and isotopic labeling were carried out on sunflower leaves, using glucose that was 13 C-enriched at specific C-atom positions. Position-specific decarboxylation measurements and NMR analysis of metabolites were used to trace the fate of C-atoms in metabolism. Decarboxylation rates were significant at low light (including above the Kok break point) and increased with decreasing irradiance below 100 µmol photons m –2 s –1 . The variation in several metabolite pools such as malate, fumarate or citrate, and flux calculations suggest the involvement of several decarboxylating pathways in the Kok effect, including the malic enzyme. Our results show that day respiratory CO 2 evolution plays an important role in the Kok effect. Furthermore, the increase in the apparent quantum yield of photosynthesis below the Kok break point is also probably related to malate metabolism, which participates in maintaining photosynthetic linear electron flow.

54 ENVIRONMENTAL SCIENCES↗

NASA NTRSDate not supplied

Quantum Distributed Algorithms for Approximate Steiner Trees and Directed Minimum Spanning Trees

We present two algorithms in the Quantum CONGEST- CLIQUE model of distributed computation that succeed with high probability; one for producing an approximately optimal Steiner Tree, and one for producing an exact directed minimum spanning tree, each of which uses O ̃(n1/4) rounds of communication and O ̃(n9/4) messages, achieving a lower asymptotic round and message complexity than any known algorithms in the classical CONGEST-CLIQUE model. At a high level, we achieve these results by combining classical algorithms with fast quantum subroutines. Additionally, we characterize the constants and logarithmic factors involved in our algorithms, as well as related classical algorithms, revealing that advances are needed to render both practical.

quantum computing↗

DOE OSTI2024

Entanglement-Enhanced Neyman-Pearson Target Detection

Quantum illumination (QI) provides entanglement-enabled target-detection enhancement, despite operating in an entanglement-breaking environment. Existing experimental studies of QI have utilized a Bayesian approach, assuming that the target is equally likely to be present or absent before detection, to demonstrate an advantage over classical target detection. However, such a premise breaks down in practical operational scenarios in which the prior probability is unknown, thereby hindering QI's applicability to real-world target-detection scenarios. In this work, we adopt the Neyman-Pearson criterion in lieu of the error probability for equally likely target absence or presence as our figure of merit for QI. We demonstrate an unconditional quantum advantage over the optimal classical-illumination protocol as benchmarked by the receiver operating characteristic, which examines detection probability versus false-alarm probability without resorting to known prior probabilities. Our work represents a critical advancement in adapting quantum-enhanced sensing to practical operational settings.

Ward, William↗

NASA NTRSDate not supplied

Quantum Distributed Algorithms for Approximate Steiner Trees and Directed Minimum Spanning Trees

We present two algorithms in the Quantum CONGEST- CLIQUE model of distributed computation that succeed with high probability; one for producing an approximately optimal Steiner Tree, and one for producing an exact directed minimum spanning tree, each of which uses O ̃(n 1/4 ) rounds of communication and O ̃(n 9/4 ) messages, achieving a lower asymptotic round and message complexity than any known algorithms in the classical CONGEST-CLIQUE model. At a high level, we achieve these results by combining classical algorithms with fast quantum subroutines. Additionally, we characterize the constants and logarithmic factors involved in our algorithms, as well as related classical algorithms, revealing that advances are needed to render both practical.

quantum computing↗

DOE OSTI2026

An efficient explicit implementation of a near-optimal quantum algorithm for simulating linear dissipative differential equations

We propose an efficient block-encoding technique for the implementation of the Linear Combination of Hamiltonian Simulations (LCHS) for simulating dissipative initial-value problems. This algorithm approximates a target nonunitary operator as a weighted sum of Hamiltonian evolutions, thereby emulating a dissipative problem by mixing various time scales. We introduce an efficient encoding of the LCHS into a quantum circuit based on a simple coordinate transformation that turns the dependence on the summation index into a trigonometric function. Classically, this method is equivalent to the use of a highly accurate Fejér-Clenshaw-Curtis quadrature formula. Quantumly, this significantly simplifies block-encoding of a dissipative problem and allows one to perform an exponential number of Hamiltonian simulations by a single Quantum Signal Processing (QSP) circuit. The resulting LCHS circuit has high success probability and the selector scales logarithmically with the number of terms in the LCHS sum and linearly with time. Careful analysis of error convergence proves that this method is more efficient than other LCHS circuits that have recently appeared in the literature. We verify the quantum circuit and its scaling by simulating it on a digital emulator of fault-tolerant quantum computers and, as a test problem, solve the advection-diffusion equation. The proposed algorithm can be used for simulating a wide class of nonunitary initial-value problems including the Liouville equation with added dissipation and linear embeddings of nonlinear systems, such as the Koopman-von Neumann and Carleman embeddings.

Novikau, I [Lawrence Livermore National Laboratory↗

DOE OSTI2023

A Practical Approach to Wave Function Propagation, Hopping Probabilities, and Time Steps in Surface Hopping Calculations

We compare several established approaches for propagating wave functions and calculating hopping probabilities within the fewest switches surface hopping (FSSH) algorithm for difficult cases with many electronic states and many trivial crossings. If only a single time step (Δt c ) is employed, we find that no published approach can accurately capture the dynamics correctly unless Δt c → 0 (which is not computationally feasible). If multiple time steps are employed, for a fixed classical time step (Δt c ), a robust scheme can be found for dynamically choosing quantum time steps (δt q1 and δt q2 ) and calculating hopping probabilities so that one can systematically reduce all errors and achieve maximally efficient accuracy; scattering calculations confirm that one can choose a fairly large classical time step. Furthermore, the robust scheme presented here uses both the “local diabatic” and adiabatic interpolation and thus borrows elements from both the Granucci/Persico and Meek/Levine algorithms. Our findings should be broadly applicable in the future.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

DOE OSTI2021

Beyond the universal Dyson singularity for 1-D chains with hopping disorder

We study a simple non-interacting nearest neighbor tight-binding model in one dimension with disorder, where the hopping terms are chosen randomly. This model exhibits a well-known singularity at the band center both in the density of states and localization length. If the probability distribution of the hopping terms is well-behaved, then the singularities exhibit universal behavior, the functional form of which was first discovered by Freeman Dyson in the context of a chain of classical harmonic oscillators. We show here that this universal form can be violated in a tunable manner if the hopping elements are chosen from a divergent probability distribution. We also demonstrate a connection between a breakdown of universality in this quantum problem and an analogous scenario in the classical domain — that of random walks and diffusion with anomalous exponents.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2022

Lossless Quantum Hard-Drive Memory Using Parity-Time Symmetry

We theoretically studied the feasibility of building a long-term read-write quantum memory using the principle of parity-time (PT) symmetry, which has already been demonstrated for classical systems. The design consisted of a two-resonator system. Although both resonators would feature intrinsic loss, the goal was to apply a driving signal to one of the resonators such that it would become an amplifying subsystem, with a gain rate equal and opposite to the loss rate of the lossy resonator. Consequently, the loss and gain probabilities in the overall system would cancel out, yielding a closed quantum system. Upon performing detailed calculations on the impact of a driving signal on a lossy resonator, our results demonstrated that an amplifying resonator is physically unfeasible, thus forestalling the possibility of PT-symmetric quantum storage. Our finding serves to significantly narrow down future research into designing a viable quantum hard drive.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2026

Path-integral predictions for preasymptotic quantum tunneling

When tunneling occurs out of generic initial states, a significant fraction of probability is lost at early times, during which the dynamics is governed by excited resonance states. However, first-principles analyses based on path-integrals have only captured the leading asymptotic behavior, during which the tunneling rate is dominated by the false vacuum contribution. In this work, we discuss the behavior in the preasymptotic regime from a first-principles path-integral perspective. We demonstrate how the relevant expressions can be evaluated systematically through semiclassical methods in the recently developed steadyon picture. This approach allows one to trace the role of the relevant physical scales, making transparent the underlying assumptions and approximations, and offering a clear path to establishing a systematically improvable framework to evaluate tunneling rates nonperturbatively.

Lin, Joshua↗

NASA NTRS2008

Quantum-Inspired Maximizer

A report discusses an algorithm for a new kind of dynamics based on a quantum- classical hybrid-quantum-inspired maximizer. The model is represented by a modified Madelung equation in which the quantum potential is replaced by different, specially chosen 'computational' potential. As a result, the dynamics attains both quantum and classical properties: it preserves superposition and entanglement of random solutions, while allowing one to measure its state variables, using classical methods. Such optimal combination of characteristics is a perfect match for quantum-inspired computing. As an application, an algorithm for global maximum of an arbitrary integrable function is proposed. The idea of the proposed algorithm is very simple: based upon the Quantum-inspired Maximizer (QIM), introduce a positive function to be maximized as the probability density to which the solution is attracted. Then the larger value of this function will have the higher probability to appear. Special attention is paid to simulation of integer programming and NP-complete problems. It is demonstrated that the problem of global maximum of an integrable function can be found in polynomial time by using the proposed quantum- classical hybrid. The result is extended to a constrained maximum with applications to integer programming and TSP (Traveling Salesman Problem).

Zak, Michail↗

DOE OSTI2022

Training a Quantum Annealing Based Restricted Boltzmann Machine on Cybersecurity Data

A restricted Boltzmann machine (RBM) is a generative model that could be used in effectively balancing a cybersecurity dataset because the synthetic data a RBM generates follows the probability distribution of the training data. RBM training can be performed using contrastive divergence (CD) and quantum annealing (QA). QA-based RBM training is fundamentally different from CD and requires samples from a quantum computer. We present a real-world application that uses a quantum computer. Specifically, we train a RBM using QA for cybersecurity applications. The D-Wave 2000Q has been used to implement QA. RBMs are trained on the ISCX data, which is a benchmark dataset for cybersecurity. For comparison, RBMs are also trained using CD. CD is a commonly used method for RBM training. Our analysis of the ISCX data shows that the dataset is imbalanced. We present two different schemes to balance the training dataset before feeding it to a classifier. The first scheme is based on the undersampling of benign instances. The imbalanced training dataset is divided into five sub-datasets that are trained separately. A majority voting is then performed to get the result. Our results show the majority vote increases the classification accuracy up from 90.24% to 95.68%, in the case of CD. For the case of QA, the classification accuracy increases from 74.14% to 80.04%. In the second scheme, a RBM is used to generate synthetic data to balance the training dataset. We show that both QA and CD-trained RBM can be used to generate useful synthetic data. Balanced training data is used to evaluate several classifiers. Among the classifiers investigated, K-Nearest Neighbor (KNN) and Neural Network (NN) perform better than other classifiers. They both show an accuracy of 93%. Our results show a proof-of-concept that a QA-based RBM can be trained on a 64-bit binary dataset. The illustrative example suggests the possibility to migrate many practical classification problems to QA-based techniques. Further, we show that synthetic data generated from a RBM can be used to balance the original dataset.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2020

A practical and efficient approach for Bayesian quantum state estimation

Bayesian inference is a powerful paradigm for quantum state tomography, treating uncertainty in meaningful and informative ways. Yet the numerical challenges associated with sampling from complex probability distributions hampers Bayesian tomography in practical settings. In this article, we introduce an improved, self-contained approach for Bayesian quantum state estimation. Leveraging advances in machine learning and statistics, our formulation relies on highly efficient preconditioned Crank–Nicolson sampling and a pseudo-likelihood. We theoretically analyze the computational cost, and provide explicit examples of inference for both actual and simulated datasets, illustrating improved performance with respect to existing approaches.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2024

Search for charge non-conservation and Pauli exclusion principle violation with the M AJORANA D EMONSTRATOR

Charge conservation and the Pauli exclusion principle result from fundamental symmetries in the standard model of particle physics, and are typically taken as axiomatic. High-precision tests for small violations of these symmetries could point to new physics. Here we consider three models for violation of these processes, which would produce detectable ionization in the high-purity germanium detectors of the M AJORANA D EMONSTRATOR experiment. Using a 37.5 kg yr exposure, we report a lower limit on the electron mean lifetime, improving the previous best limit for the e → v e $\overline{v_e}$ v e decay channel by more than an order of magnitude. Here, we also present searches for two types of violation of the Pauli exclusion principle, setting limits on the probability of an electron to be found in a symmetric quantum state.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

NASA NTRS1989

Superaromatics: The key to a unified cosmic dust theory

The theory of Superaromatics, the key to a unified cosmic dust theory, was constructed by analyzing several thousand astronomical features covering every major aspect of astrophysics and astrochemistry relating to dust. To insure consistency between disciplines, the logical structure of the conclusions in each field was checked rather than accepting the current consensus. No substantial contradictory features are known to the author. The analysis falls into seven major parts: (1) kinetics of grain formation and destruction; (2) optical spectra of the interstellar medium (ISM); (3) meteorite interplanetary dust particle (IPD) chemistry; (4) structure and chemistry of the interstellar medium arising from surface catalysis; (6) dynamics of circumstellar and interstellar dust clouds, including galactic morphology; and (7) the chemistry and physics of previously unidentified compounds. Only tentative conclusions are presented here. The principle conclusion is that quantum mechanics as it is normally formulated is incomplete. The probable cause is that it is formulated with complex numbers rather than the more fundamental quaternion system. The manifestation in astrochemistry is that the most stable compounds are superaromatic and exotic enough to confound most classical analysis.

Manuel, Lawrence R.↗