Search NASA⌕ Search

SEARCH · Search NASA

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

Quantum arrival and dwell times via idealized clocks

A number of approaches to the problem of defining arrival- and dwell-time probabilities in quantum theory makes use of idealized models of clocks. An interesting question is the extent to which the probabilities obtained in this way are related to standard semiclassical results. In this paper, we explore this question using a reasonably general clock model, solved using path-integral methods. We find that, in the weak-coupling regime, where the energy of the clock is much less than the energy of the particle it is measuring, the probability for the clock pointer can be expressed in terms of the probability current in the case of arrival times, and the dwell-time operator in the case of dwell times, the expected semiclassical results. In the regime of strong system-clock coupling, we find that the arrival-time probability is proportional to the kinetic-energy density, consistent with an earlier model involving a complex potential. We argue that, properly normalized, this may be the generically expected result in this regime. We show that these conclusions are largely independent of the form of the clock Hamiltonian.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A Consistent Histories Formulation of Wheeler-DeWitt Quantum Cosmology

We summarize a fully worked-out consistent histories formulation of a quantum cosmological model, and illustrate with an example calculation of the probability that the quantum universe becomes singular. Specifically, we take a complete Wheeler-DeWitt canonical quantization of a flat Friedmann-Robertson-Walker cosmological model sourced with a free massless scalar field, and construct the decoherence functional which determines which quantum histories may be consistently assigned probabilities. As an example, we exhibit the probability that the quantum universe is singular in the sense that it assumes zero volume. The classical solutions of this model are all singular; we show that the quantum solutions are as well. We comment on the crucial role played by quantum decoherence in arriving at this conclusion.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

No-signaling, perfect bipartite dichotomic correlations and local randomness

The no-signaling constraint on bi-partite correlations is reviewed. It is shown that in order to obtain non-trivial Bell-type inequalities that discern no-signaling correlations from more general ones, one must go beyond considering expectation values of products of observables only. A new set of nontrivial no-signaling inequalities is derived which have a remarkably close resemblance to the CHSH inequality, yet are fundamentally different. A set of inequalities by Roy and Singh and Avis et al., which is claimed to be useful for discerning no-signaling correlations, is shown to be trivially satisfied by any correlation whatsoever. Finally, using the set of newly derived no-signaling inequalities a result with potential cryptographic consequences is proven: if different parties use identical devices, then, once they have perfect correlations at spacelike separation between dichotomic observables, they know that because of no-signaling the local marginals cannot but be completely random.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Controlling error orientation to improve quantum algorithm success rates

The success probability of a quantum algorithm constructed from noisy quantum gates cannot be accurately predicted from single-parameter metrics that compare noisy and ideal gates. We illustrate this concept by examining a system with coherent errors and comparing algorithm success rates for different choices of two-qubit gates that are constructed from composite pulse sequences, where the residual gate errors are related by a unitary transformation. As a result, all of the sequences have the same error relative to the ideal gate under any distance measure that is invariant under unitary transformations. However, the circuit success can vary dramatically by choosing error orientations that do not affect the final outcome and error orientations that cancel between conjugate controlled-nots, as demonstrated here with Clifford circuits, compiled Toffoli gates, and quantum simulation algorithms. Furthermore, the results point to the utility of both minimizing the error and optimizing the error direction and also to the advantages of using multiple control sequences for the same gate type within a single algorithm.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Schwinger-Dyson equations in large-N quantum field theories and nonlinear random processes

We propose a stochastic method for solving Schwinger-Dyson equations in large-N quantum field theories. Expectation values of single-trace operators are sampled by stationary probability distributions of the so-called nonlinear random processes. The set of all the histories of such processes corresponds to the set of all planar diagrams in the perturbative expansions of the expectation values of singlet operators. We illustrate the method on examples of the matrix-valued scalar field theory and the Weingarten model of random planar surfaces on the lattice. For theories with compact field variables, such as sigma models or non-Abelian lattice gauge theories, the method does not converge in the physically most interesting weak-coupling limit. In this case one can absorb the divergences into a self-consistent redefinition of expansion parameters. A stochastic solution of the self-consistency conditions can be implemented as a 'memory' of the random process, so that some parameters of the process are estimated from its previous history. We illustrate this idea on the two-dimensional O(N) sigma model. The extension to non-Abelian lattice gauge theories is discussed.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

X-shaped and Y-shaped Andreev resonance profiles in a superconducting quantum dot

