Search NASA⌕ Search

SEARCH · Search NASA

Results for “HILBERT SPACE”

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

Quantum Thermodynamics of Nonequilibrium Processes in Lattice Gauge Theories

A key objective in nuclear and high-energy physics is to describe nonequilibrium dynamics of matter, e.g., in the early Universe and in particle colliders, starting from the standard model of particle physics. Classical computing methods, via the framework of lattice gauge theory, have experienced limited success in this mission. Quantum simulation of lattice gauge theories holds promise for overcoming computational limitations. Because of local constraints (Gauss’s laws), lattice gauge theories have an intricate Hilbert-space structure. This structure complicates the definition of thermodynamic properties of systems coupled to reservoirs during equilibrium and nonequilibrium processes. We show how to define thermodynamic quantities such as work and heat using strong-coupling thermodynamics, a framework that has recently burgeoned within the field of quantum thermodynamics. Our definitions suit instantaneous quenches, simple nonequilibrium processes undertaken in quantum simulators. To illustrate our framework, we compute the work and heat exchanged during a quench in a Z 2 lattice gauge theory coupled to matter in 1+1 dimensions. Here, the thermodynamic quantities, as functions of the quench parameter, evidence a phase transition. For general thermal states, we derive a simple relation between a quantum many-body system’s entanglement Hamiltonian, measurable with quantum-information-processing tools, and the Hamiltonian of mean force, used to define strong-coupling thermodynamic quantities.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Quantum chaos on edge

Recently, the physics of many-body quantum chaotic systems close to their ground states has come under intensified scrutiny. Such studies are motivated by the emergence of model systems exhibiting chaotic fluctuations throughout the entire spectrum [the Sachdev-Ye-Kitaev (SYK) model being a renowned representative] as well as by the physics of holographic principles, which likewise unfold close to ground states. Interpreting the edge of the spectrum as a quantum critical point, here we combine a wide range of analytical and numerical methods to the identification and comprehensive description of two different universality classes: the near edge physics of “sparse” and the near edge of “dense” chaotic systems. The distinction lies in the ratio between the number of a system's random parameters and its Hilbert space dimension, which is exponentially small or algebraically small in the sparse and dense case, respectively. Notable representatives of the two classes are generic chaotic many-body models (sparse) and invariant random matrix ensembles or chaotic gravitational systems (dense). While the two families share identical spectral correlations at energy scales comparable to the level spacing, the density of states and its fluctuations near the edge are different. Considering the SYK model as a representative of the sparse class, we apply a combination of field theory and exact diagonalization to a detailed discussion of its edge spectrum. Conversely, Jackiw-Teitelboim gravity is our reference model for the dense class, where an analysis of the gravitational path integral and random matrix theory reveal universal differences to the sparse class, whose implications for the construction of holographic principles we discuss. Published by the American Physical Society 2024

Altland, Alexander (ORCID:0000000229914805)↗

Robust preparation of ground state phases under noisy imaginary time evolution

Nonunitary state preparation protocols such as imaginary time evolution (ITE) offer substantial advantages relative to unitary ones, including the ability to prepare certain long-range correlated states more efficiently. Here, we ask whether such protocols are also robust to noise arising due to coupling to the environment. We consider a nonunitary ITE “circuit” subjected to a variety of noise models and investigate whether the resulting steady state remains in the same phase as the target state of the ITE at finite noise strength. Taking the one-dimensional quantum Ising model as a concrete example, we find that the ground-state order and associated phase transition persist in the presence of noise, provided the noise does not explicitly break the symmetry that protects the phase transition. That is, the noise must possess the protecting symmetry in a weak (or average) form. Our analysis is facilitated by a mapping to an effective Hamiltonian picture in a doubled Hilbert space. We discuss possible implications of these findings for quantum simulation on noisy quantum hardware. Published by the American Physical Society 2025

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Nuclear Responses with Neural-Network Quantum States

