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 361 records · Page 20

Nonlocal subpicosecond delay metrology using spectral quantum interference

Precise knowledge of position and timing information is critical to support elementary protocols such as entanglement swapping on quantum networks. While approaches have been devised to use quantum light for such metrology, they largely rely on time-of-flight (ToF) measurements with single-photon detectors and, therefore, are limited to picosecond-scale resolution owing to detector jitter. In this work, we demonstrate an approach to distributed sensing that leverages phase modulation to map changes in the spectral phase to coincidence probability, thereby overcoming the limits imposed by single-photon detection. By extracting information about the joint biphoton phase, we measure a generalized delay—the difference in signal–idler arrival, relative to local radio frequency (RF) phase modulation. For nonlocal ranging measurements, we achieve (2$σ$) precision of ±0.04 ps and for measurements of the relative RF phase, (2$σ$) precision of ±0.7°. We complement this fine timing information with ToF data from single-photon time-tagging to demonstrate absolute measurement of time delay. By relying on off-the-shelf telecommunications equipment and standard quantum resources, this approach has the potential to reduce overhead in practical quantum networks.

42 ENGINEERING↗

Television photometry - The Mariner 9 experience

Television photometry is compared to conventional techniques. Reduced data from Mariner 9 cameras should, under optimum conditions, have been accurate to a few percent. However, a combination of unstable camera properties and various unfortunate circumstances produced serious nonlinearities and other systematic errors. The means of estimating these errors are described in detail; they lean heavily on the fortuitous presence of a few specks of dust on the faceplate of one vidicon. Crude corrections will probably improve the photometric quality for the two most-used filter positions of the A camera. It would be very difficult to improve the photometry further. In view of their low photometric accuracy and detective quantum efficiency vidicons do not seem likely to replace conventional photography, except for special applications.

Young, A. T.↗

Application of Simulated Annealing and Related Algorithms to TWTA Design

Simulated Annealing (SA) is a stochastic optimization algorithm used to search for global minima in complex design surfaces where exhaustive searches are not computationally feasible. The algorithm is derived by simulating the annealing process, whereby a solid is heated to a liquid state and then cooled slowly to reach thermodynamic equilibrium at each temperature. The idea is that atoms in the solid continually bond and re-bond at various quantum energy levels, and with sufficient cooling time they will rearrange at the minimum energy state to form a perfect crystal. The distribution of energy levels is given by the Boltzmann distribution: as temperature drops, the probability of the presence of high-energy bonds decreases. In searching for an optimal design, local minima and discontinuities are often present in a design surface. SA presents a distinct advantage over other optimization algorithms in its ability to escape from these local minima. Just as high-energy atomic configurations are visited in the actual annealing process in order to eventually reach the minimum energy state, in SA highly non-optimal configurations are visited in order to find otherwise inaccessible global minima. The SA algorithm produces a Markov chain of points in the design space at each temperature, with a monotonically decreasing temperature. A random point is started upon, and the objective function is evaluated at that point. A stochastic perturbation is then made to the parameters of the point to arrive at a proposed new point in the design space, at which the objection function is evaluated as well. If the change in objective function values (Delta)E is negative, the proposed new point is accepted. If (Delta)E is positive, the proposed new point is accepted according to the Metropolis criterion: rho((Delta)f) = exp((-Delta)E/T), where T is the temperature for the current Markov chain. The process then repeats for the remainder of the Markov chain, after which the temperature is decremented and the process repeats. Eventually (and hopefully), a near-globally optimal solution is attained as T approaches zero. Several exciting variants of SA have recently emerged, including Discrete-State Simulated Annealing (DSSA) and Simulated Tempering (ST). The DSSA algorithm takes the thermodynamic analogy one step further by categorizing objective function evaluations into discrete states. In doing so, many of the case-specific problems associated with fine-tuning the SA algorithm can be avoided; for example, theoretical approximations for the initial and final temperature can be derived independently of the case. In this manner, DSSA provides a scheme that is more robust with respect to widely differing design surfaces. ST differs from SA in that the temperature T becomes an additional random variable in the optimization. The system is also kept in equilibrium as the temperature changes, as opposed to the system being driven out of equilibrium as temperature changes in SA. ST is designed to overcome obstacles in design surfaces where numerous local minima are separated by high barriers. These algorithms are incorporated into the optimal design of the traveling-wave tube amplifier (TWTA). The area under scrutiny is the collector, in which it would be ideal to use negative potential to decelerate the spent electron beam to zero kinetic energy just as it reaches the collector surface. In reality this is not plausible due to a number of physical limitations, including repulsion and differing levels of kinetic energy among individual electrons. Instead, the collector is designed with multiple stages depressed below ground potential. The design of this multiple-stage collector is the optimization problem of interest. One remaining problem in SA and DSSA is the difficulty in determining when equilibrium has been reached so that the current Markov chain can be terminated. It has been suggested in recent literature that simulating the thermodynamic properties opecific heat, entropy, and internal energy from the Boltzmann distribution can provide good indicators of having reached equilibrium at a certain temperature. These properties are tested for their efficacy and implemented in SA and DSSA code with respect to TWTA collector optimization.

