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.
We present a quantum algorithm to compute the logarithm of the determinant of the fermion matrix, assuming access to a classical lattice gauge field configuration. The algorithm uses the quantum eigenvalue transform, and quantum mean estimation, giving a query complexity that scales like O ( V log ( V ) ) in the matrix dimension V . Published by the American Physical Society 2025
The low-energy, finite-volume spectrum of the two-nucleon system at a quark mass corresponding to a pion mass of 𝑚𝜋≈806 MeV is studied with lattice quantum chromodynamics (LQCD) using variational methods. The interpolating-operator sets used in [Variational study of two-nucleon systems with lattice QCD, Phys. Rev. D 107, 094508 (2023).] are extended by including a complete basis of local hexaquark operators, as well as plane-wave dibaryon operators built from products of both positive- and negative-parity nucleon operators. Results are presented for the isosinglet and isotriplet two-nucleon channels. In both channels, noticeably weaker variational bounds on the lowest few energy eigenvalues are obtained from operator sets which contain only hexaquark operators or operators constructed from the product of two negative-parity nucleons, while other operator sets produce low-energy variational bounds which are consistent within statistical uncertainties. The consequences of these studies for the LQCD understanding of the two-nucleon spectrum are investigated.
Here, we study the energy landscapes of particles with short-range attractive interactions as the range of the interactions increases. Starting with the set of local minima for 6 ≤ $\textit{N}$ ≤ 12 hard spheres that are “sticky,” i.e., they interact only when their surfaces are exactly in contact, we use numerical continuation to evolve the local minima (clusters) as the range of the potential increases, using both the Lennard-Jones and Morse families of interaction potentials. As the range increases, clusters merge, until at long ranges only one or two clusters are left. We compare clusters obtained by continuation with different potentials and find that for short and medium ranges, up to about 30% of particle diameter, the continued clusters are nearly identical, both within and across families of potentials. For longer ranges, the clusters vary significantly, with more variation between families of potentials than within a family. We analyze the mechanisms behind the merge events and find that most rearrangements occur when a pair of nonbonded particles comes within the range of the potential. An exception occurs for nonharmonic clusters, i.e., those that have a zero eigenvalue in their Hessian, which undergo a more global rearrangement.
Here, we present a semidefinite programming algorithm to find eigenvalues of Schrödinger operators within the bootstrap approach to quantum mechanics. The bootstrap approach involves two ingredients: a nonlinear set of constraints on the variables (expectation values of operators in an energy eigenstate), plus positivity constraints (unitarity) that need to be satisfied. By fixing the energy we linearize all the constraints and show that the feasibility problem can be presented as an optimization problem for the variables that are not fixed by the constraints and one additional slack variable that measures the failure of positivity. To illustrate the method we are able to obtain high-precision, sharp bounds on eigenenergies for arbitrary confining polynomial potentials in one dimension.
All known examples suggesting an exponential separation between classical simulation algorithms and stoquastic adiabatic quantum computing (StoqAQC) exploit symmetries that constrain adiabatic dynamics to effective, symmetric subspaces. The symmetries produce large effective eigenvalue gaps, which in turn make adiabatic computation efficient. We present a classical algorithm to subexponentially sample from an effective subspace of any k -local stoquastic Hamiltonian H , without a priori knowledge of its symmetries (or near symmetries). Our algorithm maps any k -local Hamiltonian to a graph G = ( V , E ) with | V | = O (poly (n)) , where n is the number of qubits. Given the well-known result of Babai [Graph isomorphism in quasipolynomial time, in Proceedings of the Forty-Eighth Annual ACM Symposium on Theory of Computing (2016), pp. 684–697], we exploit graph isomorphism to study the automorphisms of G and arrive at an algorithm quasipolynomial in | V | for producing samples from effective subspace eigenstates of H . Our results rule out exponential separations between StoqAQC and classical computation that arise from hidden symmetries in k -local Hamiltonians. Our graph representation of H is not limited to stoquastic Hamiltonians and may rule out corresponding obstructions in nonstoquastic cases, or be useful in studying additional properties of k -local Hamiltonians.
Eigenvector continuation is a computational method that finds the extremal eigenvalues and eigenvectors of a Hamiltonian matrix with one or more control parameters. It does this by projection onto a subspace of eigenvectors corresponding to selected training values of the control parameters. The method has proven to be very efficient and accurate for interpolating and extrapolating eigenvectors. However, almost nothing is known about how the method converges, and its rapid convergence properties have remained mysterious. In this Letter, we present the first study of the convergence of eigenvector continuation. In order to perform the mathematical analysis, we introduce a new variant of eigenvector continuation that we call vector continuation. We first prove that eigenvector continuation and vector continuation have identical convergence properties and then analyze the convergence of vector continuation. Our analysis shows that, in general, eigenvector continuation converges more rapidly than perturbation theory. The faster convergence is achieved by eliminating a phenomenon that we call differential folding, the interference between nonorthogonal vectors appearing at different orders in perturbation theory. From our analysis we can predict how eigenvector continuation converges both inside and outside the radius of convergence of perturbation theory. Further, while eigenvector continuation is a nonperturbative method, we show that its rate of convergence can be deduced from power series expansions of the eigenvectors. Our results also yield new insights into the nature of divergences in perturbation theory.
Predictive 3D optimization reveals a novel approach to modify a nonaxisymmetric magnetic perturbation to be entirely harmless for tokamaks, by essentially restoring quasisymmetry in perturbed particle orbits as much as possible. Such a quasisymmetric magnetic perturbation (QSMP) has been designed and successfully tested in the KSTAR and DIII-D tokamaks, demonstrating no performance degradation despite the large overall amplitudes of nonaxisymmetric fields and strong response otherwise expected in the tested plasmas. The results indicate that a quasisymmetric optimization is a robust path of error field correction across the resonant and nonresonant field spectrum in a tokamak, leveraging the prevailing concept of quasisymmetry for general 3D plasma confinement systems such as stellarators. Finally, the optimization becomes, in fact, a simple eigenvalue problem to the so-called torque response matrices if a perturbed equilibrium is calculated consistent with nonaxisymmetric neoclassical transport.
Disorder and interactions can lead to the breakdown of statistical mechanics in certain quantum systems, a phenomenon known as many-body localization (MBL). Much of the phenomenology of MBL emerges from the existence of localized-bits, or l-bits, a set of conserved quantities that are spatially localized and binary (i.e., possess only ±1 eigenvalues). While MBL and l-bits are known to exist in one-dimensional systems, their existence in dimensions greater than one is a key open question. To tackle this question, we develop an algorithm that can find approximate binary l-bits in arbitrary dimensions by adaptively generating a basis of operators in which to represent the l-bit. We use the algorithm to study four models: the one-, two-, and three-dimensional disordered Heisenberg models and the two-dimensional disordered hard-core Bose-Hubbard model. For all four of the models studied, our algorithm finds high-quality l-bits at large disorder strength and rapid qualitative changes in the distributions of l-bits in particular ranges of disorder strengths, suggesting the existence of MBL transitions. Furthermore, these transitions in the one-dimensional Heisenberg model and two-dimensional Bose-Hubbard model coincide well with past estimates of the critical disorder strengths in these models which further validates the evidence of MBL-like behavior in the other two and three-dimensional models we examine. In addition to finding MBL-like behavior in higher dimensions, our algorithm can be used to probe MBL in various geometries and dimensionality.
Here, we adapt the robust phase estimation algorithm to the evaluation of energy differences between two eigenstates using a quantum computer. This approach does not require controlled unitaries between auxiliary and system registers or even a single auxiliary qubit. As a proof of concept, we calculate the energies of the ground state and low-lying electronic excitations of a hydrogen molecule in a minimal basis on a cloud quantum computer. The denominative robustness of our approach is then quantified in terms of a high tolerance to coherent errors in the state preparation and measurement. Conceptually, we note that all quantum phase estimation algorithms ultimately evaluate eigenvalue differences.
In this work, we employ electric circuit networks to study topological states of matter in non-Hermitian systems enriched by parity-time symmetry $\mathcal{PT}$ and chiral symmetry anti-$\mathcal{PT (APT)}$. The topological structure manifests itself in the complex admittance bands which yields excellent measurability and signal to noise ratio. We analyze the impact of $\mathcal{PT}$-symmetric gain and loss on localized edge and defect states in a non-Hermitian Su-Schrieffer-Heeger (SSH) circuit. We realize all three symmetry phases of the system, including the $\mathcal{APT}$-symmetric regime that occurs at large gain and loss. We measure the admittance spectrum and eigenstates for arbitrary boundary conditions, which allows us to resolve not only topological edge states, but also a novel $\mathcal{PT}$-symmetric $\mathbb{Z}_2$ invariant of the bulk. We discover the distinct properties of topological edge states and defect states in the phase diagram. In the regime that is not $\mathcal{PT}$ symmetric, the topological defect state disappears and only reemerges when $\mathcal{APT}$ symmetry is reached, while the topological edge states always prevail and only experience a shift in eigenvalue. Our findings unveil a future route for topological defect engineering and tuning in non-Hermitian systems of arbitrary dimension.
We present a stochastic quantum computing algorithm that can prepare any eigenvector of a quantum Hamiltonian within a selected energy interval $\ [E-\epsilon, E+\epsilon]$. In order to reduce the spectral weight of all other eigenvectors by a suppression factor δ, the required computational effort scales as $\ O[|\log \delta|/(p \epsilon)]$, where p s the squared overlap of the initial state with the target eigenvector. The method, which we call the rodeo algorithm, uses auxiliary qubits to control the time evolution of the Hamiltonian minus some tunable parameter E . In this manner, we converge to the target eigenvector with exponential accuracy in the number of measurements. In addition to preparing eigenvectors, the method can also compute the full spectrum of the Hamiltonian. We illustrate the performance with several examples. For energy eigenvalue determination with error $\epsilon$, the computational scaling is $\ O[(\log \epsilon)^2/(p \epsilon)]$. For eigenstate preparation, the computational scaling is $\ O(\log \Delta/p)$, where $\Delta$ is the magnitude of the orthogonal component of the residual vector. The speed for eigenstate preparation is exponentially faster than that for phase estimation or adiabatic evolution.
Recent work has shown that loop corrections from massless particles generate $\frac{3}{2}$ log𝑇 Hawking corrections to black hole entropy which dominate the thermodynamics of cold near-extreme charged black holes. Here we adapt this analysis to near-extreme Kerr black holes. Like AdS 2 ×𝑆 2 , the near-horizon extreme Kerr (NHEK) metric has a family of normalizable zero modes corresponding to reparametrizations of boundary time. The path integral over these zero modes leads to an infrared divergence in the one-loop approximation to the Euclidean NHEK partition function. We regulate this divergence by retaining the leading finite temperature correction in the NHEK scaling limit. This “not-NHEK” geometry lifts the eigenvalues of the zero modes, rendering the path integral infrared finite. The quantum-corrected near-extremal entropy exhibits $\frac{3}{2}$ log𝑇 Hawking behavior characteristic of the Schwarzian model and predicts a lifting of the ground state degeneracy for the extremal Kerr black hole.
Quantum fluctuations in QCD influence nucleon structure and interactions, with pion production serving as a key probe of chiral dynamics. In this Letter, we present a lattice QCD calculation of multipole amplitudes at threshold, related to both pion electroproduction and weak production from a nucleon, using two gauge ensembles near the physical pion mass. We develop a technique for spin projection and construct multiple operators for analyzing the generalized eigenvalue problem in both the nucleon-pion system in the center-of-mass frame and the nucleon system with nonzero momentum. The numerical lattice results are then compared with those extracted from experimental data and predicted by low-energy theorems incorporating one-loop corrections. Published by the American Physical Society 2025
Application of isotropic pressure or uniaxial strain alters the elastic properties of materials; sufficiently large strains can drive structural transformations. Linear elasticity describes stability against infinitesimal strains, while nonlinear elasticity describes the response to finite deformations. Here, it was previously shown that uniaxial strain along [100] drives refractory metals and alloys towards mechanical instabilities. These include an extensional instability, and a symmetry-breaking orthorhombic distortion caused by a Jahn-Teller-Peierls instability that splays the cubic lattice vectors. Here we analyze these transitions in depth. Eigenvalues and eigenvectors of the Wallace tensor identify and classify linear instabilities in the presence of strain. We show that both instabilities are discontinuous, leading to discrete jumps in the lattice parameters. We provide physical intuition for the instabilities by analyzing the changes in first-principles energy, stress, bond lengths, and angles upon application of strain. Electronic band structure calculations show differential occupation of bonding and antibonding orbitals, driven by the changing bond lengths and leading to the structural transformations. Strain thresholds for these instabilities depend on the valence electron count.
The dependence of ab initio many-body perturbation theory within the $\textit{GW}$ approximation on the eigensystem used in calculating quasiparticle corrections limits this method's predictive power. Here, we investigate the accuracy of the recently developed Wannier-localized optimally tuned screened range-separated hybrid (WOT-SRSH) functional as a generalized Kohn-Sham starting point for single-shot $\textit{GW}$ ($G_0W_0$) calculations for a range of semiconductors and insulators. Comparison to calculations based on well-established functionals, namely, PBE, PBE0, and HSE, as well as to self-consistent GW schemes and to experiment, shows that band gaps computed via $G_0W_0$@WOT-SRSH have a level of precision and accuracy that is comparable to that of more advanced methods such as quasiparticle self-consistent $\textit{GW}$ and eigenvalue self-consistent $\textit{GW}$. In this work, we also find that $G_0W_0$@WOT-SRSH improves the description of states deeper in the valence band manifold. Finally, we show that $G_0W_0$@WOT-SRSH significantly reduces the sensitivity of computed band gaps to ambiguities in the underlying WOT-SRSH tuning procedure.
Currently available quantum hardware allows for small-scale implementations of quantum machine learning algorithms. Such experiments aid the search for applications of quantum computers by benchmarking the near-term feasibility of candidate algorithms. Here we demonstrate the quantum learning of a two-qubit unitary by a sequence of three parameterized quantum circuits containing a total of 21 variational parameters. Moreover, we variationally diagonalize the unitary to learn its spectral decomposition, i.e., its eigenvalues and eigenvectors. We illustrate how this can be used as a subroutine to compress the depth of dynamical quantum simulations. One can view our implementation as a demonstration of entanglement-enhanced machine learning, as only a single (entangled) training data pair is required to learn a 4 × 4 unitary matrix.
Characterizing entanglement in quantum materials is crucial for advancing next-generation quantum technologies. Despite recent strides in witnessing entanglement in magnetic materials with distinguishable spin modes, quantifying entanglement in systems formed by indistinguishable electrons remains a formidable challenge. To solve this problem, we introduce a method to extract various four-fermion correlations by analyzing the nonlinearity in resonant inelastic x-ray scattering spectra. These correlations constitute the primary components of the cumulant two-particle reduced density matrix. We further derive bounds for its eigenvalues and demonstrate the linear scaling with fermionic entanglement depth, providing a reliable witness for entanglement. Using the material-relevant strongly correlated models as examples, we show how this entanglement witness can efficiently quantify multipartite entanglement across different phase regions, highlighting its advantage over quantum Fisher information. Published by the American Physical Society 2025
Lloyd [Nat. Commun. , 10138 (2016)] were first to demonstrate the promise of quantum algorithms for computing Betti numbers, a way to characterize topological features of data sets. Here, we propose, analyze, and optimize an improved quantum algorithm for topological data analysis (TDA) with reduced scaling, including a method for preparing Dicke states based on inequality testing, a more efficient amplitude estimation algorithm using Kaiser windows, and an optimal implementation of eigenvalue projectors based on Chebyshev polynomials. We compile our approach to a fault-tolerant gate set and estimate constant factors in the Toffoli complexity. Our analysis reveals that superquadratic quantum speedups are only possible for this problem when targeting a multiplicative error approximation and the Betti number grows asymptotically. Further, we propose a dequantization of the quantum TDA algorithm that shows that having exponentially large dimension and Betti number are necessary, but insufficient conditions, for superpolynomial advantage. We then introduce and analyze specific problem examples which have parameters in the regime where superpolynomial advantages may be achieved, and argue that quantum circuits with tens of billions of Toffoli gates can solve seemingly classically intractable instances. Published by the American Physical Society 2024