Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “MATRICES”

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 721 records · Page 40
All sourcesNASA NTRSDOE OSTI
DOE OSTI2020

Morphological Characters Can Strongly Influence Early Animal Relationships Inferred from Phylogenomic Data Sets

There are considerable phylogenetic incongruencies between morphological and phylogenomic data for the deep evolution of animals. This has contributed to a heated debate over the earliest-branching lineage of the animal kingdom: the sister to all other Metazoa (SOM). Here, we use published phylogenomic data sets ($\sim $45,000–400,000 characters in size with $\sim $15–100 taxa) that focus on early metazoan phylogeny to evaluate the impact of incorporating morphological data sets ($\sim $15–275 characters). We additionally use small exemplar data sets to quantify how increased taxon sampling can help stabilize phylogenetic inferences. We apply a plethora of common methods, that is, likelihood models and their “equivalent” under parsimony: character weighting schemes. Our results are at odds with the typical view of phylogenomics, that is, that genomic-scale data sets will swamp out inferences from morphological data. Instead, weighting morphological data 2–10$\times $ in both likelihood and parsimony can in some cases “flip” which phylum is inferred to be the SOM. This typically results in the molecular hypothesis of Ctenophora as the SOM flipping to Porifera (or occasionally Placozoa). However, greater taxon sampling improves phylogenetic stability, with some of the larger molecular data sets ($>$200,000 characters and up to $\sim $100 taxa) showing node stability even with $\geqq100\times $ upweighting of morphological data. Accordingly, our analyses have three strong messages. 1) The assumption that genomic data will automatically “swamp out” morphological data is not always true for the SOM question. Morphological data have a strong influence in our analyses of combined data sets, even when outnumbered thousands of times by molecular data. Morphology therefore should not be counted out a priori. 2) We here quantify for the first time how the stability of the SOM node improves for several genomic data sets when the taxon sampling is increased. 3) The patterns of “flipping points” (i.e., the weighting of morphological data it takes to change the inferred SOM) carry information about the phylogenetic stability of matrices. The weighting space is an innovative way to assess comparability of data sets that could be developed into a new sensitivity analysis tool.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2025

Randomized Adiabatic Quantum Linear Solver Algorithm with Optimal Complexity Scaling and Detailed Running Costs

Solving linear systems of equations is a fundamental problem with a wide variety of applications across many fields of science, and there is increasing effort to develop quantum linear solver algorithms. Subaşı et al. [Phys. Rev. Lett. 122, 060504 (2019)] proposed a randomized algorithm inspired by adiabatic quantum computing, based on a sequence of random Hamiltonian simulation steps, with suboptimal scaling in the condition number 𝜅 of the linear system and the target error 𝜖. Here we go beyond these results in several ways. Firstly, using filtering [Lin and Tong, Quantum 4, 361 (2020)] and Poissonization techniques [Cunningham and Roland, ArXiv:2406.03972 (2024)], the algorithm complexity is improved to the optimal scaling 𝑂⁡(𝜅⁢log (1/𝜖))—an exponential improvement in 𝜖, and a shaving of a log 𝜅 scaling factor in 𝜅. Secondly, the algorithm is further modified to achieve constant factor improvements, which are vital as we progress towards hardware implementations on fault-tolerant devices. We introduce a cheaper randomized walk operator method replacing Hamiltonian simulation—which also removes the need for potentially challenging classical precomputations; randomized routines are sampled over optimized random variables; circuit constructions are improved. We obtain a closed formula rigorously upper bounding the expected number of times one needs to apply a block-encoding of the linear system matrix to output a quantum state encoding the solution to the linear system. The upper bound is 837⁢𝜅 at 𝜖 = 10 −10 for Hermitian matrices.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Two- and three-meson scattering amplitudes with physical quark masses from lattice QCD

