Search NASA⌕ Search

SEARCH · Search NASA

Results for “STATE VECTOR”

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 19 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

Hybrid power system control and operating strategy based on power system state vector calculation

Controlling a hybrid power system includes calculating a power system state vector based on energy demand and a stored data array including a matrix defined by a power system hardware configuration. The control further includes producing a power request based on the power system state vector, and varying a flow of energy amongst energy devices using drive linkages in the hybrid power system based on the power request. Related apparatus, control logic and controller structure is disclosed.

Guo, Fang↗
DOE OSTI2023

HQ-Sim: High-performance State Vector Simulation of Quantum Circuits on Heterogeneous HPC Systems

Quantum circuit simulations are applied in more and more circum- stances as the quantum computing community becomes broader. It helps researchers to evaluate quantum algorithms and relieve the burden of limited quantum computing resources. However, most of the state-of-the-art quantum simulators utilize either CPU or GPU to store and calculate the state vector, which results in resource starvation. Moreover, the maximum number of qubits supported by the simulator is bounded by the memory, since the memory utilization increases exponentially with the number of qubits. In this study, we leverage Heterogeneous computing to utilize both CPU and GPU to store and update state vectors. We also integrate lossy data compression to reduce memory requirements. Specifically, we develop a heterogeneous framework that has a dynamic scheduler to fully utilize the computing resources. We apply lossy compression to chunked state vector to make the maximum number of qubits higher than the regular simulators, the compression also benefits the data movement between CPU and GPU.

Zhang, Boyuan↗
DOE OSTI2019

The Ground-State Vector of the XY Heisenberg Chain and the Gauss Decomposition

We consider the XY Heisenberg spin (1/2) chain in the fermion representation. The construction of the ground-state vector is based on the group-theoretical approach. An exact expression for the ground-state vector will allow one to study the combinatorics of the correlation functions of the model.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Observation of an Axial-Vector State in the Study of the Decay ψ ( 3686 ) → ϕ η η ′

Using ( 2712.4 ± 14.3 ) × 10 6 ψ ( 3686 ) events collected with the BESIII detector at BEPCII, a partial wave analysis of the decay ψ ( 3686 ) → ϕ η η ′ is performed with the covariant tensor approach. In addition to the established states h 1 ( 1900 ) and ϕ ( 2170 ) , an axial-vector state with a mass near 2.3 GeV / c 2 is observed for the first time. Its mass and width are measured to be 2316 ± 9 stat ± 3 0 syst MeV / c 2 and 89 ± 1 5 stat ± 2 6 syst MeV , respectively. The product branching fractions of B [ ψ ( 3686 ) → X ( 2300 ) η ′ ] B [ X ( 2300 ) → ϕ η ] and B [ ψ ( 3686 ) → X ( 2300 ) η ] B [ X ( 2300 ) → ϕ η ′ ] are determined to be ( 4.8 ± 1.3 stat ± 0.7 syst ) × 10 − 6 and ( 2.2 ± 0.7 stat ± 0.7 syst ) × 10 − 6 , respectively. The branching fraction B [ ψ ( 3686 ) → ϕ η η ′ ] is measured for the first time to be ( 3.14 ± 0.1 7 stat ± 0.2 4 syst ) × 10 − 5 . The first uncertainties are statistical and the second are systematic. Published by the American Physical Society 2025

Ablikim, M.↗
DOE OSTI2021

SV-Sim: Scalable PGAS-based State Vector Simulation of Quantum Circuits

High-performance quantum circuit simulation in a classic HPC is still imperative in the NISQ era. Observing that the major obstacle of scalable state-vector quantum simulation arises from the massively fine-grained irregular data-exchange with remote nodes, in this paper we present SV-Sim to apply the emerging PGAS-based communication models (i.e., direct peer access for intra-node CPUs/GPUs and SHMEM for inter-node CPU/GPU clusters) for efficient scalable quantum circuit simulation. Through an orchestrated device functional pointer design, SV-Sim is able to abstract the quantum gate sets across various heterogeneous backends, including IBM/Intel/AMD CPUs, NVIDIA /AMD GPUs, and Intel MIC, in a unified framework, but still asserting outstanding performance and tractable interface to higher-level quantum programming environments, such as IBM Qiskit, Microsoft Q\# and Google Cirq. Circumventing the disability of polymorphism in GPUs and leveraging the device-initiated one-sided communication, SV-Sim can process dynamically synthesized quantum circuit in a single GPU/CPU kernel without the need of expensive JIT or runtime branching, significantly improving the performance and simplifying the programming complexity for the emerging variational quantum algorithms. Evaluations on NVIDIA A100-DGX-1, V100-DGX-2, AMD MI100, ALCF Theta, and OLCF Summit HPCs show that SV-Sim can delivery scalable performance on various state-of-the-art HPC platforms, offering a useful tool for quantum algorithm validation and verification.

