Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “polynomials”

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 145 records · Page 8

Leveraging Hamiltonian simulation techniques to compile operations on bosonic devices

Circuit quantum electrodynamics enables the combined use of qubits and oscillator modes. Despite a variety of available gate sets, many hybrid qubit-boson (i.e. qubit-oscillator) operations are realizable only through optimal control theory, which is oftentimes intractable and uninterpretable. We introduce an analytic approach with rigorously proven error bounds for realizing specific classes of operations via two matrix product formulas commonly used in Hamiltonian simulation, the Lie–Trotter–Suzuki and Baker–Campbell–Hausdorff product formulas. We show how this technique can be used to realize a number of operations of interest, including polynomials of annihilation and creation operators, namely (a) p (a † ) q for integer p, q. We show examples of this paradigm including obtaining universal control within a subspace of the entire Fock space of an oscillator, state preparation of a fixed photon number in the cavity, simulation of the Jaynes–Cummings Hamiltonian, and simulation of the Hong-Ou-Mandel effect. This work demonstrates how techniques from Hamiltonian simulation can be applied to better control hybrid qubit-boson devices.

bosonic qubits↗

Galerkin formulation of path integrals in lattice field theory

We present a mathematical framework for Galerkin formulations of path integrals in lattice field theory. The framework is based on using the degrees of freedom (DOFs) associated to a Galerkin discretization as the fundamental lattice variables. We formulate standard concepts in lattice field theory, such as the partition function and correlation functions, in terms of the DOFs. For example, using continuous finite element spaces, we show that the two-point spatial correlation function can be defined between any two points on the domain (as opposed to at just lattice sites) and furthermore, this two-point function satisfies a weak propagator (or Green’s function) identity, in analogy to the continuum case, as well as a convergence estimate obtained from the standard finite element techniques. Furthermore, this framework leads naturally to higher-order formulations of lattice field theories by considering higher-order finite element spaces for the Galerkin discretization. We consider analytical and numerical examples of scalar field theory to investigate how increasing the order of piecewise polynomial finite element spaces affect the approximation of lattice observables. Finally, we sketch an outline of this Galerkin framework in the context of gauge field theories.

97 MATHEMATICS AND COMPUTING↗

Two-dimensional coherent spectrum of high-spin models via a quantum computing approach

Here in this work we present and benchmark a quantum computing approach to calculate the two-dimensional coherent spectrum (2DCS) of high-spin models. Our approach is based on simulating their real-time dynamics in the presence of several magnetic field pulses, which are spaced in time. We utilize the adaptive variational quantum dynamics simulation algorithm for the study due to its compact circuits, which enables simulations over sufficiently long times to achieve the required resolution in frequency space. Specifically, we consider an antiferromagnetic quantum spin model that incorporates Dzyaloshinskii-Moriya interactions and single-ion anisotropy. The obtained 2DCS spectra exhibit distinct peaks at multiples of the magnon frequency, arising from transitions between different eigenstates of the unperturbed Hamiltonian. By comparing the one-dimensional coherent spectrum with 2DCS, we demonstrate that 2DCS provides a higher resolution of the energy spectrum. We further investigate how the quantum resources scale with the magnitude of the spin using two different binary encodings of the high-spin operators: the standard binary encoding and the Gray code. At low magnetic fields both encodings require comparable quantum resources, but at larger field strengths the Gray code is advantageous. Numerical simulations for spin models with increasing number of sites indicate a polynomial system-size scaling for quantum resources. Lastly, we compare the numerical 2DCS with experimental results on a rare-earth orthoferrite system. The observed strength of the magnonic high-harmonic generation signals in the 2DCS of the quantum high-spin model aligns well with the experimental data, showing significant improvement over the corresponding mean-field results.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Learning to classify quantum phases of matter with a few measurements

