Fermionic Reduced Density Low-Rank Matrix Completion, Noise Filtering, and Measurement Reduction in Quantum Simulations
Not Available
SEARCH · Engineering Papers
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.
Not Available
This paper presents a data-driven algorithm for the feeder power disaggregation problem in distribution systems. Leveraging spatio-temporal power patterns in residential homes, residential power is discomposed into three components: sparse-switching loads, periodic loads, and photovoltaic (PV) generation, which are characterized through the design of two sparse matrices and a low-rank matrix. The matrix completion process is data-efficient because of the matrix sparsity and low rankness, along with the use of power system models. The proposed approach is tested using real-world residential data set on a 33-bus distribution system, demonstrating accurate power disaggregation with efficient matrix completion.
Experimentally measured reduced density matrices (RDMs) often violate constraints that ensure they represent N-electron states—known as N-representability conditions—because of statistical and hardware noise. In this work, we present a correlated purification framework based on semidefinite programming to restore the accuracy of a noisy, unphysical two-electron RDM (2-RDM). The method performs a bi-objective optimization that minimizes both the many-electron energy and the nuclear norm of the correction to the measured 2-RDM. The nuclear norm, often employed in matrix completion, promotes low-rank corrections, while the energy term acts as a regularization term that can improve the purity of the ground state. While the method is particularly effective for ground states, it can also be applied to excited and nonstationary states by decreasing the weight of the energy relative to the error norm. In an application to fermionic shadow tomography of large hydrogen chains, correlated purification yields substantial reductions in both energy and 2-RDM error, achieving chemical accuracy across dissociation curves. This framework provides a robust strategy for tomography in many-body quantum simulations.
This paper considers the problem of recovering missing entries in a partially observed matrix from relatively few measurements (i.e., the so-called matrix completion problem) with the aim of increasing the presently limited observability of low-voltage distribution grids. To this end, the partially observed matrix is formed using scarce voltage magnitude measurements while accounting for their spatial information. Voltage readings are assumed to be collected from distribution utility sensors and/or geographically-distributed cable television network sensors located in immediate proximity to distribution grid nodes. A matrix completion approach built on the parameter-less singular value shrinkage technique is used to estimate voltage magnitudes at otherwise non-observable low-voltage nodes using a small number of single- or multiple-snapshot data. The effectiveness of the proposed approach is demonstrated using a U.S.-style distribution test system from the synthetic SMART- DS data set under very low- to moderate-observability conditions.
Reduced density matrices are central to describing observables in many-body quantum systems. In electronic structure theory, the two-particle reduced density matrix (2-RDM) suffices to determine the energy and other key properties. Recent work has used matrix completion, leveraging the low-rank structure of RDMs and approximate theoretical models, to reconstruct the 2-RDM from partial data and thus reduce the computational cost. However, matrix completion is, in general, an under-determined problem. Revisiting Rosina’s theorem (Rosina, M. Queen’s Papers on Pure and Applied Mathematics , 1968, No. 11, 369), we here show that the matrix completion is unique under certain conditions, identifying the subset of 2-RDM elements that enables its exact reconstruction from incomplete information. Building on this, we introduce a hybrid quantum–stochastic algorithm that achieves exact matrix completion, demonstrated through applications to the Fermi–Hubbard model.
This work examines the viability of matrix completion methods as cost-effective alternatives to full nuclear Hessians for calculating quantum and variational effects in chemical reactions. The harmonic variety-based matrix completion (HVMC) algorithm, developed in a previous study (https://doi.org/10.1063/5.0018326), exploits the low-rank character of the polynomial expansion of potential energy to recover, using a small sample, vibrational frequencies (square roots of nuclear Hessian eigenvalues) constituting the reaction path. Furthermore, these frequencies are essential for calculating rate coefficients using variational transition state theory with multidimensional tunneling (VTST-MT). HVMC performance is examined for four SN2 reactions and five hydrogen transfer reactions, with each H-transfer reaction consisting of at least one vibrational mode strongly coupled to the reaction coordinate. HVMC is robust and captures zero-point energies, vibrational free energies, zero-curvature tunneling, and adiabatic ground state and free energy barriers as well as their positions on the reaction coordinate. For medium to large reactions involving H-transfer, with the exception of the most complex Ir catalysis system, less than 35% of total eigenvalue information is necessary for accurate recovery of key VTST-MT observables.
This report documents a research project on analyzing low-rank tensor models for data analysis that took place at Sandia National Laboratories from October 2023–September 2025. The focus of this work was to extend theoretical frameworks from statistics and probability theory for use with models for scalar, vector, and matrix data to models with tensor, or general multi-dimensional array, data. Through this work, we have provided a new set of tools for bounding errors on low-rank tensor models of both complete and sampled data. The remainder of this report is organized as follows. In Section 1, we describe the proposed work at the start of the project. Section 2 describes the research advances made as part of the project. Other research contributions in the form of conference presentations and software development is provided in Section 3. Workforce development at Sandia and Florida Atlantic University (via a subcontract on this project) is provided in Section 4.
This report demonstrates satisfactory data compression of SOLPS-ITER simulation output ranging from 2D fields, 1D profiles, and 0D scalar variables with a novel matrix decomposition approach. The singular value decomposition (SVD) scales poorly for large matrix sizes and is unsuited to the application on high dimensional data common to fusion plasma physics simulation. In this work, we employ the columns-submatrix-rows (CUR) matrix factorization technique in order to compute a low-rank approximation up to two orders of magnitude faster than the SVD, but within a nominal L2-norm relative error of ε = 10 –2 . In addition, the CUR approach maintains the original format of the data, in its extracted columns and rows, allowing for interpretable data storage at the original resolution of the simulation. We utilize an iterative algorithm to compute the CUR decomposition of simulation output by maximizing the volume, or linearly independent information content, of a low-rank submatrix contained within the data. Experiments over $\textit{n} × \textit{n}$ randomized test matrices with embedded rank-deficient features show that this maximum volume implementation of CUR matrix approximation has reduced asymptotic computational complexity on the order of n compared to the SVD, which scales approximately as $n^3$. These results show that the CUR technique can be used to effectively select time step snapshots (columns) of over 140 SOLPS-ITER output variables and the associated discretized coordinate timeseries (rows) allowing for reconstruction of the complete simulation dynamics.
Here, in this study, we present a many-body theory based on a solution of the N-representability problem in which the ground-state two-particle reduced density matrix (2-RDM) is determined directly without the many-particle wave function. We derive an equation that re-expresses physical constraints on higher-order RDMs to generate direct constraints on the 2-RDM, which are required for its derivation from an N-particle density matrix, known as N-representability conditions. The approach produces a complete hierarchy of 2-RDM constraints that do not depend explicitly upon the higher RDMs or the wave function. By using the two-particle part of a unitary decomposition of higher order constraint matrices, we can solve the energy minimization by semidefinite programming in a form where the low-rank structure of these matrices can be potentially exploited. We illustrate by computing the ground-state electronic energy and properties of the H 8 ring.
Phasor measurement units (PMUs) provide high temporal-resolution synchrophasor measurements for power system monitoring and control. The frequent data quality issues, such as missing and bad data, prevent the incorporation of synchrophasor data in real-time operations. Most existing data-driven data recovery methods assume the power system dynamics can be approximated by a linear dynamical system, and the recovery performance degrades significantly when the power system is experiencing nonlinear dynamics during significant events. Here, this paper proposes a data-driven Bayesian nonlinear synchrophasor data recovery method (Ba-NSDR) that can recover a consecutive time period of simultaneous data losses or errors across all channels, even when the underlying system is highly nonlinear. The idea is to lift the Hankel matrix of the spatial-temporal synchrophasor data to a higher dimension such that the lifted Hankel matrix is low-rank in that space and can be processed with the kernel trick. Our proposed Bayesian method then infers the probabilistic distributions of synchrophasor from the partial observations. Some distinctive features of Ba-NSDR include an uncertainty index to measure the accuracy of the recovery result and the robustness to parameter selections. Our method is verified on both synthetic and recorded event datasets.
In this article, we provide an overview of state-of-the-art techniques that are being developed for efficient calculation of second and higher nuclear derivatives of quantum mechanical (QM) energy. Calculations of nuclear Hessians and anharmonic terms incur high costs and memory and scale poorly with system size. Three emerging classes of methods—machine learning (ML), automatic differentiation (AD), and matrix completion (MC)—have demonstrated promise in overcoming these challenges. We illustrate studies that employ unsupervised ML methods to reduce the need for multiple Hessian calculations in dynamics simulations and those that utilize supervised ML to construct approximate potential energy surfaces and estimate Hessians and anharmonic terms at reduced cost. By extension, if electronic structure operations could be written in a manner similar to functions underlying ML methods, rapid differentiation or AD routines can be employed to inexpensively calculate higher arbitrary-order derivatives. While ML approaches are typically black-box, we describe methods such as compressed sensing (CS) and MC, which explicitly leverage problem-specific mathematical properties of higher derivatives such as sparsity and low-rank, to complete higher derivative information using only a small, incomplete sample. The three classes of methods facilitate reliable predictions of observables ranging from infrared spectra to thermal conductivity and constitute a promising way forward in accurately capturing otherwise intractable higher-order responses of QM energy to nuclear perturbations.