Search NASA⌕ Search

SEARCH · Search NASA

Results for “Hilbert spaces”

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 127 records · Page 7
All sourcesNASA NTRSDOE OSTI
NASA NTRS1991

H(infinity) and H2 optimal controllers for periodic and multi-rate systems

The solutions to the optimal l2 to l2 disturbance rejection problem H(infinity) as well as to the LQG (linear quadratic Gaussian) H2 problem in periodic systems using the lifting technique are presented. Both problems involve a causality condition on the optimal LTI (linear time invariant) compensator when viewed in the lifted domain. The H(infinity) problem is solved using the Nehari's theorem, whereas in the H2 problem the solution is obtained using the projection theorem in Hilbert spaces. The authors demonstrate that exactly the same method of solution to the H(infinity) and H2 problems in periodic systems applies when considering the same problems in multirate sampled data systems.

Voulgaris, Petros G.↗
NASA NTRS1992

A continuum model for interconnected lattice trusses

A continuum model for interconnected lattice trusses based on the 1D Timoshenko beam approximation is developed using the NASA-LRC Phase Zero Evolutionary Model. The continuum model dynamics is presented in the canonical wave-equation form in a Hilbert space.

Balakrishnan, A. V.↗
NASA NTRS1993

Geometric aspects of uncertainty and correlation

The fact that the metric induced on the quantum evolution submanifold of the protective Hilbert space describes the uncertainties and correlations of the operators generating the quantum-state evolution and exhibits the inherently-quantized geometry is discussed.

Abe, Sumiyoshi↗
NASA NTRS1994

Semigroup approximation and robust stabilization of distributed parameter systems

Theoretical results that enable rigorous statements of convergence and exponential stability of Galerkin approximations of LQR controls for infinite dimensional, or distributed parameter, systems have proliferated over the past ten years. In addition, extensive progress has been made over the same time period in the derivation of robust control design strategies for finite dimensional systems. However, the study of the convergence of robust finite dimensional controllers to robust controllers for infinite dimensional systems remains an active area of research. We consider a class of soft-constrained differential games evolving in a Hilbert space. Under certain conditions, a saddle point control can be given in feedback form in terms of a solution to a Riccati equation. By considering a related LQR problem, we can show a convergence result for finite dimensional approximations of this differential game. This yields a computational algorithm for the feedback gain that can be derived from similar strategies employed in infinite dimensional LQR control design problems. The approach described in this paper also inherits the additional properties of stability robustness common to game theoretic methods in finite dimensional analysis. These theoretical convergence and stability results are verified in several numerical experiments.

Kurdila, A. J.↗
NASA NTRS1994

Discretized energy minimization in a wave guide with point sources

An anti-noise problem on a finite time interval is solved by minimization of a quadratic functional on the Hilbert space of square integrable controls. To this end, the one-dimensional wave equation with point sources and pointwise reflecting boundary conditions is decomposed into a system for the two propagating components of waves. Wellposedness of this system is proved for a class of data that includes piecewise linear initial conditions and piecewise constant forcing functions. It is shown that for such data the optimal piecewise constant control is the solution of a sparse linear system. Methods for its computational treatment are presented as well as examples of their applicability. The convergence of discrete approximations to the general optimization problem is demonstrated by finite element methods.

Propst, G.↗
NASA NTRS1994

Evolution of wave function in a dissipative system

For a dissipative system with Ohmic friction, we obtain a simple and exact solution for the wave function of the system plus the bath. It is described by the direct product in two independent Hilbert space. One of them is described by an effective Hamiltonian, the other represents the effect of the bath, i.e., the Brownian motion, thus clarifying the structure of the wave function of the system whose energy is dissipated by its interaction with the bath. No path integral technology is needed in this treatment. The derivation of the Weisskopf-Wigner line width theory follows easily.

Yu, Li-Hua↗
NASA NTRS1994

On the nonlocal predictions of quantum optics

We give a definition of locality in quantum optics based upon Bell's work, and show that locality has been violated in no experiment performed up to now. We argue that the interpretation of the Wigner function as a probability density gives a very attractive local realistic picture of quantum optics provided that this function is nonnegative. We conjecture that this is the case for all states which can be realized in the laboratory. In particular, we believe that the usual representation of 'single photon states' by a Fock state of the Hilbert space is not correct and that a more physical, although less simple mathematically, representation involves density matrices. We study in some detail the experiment showing anticorrelation after a beam splitter and prove that it naturally involves a positive Wigner function. Our (quantum) predictions for this experiment disagree with the ones reported in the literature.