Li, Ang↗
DOE OSTI2022

QForte: An Efficient State-Vector Emulator and Quantum Algorithms Library for Molecular Electronic Structure

Here, we introduce a novel open-source software package QForte, a comprehensive development tool for new quantum simulation algorithms. QForte incorporates functionality for handling molecular Hamiltonians, fermionic encoding, ansatz construction, time evolution, and state-vector emulation, requiring only a classical electronic structure package as a dependency. QForte also contains black-box implementations of a wide variety of quantum algorithms, including variational and projective quantum eigensolvers, adaptive eigensolvers, quantum imaginary time evolution, and quantum Krylov methods. We highlight two features of QForte: (i) how the Python class structure of QForte enables the facile implementation of new algorithms, and (ii) how existing algorithms can be executed in just a few lines of code.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2022

Efficient Hierarchical State Vector Simulation of Quantum Circuits via Acyclic Graph Partitioning

Early but promising results in quantum computing have been enabled by the concurrent development of quantum algorithms, devices, and materials. Classical simulation of quantum programs has enabled the design and analysis of algorithms and implementation strategies targeting current and anticipated quantum device architectures. In this paper, we present a graph-based approach to achieve efficient quantum circuit simulation. Our approach involves partitioning the graph representation of a given quantum circuit into sub-graphs/circuits that exhibit better data locality. Simulation of each sub-circuit is organized hierarchically, with the iterative construction and simulation of smaller state vectors, improving overall performance. Also, this partitioning reduces the number of passes through data, improving the total computation time. We present three partitioning strategies and observe that acyclic graph partitioning typically results in the best time-to-solution. In contrast, other strategies reduce the partitioning time at the expense of potentially increased simulation times. Experimental evaluation demonstrates the effectiveness of our approach.

Fang, Bo↗
DOE OSTI2019

Coherent Gamow states for the hyperbolic Pöschl–Teller potential

Highlights: •The use of Gamow states as coherent states. •The case of hyperbolic Pöschl–Teller potential. •Bosonic expansions. -- Abstract: We have defined a pair of families of coherent states using creation and annihilation operators relating the Gamow states, vector states for non-relativistic quantum resonances. We have used an explicit one dimensional model, for which these operators may be explicitly written: the one dimensional Pöschl–Teller Hamiltonian. We have shown that this model may serve as an example for the pseudo-boson formalism.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2025

Ground state energy and magnetization curve of a frustrated magnetic system from real-time evolution on a digital quantum processor

Models of interacting many-body quantum systems that may realize new exotic phases of matter, notably quantum spin liquids, are challenging to study using even state-of-the-art classical methods such as tensor network simulations. Quantum computing provides a promising route for overcoming these difficulties to find ground states, dynamics, and more. In this paper, we argue that recently developed hybrid quantum-classical algorithms based on real-time evolution are promising methods for solving a particularly important model in the search for spin liquids, the antiferromagnetic Heisenberg model on the two-dimensional kagome lattice. We show how to construct efficient quantum circuits to implement time evolution for the model and to evaluate key observables on the quantum computer, and we argue that the method has favorable scaling with increasing system size. We then restrict to a 12-spin star plaquette from the kagome lattice and a related 8-spin system, and we give an empirical demonstration on these small systems that the hybrid algorithms can efficiently find the ground state energy and the magnetization curve. For these demonstrations, we use four levels of approximation: exact state vectors, exact state vectors with statistical noise from sampling, noisy classical emulators, and (for the 8-spin system only) real quantum hardware, specifically the Quantinuum H1-1 processor; for the noisy simulations and hardware demonstration, we also employ error mitigation strategies based on the symmetries of the Hamiltonian. Our results strongly suggest that these hybrid algorithms present a promising direction for studying quantum spin liquids and more generally for resolving important unsolved problems in condensed matter theory and beyond.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Searches for exclusive Higgs and Z boson decays into a vector quarkonium state and a photon using 139 fb$^{-1}$ of ATLAS $\sqrt{s}=13$ TeV proton–proton collision data

