Coupled-channels method for rearrangement collisions
Classification and construction of open-channel projection operators for rearrangement collisions using subspaces of total Hilbert space of system
Volkin, H. C.↗
SEARCH · Search NASA
Results for “Subspace projection”
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.
Logical shadow tomography: Efficient estimation of error-mitigated observables
We introduce a technique to estimate error-mitigated expectation values on noisy quantum computers. Our technique performs shadow tomography on a logical state to produce a memory-efficient classical reconstruction of the noisy density matrix. Using efficient classical post-processing, one can mitigate errors by projecting into the codespace as in subspace expansion and taking powers of the density matrix as in virtual distillation. Relative to subspace expansion which requires Ω (2^((n-1)k) samples to estimate a Pauli observable with an [[n; k]] stabilizer code, our technique requires only Ө(2^k) samples. Relative to virtual distillation, our technique can compute powers of the density matrix without implementing additional copies of quantum states the quantum computer. We present numerical results using logical states encoded with up to sixty physical qubits and show fast convergence to error-free expectation values with only 10^5 samples under 1% depolarizing noise.
quantum computing↗
A General Algorithm for Reusing Krylov Subspace Information. I. Unsteady Navier-Stokes
A general algorithm is developed that reuses available information to accelerate the iterative convergence of linear systems with multiple right-hand sides A x = b (sup i), which are commonly encountered in steady or unsteady simulations of nonlinear equations. The algorithm is based on the classical GMRES algorithm with eigenvector enrichment but also includes a Galerkin projection preprocessing step and several novel Krylov subspace reuse strategies. The new approach is applied to a set of test problems, including an unsteady turbulent airfoil, and is shown in some cases to provide significant improvement in computational efficiency relative to baseline approaches.
Carpenter, Mark H.↗
Application of a Reduced Order Kalman Filter to Initialize a Coupled Atmosphere-Ocean Model: Impact on the Prediction of El Nino
A reduced order Kalman Filter, based on a simplification of the Singular Evolutive Extended Kalman (SEEK) filter equations, is used to assimilate observed fields of the surface wind stress, sea surface temperature and sea level into the nonlinear coupled ocean-atmosphere model. The SEEK filter projects the Kalman Filter equations onto a subspace defined by the eigenvalue decomposition of the error forecast matrix, allowing its application to high dimensional systems. The Zebiak and Cane model couples a linear reduced gravity ocean model with a single vertical mode atmospheric model of Zebiak. The compatibility between the simplified physics of the model and each observed variable is studied separately and together. The results show the ability of the model to represent the simultaneous value of the wind stress, SST and sea level, when the fields are limited to the latitude band 10 deg S - 10 deg N. In this first application of the Kalman Filter to a coupled ocean-atmosphere prediction model, the sea level fields are assimilated in terms of the Kelvin and Rossby modes of the thermocline depth anomaly. An estimation of the error of these modes is derived from the projection of an estimation of the sea level error over such modes. This method gives a value of 12 for the error of the Kelvin amplitude, and 6 m of error for the Rossby component of the thermocline depth. The ability of the method to reconstruct the state of the equatorial Pacific and predict its time evolution is demonstrated. The method is shown to be quite robust for predictions I up to six months, and able to predict the onset of the 1997 warm event fifteen months before its occurrence.
Ballabrera-Poy, Joaquim↗
Application of a Reduced Order Kalman Filter to Initialize a Coupled Atmosphere-Ocean Model: Impact on the Prediction of El Nino
A reduced order Kalman Filter, based on a simplification of the Singular Evolutive Extended Kalman (SEEK) filter equations, is used to assimilate observed fields of the surface wind stress, sea surface temperature and sea level into the nonlinear coupled ocean-atmosphere model of Zebiak and Cane. The SEEK filter projects the Kalman Filter equations onto a subspace defined by the eigenvalue decomposition of the error forecast matrix, allowing its application to high dimensional systems. The Zebiak and Cane model couples a linear reduced gravity ocean model with a single vertical mode atmospheric model of Zebiak. The compatibility between the simplified physics of the model and each observed variable is studied separately and together. The results show the ability of the model to represent the simultaneous value of the wind stress, SST and sea level, when the fields are limited to the latitude band 10 deg S - 10 deg N In this first application of the Kalman Filter to a coupled ocean-atmosphere prediction model, the sea level fields are assimilated in terms of the Kelvin and Rossby modes of the thermocline depth anomaly. An estimation of the error of these modes is derived from the projection of an estimation of the sea level error over such modes. This method gives a value of 12 for the error of the Kelvin amplitude, and 6 m of error for the Rossby component of the thermocline depth. The ability of the method to reconstruct the state of the equatorial Pacific and predict its time evolution is demonstrated. The method is shown to be quite robust for predictions up to six months, and able to predict the onset of the 1997 warm event fifteen months before its occurrence.
Ballabrera-Poy, J.↗
A numerical scheme for the identification of hybrid systems describing the vibration of flexible beams with tip bodies
A cubic spline based Galerkin-like method is developed for the identification of a class of hybrid systems which describe the transverse vibration to flexible beams with attached tip bodies. The identification problem is formulated as a least squares fit to data subject to the system dynamics given by a coupled system of ordnary and partial differential equations recast as an abstract evolution equation (AEE) in an appropriate infinite dimensional Hilbert space. Projecting the AEE into spline-based subspaces leads naturally to a sequence of approximating finite dimensional identification problems. The solutions to these problems are shown to exist, are relatively easily computed, and are shown to, in some sense, converge to solutions to the original identification problem. Numerical results for a variety of examples are discussed.
Rosen, I. G.↗
Hyperstability in variable structure systems
A variable structure control law is a discontinuous feedback law whose coefficients switch on hypersurfaces defined in the state space. Feedback systems with variable structure control laws are often referred to as variable structure systems (VSS). The main feature of VSS is the sliding motion which can occur at the intersection of the switching surfaces. Demonstrating existence and reaching in the case of vector control in n-dimensional space is in general a problem in stability of nonlinear systems. The present investigation is concerned with the projection of motion on an m-dimensional subspace, taking into account aspects of the hyperstability concept in VSS design. The considered concepts are illustrated with the aid of an example.
Calise, A. J.↗
Structural damage detection of space truss structures using best achievable eigenvectors
A method is presented by which measured modes and frequencies from a modal test can be used to determine the location and magnitude of damage in a space struss structure. The damage is located by computing the Euclidean distances between the measured mode shapes and the best achievable eigenvectors. The best achievable eigenvectors are the projection of the measured mode shapes onto the subspace defined by the refined analytical model of the structure and the measured frequencies. Loss of both stiffness and mass properties can be located and quantified. To examine the performance of the method when experimentally measured modes are employed, various damage detection studies using a laboratory eight-bay truss structure were conducted. The method performs well even though the measurement errors inevitably make the damage location more difficult.
Lim, Tae W.↗
Spline-based distributed system identification with application to large space antennas
A parameter and state estimation technique for distributed models is demonstrated through the solution of a problem generic to large space antenna system identification. Assuming the position of the reflective surface of the maypole (hoop/column) antenna to be approximated by the static two-dimensional, stretched-membrane partial differential equation with variable-stiffness coefficient functions, a spline-based approximation procedure is described that estimates the shape and stiffness functions from data set observations. For given stiffness functions, the Galerkin projection with linear spline-based functions is applied to project the distributed problem onto a finite-dimensional subspace wherein algebraic equations exist for determining a static shape (state) prediction. The stiffness functions are then parameterized by cubic splines and the parameters estimated by an output error technique. Numerical results are presented for data descriptive of a 100-m-diameter maypole antenna.
Banks, H. T.↗
Controller reduction by preserving impulse response energy
A model order reduction algorithm based on a Krylov recurrence formulation is developed to reduce order of controllers. The reduced-order controller is obtained by projecting the full-order LQG controller onto a Krylov subspace in which either the controllability or the observability grammian is equal to the identity matrix. The reduced-order controller preserves the impulse response energy of the full-order controller and has a parameter-matching property. Two numerical examples drawn from other controller reduction literature are used to illustrate the efficacy of the proposed reduction algorithm.
Craig, Roy R., Jr.↗
Projection methods for the numerical solution of Markov chain models
Projection methods for computing stationary probability distributions for Markov chain models are presented. A general projection method is a method which seeks an approximation from a subspace of small dimension to the original problem. Thus, the original matrix problem of size N is approximated by one of dimension m, typically much smaller than N. A particularly successful class of methods based on this principle is that of Krylov subspace methods which utilize subspaces of the form span(v,av,...,A(exp m-1)v). These methods are effective in solving linear systems and eigenvalue problems (Lanczos, Arnoldi,...) as well as nonlinear equations. They can be combined with more traditional iterative methods such as successive overrelaxation, symmetric successive overrelaxation, or with incomplete factorization methods to enhance convergence.
Saad, Youcef↗
Logical Shadow Tomography: Efficient Estimation of Error-mitigated Observables
In near-term quantum applications, reducing errors and improving device reliability is an essential task. Towards these ends, various techniques have been introduced in recent literature, collectively referred to as quantum error mitigation techniques, for reducing errors in pre-fault-tolerant devices. Here, we introduce logical shadow tomography as a versatile error mitigation method. Our technique uses a stabilizer code to encode information in a logical state. Instead of doing active error correction, quantum states will be measured at the end of computation via shadow tomography and non-logical errors are projected out in the classical post-processing. Relative to quantum subspace expansion which requires O(2(M-1)L) experiments to estimate an logical Pauli observable encoded by an [[M, L, d]] code, our technique only requires 2L experiments, an important practical reduction in resources.
Hong-Ye Hu↗
Understanding Majorana braiding in superconductors with a fixed total number of particles
Mean-field one-dimensional topological superconductors host edge Majorana zero modes (MZMs) that encode a topologically protected ground-state degeneracy and enable robust braiding operations within this subspace. Mean-field states lack definite particle number and thus cannot represent isolated systems. Nevertheless, projecting them onto fixed particle number can yield good approximations to an isolated superconductor ground state. In earlier work [Sajith et al., Phys. Rev. B 109, 184509 (2024)] we showed that the projected Kitaev wave function of a single wire preserves some important mean-field features, such as the zero-energy spectral peaks near the wire edges. However, uniqueness of the fixed-number ground state does not allow for any nontrivial operations in the ground-state subspace. To overcome this limitation, here we consider the case of multiple wires with a conserved total charge, using the same approach. In the limit of vanishing interwire coupling, this system has a macroscopic ground-state degeneracy. We show how this degeneracy is resolved by coherent single-particle tunneling, and identify special many-body states which play the same role as the MZM parity states in the mean field. In this work, we demonstrate how braiding operations can be implemented and discuss both intrinsic and extrinsic limits on their fidelity.
75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
Sylvester-preconditioned adaptive-rank implicit time integrators for advection-diffusion equations with variable coefficients
Here, we consider the adaptive-rank integration of multi-dimensional time-dependent advection-diffusion partial differential equations (PDEs) with variable coefficients. We employ a standard finite-difference method for spatial discretization coupled with high-order diagonally implicit Runge-Kutta temporal schemes. The discrete equation is a generalized Sylvester equation (GSE), which we solve with a projection-based adaptive-rank algorithm structured around two key strategies: (i) constructing dimension-wise subspaces using a novel atypical extended Krylov strategy, and (ii) efficiently solving the basis coefficient matrix with a preconditioned GMRES solver. The low-rank decomposition is performed in 2D using SVD and with high-order SVD (HOSVD) in 3D to represent the tensor in a compressed Tucker format. For d-dimensional problems (here, d = 2 or 3), the computational complexity and memory storage of the approach are found numerically to scale as and $\mathscr{O}(Nr^2) + \mathscr{O} (r^{d+1})$ and $\mathscr{O}(Nr) + \mathscr{O} (r^{d})$, respectively, with the one-dimensional resolution and the maximal rank during the Krylov iteration (which we find to be largely independent of on our numerical examples). We present numerical examples that illustrate the advertised properties of the algorithm.
97 MATHEMATICS AND COMPUTING↗
On approximating hereditary dynamics by systems of ordinary differential equations
The paper deals with methods of obtaining approximate solutions to linear retarded functional differential equations (hereditary systems). The basic notion is to project the infinite dimensional space of initial functions for the hereditary system onto a finite dimensional subspace. Within this framework, two particular schemes are discussed. The first uses well-known piecewise constant approximations, while the second is a new method based on piecewise linear approximating functions. Numerical results are given.
Cliff, E. M.↗
Hamiltonian simulation in Zeno subspaces
Here, we investigate the quantum Zeno effect as a framework for designing and analyzing quantum algorithms for Hamiltonian simulation. We show that frequent projective measurements of an ancilla qubit register can be used to simulate quantum dynamics on a target qubit register with a circuit complexity similar to randomized approaches. The classical sampling overhead in the latter approaches is traded for ancilla qubit overhead in Zeno-based approaches. A second-order Zeno sequence is developed to improve scaling and implementations through unitary kicks are discussed. We derive rigorous error bounds that allow for identifying the associated circuit complexities for the first- and second-order Zeno sequences. We show that the circuits over the combined register can be identified as a subroutine commonly used in post-Trotter Hamiltonian simulation methods. We build on this observation to reveal connections between different Hamiltonian simulation algorithms.
Hamiltonian simulation↗
DP-TwoLevel: two-stage gradient subspace learning for differentially private federated learning
Federated learning (FL) enables collaborative model training across distributed data sources without sharing raw data, but faces fundamental challenges in communication efficiency and privacy. Differentially private (DP) training mitigates information leakage but introduces noise that degrades model performance, especially in high-dimensional settings. We propose DP-TwoLevel, a hierarchical gradient projection method that improves utility under fixed DP constraints by exploiting low-dimensional structure in model updates. Our approach learns a two-level PCA-based representation of gradients and applies DP noise in a reduced-dimensional subspace, thereby lowering the effective noise magnitude while preserving dominant signal components. We evaluate the method across three datasets (MNIST, Fashion-MNIST, CIFAR-10) and three privacy regimes (ϵ∈0.5, 1.0, 2.0). Across nine experimental settings, DP-TwoLevel consistently outperforms DP-FedAvg, achieving an average accuracy improvement of 9.44%, with larger gains observed in lower ϵ(higher-noise) regimes (up to +22.31%). We further analyze scalability across models ranging from 100K to 1.49M parameters and identify a variance-based success criterion: performance remains strong when the projection preserves more than 75% of gradient variance, degrades in a marginal regime (65–75%), and fails below this threshold. Our results demonstrate that structure-aware dimensionality reduction can significantly improve the privacy–utility tradeoff in FL without modifying formal privacy guarantees. We also provide empirical evidence of scaling limitations for global projections and motivate per-layer extensions for larger models.
Kotevska, Olivera [ORNL] (ORCID:0000000316772243)↗
Exploration of signal processing methods for superconducting magnet and quench data
Quenching is the phenomenon of a superconducting magnetic material carrying current transitioning into a regular conducting material. This may cause severe and irreparable damage to the superconductor due to Joule heating. The Magnet Department at Fermi National Accelerator Laboratory (FNAL) has acquired experimental data through quench antenna arrays that are recorded when the quench is detected. These data are in terms of voltage signals that are sampled at 100kHz for several minutes. There are multiple channels and each channel provides a data set of more than 20 million observations, while there is one channel, called the trigger channel which shows the time when quench is detected. Despite some advancements that were made including machine learning, data complexity still shadows the progress. In this work, we studied a multi-resolution analysis of the quench antenna data through the Haar wavelet transform. In particular, we applied the maximally overlapped discrete w avelet transform (MODWT) of a suitable level L to the given data and then projected it onto the wavelet basis. This decomposes a given signal (Original data) $x ϵ \mathbb{R}^N$ into $L + 1$ subspaces of $\mathbb{R}^N$. One of the subspaces called the approximation, captures the trend of the signal, and the others, called the details, capture the fluctuations at different frequency bands. This decomposition provides a clear trend of the data at a suitable level and also various activities (spikes) are seen in the details of the decomposition at every level. These spikes might reveal some information about the quench under investigation but in any case, give information about magnet behavior. Also, this decomposition is seen to be very useful in removing noise present in the data due to the source or mechanism of the experiment.
72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