We introduce a variational Monte Carlo framework that combines neural-network quantum states with the Lorentz integral transform technique to compute the dynamical properties of self-bound quantum many-body systems in continuous Hilbert spaces. While broadly applicable to various quantum systems, including atoms and molecules, in this initial application we focus on the photoabsorption cross section of light nuclei, where benchmarks against numerically exact techniques are available. Our accurate theoretical predictions are complemented by robust uncertainty quantification, enabling meaningful comparisons with experiments. Here, we demonstrate that a relatively simple nuclear Hamiltonian—based on a leading-order pionless EFT expansion and known to accurately reproduce ground-state energies of nuclei with 𝐴 ≤ 40—also provides a reliable description of the photoabsorption cross section.

Ab initio calculations↗

Simulating large one-dimensional neutral-atom quantum systems

While abstract models of quantum computation assume a closed system of two-level states, practical quantum devices inevitably couple to the environment in some way, creating sources of noise. Understanding the tolerance to noise of specific quantum algorithms run on specific devices is important for determining the feasibility of quantum computing in the current noisy intermediate-scale quantum era. Of particular interest is understanding the noise sensitivity of these devices as more qubits are added to the system. Classical simulations are a useful tool to understand the effects of this noise, but direct classical simulations of open quantum systems are burdened by an exponentially growing cost in the number of qubits and a large local Hilbert space dimension. For onedimensional, shallow circuits, using tensor networks can replace this exponential cost with a linear one and simulate far wider systems than what would normally be available. In this paper, we describe a tensor network simulation of a neutral atom quantum system under the presence of noise, while introducing a purity-preserving truncation technique that compromises between the simplicity of the matrix product state and the positivity of the matrix product density operator. We apply this simulation to a near-optimized iteration of the quantum approximate optimization algorithm on a transverse field Ising model in order to investigate the influence of large system sizes on the performance of the algorithm. We find that while circuits with a large number of qubits fail more often under noise that depletes the qubit population, their outputs on a successful measurement are just as robust under Rydberg atom dissipation or qubit dephasing as smaller systems. However, such circuits might not perform as well under coherent multiqubit errors such as Rydberg atom crosstalk. We also find that the optimized parameters are especially robust to noise, suggesting that a noisier quantum system can be used to find the optimal parameters before switching to a cleaner system for measurements of observables.

Allen, James↗

Parallel-in-time quantum simulation via Page and Wootters quantum time

In the past few decades, researchers have created a veritable zoo of quantum algorithms by drawing inspiration from classical computing, information theory, and even from physical phenomena. Here, we present quantum algorithms for parallel-in-time simulations that are inspired by the Page and Wootters formalism. In this framework, and thus in our algorithms, the classical time variable of quantum mechanics is promoted to the quantum realm by introducing a Hilbert space of “clock” qubits that are then entangled with the “system” qubits. We show that our algorithms can compute temporal properties over 𝑁 different times of many-body systems by only using log⁡(𝑁) clock qubits. As such, we achieve an exponential trade-off between time and spatial complexities. In addition, we rigorously prove that the entanglement created between the system qubits and the clock qubits has operational meaning, as it encodes valuable information about the system’s dynamics. We also provide a circuit depth estimation of all the protocols, showing a running time advantage in computation times over traditional sequential-in-time algorithms. In particular, for the case when the dynamics are determined by the Aubry-Andre model, we present a hybrid method for which our algorithms have a depth that only scales as 𝒪⁡(log⁡(𝑁)⁢𝑛). As a by-product, we can relate the previous schemes to the problem of equilibration of an isolated quantum system, thus indicating that our framework enables a new dimension for studying dynamical properties of many-body systems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Spacetime quantum mechanics for bosonic and fermionic systems

We provide a Hilbert space approach to quantum mechanics where space and time are treated on an equal footing. Our approach replaces the standard dependence on an external classical time parameter with a spacetime-symmetric algebraic structure, thereby unifying the axioms that traditionally distinguish the treatment of spacelike and timelike separations. Standard quantum evolution can be recovered from timelike correlators, defined by means of a quantum action operator, a quantum version of the action of classical mechanics. The corresponding map also provides an alternative perspective on the path integral formulation that, in the case of fermions, does not require the use of Grassmann variables. In addition, the formalism can be interpreted in terms of generalized quantum states, codifying both the conventional information of a quantum system at a given time and its evolution. We show that these states are solutions to a quantum principle of stationary action grounded in timelike correlations and pseudo-entropies.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Polarization–frequency hyperentangled photons: generation, characterization, and manipulation

