Search NASA⌕ Search

SEARCH · Search NASA

Results for “Theorem Proving”

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 559 records · Page 31

Four no-go theorems on the existence of spin and orbital angular momentum of massless bosons

The past decades have seen substantial interest in the so-called orbital angular momentum (OAM) of light, driven largely by its diverse range of applications. However, there are fundamental theoretical issues with decomposing the angular momentum of massless particles, such as photons, into spin (SAM) and orbital angular momentum parts. While the angular momentum of massive particles has a natural splitting into the Wigner SAM and OAM, there are numerous proposed splittings for photons and no consensus about which is correct. Moreover, it has been shown that most of the proposed SAM and OAM operators do not satisfy the defining commutation relations of angular momentum operators and are thus not legitimate splittings. Here, we prove that it is generally impossible to split the total angular momentum operator of massless bosons, such as photons and gravitons, into spin and orbital parts. We prove two further generalizations of this result, showing that there are no SAM-OAM splittings even if (1) the SAM operator generates non-internal symmetries or (2) if one allows the SAM and OAM operators to generate non-SO(3) symmetries.

Chern numbers↗

Theoretical implications of detecting gravitational waves

This paper is the third in a series of theorems which state how cosmological observations can provide evidence for an early phase of acceleration in the universe. It was demonstrated in [1,2], that the observed power spectrum for scalar perturbations forces all possible alternative theories of inflation to theories other than General Relativity. It was shown that generically, without a phase of accelerated expansion, these alternatives have to break at least one of the following tenets of classical general relativity: the Null Energy Condition (NEC), subluminal signal propagation, or sub-Planckian energy densities. In this paper we prove how detection of primordial gravitational waves at large scales can provide independent evidence to support a phase of accelerated expansion. This proof does not rely on the spectral index for tensor modes but relies on validity of quantum field theory in curved space time and tensor modes being sourced from adiabatic vacuum fluctuations. Our approach, like in the case of scalars, is proof by contradiction: we investigate the possibility of a detectable tensor signal sourced by vacuum fluctuations in a non-accelerating, sub-Planckian universe using cosmological perturbation theory and derive contradictory limits on cosmological dynamics. The contradiction implies that one or more of our axioms for early universe must have been broken. The bound from tensor perturbations is not only independent of, but also stronger than the one obtained from scalar power spectrum.

79 ASTRONOMY AND ASTROPHYSICS↗

No-go theorem for one-way quantum computing on naturally occurring two-level systems

The ground states of some many-body quantum systems can serve as resource states for the one-way quantum computing model, achieving the full power of quantum computation. Such resource states are found, for example, in spin-(5/2) and spin-(3/2) systems. It is, of course, desirable to have a natural resource state in a spin-(1/2), that is, qubit system. Here, we give a negative answer to this question for frustration-free systems with two-body interactions. In fact, it is shown to be impossible for any genuinely entangled qubit state to be a nondegenerate ground state of any two-body frustration-free Hamiltonian. What is more, we also prove that every spin-(1/2) frustration-free Hamiltonian with two-body interaction always has a ground state that is a product of single- or two-qubit states. In other words, there cannot be any interesting entanglement features in the ground state of such a qubit Hamiltonian.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A simple, flexible technique for RF cavity wake-field calculations

It is typical in the accelerator field to model machine components, especially RF cavities, as parallel RLC resonators. In the interest of simulating and diagnosing beam instabilities, knowledge of the time-domain voltage waveform over an equivalent resonator by a bunch current often proves useful. This waveform may be found by convolving the bunch current with the RLC resonator impulse response. While analytical and quasi-analytical expressions are available in this regime for common distributions such as the Gaussian, analogous results for less standard distributions are difficult to obtain using direct methods, which opens the door for the development of a more generalized technique. In this paper, a formulation is created that allows for the simple computation of the time-domain voltage waveform of and RLC resonator. The formulation uses the Cauchy Residue Theorem to extract the convolution result from the Fourier Domain, and it only requires that the current distribution Fourier Transform be holomorphic and known at one specific evaluation point. This greatly simplifies the computation of the time domain voltage for a large amount of bunch distributions both common and uncommon.

43 PARTICLE ACCELERATORS↗

Multistep DBT and regular rational extensions of the isotonic oscillator