We study systems of two and three mesons composed of pions and kaons at maximal isospin using four CLS ensembles with 𝑎 ≈ 0.063 fm, including one with approximately physical quark masses. Using the stochastic Laplacian-Heaviside method, we determine the energy spectrum of these systems including many levels in different momentum frames and irreducible representations. Using the relativistic two- and three-body finite-volume formalism, we constrain the two- and three-meson K matrices, including not only the leading 𝑠 wave, but also 𝑝 and 𝑑 waves. By solving the three-body integral equations, we determine, for the first time, the physical-point scattering amplitudes for 3⁢𝜋 + , 3⁢𝐾 + , 𝜋 + ⁢𝜋 + ⁢𝐾 + , and 𝐾 + ⁢𝐾 + ⁢𝜋 + systems. These are determined for total angular momentum 𝐽 𝑃 = 0 − , 1 + , and 2 − . We also obtain accurate results for 2⁢𝜋 + , 𝜋 + ⁢𝐾 + , and 2⁢𝐾 + phase shifts. We compare our results to chiral perturbation theory and to phenomenological fits.

FOS: Physical sciences↗
DOE OSTI2026

Out-of-time ordered correlation functions for the localized 𝑓 electrons in the Falicov-Kimball model

We provide an exact evaluation of the out-of-time correlation (OTOC) functions for the localized 𝑓-particle states in the Falicov-Kimball model within dynamical mean-field theory. Different regimes of quantum chaos and quantum scrambling are distinguished by the winding numbers of the block Toeplitz matrices used in the calculation. The similarities of these fermionic OTOCs and their logarithmic derivatives for time evolution with the OTOCs for quantum spin models with disorder are also discussed.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2026

JIMWLK on a quantum computer

We propose a method for solving the Jalilian-Marian-Iancu-McLerran-Weigert-Leonidov-Kovner (JIMWLK) evolution equation on quantum computers. Our approach exploits the reformulation of the JIMWLK equation as a Lindblad master equation governing the rapidity evolution of the hadronic density matrix, as established in prior work. To render the problem tractable for quantum simulation, we introduce several approximations: the two-dimensional transverse plane is reduced to a one-dimensional radial lattice by assuming azimuthal symmetry of the jump operators; the gauge group is restricted to SU(2); and the infinite Wilson lines of the JIMWLK equation are replaced by finite Wilson links along the light-cone direction. The resulting bosonic Hilbert space is truncated using the electric field basis familiar from Hamiltonian lattice gauge theory, with states restricted to angular momenta 𝑗 ≤ 𝑗 max . We derive the matrix elements of the JIMWLK Lindblad jump operators in this basis. As a benchmark, we demonstrate rapid convergence of the fundamental dipole expectation value with 𝑗 max for both pure and mixed Gaussian initial density matrices. For the simplest truncation, 𝑗 max =1/2, we implement the Lindblad evolution using a quantum simulation algorithm verified with the Qiskit statevector simulator by decomposing the non-unitary evolution operator into a linear combination of unitaries. This work establishes a concrete pathway toward quantum simulation of high-energy quantum chromodynamics evolution equations, with direct relevance to the physics program of the Electron-Ion Collider.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2026

Sampling off-axis neutrino fluxes with the short-baseline near detector

The short-baseline near detector (SBND), the near detector in the short-baseline neutrino program at Fermi National Accelerator Laboratory, is located just 110 m from the booster neutrino beam target. Thanks to this close proximity, relative to its 4 m × 4 m front face, neutrinos enter SBND over a range of angles from 0° to approximately 1.6°, enabling the detector to sample variations in the neutrino flux as a function of the angle—a technique known as precision reaction-independent spectrum measurement (PRISM), referred to here as SBND-PRISM. In this paper, we show how muon- and electron-neutrino fluxes vary as a function of the neutrino beam axis angle and how this can be exploited to expand the physics potential of SBND. We make use of a model that predicts an angle-dependent electron-neutrino excess signal to illustrate this effect, such as 𝜈 𝜇 → 𝜈 𝑒 oscillations. We present how SBND-PRISM provides a method to add robustness against uncertainties in cross-section modeling and, more generally, uncertainties that do not depend on the spatial position of neutrino interaction inside the detector. The fluxes, along with their associated covariance matrices, are made publicly available with this publication.

