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 91 records · Page 5
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

Quantum simulations of dark sector showers

We consider dark sector scenarios where dark matter is accompanied by a dark photon and multiple-flavor dark fermions charged under the dark gauge group. We study quantum interference effects in dark sector jets, where multiple dark photons are emitted from high-energy dark fermions. We perform fully quantum simulations of dark sector showers and compare the results against those of the classical Monte-Carlo simulations. We find important differences in probability distributions of dark photon countings between quantum and classical computations. When the number of dark-fermion flavors is large, we find significant enhancements in large numbers of dark photon emissions. Such enhancements can provide distinguishing signals for our scenarios at particle colliders.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2021

Quantum circuit cutting with maximum-likelihood tomography

Abstract We introduce maximum-likelihood fragment tomography (MLFT) as an improved circuit cutting technique for running clustered quantum circuits on quantum devices with a limited number of qubits. In addition to minimizing the classical computing overhead of circuit cutting methods, MLFT finds the most likely probability distribution for the output of a quantum circuit, given the measurement data obtained from the circuit’s fragments. We demonstrate the benefits of MLFT for accurately estimating the output of a fragmented quantum circuit with numerical experiments on random unitary circuits. Finally, we show that circuit cutting can estimate the output of a clustered circuit with higher fidelity than full circuit execution, thereby motivating the use of circuit cutting as a standard tool for running clustered circuits on quantum hardware.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Perfect quantum state transfer on diamond fractal graphs

In the quest for designing novel protocols for quantum information and quantum computation, an important goal is to achieve perfect quantum state transfer for systems beyond the well-known one- dimensional cases, such as 1D spin chains. Here, we use methods from fractal analysis and probability to find a new class of quantum spin chains on fractal-like graphs (known as diamond fractals) which support perfect quantum state transfer and which have a wide range of different Hausdorff and spectral dimensions. The resulting systems are spin networks combining Dyson hierarchical model structure with transverse permutation symmetries of varying order.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Operator-level quantum acceleration of non-logconcave sampling

Sampling from probability distributions of the form 𝝈 ∝ e −𝜷V , where V is a continuous potential, is a fundamental task across physics, chemistry, biology, computer science, and statistics. However, when V is nonconvex, the resulting distribution becomes non-logconcave, and classical methods such as Langevin dynamics often exhibit poor performance. We introduce a quantum algorithm that provably accelerates a broad class of continuous-time sampling dynamics. For Langevin dynamics, our method encodes the target Gibbs measure into the amplitudes of aquantum state, identified as the kernel of a block matrix derived from a factorization of the Witten Laplacian operator. This connection enables Gibbs sampling via singular value thresholding and yields up to a quartic quantum speedup over best-knownclassical Langevin-based methods in the non-logconcave setting. Building on this framework, we further develop the first quantum algorithm that accelerates replica exchange Langevin diffusion, a widely used method for sampling from complex, rugged energy landscapes.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Geometric Event-Based Quantum Mechanics

In this work, we propose a special relativistic framework for quantum mechanics. It is based on introducing a Hilbert space for events. Events are taken as primitive notions (as customary in relativity), whereas quantum systems (e.g. fields and particles) are emergent in the form of joint probability amplitudes for position and time of events. Textbook relativistic quantum mechanics and quantum field theory can be recovered by dividing the event Hilbert spaces into space and time (a foliation) and then conditioning the event states onto the time part. Our theory satisfies the full Lorentz symmetry as a ‘geometric’ unitary transformation, and possesses relativistic observables for space (location of an event) and time (position in time of an event).

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
NASA NTRS1992

Going through a quantum phase