Radke, Eric M.↗

Exact block encoding of imaginary time evolution with universal quantum neural networks

We develop a constructive approach to generate quantum neural networks capable of representing the exact thermal states of all many-body qubit Hamiltonians. The Trotter expansion of the imaginary time propagator is implemented through an exact block encoding by means of a unitary, restricted Boltzmann machine architecture. Marginalization over the hidden-layer neurons (auxiliary qubits) creates the nonunitary action on the visible layer. Then, we introduce a unitary deep Boltzmann machine architecture in which the hidden-layer qubits are allowed to couple laterally to other hidden qubits. We prove that this wave-function is closed under the action of the imaginary time propagator and, more generally, can represent the action of a universal set of quantum gate operations. We provide analytic expressions for the coefficients for both architectures, thus enabling exact network representations of thermal states without stochastic optimization of the network parameters. In the limit of large imaginary time, the yields the ground state of the system. The number of qubits grows linearly with the number of interactions and total imaginary time for a fixed interaction order. Both networks can be readily implemented on quantum hardware via midcircuit measurements of auxiliary qubits. If only one auxiliary qubit is measured and reset, the circuit depth scales linearly with imaginary time and number of interactions, while the width is constant. Alternatively, one can employ a number of auxiliary qubits linearly proportional to the number of interactions, and circuit depth grows linearly with imaginary time only. Every midcircuit measurement has a postselection success probability, and the overall success probability is equal to the product of the probabilities of the midcircuit measurements.

97 MATHEMATICS AND COMPUTING↗

QuGrav: Bringing gravitational waves to light with qumodes

We propose using qumodes, quantum bosonic modes, for detecting high-frequency gravitational waves via the inverse Gertsenshtein effect, where a gravitational wave resonantly converts into a single photon in a magnetized cavity. For an occupation number n of the photon field in a qumode, the conversion probability is enhanced by a factor of n + 1 due to Bose-Einstein statistics. Unlocking this increased sensitivity entails the ability to continuously prepare the qumode and perform nondemolition measurement on the qumode-qubit system within the qumode coherence time. Our results indicate that, at microwave frequencies and with existing technology, the proposed setup can attain sensitivities within 1.7 orders of magnitude of the cosmological bound. With anticipated near-future improvements, it has the potential to surpass this limit and pave the way for the first exploration of high-frequency cosmological gravitational wave backgrounds. At optical frequencies, it can enhance the sensitivity of current detectors by one order of magnitude. That further enhances their potential in reaching the single-graviton level.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

A study of events with photoelectric emission in the DarkSide-50 liquid argon Time Projection Chamber