Abratenko, P. [Tufts University]↗
DOE OSTI2026

Correlated purification for restoring 𝑁-representability in quantum simulation

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.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2026

Binding energy of the 𝑇 𝑏⁢𝑏 tetraquark from lattice QCD with relativistic and nonrelativistic heavy-quark actions

We present a new determination of the $b\bar{b}$𝑢⁢𝑑 (𝐽 𝑃 = 1 + , 𝐼 = 0) tetraquark binding energy using lattice quantum chromodynamics (QCD) with domain-wall light quarks and a nonperturbatively tuned three-parameter anisotropic-clover “relativistic” action for the 𝑏 quarks. We also perform a direct comparison with a reanalysis of data generated in prior work using a lattice-nonrelativistic QCD (NRQCD) action for the 𝑏 quarks and otherwise identical parameters. Using the new data with relativistic 𝑏 quarks from seven different ensembles with multiple lattice spacings and pion masses, we perform combined chiral and continuum extrapolations and obtain (𝑚 𝑇 𝑏⁢𝑏 −𝑚 𝐵 −𝑚 𝐵* ) RHQ =(−76 ±23) MeV. For the NRQCD data from five ensembles, we perform chiral-only extrapolations and obtain (𝑚 𝑇 𝑏⁢𝑏 −𝑚 𝐵 −𝑚 𝐵* ) NRQCD = (−74 ±17 ±10) MeV. The lower magnitude of the results obtained here, compared to the original analysis in [Phys. Rev. D 100, 014503 (2019)], is due to the use of the symmetric parts of the correlation matrices with local four-quark operators only.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2025

Construction of approximate invariants for nonintegrable Hamiltonian systems

We present a method to construct high-order polynomial approximate invariants (AI) for nonintegrable Hamiltonian dynamical systems and apply it to a modern ring-based particle accelerator. Taking advantage of a special property of one-turn transformation maps expressed as square matrices, AIs can be constructed order by order iteratively. Evaluating AI with simulation data, we observe that AI’s fluctuation is actually a measure of chaos. Through minimizing the fluctuations, the stable region of long-term motions, i.e., the dynamic aperture of the accelerator, could be enlarged.

36 MATERIALS SCIENCE↗
DOE OSTI2020

Quantum state reduction: Generalized bipartitions from algebras of observables

Reduced density matrices are a powerful tool in the analysis of entanglement structure, approximate or coarse-grained dynamics, decoherence, and the emergence of classicality. It is straightforward to produce a reduced density matrix with the partial-trace map by tracing out part of the quantum state, but in many natural situations this reduction may not be achievable. We investigate the general problem of identifying how the quantum state is reduced given a restriction on the observables. For example, in an experimental setting, the set of observables that can actually be measured is usually modest (compared to the set of all possible observables) and their resolution is limited. In such situations, the appropriate state-reduction map can be defined via a generalized bipartition, which is associated with the structure of irreducible representations of the algebra generated by the restricted set of observables. One of our main technical results is a general, not inherently numeric, algorithm for finding irreducible representations of matrix algebras. In our work, we demonstrate the viability of this approach with two examples of limited-resolution observables. The definition of quantum state reductions can also be extended beyond algebras of observables. To accomplish this task we introduce a more flexible notion of bipartition, the partial bipartition, which describes coarse grainings preserving information about a limited set (not necessarily algebra) of observables. We describe a variational method to choose the coarse grainings most compatible with a specified Hamiltonian, which exhibit emergent classicality in the reduced state space. We apply this construction to the concrete example of the one-dimensional Ising model. Our results have relevance for quantum information, bulk reconstruction in holography, and quantum gravity.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2020

Capturing multireference excited states by constrained-density-functional theory

The computation of excited electronic states with commonly employed (approximate) methods is challenging, typically yielding states of lower quality than the corresponding ground state for a higher computational cost. In this work, we present a mean-field method that extends the previously proposed excited constrained-density-functional theory (XCDFT) from single Slater determinants to ensemble one-body reduced density matrices for computing low-lying excited states. The method still retains an associated computational complexity comparable to a semilocal density functional theory (DFT) calculation while at the same time it is capable of approaching states with multireference character. Further, we benchmark the quality of this method on well-established test sets, finding good descriptions of the electronic structure of multireference states and maintaining an overall accuracy for the predicted excitation energies comparable to semilocal time-dependent DFT.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2021