Marshall, Trevor W.↗
NASA NTRS1996

Chiral Bosonization of Superconformal Ghosts

We explain the difference of the Hilbert space of the superconformal ghosts (beta,gamma) system from that of its bosonized fields phi and chi. We calculate the chiral correlation functions of phi, chi fields by inserting appropriate projectors.

Shi, Deheng↗
NASA NTRS1995

Microgravity and Charge Transfer in the Neuronal Membrane: Implications for Computational Neurobiology

Evidence from natural and artificial membranes indicates that the neural membrane is a liquid crystal. A liquid-to-gel phase transition caused by the application of superposed electromagnetic fields to the outer membrane surface releases spin-correlated electron pairs which propagate through a charge transfer complex. The propagation generates Rydberg atoms in the lipid bilayer lattice. In the present model, charge density configurations in promoted orbitals interact as cellular automata and perform computations in Hilbert space. Due to the small binding energies of promoted orbitals, their automata are highly sensitive to microgravitational perturbations. It is proposed that spacetime is classical on the Rydberg scale, but formed of contiguous moving segments, each of which displays topological equivalence. This stochasticity is reflected in randomized Riemannian tensor values. Spacetime segments interact with charge automata as components of a computational process. At the termination of the algorithm, an orbital of high probability density is embedded in a more stabilized microscopic spacetime. This state permits the opening of an ion channel and the conversion of a quantum algorithm into a macroscopic frequency code.

Wallace, Ron↗
NASA NTRS2002

Kernel Partial Least Squares for Nonlinear Regression and Discrimination

This paper summarizes recent results on applying the method of partial least squares (PLS) in a reproducing kernel Hilbert space (RKHS). A previously proposed kernel PLS regression model was proven to be competitive with other regularized regression methods in RKHS. The family of nonlinear kernel-based PLS models is extended by considering the kernel PLS method for discrimination. Theoretical and experimental results on a two-class discrimination problem indicate usefulness of the method.

Rosipal, Roman↗
NASA NTRS2002

Locally-Based Kernal PLS Smoothing to Non-Parametric Regression Curve Fitting

We present a novel smoothing approach to non-parametric regression curve fitting. This is based on kernel partial least squares (PLS) regression in reproducing kernel Hilbert space. It is our concern to apply the methodology for smoothing experimental data where some level of knowledge about the approximate shape, local inhomogeneities or points where the desired function changes its curvature is known a priori or can be derived based on the observed noisy data. We propose locally-based kernel PLS regression that extends the previous kernel PLS methodology by incorporating this knowledge. We compare our approach with existing smoothing splines, hybrid adaptive splines and wavelet shrinkage techniques on two generated data sets.

Rosipal, Roman↗
NASA NTRS2003

Time as an Observable in Nonrelativistic Quantum Mechanics

The argument follows from the viewpoint that quantum mechanics is taken not in the usual form involving vectors and linear operators in Hilbert spaces, but as a boundary value problem for a special class of partial differential equations-in the present work, the nonrelativistic Schrodinger equation for motion of a structureless particle in four- dimensional space-time in the presence of a potential energy distribution that can be time-as well as space-dependent. The domain of interest is taken to be one of two semi-infinite boxes, one bounded by two t=constant planes and the other by two t=constant planes. Each gives rise to a characteristic boundary value problem: one in which the initial, input values on one t=constant wall are given, with zero asymptotic wavefunction values in all spatial directions, the output being the values on the second t=constant wall; the second with certain input values given on both z=constant walls, with zero asymptotic values in all directions involving time and the other spatial coordinates, the output being the complementary values on the z=constant walls. The first problem corresponds to ordinary quantum mechanics; the second, to a fully time-dependent version of a problem normally considered only for the steady state (time-independent Schrodinger equation). The second problem is formulated in detail. A conserved indefinite metric is associated with space-like propagation, where the sign of the norm of a unidirectional state corresponds to its spatial direction of travel.

Hahne, G. E.↗
NASA NTRS2003

NASA Tech Briefs, January 2003