In some recent articles, we developed a new systematic approach to generate solvable rational extensions of primary translationally shape invariant potentials. In this generalized SUSY QM partnership, the DBTs are built on the excited states Riccati-Schroedinger (RS) functions regularized via specific discrete symmetries of the considered potential. In the present paper, we prove that this scheme can be extended in a multistep formulation. Applying this scheme to the isotonic oscillator, we obtain new towers of regular rational extensions of this potential which are strictly isospectral to it. We give explicit expressions for their eigenstates which are associated to the recently discovered exceptional Laguerre polynomials and show explicitly that these extensions inherit the shape invariance properties of the original potential. - Highlights: Black-Right-Pointing-Pointer Hamiltonian hierarchies via SUSY quantum partnership generalized to excited states. Black-Right-Pointing-Pointer Goes beyond the scope of the Crum and Krein-Adler theorems. Black-Right-Pointing-Pointer Complete proofs based on deconjugacy theorems and recurrency scheme. Black-Right-Pointing-Pointer Determinantal expressions for new exceptional Laguerre polynomials. Black-Right-Pointing-Pointer Proof of the hereditary character of the shape invariance.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Geometric Delocalization in Two Dimensions

We demonstrate the existence of transient two-dimensional surfaces where a random-walking particle escapes to infinity in contrast to localization in standard flat two-dimensional space. We first prove that any rotationally symmetric two-dimensional membrane embedded in flat three-dimensional space cannot be transient. Then we formulate a criterion for the transience of a general asymmetric two-dimensional membrane. We use it to explicitly construct a class of transient two-dimensional manifolds with a nontrivial metric and height function but “zero average curvature,” which we dub “tablecloth manifolds.” The absence of the logarithmic infrared divergence of the Laplace-Beltrami operator in turn implies the absence of weak localization, nonexistence of bound states in shallow potentials, and breakdown of the Mermin-Wagner theorem and Kosterlitz-Thouless transition on the tablecloth manifolds, which may be realizable in both quantum simulators and corrugated two-dimensional materials.

Anderson localization↗

General comparison theorem for eigenvalues of a certain class of Hamiltonians

Using the Hellmann-Feynman theorem, a general comparison theorem is established for an eigenvalue equation of the form (T+V)|{psi}>=E|{psi}>, where T is a kinetic part which depends only on momenta and V is a potential which depends only on positions. We assume that H{sup (1)}=T+V{sup (1)} and H{sup (2)}=T+V{sup (2)} (H{sup (1)}=T{sup (1)}+V and H{sup (2)}=T{sup (2)}+V) support both discrete eigenvalues E{sub {l_brace}{alpha}{r_brace}}{sup (1)} and E{sub {l_brace}{alpha}{r_brace}}{sup (2)}, where {l_brace}{alpha}{r_brace} represents a set of quantum numbers. We prove that, if V{sup (1){<=}}V{sup (2)} (T{sup (1){<=}}T{sup (2)}) for all position (momentum) variables, then the corresponding eigenvalues are ordered as E{sub {l_brace}{alpha}{r_brace}}{sup (1){<=}}E{sub {l_brace}{alpha}{r_brace}}{sup (2)}. Some analytical applications are given.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Quantum Routing and Entanglement Dynamics Through Bottlenecks

To implement arbitrary quantum circuits in architectures with restricted interactions, one may effectively simulate all-to-all connectivity by routing quantum information. We consider the entanglement dynamics and routing between two regions only connected through an intermediate “bottleneck” region with few qubits. In such systems, where the entanglement rate is restricted by a vertex boundary rather than an edge boundary of the underlying interaction graph, existing results such as the small incremental entangling theorem give only a trivial constant lower bound on the routing time (the minimum time to perform an arbitrary permutation). We significantly improve the lower bound on the routing time in systems with a vertex bottleneck. Specifically, for any system with two regions 𝐿,𝑅 with 𝑁 𝐿 ,𝑁 𝑅 qubits, respectively, coupled only through an intermediate region 𝐶 with 𝑁 𝐶 qubits, for any 𝛿 > 0 we show a lower bound of Ω⁢(𝑁$^{1−𝛿}_{𝑅}$/√𝑁 𝐿⁢ 𝑁 𝐶 ) on the Hamiltonian quantum routing time when using piecewise time-independent Hamiltonians, or time-dependent Hamiltonians subject to a smoothness condition. We also prove an upper bound on the average amount of bipartite entanglement between 𝐿 and 𝐶,𝑅 that can be generated in time 𝑡 by such architecture-respecting Hamiltonians in systems constrained by vertex bottlenecks, improving the scaling in the system size from 𝑂⁡(𝑁 𝐿⁢ 𝑡) to 𝑂⁡(√𝑁 𝐿⁢ 𝑡). As a special case, when applied to the star graph (i.e., one vertex connected to 𝑁 leaves), we obtain an Ω⁡(√𝑁 1−𝛿 ) lower bound on the routing time and on the time to prepare 𝑁/2 Bell pairs between the vertices. We also show that, in systems of free particles, we can route optimally on the star graph in time Θ⁡(√𝑁) using Hamiltonian quantum routing, obtaining a speedup over gate-based routing, which takes time Θ⁡(𝑁).

97 MATHEMATICS AND COMPUTING↗