Random circuit block-encoded matrix and a proposal of quantum LINPACK benchmark

The LINPACK benchmark reports the performance of a computer for solving a system of linear equations with dense random matrices. Although this task was not designed with a real application directly in mind, the LINPACK benchmark has been used to define the list of TOP500 supercomputers since the debut of the list in 1993. We propose that a similar benchmark, called the quantum LINPACK benchmark, could be used to measure the whole machine performance of quantum computers. The success of the quantum LINPACK benchmark should be viewed as the minimal requirement for a quantum computer to perform a useful task of solving linear algebra problems, such as linear systems of equations. We propose an input model called the Random Circuit Block-Encoded Matrix (RACBEM), which is a proper generalization of a dense random matrix in the quantum setting. The RACBEM model is efficient to be implemented on a quantum computer and can be designed to optimally adapt to any given quantum architecture, with relying on a black-box quantum compiler. Besides solving linear systems, the RACBEM model can be used to perform a variety of linear algebra tasks relevant to many physical applications, such as computing spectral measures, time series generated by a Hamiltonian simulation, and thermal averages of the energy. We implement these linear algebra operations on IBM Q quantum devices as well as quantum virtual machines, and demonstrate their performance in solving scientific computing problems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

Probabilistic simulation of quantum circuits using a deep-learning architecture

The fundamental question of how to best simulate quantum systems using conventional computational resources lies at the forefront of condensed matter and quantum computation. It impacts both our understanding of quantum materials and our ability to emulate quantum circuits. Here we present an exact formulation of quantum dynamics via factorized generalized measurements which maps quantum states to probability distributions with the advantage that local unitary dynamics and quantum channels map to local quasistochastic matrices. This representation provides a general framework for using state-of-the-art probabilistic models in machine learning for the simulation of quantum many-body dynamics. Using this framework, we have developed a practical algorithm to simulate quantum circuits using an attention network based on a powerful neural network ansatz responsible for the most recent breakthroughs in natural language processing. We demonstrate our approach by simulating circuits that build Greenberger-Horne-Zeilinger and linear graph states of up to 60 qubits, as well as a variational quantum eigensolver circuit for preparing the ground state of the transverse field Ising model on several system sizes. Our methodology constitutes a modern machine learning approach to the simulation of quantum physics with applicability both to quantum circuits as well as other quantum many-body systems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2022

Parametrized process characterization with reduced resource requirements

Quantum process tomography (QPT) is a powerful tool to characterize quantum operations, but it requires considerable resources, making it impractical for more than two-qubit systems. This study proposes an alternative approach that requires significantly fewer resources for unitary process characterization with a built-in method for state preparation and measurement error mitigation. By measuring the quantum process as rotated through the X and Y axes on the Bloch sphere, we can acquire enough information to reconstruct the quantum process matrix χ and measure its fidelity. We test the algorithm's performance against standard QPT using simulated and physical experiments on several IBM quantum processors and compare the resulting process matrices. We demonstrate with numerical experiments that the method can improve gate fidelity via a noise reduction in the imaginary part of the process matrix, along with a stark decrease in the number of experiments needed to perform the characterization.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2022

Statistical analysis on random quantum circuit sampling by Sycamore and Zuchongzhi quantum processors