We study the identification of quantum phases of matter, at zero temperature, when only part of the phase diagram is known in advance. Following a supervised learning approach, we show how to use our previous knowledge to construct an observable capable of classifying the phase even in the unknown region. By using a combination of classical and quantum techniques, such as tensor networks, kernel methods, generalization bounds, quantum algorithms, and shadow estimators, we show that, in some cases, the certification of new ground states can be obtained with a polynomial number of measurements. An important application of our findings is the classification of the phases of matter obtained in quantum simulators, e.g. cold atom experiments, capable of efficiently preparing ground states of complex many-particle systems and applying simple measurements, e.g. single qubit measurements, but unable to perform a universal set of gates.

quantum machine learning↗

Hybrid algorithm for the time-dependent Hartree–Fock method using the Yang–Baxter equation on quantum computers *

Abstract The time-dependent Hartree–Fock (TDHF) method is an approach to simulate the mean field dynamics of electrons within the assumption that the electrons move independently in their self-consistent average field and within the space of single Slater determinants. One of the major advantages of performing time dynamics within Hartree–Fock theory is the free fermionic nature of the problem, which makes TDHF classically simulatable in polynomial time. Here, we present a hybrid TDHF implementation for quantum computers. This quantum circuit grows with time; but with our recent work on circuit compression via the Yang–Baxter equation (YBE), the resulting circuit is constant depth. This study provides a new way to simulate TDHF with the aid of a quantum device as well as provides a new direction for the application of YBE symmetry in quantum chemistry simulations.

97 MATHEMATICS AND COMPUTING↗

Analog and symbolic computation through the Koopman framework

We develop a Koopman operator framework for studying the computational structure of dynamical systems. Specifically, we show that the resolvent of the Koopman operator provides a natural abstraction of halting, yielding a ‘Koopman halting problem’ that is recursively enumerable in general. For symbolic systems, such as those defined on Cantor space, this operator formulation captures reachability between clopen sets, while for equicontinuous systems we prove that the Koopman halting problem is decidable. Our framework demonstrates that absorbing (halting) states in coarse-grained finite automata correspond to Koopman eigenfunctions with eigenvalue one, while cycles in the transition graph impose spectral constraints associated with periodic dynamics. These results provide a unifying perspective on computation in symbolic and analog systems, showing how computational universality is reflected in operator spectra, invariant subspaces, and algebraic structures. Beyond symbolic dynamics, this operator-theoretic lens opens pathways to analyze the computational properties of a broader class of dynamical systems, including polynomial and analog models, and suggests that computational hardness may admit dynamical signatures in terms of Koopman spectral structure.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DESI DR2 Galaxy luminosity functions

We present galaxy luminosity functions (LFs) for the Dark Energy Spectroscopic Instrument (DESI) DR2 Bright Galaxy Survey (BGS) in the g, r, z, and $w1$ bands over $0.002\lt z\lt 0.6$. Our analysis uses updated k-corrections and evolutionary corrections, including new polynomial kcorrection fits derived from BGS Year 1 data that supersede earlier GAMA-based prescriptions. Exploiting the statistical power of DESI, we measure LFs to very faint magnitudes, reaching $^{0.1}M_r-5\log h\sim -10$. Independent measurements from the North and South survey regions show excellent agreement around the LF knee, but the very small statistical uncertainties reveal that simple analytic forms fail to capture the full LF shape. The bright end departs from a pure exponential decline, while the faint end exhibits complex, non-powerlaw behaviour, including a pronounced upturn at $^{0.1}M_r-5\log h\gtrsim -15$, which is stronger for red galaxies than for blue. We show that our LFs are largely complete for galaxies with surface brightness $\mu _{50}\lt 25$, and that an apparent steepening fainter than $-13$ is driven primarily by local overdensity and fragmentation of large galaxies. A systematic North–South offset at the brightest magnitudes is traced to red galaxies and may reflect shallower North photometry underestimating extended earlytype profiles, although this remains inconclusive. We therefore also provide LFs based on model Petrosian magnitudes. Redshift splitting reveals small but significant residuals, indicating limitations of a simple global evolutionary model. Using the redshift limits of J. Loveday et al. (2012), we find excellent agreement with GAMA, with substantially reduced statistical errors. These measurements provide a precise reference for studies of environmental and population-dependent LFs and for testing galaxy formation models.