Frequency-bin encoding is massively parallelizable and robust for optical fiber transmission. When coupled with an additional degree of freedom (DoF), the expansion of the Hilbert space allows for deterministic controlled operations between two DoFs within a single photon. Such capabilities, when combined with photonic hyperentanglement, are of great value for quantum communication protocols, including dense coding and single-copy entanglement distillation. In this talk, we present an all-fiber-coupled, ultrabroadband polarization–frequency hyperentangled source and conduct comprehensive quantum state tomography across multiple dense wavelength division multiplexing channels spanning the optical C+L-band (1530–1625 nm). In addition, we design and implement a high-fidelity controlled-NOT (cnot) operation between polarization and frequency DoFs by exploiting electro-optic phase modulation within a fiber Sagnac loop. Collectively, our hyperentangled source and two-qubit gate should unlock new opportunities for harnessing polarization–frequency resources in established telecommunication fiber networks for future quantum applications.

Lu, Hsuan-Hao↗

Discovery of Probabilistic Dirichlet-to-Neumann Maps on Graphs

Dirichlet-to-Neumann maps enable the coupling of multiphysics simulations across computational subdomains by ensuring continuity of state variables and fluxes at artificial interfaces. We present a novel method for learning Dirichlet-to-Neumann maps on graphs using Gaussian processes, specifically for problems where the data obey a conservation law arising from an underlying partial differential equation. Our approach combines discrete exterior calculus and nonlinear optimal recovery to infer relationships between vertex and edge values. This framework yields data-driven predictions with uncertainty quantification across the entire graph, even when observations are limited to a subset of vertices and edges. By minimizing the reproducing kernel Hilbert space norm while penalizing kernel complexity through maximum likelihood estimation, our method ensures that the resulting surrogate strictly enforces conservation laws without overfitting. We demonstrate our method on two representative applications: subsurface flow in fracture networks and arterial blood flow. Finally, the results demonstrate that the method maintains high accuracy and well-calibrated uncertainty estimates even under severe data scarcity, highlighting its potential for scientific applications where limited data and reliable uncertainty quantification are critical.

Dirichlet-to-Neumann map↗

Scalability Analysis of Quantum Models for Stress and Emotion Detection

Stress and emotion detection from high-dimensional physiological signals is a challenging task, particularly when aiming for accurate classification across diverse behavioral states. Quantum machine learning (QML) is promising for modeling such high-dimensional data, but scalability is limited by qubit resources and the exponential cost of classical statevector simulation. This work studies the scalability of quantum support vector machines (QSVMs) for binary stress detection and three-class emotion recognition (Negative/Neutral/Positive) under varying qubit counts and angle-encoding strategies. We also present a comparison study with one-feature-per-qubit (1:1) and two-features-per-qubit (2:1) mappings. Experiments are executed on HPC infrastructure using NVIDIA CUDA-Q to evaluate performance, variance, and class-dependent separability at higher-qubit setups. Results show that larger Hilbert spaces can improve peak accuracy but may increase instability. At the same time, dense 2:1 encoding yields more consistent stress detection performance. For emotion recognition, scaling improves discrimination for classes like Negative and Positive more than Neutral. We find that effective QML scaling is task-dependent and benefits more from encoding design than simply increasing qubit count.

