Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “unitary transformation”

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.

116 records · Page 7

Polar decomposition for attitude determination from vector observations

This work treats the problem of weighted least squares fitting of a 3D Euclidean-coordinate transformation matrix to a set of unit vectors measured in the reference and transformed coordinates. A closed-form analytic solution to the problem is re-derived. The fact that the solution is the closest orthogonal matrix to some matrix defined on the measured vectors and their weights is clearly demonstrated. Several known algorithms for computing the analytic closed form solution are considered. An algorithm is discussed which is based on the polar decomposition of matrices into the closest unitary matrix to the decomposed matrix and a Hermitian matrix. A somewhat longer improved algorithm is suggested too. A comparison of several algorithms is carried out using simulated data as well as real data from the Upper Atmosphere Research Satellite. The comparison is based on accuracy and time consumption. It is concluded that the algorithms based on polar decomposition yield a simple although somewhat less accurate solution. The precision of the latter algorithms increase with the number of the measured vectors and with the accuracy of their measurement.

Bar-Itzhack, Itzhack Y.↗

Utilization of Historic Information in an Optimisation Task

One of the basic components of a discrete model of motor behavior and decision making, which describes tracking and supervisory control in unitary terms, is assumed to be a filtering mechanism which is tied to the representational principles of human memory for time-series information. In a series of experiments subjects used the time-series information with certain significant limitations: there is a range-effect; asymmetric distributions seem to be recognized, but it does not seem to be possible to optimize performance based on skewed distributions. Thus there is a transformation of the displayed data between the perceptual system and representation in memory involving a loss of information. This rules out a number of representational principles for time-series information in memory and fits very well into the framework of a comprehensive discrete model for control of complex systems, modelling continuous control (tracking), discrete responses, supervisory behavior and learning.

Boesser, T.↗

Higher-rank tensor field theory of non-abelian fracton and embeddon

We formulate a new class of tensor gauge field theories in any dimension that is a hybrid class between symmetric higher-rank tensor gauge theory (i.e., higher-spin gauge theory) and anti-symmetric tensor topological field theory. Our theory describes a mixed unitary phase interplaying between gapless and gapped topological order phases (which can live with or without Euclidean, Poincaré, or anisotropic symmetry, at least in ultraviolet high or intermediate energy field theory, but not yet to a lattice cutoff scale). The “gauge structure” can be compact, continuous, abelian or non-abelian. Our theory sits outside the paradigm of Maxwell electromagnetic theory in 1865 and Yang–Mills isospin/color theory in 1954. We discuss its local gauge transformation in terms of the ungauged vector-like or tensor-like higher-moment global symmetry. The non-abelian gauge structure is caused by gauging the non-commutative symmetries: a higher-moment symmetry and a charge conjugation (particle–hole) symmetry. Vector global symmetries along time direction may exhibit time crystals. We explore the relation of these long-range entangled matters to a non-abelian generalization of Fracton order in condensed matter, a field theory formulation of foliation, the spacetime embedding and Embeddon that we newly introduce, and possible fundamental physics applications to dark matter or dark energy.

36 MATERIALS SCIENCE↗

A quantum hamiltonian simulation benchmark

Hamiltonian simulation is one of the most important problems in quantum computation, and quantum singular value transformation (QSVT) is an efficient way to simulate a general class of Hamiltonians. However, the QSVT circuit typically involves multiple ancilla qubits and multi-qubit control gates. In order to simulate a certain class of n-qubit random Hamiltonians, we propose a drastically simplified quantum circuit that we refer to as the minimal QSVT circuit, which uses only one ancilla qubit and no multi-qubit controlled gates. We formulate a simple metric called the quantum unitary evolution score (QUES), which is a scalable quantum benchmark and can be verified without any need for classical computation. Under the globally depolarized noise model, we demonstrate that QUES is directly related to the circuit fidelity, and the potential classical hardness of an associated quantum circuit sampling problem. Under the same assumption, theoretical analysis suggests there exists an ‘optimal’ simulation time t opt ≈ 4.81, at which even a noisy quantum device may be sufficient to demonstrate the potential classical hardness.

97 MATHEMATICS AND COMPUTING↗

Noise resilience of variational quantum compiling

Variational hybrid quantum-classical algorithms (VHQCAs) are near-term algorithms that leverage classical optimization to minimize a cost function, which is efficiently evaluated on a quantum computer. Recently VHQCAs have been proposed for quantum compiling, where a target unitary U is compiled into a short-depth gate sequence V. In this work, we report on a surprising form of noise resilience for these algorithms. Namely, we find one often learns the correct gate sequence V (i.e. the correct variational parameters) despite various sources of incoherent noise acting during the cost-evaluation circuit. Our main results are rigorous theorems stating that the optimal variational parameters are unaffected by a broad class of noise models, such as measurement noise, gate noise, and Pauli channel noise. Furthermore, our numerical implementations on IBM's noisy simulator demonstrate resilience when compiling the quantum Fourier transform, Toffoli gate, and W-state preparation. Hence, variational quantum compiling, due to its robustness, could be practically useful for noisy intermediate-scale quantum devices. Finally, we speculate that this noise resilience may be a general phenomenon that applies to other VHQCAs such as the variational quantum eigensolver.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Optimal Control for the Quantum Simulation of Nuclear Dynamics