Finding unequivocal evidence of dark matter interactions in a particle detector is a major goal of research in physics. Liquid argon time projection chambers offer a path to probe Weakly Interacting Massive Particles scattering cross sections on nuclei down to the so-called neutrino floor, in a mass range from a few GeV to hundreds of TeV. Based on the successful operation of the DarkSide-50 detector at LNGS, a new and more sensitive experiment, DarkSide-20k, has been designed and is now under construction. A thorough understanding of the DarkSide-50 detector response and, therefore, of all types of events observed in the detector, is essential for the optimal design of the new experiment. In this article, we report on a specific set of events, namely, standard two-pulse scintillation–ionization signals with a third small amplitude pulse, occurring within the 440 μ s data acquisition window of standard events. Some of these events are due to the photoionization of the TPC cathode. We compare our results with those published by collaborations using liquid xenon time projection chambers, which observed a similar phenomenon, and, in particular, with a recent paper by the LUX Collaboration (D.S. Akerib et al. Phys.Rev.D 102, 092004 (2020)) From the measured rate of these events, we estimate for the first time the quantum efficiency of the tetraphenyl butadiene deposited on the DarkSide-50 cathode at wavelengths of around 128 nm, in liquid argon. Also, both experiments observe events likely related to the photoionization of impurities in the liquid. The probability of photoelectron emission per unit length turns out to be an order of magnitude lower in DarkSide-50 than in LUX.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Geometry of quantum signal detection.

Consideration of a binary quantum signal detection problem in a two-dimensional Hilbert space. The optimum detection problem is reduced to the problem of finding the locus of a vector which has a maximum projection along the fixed a priori probability vector of hypotheses. It is shown that the desired locus can be determined by a geometrical method involving the use of a randomized decision strategy. It is further shown that this geometrical method can be applied to the optimum solution of a binary detection problem described in a product Hilbert space.

Harger, R. O.↗

State-selected chemical reaction dynamics at the S matrix level - Final-state specificities of near-threshold processes at low and high energies

State-to-state reaction probabilities are found to be highly final-state specific at state-selected threshold energies for the reactions O + H2 yield OH + H and H + H2 yield H2 + H. The study includes initial rotational states with quantum numbers 0-15, and the specificity is especially dramatic for the more highly rotationally excited reactants. The analysis is based on accurate quantum mechanical reactive scattering calculations. Final-state specificity is shown in general to increase with the rotational quantum number of the reactant diatom, and the trends are confirmed for both zero and nonzero values of the total angular momentum.

Chatfield, David C.↗

Extraction of the higher-twist parton distribution $e(x)$ from CLAS data

We present the first point-by-point extraction of a twist-3 PDF. The scalar PDF, e(x), is accessed through the analysis of the data for the sin φR-moment of the beam-spin asymmetry for dihadron production in semi-inclusive DIS off proton target at CLAS and CLAS12. The dihadron formalism allows for use of collinear framework, hence calling for a minimal set of approximations and hypotheses. The extracted PDF e(x) carries insights into the physics of the largely-unexplored quark-gluon correlations, and its first Mellin moment is related to the marginally known scalar charge of the nucleon. We show that the proton flavor combination of the scalar PDF is nonzero at more than 74% probability.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Evaluating Space Object Conjunction Probabilities Using Characteristic Function Inversion

This report discusses an approach to computing the probability of a conjunction between two space objects in the short-term encounter scenario. A conjunction is defined here as an event where the miss distance between the objects is less than some specified value. The scenario assumptions are that the motion of the objects is linear, their positions are Gaussian distributed, and their velocities are known and constant. Under these assumptions, the squared-miss distance is shown to have the generalized chi-square distribution. An established statistical technique called characteristic function inversion is employed to evaluate the distribution and obtain conjunction probabilities. The method is closely related to a recent approach based on moment generating function inversion, and a qualitative comparison of the approaches is provided. Last, the method is tested on several benchmark test cases where it agrees with numerical integration on the cases with conjunction probabilities above 10 –12 . However, the exact probability in these cases is usually not needed and this probability can be bounded above using an independent Gaussian approximation. Overall, the report shows how to compute conjunction probabilities using a standard statistical method, though numerical integration seems to perform equally well.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Machine Learning Predictions of Transition Probabilities in Atomic Spectra