Encoding an Oscillator into Many Oscillators

An outstanding challenge for quantum information processing using bosonic systems is Gaussian errors such as excitation loss and added thermal noise errors. Thus, bosonic quantum error correction is essential. Most bosonic quantum error correction schemes encode a finite-dimensional logical qubit or qudit into noisy bosonic oscillator modes. In this case, however, the infinite-dimensional bosonic nature of the physical system is lost at the error-corrected logical level. On the other hand, there are several proposals for encoding an oscillator mode into many noisy oscillator modes. However, these oscillator-into-oscillators encoding schemes are in the class of Gaussian quantum error correction. Therefore, these codes cannot correct practically relevant Gaussian errors due to the established no-go theorems that state that Gaussian errors cannot be corrected by using only Gaussian resources. Here, we circumvent these no-go results and show that it is possible to correct Gaussian errors by using Gottesman-Kitaev-Preskill (GKP) states as non-Gaussian resources. In particular, we propose a non-Gaussian oscillator-into-oscillators code, namely the GKP two-mode squeezing code, and demonstrate that it can quadratically suppress additive Gaussian noise errors in both the position and momentum quadratures except for a small sublogarithmic correction. Furthermore, we demonstrate that our GKP two-mode squeezing code is near optimal in the weak noise limit by proving via quantum information theoretic tools that quadratic noise suppression is optimal when we use two physical oscillator modes. Lastly, in this work we show that our non-Gaussian oscillator encoding scheme can also be used to correct excitation loss and thermal noise errors, which are dominant error sources in many realistic bosonic systems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

BPS solitons in Lifshitz field theories

Lorentz-invariant scalar-field theories in d+1 dimensions with second-order derivative terms are unable to support static soliton solutions that are both finite in energy and stable for d>2, a result known as Derrick's theorem. Lifshitz theories, which introduce higher-order spatial derivatives, need not obey Derrick's theorem. We construct stable, finite-energy, static soliton solutions in Lifshitz scalar-field theories in 3+1 dimensions with a dynamical critical exponent z=2. We exhibit three generic types: nontopological point defects, topological point defects, and topological strings. We focus mainly on Lifshitz theories that are defined through a superpotential and admit Bogomolnyi-Prasad-Sommerfield solutions. These kinds of theories are the bosonic sectors of supersymmetric theories derived from the stochastic dynamics of a scalar field theory in one higher dimension. If nature obeys a Lifshitz field theory in the ultraviolet, then the novel topological defects discussed here may exist as relics from the early universe. Their discovery would prove that standard field theory breaks down at short distance scales.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Cloning entangled photons to scales one can see

By amplifying photonic qubits it is possible to produce states that contain enough photons to be seen with the human eye, potentially bringing quantum effects to macroscopic scales [P. Sekatski, N. Brunner, C. Branciard, N. Gisin, and C. Simon, Phys. Rev. Lett. 103, 113601 (2009)]. In this paper we theoretically study quantum states obtained by amplifying one side of an entangled photon pair with different types of optical cloning machines for photonic qubits. We propose a detection scheme that involves lossy threshold detectors (such as the human eye) on the amplified side and conventional photon detectors on the other side. We show that correlations obtained with such coarse-grained measurements prove the entanglement of the initial photon pair and do not prove the entanglement of the amplified state. We emphasize the importance of the detection loophole in Bell violation experiments by giving a simple preparation technique for separable states that violate a Bell inequality without closing this loophole. Finally, we analyze the genuine entanglement of the amplified states and its robustness to losses before, during, and after amplification.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Time Evolution of Correlation Functions in Quantum Many-Body Systems

We give rigorous analytical results on the temporal behavior of two-point correlation functions—also known as dynamical response functions or Green’s functions—in closed many-body quantum systems. We show that in a large class of translation-invariant models the correlation functions factorize at late times $\langle$A ( t ) B$\rangle$ β → $\langle$ A$\rangle$ β $\langle$ B$\rangle$ β , thus proving that dissipation emerges out of the unitary dynamics of the system. We also show that for systems with a generic spectrum the fluctuations around this late-time value are bounded by the purity of the thermal ensemble, which generally decays exponentially with system size. For autocorrelation functions we provide an upper bound on the timescale at which they reach the factorized late time value. Remarkably, this bound is only a function of local expectation values and does not increase with system size. We give numerical examples that show that this bound is a good estimate in nonintegrable models, and argue that the timescale that appears can be understood in terms of an emergent fluctuation-dissipation theorem. Our study extends to further classes of two point functions such as the symmetrized ones and the Kubo function that appears in linear response theory, for which we give analogous results.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Generalized Eigenvalues for pairs on heritian matrices