79 ASTRONOMY AND ASTROPHYSICS↗

Lie-algebraic classical simulations for quantum computing

The classical simulation of quantum dynamics plays an important role in our understanding of quantum complexity and in the development of quantum technologies. Efficient techniques such as those based on the Gottesman-Knill theorem for Clifford circuits, tensor networks for low entanglement-generating circuits, or Wick's theorem for fermionic Gaussian states have become central tools in quantum computing. In this work, we contribute to this body of knowledge by presenting a framework for classical simulations, dubbed “𝔤-sim”, which is based on the underlying Lie algebraic structure of the dynamical process. When the dimension of the algebra grows at most polynomially in the system size, there exist observables for which the simulation is efficient. Indeed, we show that 𝔤-sim enables new regimes for classical simulations, is able to deal with certain forms of noise in the evolution, as well as can be used to tackle several paradigmatic variational and nonvariational quantum computing tasks. For the former, we perform Lie-algebraic simulations to train and optimize parametrized quantum circuits (thus effectively showing that some variational models can be dequantized), design enhanced parameter initialization strategies, solve tasks of quantum circuit synthesis, and train a quantum-phase classifier. For the latter, we report large-scale noiseless and noisy simulations on benchmark problems. By comparing the limitations of 𝔤-sim and certain Wick's theorem-based simulations, we find that the two methods become inefficient for different types of states or observables, hinting at the existence of distinct, nonequivalent resources for classical simulation.

97 MATHEMATICS AND COMPUTING↗

String-based axial and helicity-flip GPDs: A comparison to lattice QCD

We construct an analytic, string-based representation of the nucleon’s axial and helicity-flip conformal moments of generalized parton distributions (GPDs) that holds for skewness and for both the quark and gluon channels. The starting point is the Mellin-Barnes resummation of the conformal partial-wave expansion, where the moments are parametrized by open- (Reggeon) and closed-string (Pomeron) trajectories with slopes determined by experimental form factors and meson/glueball spectroscopy. The forward limits are fixed by the empirical unpolarized and polarized parton distributions. Polynomiality, crossing symmetry, and support are satisfied by construction. After next-to-leading order Dokshitzer-Gribov-Lipatov-Altarelli-Parisi/Efremov-Radyushkin-Brodsky-Lepage evolution to μ = 2 GeV our analytic framework (i) reproduces some of the currently available lattice moments of E and H˜ in the nonsinglet sector, (ii) predicts sea-quark and gluon polarized moments that will be testable by forthcoming simulations and experiments at Jefferson Lab and the future Electron-Ion Collider, and (iii) yields axial and helicity-flip GPDs in x-space in reasonable agreement with lattice QCD.

Gauge-gravity dualities↗

Efficient Simulation of Logical Magic State Preparation Protocols

Developing space- and time-efficient logical magic state preparation (MSP) protocols will likely be an essential step toward building a large-scale fault-tolerant quantum computer. Motivated by this need, we introduce a scalable method for simulating logical MSP protocols under the standard circuit-level noise model. When applied to protocols based on code-switching, magic state cultivation, and magic state distillation, our method yields a complexity polynomial in (i) the number of qubits and (ii) the nonstabilizerness, e.g., stabilizer rank or Pauli rank, of the target encoded magic state. The efficiency of our simulation method is rooted in a curious fact: every circuit-level Pauli error in these protocols propagates to a Clifford error at the end. This property is satisfied by a large family of protocols, including those that repeatedly measure a transversal Clifford that squares to a Pauli. We provide a proof-of-principle numerical simulation that prepares a magic state using such logical Clifford measurements. Our work enables practical simulation of logical MSP protocols without resorting to approximations or resource-intensive state-vector simulations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Deterministic Quantum Trajectory via Imaginary Time Evolution