Forward modeling of optical spectra with absolute radiometric intensities requires knowledge of the individual transition probabilities for every transition in the spectrum. In many cases, these transition probabilities, or Einstein A-coefficients, quickly become practically impossible to obtain through either theoretical or experimental methods. Complicated electronic orbitals with higher order effects will reduce the accuracy of theoretical models. Experimental measurements can be prohibitively expensive and are rarely comprehensive due to physical constraints and sheer volume of required measurements. Due to these limitations, spectral predictions for many element transitions are not attainable. In this work, we investigate the efficacy of using machine learning models, specifically fully connected neural networks (FCNN), to predict Einstein A-coefficients using data from the NIST Atomic Spectra Database. For simple elements where closed form quantum calculations are possible, the data-driven modeling workflow performs well but can still have lower precision than theoretical calculations. For more complicated nuclei, deep learning emerged more comparable to theoretical predictions, such as Hartree–Fock. Unlike experiment or theory, the deep learning approach scales favorably with the number of transitions in a spectrum, especially if the transition probabilities are distributed across a wide range of values. It is also capable of being trained on both theoretical and experimental values simultaneously. In addition, the model performance improves when training on multiple elements prior to testing. The scalability of the machine learning approach makes it a potentially promising technique for estimating transition probabilities in previously inaccessible regions of the spectral and thermal domains on a significantly reduced timeline.

74 ATOMIC AND MOLECULAR PHYSICS↗

Ablation loading of barium ions into a surface-electrode trap

Trapped-ion quantum information processing may benefit from qubits encoded in isotopes that are practically available in only small quantities, e.g., due to low natural abundance or radioactivity. Laser ablation provides a method of controllably liberating neutral atoms or ions from low-volume targets, but energetic ablation products can be difficult to confine in the small ion-electrode distance, micron-scale microfabricated traps amenable to high-speed, high-fidelity manipulation of ion arrays. Here, we investigate ablation-based ion loading into surface-electrode traps of different sizes to test a model describing ion loading probability as a function of effective trap volume and other trap parameters. We characterize loading of ablated barium from a metallic source in two cryogenic surface-electrode traps with 730 and 50 μm ion-electrode distances. Furthermore, our loading rate agrees with a predictive analytical model, providing insight for the confinement of limited-quantity species of interest for quantum computing, simulation, and sensing.

74 ATOMIC AND MOLECULAR PHYSICS↗

Transition probabilities and Stark-broadening parameters of neutral and singly ionized lead

Strengths and Stark widths of the prominent visible PbI and PbII lines are measured in emission by means of a gas-driven shock tube. Absolute ionic line strengths for 7s-7p and 7p-7d arrays conform well to quantum-mechanical sum rules and agree with theoretical predictions, but 6d-5f results differ markedly from central-field approximations. Neutral-line strengths agree satisfactorily with available comparison data. Semiempirical theory predicts the widths of PbII lines with characteristic reliability of better than 25%.

Miller, M. H.↗

Discovering causal structure with reproducing-kernel Hilbert space ε -machines

We merge computational mechanics’ definition of causal states (predictively equivalent histories) with reproducing-kernel Hilbert space (RKHS) representation inference. The result is a widely applicable method that infers causal structure directly from observations of a system’s behaviors whether they are over discrete or continuous events or time. A structural representation—a finite- or infinite-state kernel ϵ-machine—is extracted by a reduced-dimension transform that gives an efficient representation of causal states and their topology. In this way, the system dynamics are represented by a stochastic (ordinary or partial) differential equation that acts on causal states. We introduce an algorithm to estimate the associated evolution operator. Paralleling the Fokker–Planck equation, it efficiently evolves causal-state distributions and makes predictions in the original data space via an RKHS functional mapping. We demonstrate these techniques, together with their predictive abilities, on discrete-time, discrete-value infinite Markov-order processes generated by finite-state hidden Markov models with (i) finite or (ii) uncountably infinite causal states and (iii) continuous-time, continuous-value processes generated by thermally driven chaotic flows. The method robustly estimates causal structure in the presence of varying external and measurement noise levels and for very high-dimensional data.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A Gaussian measure of quantum phase noise

We study the width of the semiclassical phase distribution of a quantum state in its dependence on the average number of photons (m) in this state. As a measure of phase noise, we choose the width, delta phi, of the best Gaussian approximation to the dominant peak of this probability curve. For a coherent state, this width decreases with the square root of (m), whereas for a truncated phase state it decreases linearly with increasing (m). For an optimal phase state, delta phi decreases exponentially but so does the area caught underneath the peak: all the probability is stored in the broad wings of the distribution.

