Engineering Papers⌕ Search

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.

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

At least 19 records

Quantum Probability Cancellation Due to a Single-Photon State

When an N-photon state enters a lossless symmetric beamsplitter from one input port, the photon distribution for the two output ports has the form of Bernouli Binormial, with highest probability at equal partition (N/2 at one outport and N/2 at the other). However, injection of a single photon state at the other input port can dramatically change the photon distribution at the outputs, resulting in zero probability at equal partition. Such a strong deviation from classical particle theory stems from quantum probability amplitude cancellation. The effect persists even if the N-photon state is replaced by an arbitrary state of light. A special case is the coherent state which corresponds to homodyne detection of a single photon state and can lead to the measurement of the wave function of a single photon state.

Ou, Z. Y.↗

Simulations of Probabilities for Quantum Computing

It has been demonstrated that classical probabilities, and in particular, probabilistic Turing machine, can be simulated by combining chaos and non-LIpschitz dynamics, without utilization of any man-made devices (such as random number generators). Self-organizing properties of systems coupling simulated and calculated probabilities and their link to quantum computations are discussed.

Turing machines↗

A Path Towards Quantum Advantage in Training Deep Generative Models with Quantum Annealing

A class of quantum-classical hybrid machine-learning algorithms can be obtained by integrating classical deep generative models with quantum probability distributions as 'priors' over their latent variables. We introduce a hybrid implementation of variational autoencoders (QVAE) and also present a technique to hybridize flow-based invertible generative models. We demonstrate the use of D-Wave quantum annealers as physical simulators of quantum Boltzmann machines (QBM) to perform quantum-assisted training of QVAE. Latent-space QBM develop slowly mixing modes, opening a path to obtain quantum advantage in generative modeling with available quantum devices.

Vinci, Walter↗

Photoexcited escape probability, optical gain, and noise in quantum well infrared photodetectors

We present a detailed and thorough study of a wide variety of quantum well infrared photodetectors (QWIPs), which were chosen to have large differences in their optical and transport properties. Both n- and p-doped QWIPs, as well as intersubband transitions based on photoexcitation from bound-to-bound, bound-to-quasi-continuum, and bound-to-continuum quantum well states were investigated. The measurements and theoretical analysis included optical absorption, responsivity, dark current, current noise, optical gain, hot carrier mean free path; net quantum efficiency, quantum well escape probability, quantum well escape time, as well as detectivity. These results allow a better understanding of the optical and transport physics and thus a better optimization of the QWIP performance.

Levine, B. F.↗

Converged three-dimensional quantum mechanical reaction probabilities for the F + H2 reaction on a potential energy surface with realistic entrance and exit channels and comparisons to results for three other surfaces

Accurate three-dimensional quantum mechanical reaction probabilities are presented for the reaction F + H2 yields HF + H on the new global potential energy surface 5SEC for total angular momentum J = 0 over a range of translational energies from 0.15 to 4.6 kcal/mol. It is found that the v-prime = 3 HF vibrational product state has a threshold as low as for v-prime = 2.

Lynch, Gillian C.↗

Semicoherent symmetric quantum processes: Theory and applications

Discovering pragmatic and efficient approaches to construct ε-approximations of quantum operators such as real (imaginary) time-evolution propagators in terms of the basic quantum operations (gates) is challenging. Prior ε-approximations are invaluable, in that they enable the compilation of classical and quantum algorithm modeling of, e.g., dynamical and thermodynamic quantum properties. In parallel, symmetries are powerful tools concisely describing the fundamental laws of nature; the symmetric underpinnings of physical laws have consistently provided profound insights and substantially increased predictive power. In this work, we consider the interplay between the ε-approximate processes and the exact symmetries in a semicoherent context—where measurements occur at each logical clock cycle. Here we draw inspiration from Pascual Jordan's groundbreaking formulation of nonassociative, but commutative, symmetric algebraic form. Our symmetrized formalism is then applied in various domains such as quantum random walks, real-time evolutions, variational algorithm ansatzes, and efficient entanglement verification. Our work paves the way for a deeper understanding and greater appreciation of how symmetries can be used to control quantum dynamics in settings where coherence is a limited resource.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Dynamical Simulation of Probabilities

It has been demonstrated that classical probabilities, and in particular, probabilistic Turing machine, can be simulated by combining chaos and non-Lipschitz dynamics, without utilization of any man-made devices(such as random number generators). Self-orgainizing properties of systems coupling simulated and calculated probabilities and their link to quantum computations are discussed. Special attention was focused upon coupled stochastic processes, defined in terms of conditional probabilities, for which joint probability does not exist. Simulations of quantum probabilities are also discussed.