We propose a method for enacting the unitary time propagation of two interacting neutrons at leading order of chiral effective-field theory by efficiently encoding the nuclear dynamics into a single multilevel quantum device. The emulated output of the quantum simulation shows that, by applying a single gate that draws on the underlying characteristics of the device, it is possible to observe multiple cycles of the nuclear dynamics before the onset of decoherence. Owing to the signal's longevity, we can then extract spectroscopic properties of the simulated nuclear system. This allows us to validate the encoding of the nuclear Hamiltonian and the robustness of the simulation in the presence of quantum-hardware noise by comparing the extracted spectroscopic information to exact calculations. This work paves the way for transformative calculations of the dynamical properties of nuclei on near-term quantum devices.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Dynamic Mode Decomposition of Unsteady Pressure-Sensitive Paint Measurements for the NASA Unitary Plan Wind Tunnel Tests

This paper describes the Dynamic Mode Decomposition (DMD) of the pressures on the scale model of the Space Launch System (SLS) Block 1 cargo vehicle with the Unsteady Pressure-Sensitive Paint (uPSP) measurements, which were collected in the Ascent Transient Aerodynamics Tests with the Unitary Plan Wind Tunnel 11-by-11-foot Transonic Wind Tunnel in September 2019 at NASA Ames Research Center. The work described in this paper is a part of NASA’s development of a new state-of-the-art uPSP capability in production wind tunnels. The conventional DMD algorithm is based on the Singular Value Decomposition (SVD) of the data matrix. For the matrix of the uPSP measurements of the SLS ATAT, the number of rows is equal to the number of nodes in the grid of the scale model, and the number of columns is equal to the number of frames in the videos taken with 4 Phantom high-speed cameras. In this paper, it is verified that, for the time series with zero mean value, the DMD is equivalent to the decomposition with the Discrete Fourier Transform (DFT). Considering the uPSP is mainly used in the assessment of the unsteady, aerodynamic phenomena, the DMD of the uPSP measurements can be implemented in two steps: (1) subtract the mean value from the uPSP measurement on each of the grid nodes; (2) apply the Fast Fourier Transform (FFT) on the resulting zero-mean time series. The DMD of the uPSP measurements with FFT has two advantages: (1) the computational complexity of FFT is O(N*logN), where N is the length of the time series; (2) compared to the SVD-based DMD algorithm, the DMD with FFT can be easily implemented in parallel processing. A sample matrix of uPSP measurements, at the size of 341 grid nodes and 128 frames, is generated. Figures 1 and 2 show the eigenvalues and the ratios of the eigenvectors, respectively, of the sample matrix, without and with the mean value removed on each of the grid nodes, computed with the SVD-based DMD and the FFT. The figures demonstrate the equivalence of the SVD-based DMD and the decomposition with DFT/FFT for the time series with zero mean value. The results of DMD of the uPSP measurements of the SLS ATAT in September 2019 are presented in the paper. The DMD modes at different frequencies are shown, the aerodynamic phenomena (e.g. shockwave and vortex shedding) are demonstrated and the correlation of the DMD modes with the test configuration parameter (e.g., the Mach Number) is discussed. Figure 3 shows a software tool to visualize the DMD modes. The code to implement the algorithm described in this paper was written in C, with libraries of FFTW for FFT and MPI/OpenMP for parallel processing, and executed on the NASA Pleiades supercomputer. Funding for this research was provided by the NASA Aerosciences Evaluation and Test Capabilities Project.

Pressure-Sensitive Paint↗

Analysis of Dynamic Data from Supersonic Retropropulsion Experiments in NASA Langley's Unitary Plan Wind Tunnel

Recent experimental supersonic retropropulsion tests were conducted at the NASA Langley Research Center Unitary Plan Wind Tunnel Test Section 2 for a range of Mach numbers from 2.4 to 4.6. A 5-inch 70-degree sphere-cone forebody model with a 10-inch cylindrical aftbody experimental model was used which is capable of multiple retrorocket configurations. These configurations include a single central nozzle on the center point of the forebody, three nozzles at the forebody half-radius, and a combination of the first two configurations with no jets being plugged. A series of measurements were achieved through various instrumentation including forebody and aftbody pressure, internal pressures and temperatures, and high speed Schlieren visualization. Specifically, several high speed pressure transducers on the forebody and in the plenum were implemented to look at unsteady flow effects. The following work focuses on analyzing frequency traits due to the unsteady flow for a range of thrust coefficients for single, tri, and quad-nozzle test cases at freestream Mach 4.6 and angle of attack ranging from -8 degrees to +20 degrees. This analysis uses Matlab s fast Fourier transform, Welch's method (modified average of a periodogram), to create a power spectral density and analyze any high speed pressure transducer frequency traits due to the unsteady flow.

Codoni, Joshua R.↗