Onim, Md. Saif Hassan [University of Tennessee, Kn↗

A retrospective review of von Neumann’s analysis of hidden variables in quantum mechanics

This article reviews the history of J. von Neumann’s analysis of hidden variables in quantum mechanics and the subsequent analysis by others. In his book The Mathematical Foundations of Quantum Mechanics , published in 1932, von Neumann performed an analysis of the consequences of introducing hidden parameters (hidden variables) into quantum mechanics. He arrived at two principal conclusions: first, hidden variables cannot be incorporated into the existing theory of quantum mechanics without major modifications, and second, if they did exist, the theory would have already failed in situations where it has been successfully applied. This analysis has been taken as an “incorrect proof” against the existence of hidden variables, possibly due to a mistranslation of the German word prufen . von Neumann’s so-called proof isn’t even wrong as such a proof does not exist, but it is an examination of the limitations imposed by internal consistency of the Hilbert space formulation of the theory. One of the earliest attempts to eliminate uncertainty, by D. Bohm, requires a major modification of quantum mechanics (observables are not represented by Hermitian operators), which supports von Neumann’s first principal conclusion. However, testing the Bohm theory requires constructing a physically impossible initial state. As such, the theory has no experimental consequences, so W. Pauli referred to it as an “uncashable check”. As there are no observable consequences, the Bohm theory is possibly a counterexample to von Neumann’s second conclusion that hidden variables in particular would have already led to a failure of the theory.

density matrix↗

Building Qudit-Based Quantum Computing Processors using Superconducting RF Cavities

Superconducting radio frequency (SRF) cavities provide an excellent platform for storing quantum information as quantum d-level systems (qudits) due to their exceptionally long lifetimes and large accessible Hilbert spaces. A common strategy to manipulate the states is to use a nonlinear element like a transmon. There are, however, several challenges to building a 3D SRF architecture while maintaining a long cavity lifetime. We demonstrate our successful integration of transmons with single-cell Nb SRF cavities and the ability to prepare several non-classical states. Finally, we discuss our strategies to improve the coherence times, gate schemes, and extend the system for building a multi-qudit quantum processor.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Progress on 3D SRF-based architecture for quantum computing

Superconducting radio frequency (SRF) cavities are excellent choices for storing and manipulating quantum information as quantum d-level systems (qudits) due to their exceptionally long lifetimes and large accessible Hilbert spaces. A common strategy to manipulate the states is to use a nonlinear element like a transmon. We present preliminary experimental results obtained with cavity displacements and selective number dependent arbitrary phase gates for universal qudit control, and its application towards High-energy physics (HEP) simulations and beyond. We discuss the advantages and challenges associated with building a 3D SRF architecture while maintaining long cavity lifetimes in the presence of lossy components. We show how the system coherence properties can be preserved by carefully engineering to minimize the participation of the long coherence modes in different loss channels, while ensuring sufficient quantum controllability. We further discuss the path towards building multi-qudit systems.

Romanenko, Alexander↗

Building a quantum computing architecture using 3D superconducting cavities

Quantum computers promise advantages over classical machines for solving certain complex problems, but building processors that truly deliver this advantage remains a central challenge, particularly due to limited coherence times. Three-dimensional superconducting radio-frequency (SRF) cavities offer an attractive platform due to their exceptionally long lifetimes. However, since these harmonic systems require nonlinear elements, such as transmons, for control, additional losses are often introduced. In this talk, I will present a multimode quantum system based on an elliptical SRF cavity hosting two cavity modes weakly coupled to an ancillary transmon circuit. This architecture is carefully engineered to preserve coherence while enabling efficient control. By optimizing the design to mitigate transmon-induced decoherence, we realize single-photon lifetimes of 20.6 ms and 15.6 ms in the two modes, with pure dephasing times exceeding 40 ms. Using sideband interactions and error-resilient protocols, such as measurement-based correction and post-selection, we demonstrate high-fidelity state control, including preparation of Fock states up to N=20 with fidelities above 95% (to our knowledge, the highest reported to date), as well as high-fidelity two-mode entanglement. These results highlight 3D SRF cavities as a robust foundation for qudit-based quantum information processing, harnessing the large Hilbert space of cavity modes. I will conclude by outlining strategies to further enhance coherence in both cavities and ancilla qubits, and discuss pathways toward scaling this architecture into a larger quantum computing platform.

Roy, Tanay [Fermilab]↗

Efficient Hamiltonian encoding algorithms for extracting quantum control mechanism as interfering pathway amplitudes in the Dyson series

Hamiltonian encoding is a methodology for revealing the mechanism behind the dynamics governing controlled quantum systems. In this paper, following Mitra and Rabitz \cite{abhra_1}, we define mechanism via pathways of eigenstates that describe the evolution of the system, where each pathway is associated with a complex-valued amplitude corresponding to a term in the Dyson series. The evolution of the system is determined by the constructive and destructive interference of these pathway amplitudes. Pathways with similar attributes can be grouped together into pathway classes. The amplitudes of pathway classes are computed by modulating the Hamiltonian matrix elements and decoding the subsequent evolution of the system rather than by direct computation of the individual terms in the Dyson series. The original implementation of Hamiltonian encoding was computationally intensive and became prohibitively expensive in large quantum systems. This paper presents two new encoding algorithms that calculate the amplitudes of pathway classes by using techniques from graph theory and algebraic topology to exploit patterns in the set of allowed transitions, greatly reducing the number of matrix elements that need to be modulated. These new algorithms provide an exponential decrease in both computation time and memory utilization with respect to the Hilbert space dimension of the system. To demonstrate the use of these techniques, they are applied to two illustrative state-to-state transition problems.

Abrams, Erez [Princeton University, Massachusetts ↗

Explicit block encodings of boundary value problems for many-body elliptic operators

Simulation of physical systems is one of the most promising use cases of future digital quantum computers. In this work we systematically analyze the quantum circuit complexities of block encoding the discretized elliptic operators that arise extensively in numerical simulations for partial differential equations, including high-dimensional instances for many-body simulations. When restricted to rectangular domains with separable boundary conditions, we provide explicit circuits to block encode the many-body Laplacian with separable periodic, Dirichlet, Neumann, and Robin boundary conditions, using standard discretization techniques from low-order finite difference methods. To obtain high-precision, we introduce a scheme based on periodic extensions to solve Dirichlet and Neumann boundary value problems using a high-order finite difference method, with only a constant increase in total circuit depth and subnormalization factor. We then present a scheme to implement block encodings of differential operators acting on more arbitrary domains, inspired by Cartesian immersed boundary methods. We then block encode the many-body convective operator, which describes interacting particles experiencing a force generated by a pair-wise potential given as an inverse power law of the interparticle distance. This work provides concrete recipes that are readily translated into quantum circuits, with depth logarithmic in the total Hilbert space dimension, that block encode operators arising broadly in applications involving the quantum simulation of quantum and classical many-body mechanics.

Kharazi, Tyler [University of California, Berkeley↗

Predictive Complexity of Quantum Subsystems

We define predictive states and predictive complexity for quantum systems composed of distinct subsystems. This complexity is a generalization of entanglement entropy. It is inspired by the statistical or forecasting complexity of predictive state analysis of stochastic and complex systems theory but is intrinsically quantum. Predictive states of a subsystem are formed by equivalence classes of state vectors in the exterior Hilbert space that effectively predict the same future behavior of that subsystem for some time. As an illustrative example, we present calculations in the dynamics of an isotropic Heisenberg model spin chain and show that, in comparison to the entanglement entropy, the predictive complexity better signifies dynamically important events, such as magnon collisions. It can also serve as a local order parameter that can distinguish long and short range entanglement.

Asplund, Curtis T. (ORCID:0000000305575850)↗

From Quantum Time to Manifestly Covariant QFT: On the Need for a Quantum-Action-Based Quantization

In quantum time (QT) schemes, time is promoted to a degree of freedom, allowing Lorentz covariance to be made explicit for single particles. We ask whether this can be lifted to QFT so that Lorentz covariance becomes manifest at the Hilbert-space level, rather than being hidden as in the standard canonical formulation. We address this question by proposing a second-quantized approach in which the elementary particle is the QT particle itself, leading naturally to the notion of spacetime field algebras and of quantum action. We show, however, that a naive many-body construction runs into inconsistencies. To pinpoint their origin we introduce a classical counterpart of the second-quantized formalism, spacetime classical mechanics (SCM), and prove a no-go theorem: Dirac quantization of SCM collapses back to standard QFT and therefore hides covariance. We circumvent this problem by presenting a quantum-action-based quantization that yields a spacetime version of quantum mechanics (SQM), making covariance manifest for (interacting) QFTs. Finally, we show that this resolution is tied to a genuine spacetime generalization of the notion of a quantum state, required by causality and closely connected to recent “states over time” proposals and, in dS/CFT–motivated settings, to microscopic notions of timelike entanglement and emergent time.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