number generators quantum probabilities↗

Using Complex Probability Amplitudes to Simulate Solute Transport in Composite Porous Media

Probability amplitudes are fundamental to quantum mechanics and offer robust descriptions of complicated systems, which have allowed physicists to explain behaviors inaccessible to classical physics. This article ponders how some of the same conceptual underpinnings of the mathematics used for modeling quantum systems might be applied to subsurface water resources problems and speculates how these tools could facilitate applications on quantum computers. A probability amplitude-based model for describing advective-dispersive transport in porous media using linear operators is investigated. The proposed complex valued model decomposes spreading into two “sub-continuum partial dispersion” coefficients, and this recovers classical spreading when the sum of these coefficients is the Fickian dispersion coefficient. However, the probability amplitudes have a manyto-one relationship to a probability distribution, so it embeds a level of heterogeneity into seemingly equivalent functions. Two propagators with different sub-continuum coefficients may have the same macroscopic behavior when either is considered in isolation, but when they act on the other the system’s behavior changes. Additionally, differences in the amplitudes cause a reduction in spreading as velocity correlations are disrupted, despite both propagators having identical dispersion coefficients, and this cannot be achieved using classical methods without changing the dispersion coefficient. The main point is that these amplitude-based models offer a way to embed information about the system into the propagators, instead of just “averaging it out” when making an upscaled model.

54 ENVIRONMENTAL SCIENCES↗

Classical-Quantum Correspondence by Means of Probability Densities

Within the frame of the recently introduced phase space representation of non relativistic quantum mechanics, we propose a Lagrangian from which the phase space Schrodinger equation can be derived. From that Lagrangian, the associated conservation equations, according to Noether's theorem, are obtained. This shows that one can analyze quantum systems completely in phase space as it is done in coordinate space, without additional complications.

Vegas, Gabino Torres↗

Quantum Time-Space Tradeoffs for Matrix Problems