Schleich, Wolfgang P.↗

Optimal Zeno Dragging for Quantum Control: A Shortcut to Zeno with Action-Based Scheduling Optimization

The quantum Zeno effect asserts that quantum measurements inhibit simultaneous unitary dynamics when the “collapse” events are sufficiently strong and frequent. This applies in the limit of strong continuous measurement or dissipation. It is possible to implement a dissipative control that is known as “Zeno dragging” by dynamically varying the monitored observable, and hence also the eigenstates, which are attractors under Zeno dynamics. This is similar to adiabatic processes, in that the Zeno-dragging fidelity is highest when the rate of eigenstate change is slow compared to the measurement rate. We demonstrate here two theoretical methods for using such dynamics to achieve control of quantum systems. The first, which we shall refer to as “shortcut to Zeno,” is analogous to the shortcuts to adiabaticity (counterdiabatic driving) that are frequently used to accelerate unitary adiabatic evolution. In the second approach, we apply the Chantasri-Dressel-Jordan stochastic action [PRA 88, 042110 (2013)], and demonstrate that the extremal-probability readout paths derived from this are well suited to setting up a Pontryagin-style optimization of the Zeno-dragging schedule. A fundamental contribution of the latter approach is to show that an action suitable for measurement-driven control optimization can be derived quite generally from statistical arguments. Implementing these methods on the Zeno dragging of a qubit, we find that both approaches yield the same solution, namely, that the optimal control is a unitary that matches the motion of the Zeno-monitored eigenstate. We then show that such a solution can be more robust than a unitary-only operation and we comment on solvable generalizations of our qubit example embedded in larger systems. These methods open up new pathways toward systematically developing dynamic control of Zeno subspaces to realize dissipatively stabilized quantum operations. Published by the American Physical Society 2024

Physics↗

Impact of graph structures for QAOA on MaxCut

The quantum approximate optimization algorithm (QAOA) is a promising method of solving combinatorial optimization problems using quantum computing. QAOA on the MaxCut problem has been studied extensively on graphs with specific structure; however, little is known about the general performance of the algorithm on arbitrary graphs. Here, we investigate how different graph characteristics correlate with QAOA performance at depths at most three on the MaxCut problem for all connected non-isomorphic graphs with at most eight vertices. Some good predictors of QAOA success relate to graph symmetries, odd cycles, and density. For example, on eight vertex graphs, the average probability for selecting an optimal solution for graphs that contain no odd cycles after three iterations of QAOA is 60.6% compared to 48.2% for those that do. The data generated from these studies are shared in a publicly accessible database to serve as a benchmark for QAOA calculations and experiments. Knowing the relationship between structure and performance can be used to identify classes of combinatorial problems that are likely to exhibit a quantum advantage.

97 MATHEMATICS AND COMPUTING↗

Inference-Based Quantum Sensing

In a standard quantum sensing (QS) task one aims at estimating an unknown parameter θ, encoded into an n-qubit probe state, via measurements of the system. The success of this task hinges on the ability to correlate changes in the parameter to changes in the system response $\mathscr{R}$⁡(θ) (i.e., changes in the measurement outcomes). For simple cases the form of $\mathscr{R}$⁡(θ) is known, but the same cannot be said for realistic scenarios, as no general closed-form expression exists. Here, in this Letter, we present an inference-based scheme for QS. We show that, for a general class of unitary families of encoding, $\mathscr{R}$⁡(θ) can be fully characterized by only measuring the system response at 2⁢n+1 parameters. This allows us to infer the value of an unknown parameter given the measured response, as well as to determine the sensitivity of the scheme, which characterizes its overall performance. We show that inference error is, with high probability, smaller than δ, if one measures the system response with a number of shots that scales only as Ω⁢(log 3 ⁡(n)/δ 2 ). Furthermore, the framework presented can be broadly applied as it remains valid for arbitrary probe states and measurement schemes, and, even holds in the presence of quantum noise. We also discuss how to extend our results beyond unitary families. Finally, to showcase our method we implement it for a QS task on real quantum hardware, and in numerical simulations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