Phase measurements on a single-mode radiation field are examined from a system-theoretic viewpoint. Quantum estimation theory is used to establish the primacy of the Susskind-Glogower (SG) phase operator; its phase eigenkets generate the probability operator measure (POM) for maximum likelihood phase estimation. A commuting observables description for the SG-POM on a signal x apparatus state space is derived. It is analogous to the signal-band x image-band formulation for optical heterodyne detection. Because heterodyning realizes the annihilation operator POM, this analogy may help realize the SG-POM. The wave function representation associated with the SG POM is then used to prove the duality between the phase measurement and the number operator measurement, from which a number-phase uncertainty principle is obtained, via Fourier theory, without recourse to linearization. Fourier theory is also employed to establish the principle of number-ket causality, leading to a Paley-Wiener condition that must be satisfied by the phase-measurement probability density function (PDF) for a single-mode field in an arbitrary quantum state. Finally, a two-mode phase measurement is shown to afford phase-conjugate quantum communication at zero error probability with finite average photon number. Application of this construct to interferometric precision measurements is briefly discussed.

Shapiro, Jeffrey H.↗
DOE OSTI2026

Quantum Stochastic Programming [SWR-26-040]

The Quantum Stochastic Programming tool contains quantum computing algorithms for two-stage stochastic optimization, with a focus on the Unit Commitment (UC) problem in power systems. The algorithms combine Discrete Quantum Annealing (DQA) with Quantum Amplitude Estimation (QAE) to compute expected-value objective functions over a probability distribution of wind-power scenarios. Based on: arXiv 2402.15029 - "Quantum algorithms for the two-stage stochastic unit commitment problem"