A study was made of certain special cases of a generalized eigenvalue problem. Let A and B be nxn matrics. One may construct a certain polynomial, P(A,B, lambda) which specializes to the characteristic polynomial of B when A equals I. In particular, when B is hermitian, that characteristic polynomial, P(I,B, lambda) has real roots, and one can ask: are the roots of P(A,B, lambda) real when B is hermitian. We consider the case where A is positive definite and show that when N equals 3, the roots are indeed real. The basic tools needed in the proof are Shur's theorem on majorization for eigenvalues of hermitian matrices and the interlacing theorem for the eigenvalues of a positive definite hermitian matrix and one of its principal (n-1)x(n-1) minors. The method of proof first reduces the general problem to one where the diagonal of B has a certain structure: either diag (B) = diag (1,1,1) or diag (1,1,-1), or else the 2 x 2 principal minors of B are all 1. According as B has one of these three structures, we use an appropriate method to replace A by a positive diagonal matrix. Since it can be easily verified that P(D,B, lambda) has real roots, the result follows. For other configurations of B, a scaling and a continuity argument are used to prove the result in general.

Rublein, George↗

General integrable n-level, many-mode Janes-Cummings-Dicke models and classical r-matrices with spectral parameters

Using the technique of classical r-matrices and quantum Lax operators, we construct the most general form of the quantum integrable “n-level, many-mode” spin-boson Jaynes-Cummings-Dicke-type hamiltonians describing an interaction of a molecule of N n-level atoms with many modes of electromagnetic field and containing, in general, additional non-linear interaction terms. We explicitly obtain the corresponding quantum Lax operators and spin-boson analogs of the generalized Gaudin hamiltonians and prove their quantum commutativity. We investigate symmetries of the obtained models that are associated with the geometric symmetries of the classical r-matrices and construct the corresponding algebra of quantum integrals. We consider in detail three classes of non-skew-symmetric classical r-matrices with spectral parameters and explicitly obtain the corresponding quantum Lax operators and Jaynes-Cummings-Dicke-type hamiltonians depending on the considered r-matrix.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Generating nonclassical correlations without fully aligning measurements

We investigate the scenario where spatially separated parties perform measurements in randomly chosen bases on an N-partite Greenberger-Horne-Zeilinger state. We show that without any alignment of the measurements, the observers will obtain correlations that violate a Bell inequality with a probability that rapidly approaches 1 as N increases and that this probability is robust against noise. We also prove that restricting these randomly chosen measurements to a plane perpendicular to a common direction will always generate correlations that violate some Bell inequality. Specifically, if each observer chooses their two measurements to be locally orthogonal, then the N observers will violate one of two Bell inequalities by an amount that increases exponentially with N. These results are also robust against noise and perturbations of each observer's reference direction from the common direction.

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↗

Quantum Max-flow/Min-cut

The classical max-flow min-cut theorem describes transport through certain idealized classical networks. We consider the quantum analog for tensor networks. By associating an integral capacity to each edge and a tensor to each vertex in a flow network, we can also interpret it as a tensor network and, more specifically, as a linear map from the input space to the output space. The quantum max-flow is defined to be the maximal rank of this linear map over all choices of tensors. The quantum min-cut is defined to be the minimum product of the capacities of edges over all cuts of the tensor network. We show that unlike the classical case, the quantum max-flow=min-cut conjecture is not true in general. Under certain conditions, e.g., when the capacity on each edge is some power of a fixed integer, the quantum max-flow is proved to equal the quantum min-cut. However, concrete examples are also provided where the equality does not hold. We also found connections of quantum max-flow/min-cut with entropy of entanglement and the quantum satisfiability problem. We speculate that the phenomena revealed may be of interest both in spin systems in condensed matter and in quantum gravity.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Purposive discovery of operations

The Generate, Prune & Prove (GPP) methodology for discovering definitions of mathematical operators is introduced. GPP is a task within the IL exploration discovery system. We developed GPP for use in the discovery of mathematical operators with a wider class of representations than was possible with the previous methods by Lenat and by Shen. GPP utilizes the purpose for which an operator is created to prune the possible definitions. The relevant search spaces are immense and there exists insufficient information for a complete evaluation of the purpose constraint, so it is necessary to perform a partial evaluation of the purpose (i.e., pruning) constraint. The constraint is first transformed so that it is operational with respect to the partial information, and then it is applied to examples in order to test the generated candidates for an operator's definition. In the GPP process, once a candidate definition survives this empirical prune, it is passed on to a theorem prover for formal verification. We describe the application of this methodology to the (re)discovery of the definition of multiplication for Conway numbers, a discovery which is difficult for human mathematicians. We successfully model this discovery process utilizing information which was reasonably available at the time of Conway's original discovery. As part of this discovery process, we reduce the size of the search space from a computationally intractable size to 3468 elements.

Sims, Michael H.↗