Topics covered include: Optoelectronic Tool Adds Scale Marks to Photographic Images; Compact Interconnection Networks Based on Quantum Dots; Laterally Coupled Quantum-Dot Distributed-Feedback Lasers; Bit-Serial Adder Based on Quantum Dots; Stabilized Fiber-Optic Distribution of Reference Frequency; Delay/Doppler-Mapping GPS-Reflection Remote-Sensing System; Ladar System Identifies Obstacles Partly Hidden by Grass; Survivable Failure Data Recorders for Spacecraft; Fiber-Optic Ammonia Sensors; Silicon Membrane Mirrors with Electrostatic Shape Actuators; Nanoscale Hot-Wire Probes for Boundary-Layer Flows; Theodolite with CCD Camera for Safe Measurement of Laser-Beam Pointing; Efficient Coupling of Lasers to Telescopes with Obscuration; Aligning Three Off-Axis Mirrors with Help of a DOE; Calibrating Laser Gas Measurements by Use of Natural CO2; Laser Ranging Simulation Program; Micro-Ball-Lens Optical Switch Driven by SMA Actuator; Evaluation of Charge Storage and Decay in Spacecraft Insulators; Alkaline Capacitors Based on Nitride Nanoparticles; Low-EC-Content Electrolytes for Low-Temperature Li-Ion Cells; Software for a GPS-Reflection Remote-Sensing System; Software for Building Models of 3D Objects via the Internet; "Virtual Cockpit Window" for a Windowless Aerospacecraft; CLARAty Functional-Layer Software; Java Library for Input and Output of Image Data and Metadata; Software for Estimating Costs of Testing Rocket Engines; Energy-Absorbing, Lightweight Wheels; Viscoelastic Vibration Dampers for Turbomachine Blades; Soft Landing of Spacecraft on Energy-Absorbing Self-Deployable Cushions; Pneumatically Actuated Miniature Peristaltic Vacuum Pumps; Miniature Gas-Turbine Power Generator; Pressure-Sensor Assembly Technique; Wafer-Level Membrane-Transfer Process for Fabricating MEMS; A Reactive-Ion Etch for Patterning Piezoelectric Thin Film; Wavelet-Based Real-Time Diagnosis of Complex Systems; Quantum Search in Hilbert Space; Analytic Method for Computing Instrument Pointing Jitter; and Semiselective Optoelectronic Sensors for Monitoring Microbes.

Source record↗
NASA NTRS2018

A Blueprint for Demonstrating Quantum Supremacy with Superconducting Qubits

Long coherence times and high fidelity control recently achieved in scalable superconducting circuits paved the way for the growing number of experimental studies of many-qubit quantum coherent phenomena in these devices. Albeit full implementation of quantum error correction and fault tolerant quantum computation remains a challenge the near term pre-error correction devices could allow new fundamental experiments despite inevitable accumulation of errors. One such open question foundational for quantum computing is achieving the so called quantum supremacy, an experimental demonstration of a computational task that takes polynomial time on the quantum computer whereas the best classical algorithm would require exponential time and/or resources. It is possible to formulate such a task for a quantum computer consisting of less than a 100 qubits. The computational task we consider is to provide approximate samples from a non-trivial quantum distribution. This is a generalization for the case of superconducting circuits of ideas behind boson sampling protocol for quantum optics introduced by Arkhipov and Aaronson. In this presentation we discuss a proof-of-principle demonstration of such a sampling task on a 9-qubit chain of superconducting gmon qubits developed by Google. We discuss theoretical analysis of the driven evolution of the device resulting in output approximating samples from a uniform distribution in the Hilbert space, a quantum chaotic state. We analyze quantum chaotic characteristics of the output of the circuit and the time required to generate a sufficiently complex quantum distribution. We demonstrate that the classical simulation of the sampling output requires exponential resources by connecting the task of calculating the output amplitudes to the sign problem of the Quantum Monte Carlo method. We also discuss the detailed theoretical modeling required to achieve high fidelity control and calibration of the multi-qubit unitary evolution in the device. We use a novel cross-entropy statistical metric as a figure of merit to verify the output and calibrate the device controls. Finally, we demonstrate the statistics of the wave function amplitudes generated on the 9-gmon chain and verify the quantum chaotic nature of the generated quantum distribution. This verifies the implementation of the quantum supremacy protocol.

Kechedzhi, Kostyantyn↗
NASA NTRS2019

Exploring Network-Related Optimization Problems Using Quantum Heuristics