We consider the time and space required for quantum computers to solve a wide variety of problems involving matrices, many of which have only been analyzed classically in prior work. Our main results show that for a range of linear algebra problems—including matrix-vector product, matrix inversion, matrix multiplication and powering—existing classical time-space tradeoffs, several of which are tight for every space bound, also apply to quantum algorithms with at most a constant factor loss. For example, for almost all fixed matrices 𝐴, including the discrete Fourier transform matrix, we prove that quantum circuits with at most 𝑇 input queries and 𝑆 qubits of memory require 𝑇 = Ω⁢(𝑛 2 /𝑆) to compute matrix-vector product 𝐴⁢𝑥 for 𝑥 ∈{0,1 𝑛 . We similarly prove that matrix multiplication for 𝑛 ×𝑛 binary matrices requires 𝑇 = Ω⁢(𝑛 3 /$\sqrt{𝑆}$). Because many of our lower bounds are matched by deterministic algorithms with the same time and space complexity, our results show that quantum computers cannot provide any asymptotic advantage for these problems with any space bound. We obtain matching lower bounds for the stronger notion of quantum cumulative memory complexity—the sum of the space per layer of a circuit. We also consider Boolean (i.e., AND-OR) matrix multiplication and matrix-vector products, improving the previous quantum time-space tradeoff lower bounds for 𝑛 × 𝑛 Boolean matrix multiplication to 𝑇 = Ω⁢(𝑛 2.5 /𝑆 1/4 ) from 𝑇 = Ω⁢(𝑛 2.5 /𝑆 1/2 ). Our improved lower bound for Boolean matrix multiplication is based on a new coloring argument that extracts more from the strong direct product theorem that was the basis for prior work. To obtain our tight lower bounds for linear algebra problems, we require much stronger bounds than strong direct product theorems. We obtain these bounds by adding a new bucketing method to the quantum recording-query technique of Zhandry that lets us apply classical arguments to upper bound the success probability of quantum circuits.

lower bounds↗

Full‐dimensional coupled‐channel statistical approach to atom‐triatom systems and applications to H/D + O 3 reaction

Abstract The statistical quantum model (SQM), which assumes that the reactivity is controlled by entrance/exit channel quantum capture probabilities, is well suited for chemical reactions with a long‐lived intermediate complex. In this work, a time‐independent coupled‐channel implementation of the SQM approach is developed for atom‐triatom systems in full dimensionality. As SQM treats the capture dynamics quantum mechanically, it is capable of handling quantum effects such as tunneling. A detailed study of the H/D + O 3 capture dynamics was performed by applying the newly developed SQM method on an accurate global potential energy surface. Agreement with previous ring polymer molecular dynamics (RPMD) results on the same potential energy surface is excellent except for very low temperatures. The SQM results are also in reasonably good agreement with available experimental rate coefficients. The strong H/D kinetic isotope effect underscores the dominant role of quantum tunneling under an entrance channel barrier at low temperatures.

Yang, Dongzheng↗

Intrinsic nonlocality of spin- and polarization-resolved probabilities in strong-field quantum electrodynamics

Spin and polarization are central to precision tests of fundamental physics and for interpreting radiation from astrophysical sources and ultraintense laser-matter experiments. Here, focusing on the fundamental process of nonlinear Compton scattering, we demonstrate that a key assumption underlying current strong-field quantum electrodynamics models, i.e., that emission can be treated as an instantaneous random event sampled from a local differential rate, is inconsistent once emission angles, electron spin, and/or photon polarization are resolved. Namely, even in strictly constant and uniform fields , the resulting fully differential distribution is sign indefinite, yielding negative inferred probabilities. The physical reason is that the photon emission probability builds up over a finite length of the electron trajectory, the formation region, during which the electron direction changes by roughly the same small angle that defines the radiation cone. Therefore, we put forward a new method where we integrate over this formation region analytically to obtain a physically consistent electron spin and photon polarization model. We show that the implementation of our model is compatible with existing Monte Carlo and particle-in-cell workflows. Simulations of a GeV-class electron-laser collision accessible at current petawatt facilities and of emission in a pulsarlike magnetic field are shown to reveal spin and polarization patterns that differ even qualitatively from state-of-the-art local models. In particular, our new model predicts substantial angle-dependent circular photon polarization where the well-known collinear-emission approach yields none, and a pronounced helicity bias in the recoiling electrons absent from current predictions. These findings have direct implications for upcoming strong-field QED experiments and for interpreting polarized radiation from extreme astrophysical environments.

astrophysical electromagnetic fields↗

Generalized Wigner theorem for noninvertible symmetries

In this article, we establish the conditions under which a conservation law associated with a non-invertible operator may be realized as a symmetry in quantum physics. As established by Wigner, all quantum symmetries must be represented by either unitary or antiunitary transformations. Relinquishing an implicit assumption of invertibility, we demonstrate that the fundamental invariance of quantum transition probabilities under the application of symmetries mandates that all non-invertible symmetries may only correspond to projective unitary or antiunitary transformations, i.e., partial isometries. This extends the notion of physical states beyond conventional rays in Hilbert space to equivalence classes in an extended, gauged Hilbert space, thereby broadening the traditional understanding of symmetry transformations in quantum theory. Our generalized theorem applies irrespective of the origin of the (non)invertible symmetry, holds in arbitrary spatial dimensions, and is independent of the Hamiltonian or action. We explore its physical consequences and, using simple model systems, illustrate how the distinction between invertible and non-invertible symmetries can sometimes be tied to the choice of boundary conditions.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Non-commutative disintegrations: Existence and uniqueness in finite dimensions

Motivated by advances in categorical probability, we introduce non-commutative almost everywhere (a.e.) equivalence and disintegrations in the setting of C*-algebras. We show that C*-algebras (resp. W*-algebras) and a.e. equivalence classes of 2-positive (resp. positive) unital maps form a category. We prove non-commutative disintegrations are a.e. unique whenever they exist. We provide an explicit characterization for when disintegrations exist in the setting of finite-dimensional C*-algebras, and we give formulas for the associated disintegrations.

97 MATHEMATICS AND COMPUTING↗

Quantum Search Approaches to Sampling-Based Motion Planning

In this paper, we present a novel formulation of traditional sampling-based motion planners as database-oracle structures that can be solved via quantum search algorithms. We consider two complementary scenarios: for simpler sparse environments, we formulate the Quantum Full Path Search Algorithm (q-FPS), which creates a superposition of full random path solutions, manipulates probability amplitudes with Quantum Amplitude Amplification (QAA), and quantum measures a single obstacle free full path solution. For dense unstructured environments, we formulate the Quantum Rapidly Exploring Random Tree algorithm, q-RRT, that creates quantum superpositions of possible parent-child connections, manipulates probability amplitudes with QAA, and quantum measures a single reachable state, which is added to a tree. As performance depends on the number of oracle calls and the probability of measuring good quantum states, we quantify how these errors factor into the probabilistic completeness properties of the algorithm. We then numerically estimate the expected number of database solutions to provide an approximation of the optimal number of oracle calls in the algorithm. We compare the q-RRT algorithm with a classical implementation and verify quadratic run-time speedup in the largest connected component of a 2D dense random lattice. We conclude by evaluating a proposed approach to limit the expected number of database solutions and thus limit the optimal number of oracle calls to a given number.

97 MATHEMATICS AND COMPUTING↗