Maack, Jonathan [National Laboratory of the Rockie↗
DOE OSTI2023

Learning Many-Body Hamiltonians with Heisenberg-Limited Scaling

Learning a many-body Hamiltonian from its dynamics is a fundamental problem in physics. Here, in this Letter, we propose the first algorithm to achieve the Heisenberg limit for learning an interacting N-qubit local Hamiltonian. After a total evolution time of $\mathscr{O}$⁡(ε –1 ), the proposed algorithm can efficiently estimate any parameter in the N-qubit Hamiltonian to ε error with high probability. Our algorithm uses ideas from quantum simulation to decouple the unknown N-qubit Hamiltonian H into noninteracting patches and learns H using a quantum-enhanced divide-and-conquer approach. The proposed algorithm is robust against state preparation and measurement error, does not require eigenstates or thermal states, and only uses polylog⁡(ε –1 ) experiments. In contrast, the best existing algorithms require $\mathscr{O}$⁡⁡(ε –2 ) experiments and total evolution time. We prove a matching lower bound to establish the asymptotic optimality of our algorithm.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2025

Ancilla-entangling Floquet kicks for accelerating quantum algorithms

Quantum simulation with adiabatic annealing can provide insight into difficult problems that are impossible to study with classical computers. However, it deteriorates when the systems scale up due to the shrinkage of the excitation gap and thus places an annealing rate bottleneck for high success probability. Here, in this study, we accelerate quantum simulation using digital multiqubit gates that entangle primary system qubits with ancillary qubits. The practical benefits originate from tuning the ancillary gauge degrees of freedom to enhance the quantum algorithm's original functionality in the system registry. For simple but nontrivial short-ranged, infinite long-ranged transverse-field Ising models, and the hydrogen molecule model after qubit encoding, we show improvement in the time to solution by one hundred percent but with higher accuracy through exact state-vector numerical simulation in a digital-analog setting. The findings are further supported by time-averaged Hamiltonian theory.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1980

Performance of a near-optimum receiver for optical antipodal signals

The well known photon-counting, heterodyning and homodyning optical receivers (operating over a free-space channel) do not achieve the performance of the optimum quantum receiver, which attains significantly lower error-probabilities than the above receiver structures. A demonstration and analysis are given of a binary antipodal optical receiver that exponentially approaches the performance of the optimum quantum receiver. A general mathematical model is developed, and subsequently used to evaluate the effects of external interference and internal error-sources on receiver performance.

Vilnrotter, V. A.↗
NASA NTRS1980

Tables of Transition Probabilities and Branching Ratios for Electric Dipole Transitions Between Arbitrary Levels of Hydrogen-Like Atoms

Branching ratios in hydrogen-like atoms due to electric-dipole transitions are tabulated for the initial principal and angular momentum quantum number n, lambda, and final principal and angular momentum quantum numbers n, lambda. In table 1, transition probabilities are given for transitions n, lambda, yields n, where sums have been made with respect to lambda. In this table, 2 or = n' or = 10, o or = lambda' or = n'-1, and 1 or = n or = n'-1. In addition, averages with respect to lambda' and sums with respect to n, and lifetimes are given. In table 2, branching ratios are given for transitions n' lambda' yields ni, where sums have been made with respect to lambda. In these tables, 2 or = n' or = 10, 0 or = lambda', n'-1, and 1 or = n or = n'-1. Averages with respect to lambda' are also given. In table 3, branching ratios are given for transitions n' lambda' yields in lambda, where 1 or = n or = 5, 0 or = lambda or = n-1, n n' or = 15, and 0 or = lambda' or = n(s), where n(s), is the smaller of the two numbers n'-1 and 6. Averages with respect to lambda' are given.

Omidvar, K.↗
DOE OSTI2022

Constrained quantum optimization for extractive summarization on a trapped-ion quantum computer

Abstract Realizing the potential of near-term quantum computers to solve industry-relevant constrained-optimization problems is a promising path to quantum advantage. In this work, we consider the extractive summarization constrained-optimization problem and demonstrate the largest-to-date execution of a quantum optimization algorithm that natively preserves constraints on quantum hardware. We report results with the Quantum Alternating Operator Ansatz algorithm with a Hamming-weight-preserving XY mixer (XY-QAOA) on trapped-ion quantum computer. We successfully execute XY-QAOA circuits that restrict the quantum evolution to the in-constraint subspace, using up to 20 qubits and a two-qubit gate depth of up to 159. We demonstrate the necessity of directly encoding the constraints into the quantum circuit by showing the trade-off between the in-constraint probability and the quality of the solution that is implicit if unconstrained quantum optimization methods are used. We show that this trade-off makes choosing good parameters difficult in general. We compare XY-QAOA to the Layer Variational Quantum Eigensolver algorithm, which has a highly expressive constant-depth circuit, and the Quantum Approximate Optimization Algorithm. We discuss the respective trade-offs of the algorithms and implications for their execution on near-term quantum hardware.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Motion Planning Algorithms for Safety and Quantum Computing Efficiency

Motion planning remains a fundamental problem in robotics. Sampling-based algorithms use randomization to allow efficient solutions to this complex problem. As mobile robots and autonomous vehicles become more prevalent in everyday life, motion planning must be applied to increasingly challenging scenarios. Safety has become a paramount concern in motion planning for ensuring robotic applications enrich human lives. To date, many motion planning techniques to increase safety in the face of uncertain and dynamic environments have been developed. This dissertation first addresses distributional safety of Rapidly-Exploring Random Trees (RRT) through our algorithm W-Safe RRT. To acknowledge distributional uncertainty and poor modeling, W-Safe RRT uses the Wasserstein metric to provide a probabilistic bound on the distributional distance between a robot and obstacles. Human-interpretable environmental agent classification allows online safety margin adaptation. We propose and analyze an integrating region method for online classification that increases actor labeling accuracy based on behavioral feature values when compared to state of the art methods. The method performs class assignments based on local maximum likelihood in a created behavioral feature-space, allowing a notion of classification uncertainty. Model-based methods with safety guarantees can quickly become computationally in tractable, especially with multiple agents, higher dimensions, and plentiful unknowns. Sampling based algorithms have been parallelized for computation with multi-core computers and GPUs. We consider the use of quantum algorithms and computers for sampling-based motion planning for the first time. Quantum computing performs operations on superpositions of states and can solve certain problems much more efficiently than classical computers, but introduces previously unseen challenges. With Quantum-RRT, we recast the motion planning problem into a database-search structure and use Quantum Amplitude Amplification to find reachable states in the database with a quadratic performance increase over classical methods. We address two error sources with this method: quantum measurement and quantum oracle errors. We then extend this method to Parallel Quantum-RRT, which uses a manager-worker architecture with multiple parallel quantum workers to increase database search efficiency. We compare algorithm architectures and characterize probabilities of multiple workers finding solutions. Lastly, we test in simulation the quantum algorithms against classical versions in a wide variety of scenarios, concluding that a similar parallelization improvement is to be found in the quantum case as was found in the parallelization of classical RRT.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Exact and Fixed-Point Grover Search with Qudits

Grover's algorithm provides a quadratic speedup for searching unstructured databases and is traditionally implemented with qubits in Hilbert spaces whose dimensions are powers of two. With the advent of quantum platforms utilizing qudits---quantum systems with more than two levels---there is a need to generalize Grover search to these architectures, including heterogeneous systems with qudits of varying dimensions. Here, we present a unified framework for qudit-based Grover search, detailing the construction of oracles and diffusion operators with and without ancilla qubits and generalizing deterministic and fixed-point search variants that ensure exact or bounded success probabilities. We analyze phase-matching techniques and provide explicit circuit decompositions suitable for diverse hardware platforms. We also compare the corresponding trajectories on the Bloch sphere to provide an intuitive visualization of how the different phase choices amplify the target state. These results facilitate flexible, hardware-oriented protocols for implementing Grover search on qudit processors, potentially reducing circuit depth and enhancing success probabilities, thereby offering a practical toolkit for quantum computation and sensing applications leveraging multilevel quantum systems.

Roy, Tanay [Fermilab] (ORCID:000000019442862X)↗
DOE OSTI2021

Distinct critical behaviors from the same state in quantum spin and population dynamics perspectives

There is a deep connection between the ground states of transverse-field spin systems and the late-time distributions of evolving viral populations—within simple models, both are obtained from the principal eigenvector of the same matrix. However, that vector is the wave-function amplitude in the quantum spin model, whereas it is the probability itself in the population model. We show that this seemingly minor difference has significant consequences: Phase transitions that are discontinuous in the spin system become continuous when viewed through the population perspective, and transitions that are continuous become governed by new critical exponents. We introduce a more general class of models that encompasses both cases and that can be solved exactly in a mean-field limit. Numerical results are also presented for a number of one-dimensional chains with power-law interactions. We see that well-worn spin models of quantum statistical mechanics can contain unexpected new physics and insights when treated as population-dynamical models and beyond, motivating further studies.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
NASA NTRS1992

Proposal for a QND which-path measurement using photons

A scheme is proposed for experimentally realizing the famous two-slit gedaenken experiment using photons. As elegantly discussed for electrons by Feynman, a particle's quantum pathways interfere to produce fringes in the probability density for the particle to be found at a particle location. If the path taken by the particle is experimentally determined, the complementarity principle says that the fringes must disappear. To carry out this experiment with photons is difficult because normally the act of determining a photon's location destroys it. We propose to overcome this difficulty by putting a type-2 optical parametric amplifier (OPA) in each arm of a Mach-Zehnder interferometer, and observing fringes at the output. An OPA responds to an input photon by increasing its probability to produce a pair of photons with polarization orthogonal to the input, the detection of which allows partial inference about the path taken by the input photon without destroying it. Thus, the measurement is of the quantum nondemolition (QND) type.

Raymer, M. G.↗
NASA NTRS1985

Activated recombinative desorption: A potential component in mechanisms of spacecraft glow

The concept of activated recombination of atomic species on surfaces can explain the production of vibrationally and translationally excited desorbed molecular species. Equilibrium statistical mechanics predicts that the molecular quantum state distributions of desorbing molecules is a function of surface temperature only when the adsorption probability is unity and independent of initial collision conditions. In most cases, the adsorption probability is dependent upon initial conditions such as collision energy or internal quantum state distribution of impinging molecules. From detailed balance, such dynamical behavior is reflected in the internal quantum state distribution of the desorbing molecule. This concept, activated recombinative desorption, may offer a common thread in proposed mechanisms of spacecraft glow. Using molecular beam techniques and equipment available at Los Alamos, which includes a high translational energy 0-atom beam source, mass spectrometric detection of desorbed species, chemiluminescence/laser induced fluorescence detection of electronic and vibrationally excited reaction products, and Auger detection of surface adsorbed reaction products, a fundamental study of the gas surface chemistry underlying the glow process is proposed.

Cross, J. B.↗