Searches for the exclusive decays of Higgs and Z bosons into a vector quarkonium state and a photon are performed in the μ + μ - γ final state with a proton– proton collision data sample corresponding to an integrated luminosity of 139 fb -1 collected at $\sqrt{s}=13$ TeV with the ATLAS detector at the CERN Large Hadron Collider. The observed data are compatible with the expected back grounds. The 95% confidence-level upper limits on the branching fractions of the Higgs boson decays into J/ψ γ , ψ(2S) γ , and $Υ$(1S, 2S, 3S) γ are found to be 2.0 × 10 -4 , 10.5×10 -4 , and (2.5, 4.2, 3.4)×10 -4 , respectively, assuming Standard Model production of the Higgs boson. The corresponding 95% CL upper limits on the branching fractions of the Z boson decays are 1.2 × 10 -6 , 2.4 × 10 -6 , and (1.1, 1.3, 2.4) × 10 -6 . An observed 95% CL interval of (-133, 175) is obtained for the κ c /κ γ ratio of Higgs boson coupling modifiers, and a 95% CL interval of (-37, 40) is obtained for κ b /κ γ .

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2025

Polariton spectra under the collective coupling regime. I. Efficient simulation of linear spectra and quantum dynamics

We outline two general theoretical techniques to simulate polariton quantum dynamics and optical spectra under the collective coupling regimes described by a Holstein–Tavis–Cummings (HTC) model Hamiltonian. The first one takes advantage of sparsity of the HTC Hamiltonian, which allows one to reduce the cost of acting polariton Hamiltonian onto a state vector to the linear order of the number of states, instead of the quadratic order. The second one is applying the well-known Chebyshev series expansion approach for quantum dynamics propagation and to simulate the polariton dynamics in the HTC system; this approach allows us to use a much larger time step for propagation and only requires a few recursive operations of the polariton Hamiltonian acting on state vectors. These two theoretical approaches are general and can be applied to any trajectory-based non-adiabatic quantum dynamics methods. We apply these two techniques with our previously developed Lindblad-partially linearized density matrix approach to simulate the linear absorption spectra of the HTC model system, with both inhomogeneous site energy disorders and dipolar orientational disorders. Our numerical results agree well with the previous analytic and numerical work.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2023

Machine Learning-Based Model Predictive Control of Two-Time-Scale Systems

In this study, we present a general form of nonlinear two-time-scale systems, where singular perturbation analysis is used to separate the dynamics of the slow and fast subsystems. Machine learning techniques are utilized to approximate the dynamics of both subsystems. Specifically, a recurrent neural network (RNN) and a feedforward neural network (FNN) are used to predict the slow and fast state vectors, respectively. Moreover, we investigate the generalization error bounds for these machine learning models approximating the dynamics of two-time-scale systems. Next, under the assumption that the fast states are asymptotically stable, our focus shifts toward designing a Lyapunov-based model predictive control (LMPC) scheme that exclusively employs the RNN to predict the dynamics of the slow states. Additionally, we derive sufficient conditions to guarantee the closed-loop stability of the system under the sample-and-hold implementation of the controller. A nonlinear chemical process example is used to demonstrate the theory. In particular, two RNN models are constructed: one to model the full two-time-scale system and the other to predict solely the slow state vector. Both models are integrated within the LMPC scheme, and we compare their closed-loop performance while assessing the computational time required to execute the LMPC optimization problem.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

A projection-based analytical Jacobian framework for chemical kinetics applications

A major challenge in simulating complex combustion systems with detailed chemical kinetic models is the cost of integrating the chemical source terms, often done using stiff ODE solvers that require frequent Jacobian evaluations. Using analytically derived Jacobian matrices instead of divided-difference-based numerical Jacobian approximations can significantly reduce the associated computational cost. However, ambiguities arise in the formulation of analytical Jacobians because the chemical state of the system, or state vector, can be expressed in multiple ways, involving variables that are typically not independent from one another. Here, in this work, the consequences of those ambiguities on practical calculations are characterized in detail, and a generalized, projection-based framework is proposed as a mitigation strategy. Performances are assessed in a series of test cases involving a variety of configurations and numerical solution approaches. Results show that with proper treatment, commonly used analytical Jacobian formulations can be considered as equivalent for practical purposes, thereby alleviating concerns that the state vector chosen to express the governing equations and corresponding analytical Jacobian may significantly impact the accuracy of the simulations.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