The quasi-bound states of a superconducting quantum dot that is weakly coupled to a normal metal appear as resonances in the Andreev reflection probability, measured via the differential conductance. We study the evolution of these Andreev resonances when an external parameter (such as the magnetic field or gate voltage) is varied, using a random-matrix model for the N × N scattering matrix. We contrast the two ensembles with broken time-reversal symmetry, in the presence or absence of spin-rotation symmetry (class C or D). The poles of the scattering matrix in the complex plane, encoding the center and width of the resonance, are repelled from the imaginary axis in class C. In class D, in contrast, a number ∝ √N of the poles has zero real part. The corresponding Andreev resonances are pinned to the middle of the gap and produce a zero-bias conductance peak that does not split over a range of parameter values (Y-shaped profile), unlike the usual conductance peaks that merge and then immediately split (X-shaped profile)

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Toward a Parastatistics in Quantum Nonextensive Statistical Mechanics

On the basis of Bose quantum states in parastatistics the equations for the equilibrium distribution of quantum additive and nonextensive systems are determined. The fluctuations and variances of physical quantities for the equilibrium system are found. The Abelian group of microscopic entropies is determined for the composition law with a quadratic nonlinearity.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Dialog on Beyond Quantum

This notes clarity authors positions on a possibility to go beyond quantum mechanics.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

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↗

ACCURATE TIME-DEPENDENT WAVE PACKET STUDY OF THE H{sup +}+LiH REACTION AT EARLY UNIVERSE CONDITIONS

The dynamics and kinetics of the H{sup +} + LiH reaction have been studied using a quantum reactive time-dependent wave packet (TDWP) coupled-channel quantum mechanical method on an ab initio potential energy surface at conditions of the early universe. The total reaction probabilities for the H{sup +} + LiH(v = 0, j = 0) {yields} H{sup +} {sub 2} + Li process have been calculated from 5 Multiplication-Sign 10{sup -3} eV up to 1 eV for total angular momenta J from 0 to 110. Using a Langevin model, integral cross sections have been calculated in that range of collision energies and extrapolated for energies below 5 Multiplication-Sign 10{sup -3} eV. The calculated rate constants are found to be nearly independent of temperature in the 10-1000 K interval with a value of Almost-Equal-To 10{sup -9} cm{sup 3} s{sup -1}, which is in good agreement with estimates used in evolutionary models of the early universe lithium chemistry.

74 ATOMIC AND MOLECULAR PHYSICS↗

High quality semipolar (11{sup ¯}02) AlGaN/AlN quantum wells with remarkably enhanced optical transition probabilities

Adjusting the growth conditions from those for c-plane growth realizes high-quality semipolar (11{sup ¯}02) AlGaN/AlN quantum wells (QWs) with atomically smooth surfaces and abrupt interfaces on AlN substrates. Upon comparing the optical properties to those of c-plane QWs using time-integrated and time-resolved photoluminescence spectroscopy, the estimated internal electric field is much smaller in (11{sup ¯}02) AlGaN/AlN QWs than in c-plane QWs. Thus, (11{sup ¯}02) AlGaN/AlN QWs have narrower emission line widths and remarkably faster radiative recombination lifetimes, realizing highly efficient deep ultraviolet emissions.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Quantum Dynamics of a “Pulsating Heart”

Quantum dynamics of a pulsating mercury drop is investigated. It is demonstrated that the energy of the pulsating mercury drop can be quantized; therefore, it can generate electromagnetic radiation with a discrete spectrum. This allows a quantum generator and a radio-wave amplifier to be developed. The existence of a quantum solution of the classical Newton equation is caused by the nonstationarity of the potential of the corresponding type and by the Ehrenfest theorem. In this case, the corresponding solution is independent of the Planck constant. The quantum solutions of the equations of classical physics possess all attributes of quantum mechanics: wave-particle duality, uncertainty principle, superposition principle, causality principle, quantum interference, radiation with a discrete spectrum, tunneling, and spin effects.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A proof of von Neumann's postulate in Quantum Mechanics

A Clifford algebraic analysis is explained. It gives proof of von Neumann's postulate on quantum measurement. It is of basic significance to explain the problem of quantum wave function reduction in quantum mechanics.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

On almost surely bounded semigroups of random linear operators

Menger proposed transferring the probabilistic notions of quantum mechanics to the underlying geometry. Following Menger's idea, the notion of random metric spaces is a random generalization of that of metric spaces and also plays an important role in the study of random operator equations. The main difficulty of this article is to work out a skill to give a property peculiar to a special semigroup of random operators, which is not involved in the classical case. Subsequently, some random operators equations are studied, in particular, we discuss the Schroedinger-type random equation, which considerably generalizes the corresponding result in the sense of Skorohod.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Exactness of the original Grover search algorithm

It is well-known that when searching one out of four, the original Grover's search algorithm is exact; that is, it succeeds with certainty. It is natural to ask the inverse question: If we are not searching one out of four, is Grover's algorithm definitely not exact? In this article we give a complete answer to this question through some rationality results of trigonometric functions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