Stochastic quantum trajectories, such as pure state evolutions under unitary dynamics and random measurements, offer a crucial ensemble description of many-body open system dynamics. Recent studies have highlighted that individual quantum trajectories also encode essential physical information. Prominent examples include measurement-induced phase transitions, where a pure quantum state corresponding to fixed measurement outcomes (trajectories) exhibits distinct entanglement phases, depending on the measurement rate. However, direct observation of this effect is hindered by an exponential postselection barrier, whereby the probability of realizing a specific trajectory is exponentially small. We propose a deterministic method to efficiently prepare quantum trajectories in polynomial time using imaginary time evolution and, thus, overcome this fundamental challenge. Here, we demonstrate that our method applies to a certain class of quantum states, and argue that universal approaches do not exist for any quantum trajectories. Our result paves the way for experimentally exploring the physics of individual quantum trajectories at scale and enables direct observation of certain postselection-dependent phenomena.

Mittal, Shivan [Los Alamos National Laboratory (LA↗

Skewness-dependent moments of the pion GPD from nonlocal quark-bilinear correlators

We present lattice QCD calculations of the odd Mellin moments of pion valence-quark generalized parton distribution up to fifth order ⟨𝑥 4 ⟩ and for the skewness range [−0.33, 0] using operator product expansion of bilocal quark-bilinear operators. The calculations are performed on an ensemble with lattice spacing 𝑎 = 0.04 fm and valence pion mass 300 MeV, employing boosted pion states with momenta up to 2.428 GeV and momentum transfers reaching 2.748 GeV 2 . We employ ratio-scheme renormalization and next-to-leading logarithmic resummed perturbative matching. At zero skewness, our results are consistent with previous lattice studies. By combining matrix elements at multiple values of skewness and momentum transfer, skewness-dependent moments are obtained through simultaneous polynomiality-constrained fits.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Anatomy of information scrambling and decoherence in the integrable Sachdev-Ye-Kitaev model

The growth of information scrambling, captured by out-of-time-order correlation functions (OTOCs), is a central indicator of the nature of many-body quantum dynamics. Here, we compute analytically the complete time dependence of the OTOC for an integrable Sachdev-Ye-Kitaev (SYK) model, 𝑁 Majoranas with random two-body interactions of infinite range, coupled to a Markovian bath at finite temperature. In the limit of no coupling to the bath, the time evolution of scrambling experiences different stages. For 𝑡≲√𝑁, after an initial polynomial growth, the OTOC approaches saturation in a power-law fashion with oscillations superimposed. At 𝑡∼√𝑁, the OTOC reverses trend and starts to decrease linearly in time. The reason for this linear decrease is that, despite being a subleading 1/𝑁 effect, the OTOC in this region is governed by the spectral form factor of the antisymmetric couplings of the SYK model. The linear decrease stops at 𝑡∼2⁢𝑁, the Heisenberg time, where saturation occurs. The effect of the environment is an overall exponential decay of the OTOC for times longer than the inverse of the coupling strength to the bath. Here, the oscillations at 𝑡≲√𝑁 indicate lack of thermalization—a desired feature for better performance of quantum information devices.

Open quantum systems & decoherence↗

Ansatz-Free Hamiltonian Learning with Heisenberg-Limited Scaling

Learning the unknown interactions that govern a quantum system is crucial for quantum information processing, device benchmarking, and quantum sensing. The problem, known as Hamiltonian learning, is well understood under the assumption that interactions are local, but this assumption may not hold for arbitrary Hamiltonians. Previous methods all require high-order inverse polynomial dependency with precision, unable to surpass the standard quantum limit and reach the gold-standard Heisenberg-limited scaling. Whether Heisenberg-limited Hamiltonian learning is possible without prior assumptions about the interaction structures, a challenge we term ansatz-free Hamiltonian learning , remains an open question. In this work, we present a quantum algorithm to learn arbitrary sparse Hamiltonians without any structure constraints using only black-box queries of the system’s real-time evolution and minimal digital controls to attain Heisenberg-limited scaling in estimation error. Our method is also resilient to state-preparation-and-measurement errors, enhancing its practical feasibility. We numerically demonstrate our ansatz-free protocol for learning physical Hamiltonians and validating analog quantum simulations, benchmarking our performance against the state-of-the-art Heisenberg-limited learning approach. Moreover, we establish a fundamental trade-off between total evolution time and quantum control on learning arbitrary interactions, revealing the intrinsic interplay between controllability and total evolution-time complexity for any learning algorithm. These results pave the way for further exploration into Heisenberg-limited Hamiltonian learning in complex quantum systems under minimal assumptions, potentially enabling new benchmarking and verification protocols.

machine learning↗

Exponentially Reduced Circuit Depths Using Trotter Error Mitigation

Product formulas are a popular class of digital quantum simulation algorithms due to their conceptual simplicity, low overhead, and performance, which often exceeds theoretical expectations. Recently, Richardson extrapolation and polynomial interpolation have been proposed to mitigate the Trotter error incurred by the use of these formulas. This work provides a rigorous, general analysis of these techniques for computing time-evolved observables, simplifying the interpolation algorithm in the process, and shows that extrapolation generically improves the performance of product formulas for this task. We demonstrate that, to achieve error 𝜖 in a simulation of time 𝑇 using a 𝑝 ⁢th-order product formula with extrapolation, circuit depths of 𝑂⁡(𝑇 1+1/𝑝 ⁢polylog (1/𝜖)) are sufficient—an exponential improvement in the precision over product formulas alone. Furthermore, we prove that these algorithms achieve commutator scaling, and improve the 𝑇 complexity for the interpolation algorithm. By relaxing the requirement of performing exact Chebyshev interpolation, our simplified algorithm eliminates the need for fractional implementations of Trotter steps, reducing computational overhead. Finally, we show these techniques can be combined with the classical shadows method to estimate many time-evolved local observables. Taken together, our findings provide the strongest evidence yet for the utility of Trotter error-mitigation techniques in algorithmic applications.

quantum algorithms & computation↗

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↗

Analytical expression of a finite, long, conical canted-cosine-theta coil for particle collider interaction regions

Magnets in the accelerator interaction region (IR) present significant challenges because of high field requirements and limited available space. Conical-shaped magnets offer advantages in these environments by allowing closer placement to the interaction point while maintaining clearance from synchrotron radiation. Interestingly, numerical studies have shown that conical canted-cosine-theta (CCT) designs produce a constant field distribution along the axial direction in the IR quadrupoles for the Electron-Ion Collider (EIC) at Brookhaven National Laboratory. However, the field harmonics generated by conical CCT windings are not yet fully understood. This paper presents an analytical approach to describe the magnetic field produced by a conical surface current and proposes a method for designing conical CCT magnets for accelerator applications. First, we begin with a surface current sheet having a general cosine-theta distribution in spherical coordinates and solve the vector potential using the Green’s function. The magnetic fields generated by the conical current sheet are expressed using associated Legendre polynomials. These results are then related to circular field harmonics and integral field harmonics for designing a coil that produces a pure multipole field. Next, a single layer of the conical CCT winding path is produced based on the cosine-theta current distribution. Finally, the magnetic field quality of dipole and quadrupole conical CCT coils with multiple layers is verified using the Biot-Savart law.

Yang, Ye↗

Absence of quantization in the circular photogalvanic effect in disordered chiral Weyl semimetals

The circularly polarized photogalvanic effect (CPGE) is studied in chiral Weyl semimetals with short-range quenched disorder. Without disorder, the topological properties of chiral Weyl semimetals lead to quantization of the CPGE, which is a second-order optical response. Furthermore, using a combination of diagrammatic perturbation theory in the continuum and exact numerical calculations via the kernel polynomial method on a lattice model, we show that disorder perturbatively destabilizes the quantization of the CPGE.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