Random quantum circuit sampling, a task to sample bit strings from a random quantum circuit, is considered a suitable benchmark task to demonstrate the outperformance of quantum computers even with noisy qubits. Recently, random quantum circuit sampling was performed on the Sycamore quantum processor with 53 qubits [Nature (London) 574, 505 (2019)] and on the Zuchongzhi quantum processor with 56 qubits [Phys. Rev. Lett. 127, 180501 (2021)]. Here, we analyze and compare the statistical properties of the outputs of the random quantum circuit sampling by the Sycamore and Zuchongzhi processors. Using the Marchenko-Pastur law of random matrices of bit strings and the Wasssertein distances between bit strings, we find that the statistical properties of Sycamore bit strings are quite different from those of Zuchongzhi bit strings, while both processors score similar values of linear cross-entropy fidelity for random circuit sampling. Some bit strings sampled by the Zuchongzhi processor pass the NIST random number tests while both Sycamore and Zuchongzhi processors show similar patterns in the heat maps of bit strings. Zuchongzhi bit strings are much closer to classical uniform random bits than those of Sycamore. It is shown that the statistical properties of bit strings of both random quantum circuits change little as the depth of the random quantum circuits increases. Our findings raise a question about the computational reliability of noisy quantum processors because two quantum processors with similar noise levels and similar qubit structures produced statistically different outputs for the same random quantum circuit sampling.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2023

Emergent quantum mechanics at the boundary of a local classical lattice model

We formulate a model in which quantum mechanics emerges from classical mechanics. Given a local Hamiltonian H acting on n qubits, we define a local classical model with an additional spatial dimension whose boundary dynamics is approximately—but to arbitrary precision—described by Schrödinger's equation and H. The bulk consists of a lattice of classical bits that propagate towards the boundary through a circuit of stochastic matrices. The bits reaching the boundary are governed by a probability distribution whose deviation from the uniform distribution can be interpreted as the quantum-mechanical wave function. Bell nonlocality is achieved because information can move through the bulk much faster than the boundary speed of light. Finally, we analytically estimate how much the model deviates from quantum mechanics, and we validate these estimates using computer simulations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

Nearly optimal state preparation for quantum simulations of lattice gauge theories

Here, we present several improvements to the recently developed ground-state preparation algorithm based on the quantum eigenvalue transformation for unitary matrices (QETU), apply this algorithm to a lattice formulation of U(1) gauge theory in (2+1) dimensions, as well as propose an alternative application of QETU, a highly efficient preparation of Gaussian distributions. The QETU technique was originally proposed as an algorithm for nearly optimal ground-state preparation and ground-state energy estimation on early fault-tolerant devices. It uses the time-evolution input model, which can potentially overcome the large overall prefactor in the asymptotic gate cost arising in similar algorithms based on the Hamiltonian input model. We present modifications to the original QETU algorithm that significantly reduce the cost for the cases of both exact and Trotterized implementation of the time evolution circuit. We use QETU to prepare the ground state of a U(1) lattice gauge theory in two spatial dimensions, explore the dependence of computational resources on the desired precision and system parameters, and discuss the applicability of our results to general lattice gauge theories. We also demonstrate how the QETU technique can be utilized for preparing Gaussian distributions and wave packets in a way which outperforms existing algorithms for as little as n q ≳ 2–5 qubits.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2025

Competing ionization and dissociation: Extension of the energy-dependent frame transformation to the gerade symmetry of H 2

This article solves two major tasks that frequently arise in the theory of electron collisions with a target molecular cation. First, it extends the energy-dependent frame transformation (EDFT) treatment, which is needed to map fixed-nuclei electron-molecule scattering matrices into an energy-dependent laboratory-frame scattering matrix with vibrational channel indices. The EDFT mapping can now be carried out even when the target molecule possesses multiple low-energy potential curves, significantly transcending previous applications. Second, it implements a method to extract the rest of the full laboratory-frame scattering matrix, i.e., the columns and rows describing input and/or output dissociation channels. The treatment is benchmarked in this article against the essentially exact solution of a refined two-dimensional model of the singlet gerade Σ symmetry of H 2 . Our tests demonstrate that the theory accurately maps fixed-nuclei scattering information, of the type provided by existing electron-molecule computer codes, into a laboratory-frame scattering matrix that includes both ionization and dissociation. Furthermore, this treatment can provide a general framework applicable to a broad class of electron collision processes involving diatomic target ions, suitable for an accurate description of challenging processes such as dissociative recombination.

74 ATOMIC AND MOLECULAR PHYSICS↗