Network-related connectivity optimization problems are underlying a wide range of applications and are also of high computational complexity. We consider studying network optimization problems using two types of quantum heuristics.One is quantum annealing, and the other Quantum Alternating Operator Ansatz, an extension of the Quantum Approximate Optimization Algorithms for gate-model quantum computation, in which a cost-function based unitary and a non-commuting mixing unitary are applied alternately. We present problem mappings for problems of finding the spanning-tree or spanning-graph of a graph that optimizes certain costs, and a variant that further requires the spanning-tree be degree-bounded. With quantum annealing, all constraints are cast into penalty terms in the cost Hamiltonian, and the solution is encoded as the ground state of the Hamiltonian. We provide three mappings to the quadratic unconstrained binary optimization (QUBO) form, compare the resource requirements, and analyze the tradeoffs. For QAOA, we give special focus on the design of mixers based on the constraints presented in the problem, such that the system evolution remains in a subspace of the full Hilbert space where all constraints are satisfied. In the spanning-tree problem, one such hard constraint is that a mixer applied to a spanning-tree needs also be a spanning tree. This involves checking the connectivity of a subgraph, which is a global condition common for most network-related problems. We show how this feature can be efficiently represented in the mixer in a quantum coherent way, based on manipulation of a descendant-matrix and an adjacent matrix. We further develop a mixer for the spanning-graphs based on the spanning-tree mixer.

Wang, Zhihui↗
NASA NTRS2019

Study network-related optimization problems using quantum alternating optimization ansatz

Network-related connectivity optimization problems are underlying a wide range of applications and are also of high computational complexity. We consider studying network optimization problems using two types of quantum heuristics. One is quantum annealing, and the other Quantum Alternating Operator Ansatz, an extension of the Quantum Approximate Optimization Algorithms for gate-model quantum computation, in which a cost-function based unitary and a non-commuting mixing unitary are applied alternately. We present problem mappings for problems of finding the spanning-tree or spanning-graph of a graph that optimizes certain costs, and a variant that further requires the spanning-tree be degree-bounded. With quantum annealing, all constraints are cast into penalty terms in the cost Hamiltonian, and the solution is encoded as the ground state of the Hamiltonian. We provide three mappings to the quadratic unconstrained binary optimization (QUBO) form, compare the resource requirements, and analyze the tradeoffs. For QAOA, we give special focus on the design of mixers based on the constraints presented in the problem, such that the system evolution remains in a subspace of the full Hilbert space where all constraints are satisfied. In the spanning-tree problem, one such hard constraint is that a mixer applied to a spanning-tree needs also be a spanning tree. This involves checking the connectivity of a subgraph, which is a global condition common for most network-related problems. We show how this feature can be efficiently represented in the mixer in a quantum coherent way, based on manipulation of a descendant-matrix and an adjacent matrix. We further develop a mixer for the spanning-graphs based on the spanning-tree mixer.

Zhihui Wang↗
NASA NTRSDate not supplied

Symmetry and Error Mitigation in Quantum Alternating Operator Ansatz

Quantum Alternating Operator Ansatz (QAOA) provides a platform for probing quantum advantage in optimization problems on NISQ hardware. By exploring symmetries in the system and the structure of unitaries in the algorithm, we proposed using problem-specific mixing operators to limit the quantum evolution within a subspace where the target state lives. As an example, in case of equality constraint, we studied the use of XY operators that preserve total Pauli Z. This QAOA variant, in the noiseless case, significantly outperforms the vanilla version of QAOA where the constraints are encoded as penalty in the cost Hamiltonian and the search is in the whole Hilbert space. In presence of noise, although the advantage still holds, error mitigation is needed for QAOA. I will overview our work on the design of QAOA in presence of symmetry, the implementation and compilation of XY-QAOA, its performance and error mitigation techniques in presence of noise.

Zhihui Wang↗
NASA NTRS2023

Another Geometric Interpretation of Cramer’s Rule

We develop a geometric interpretation of Cramer’s rule as a generalization of projection onto orthogonal basis vectors using the rows of the adjugate. This interpretation makes connections between elementary linear algebra concepts like the solution to linear equations, inner products, and projections. Such connections are useful for introducing broader concepts related to Hilbert spaces and geometric algebras like Grassman algebra. Such connections were essential for the author’s mathematical education as an engineer.

linear algebra↗