Search NASA⌕ Search

SEARCH · Search NASA

Results for “Tensor networks”

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 253 records · Page 14

Triviality of quantum trajectories close to a directed percolation transition

Here we study quantum circuits consisting of unitary gates, projective measurements, and control operations that steer the system toward a pure absorbing state. Two types of phase transition occur as the rate of these control operations is increased: a measurement-induced entanglement transition, and a directed percolation transition into the absorbing state (taken here to be a product state). In this work, we show analytically that these transitions are generically distinct, with the quantum trajectories becoming disentangled before the absorbing state transition is reached, and we analyze their critical properties. We introduce a simple class of models where the measurements in each quantum trajectory define an effective tensor network (ETN)—a subgraph of the initial spacetime graph where nontrivial time evolution takes place. By analyzing the entanglement properties of the ETN, we show that the entanglement and absorbing-state transitions coincide only in the limit of the infinite local Hilbert-space dimension. Focusing on a Clifford model which allows numerical simulations for large system sizes, we verify our predictions and study the finite-size crossover between the two transitions at large local Hilbert space dimension. We give evidence that the entanglement transition is governed by the same fixed point as in hybrid circuits without feedback.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Scrambling and operator entanglement in local non-Hermitian quantum systems

The breakdown of Lieb-Robinson bounds in local, non-Hermitian quantum systems opens up the possibility for a rich landscape of quantum many-body phenomenology. We elucidate this by studying information scrambling and quantum chaos in non-Hermitian variants of paradigmatic local quantum spin-chain models. We utilize a mixture of exact diagonalization and tensor network techniques for our numerical results and focus on three dynamical quantities: (i) out-of-time-ordered correlators (OTOCs), (ii) operator entanglement of the dynamics, and (iii) entanglement growth following a quench from product initial states. We show that while OTOCs fail to capture information scrambling in a simple, local, non-Hermitian transverse-field Ising model, the closely related operator entanglement is a robust measure of dynamical properties of interest. Moreover, we show that the short-time growth of operator entanglement can generically detect entanglement phase transitions in these systems while its long-time average is shown to be a reliable indicator of quantum chaos and entanglement phases. This allows us to extend operator entanglement-based diagnostics from previous works on closed and open quantum systems, to the new arena of monitored quantum dynamics. Finally, we remark on the efficacy of these dynamical quantities in detecting integrability/chaos in the presence of continuous monitoring.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Extrapolation of nuclear structure observables with artificial neural networks

Calculations of nuclei are often carried out in finite model spaces. Thus, finite-size corrections enter, and it is necessary to extrapolate the computed observables to infinite model spaces. In this work, we employ extrapolation methods based on artificial neural networks for observables such as the ground-state energy and the point-proton radius. We extrapolate results from no-core shell model and coupled-cluster calculations to very large model spaces and estimate uncertainties. Training the network on different data typically yields extrapolation results that cluster around distinct values. We show that a preprocessing of input data, and the inclusion of correlations among the input data, reduces the problem of multiple solutions and yields more stable extrapolated results and consistent uncertainty estimates. We perform extrapolations for ground-state energies and radii in 4 He, 6 Li, and 16 O, and compare the predictions from neural networks with results from infrared extrapolations.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Entanglement and many-body effects in collective neutrino oscillations

Collective neutrino oscillations play a crucial role in transporting lepton flavor in astrophysical settings, such as supernovae, where the neutrino density is large. In this regime, neutrino-neutrino interactions are important and simulations in the mean-field approximation show evidence for collective oscillations occurring at timescales much shorter than those associated with vacuum oscillations. In this work, we study the out-of-equilibrium dynamics of a corresponding spin model using matrix product states and show how collective bipolar oscillations can be triggered by many-body correlations if appropriate initial conditions are present. We find entanglement entropies scaling at most logarithmically in the system size suggesting that classical tensor network methods could be efficient in describing collective neutrino dynamics more generally. These observation provide a clear path forward, not only to increase the accuracy of current simulations, but also to elucidate the mechanism behind collective flavor oscillations without resorting to the mean-field approximation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

S U ( 2 ) principal chiral model with tensor renormalization group on a cubic lattice

We study the continuous phase transition and thermodynamic observables in the three-dimensional Euclidean S U ( 2 ) principal chiral field model with the triad tensor renormalization group and the anisotropic tensor renormalization group methods. Using these methods, we find results that are consistent with previous Monte Carlo estimates and the predicted renormalization group scaling of the magnetization close to criticality. These results bring us one step closer to studying finite-density quantum chromodynamics in four dimensions using tensor network methods. Published by the American Physical Society 2024

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Inclusive reactions from finite Minkowski spacetime correlation functions

The need to determine scattering amplitudes of few-hadron systems for arbitrary kinematics expands a broad set of subfields of modern-day nuclear and hadronic physics. In this work, we expand upon previous explorations on the use of real-time methods, like quantum computing or tensor networks, to determine few-body scattering amplitudes. Such calculations must be performed in a finite Minkowski spacetime, where scattering amplitudes are not well defined. Our previous work presented a conjecture of a systematically improvable estimator for scattering amplitudes constructed from finite-volume correlation functions. Here we provide further evidence that the prescription works for larger kinematic regions than previously explored as well as a broader class of scattering amplitudes. Finally, we devise a new method for estimating the order of magnitude of the error associated with finite time separations needed for such calculations. In units of the lightest mass of the theory, we find that to constrain amplitudes using real-time methods within O ( 10 % ) , the spacetime volumes must satisfy m L ∼ O ( 10 – 10 2 ) ) and m T ∼ O ( 10 2 – 10 4 ) . Published by the American Physical Society 2024

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Phases of 2D massless QCD with qubit regularization

We investigate the possibility of reproducing the continuum physics of 2D S U ( N ) gauge theory coupled to a single flavor of massless Dirac fermion using qubit regularization. The continuum theory is described by N free fermions in the ultraviolet (UV) and a coset Wess-Zumino-Witten (WZW) model in the infrared (IR). In this work, we first explore how well these features can be reproduced using the Kogut-Susskind (KS) Hamiltonian with a finite-dimensional link Hilbert space and a generalized Hubbard coupling. We do this by analyzing the renormalization group (RG) flow diagram of the continuum theory and identifying important phases of the theory. Using strong coupling expansions, we show that our lattice model exhibits a gapped dimer phase and a spin-chain phase. Furthermore, for N = 2 , using tensor network methods, we show that there is a second-order phase transition between these two phases, which we identify as the critical surface of the continuum theory that connects the IR and UV fixed points. In the IR, we identify the critical theory at the transition as the expected S U ( 2 ) 1 WZW model. Lastly, we argue that modifications of our model may allow the study of the UV physics of free fermions. Published by the American Physical Society 2025

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Nonviolent nonlocality

If quantum mechanics governs nature, black holes must evolve unitarily, providing a powerful constraint on the dynamics of quantum gravity. Such evolution apparently must in particular be nonlocal, when described from the usual semiclassical geometric picture, in order to transfer quantum information into the outgoing state. Additionally, while such transfer from a disintegrating black hole has the dangerous potential to be violent to generic infalling observers, this paper proposes the existence of a more innocuous form of information transfer, to relatively soft modes in the black hole atmosphere. Simplified models for such nonlocal transfer are described and parameterized, within a possibly more basic framework of a Hilbert tensor network. Sufficiently sensitive measurements by infalling observers may detect departures from Hawking's predictions, and in generic models black holes decay more rapidly. Lastly, constraints of consistency -- internally and with known and expected features of physics -- restrict the form of information transfer, and should provide important guides to discovery of the principles and mechanisms of the more fundamental nonlocal mechanics.

79 ASTRONOMY AND ASTROPHYSICS↗

Complexity, action, and black holes

In an earlier paper "Complexity Equals Action" we conjectured that the quantum computational complexity of a holographic state is given by the classical action of a region in the bulk (the `Wheeler-DeWitt' patch). We provide calculations for the results quoted in that paper, explain how it fits into a broader (tensor) network of ideas, and elaborate on the hypothesis that black holes are the fastest computers in nature.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Distinguishability of black hole microstates

We use the Holevo information to estimate distinguishability of microstates of a black hole in anti-de Sitter space by measurements one can perform on a subregion of a Cauchy surface of the dual conformal field theory. We find that microstates are not distinguishable at all until the subregion reaches a certain size and that perfect distinguishability can be achieved before the subregion covers the entire Cauchy surface. We will then compare our results with expectations from the entanglement wedge reconstruction, tensor network models, and the bit threads interpretation of the Ryu-Takayanagi formula.

79 ASTRONOMY AND ASTROPHYSICS↗

Computational Power of Random Quantum Circuits in Arbitrary Geometries

Empirical evidence for a gap between the computational powers of classical and quantum computers has been provided by experiments that sample the output distributions of two-dimensional quantum circuits. Many attempts to close this gap have utilized classical simulations based on tensor network techniques, and their limitations shed light on the improvements to quantum hardware required to frustrate classical simulability. In particular, quantum computers having in excess of approximately 50 qubits are primarily vulnerable to classical simulation due to restrictions on their gate fidelity and their connectivity, the latter determining how many gates are required (and, therefore, how much infidelity is suffered) in generating highly entangled states. Here, we describe recent hardware upgrades to Quantinuum’s H2 quantum computer, enabling it to operate on up to 56 qubits with arbitrary connectivity and 99.843(5)% two-qubit gate fidelity. We define a class of circuits with random geometries that become hard to classically simulate in very low depth and implement them utilizing the flexible connectivity of H2. A careful analysis demonstrating the fast saturation of classical simulation complexity with depth indicates that H2 can yield data well beyond the reach of state-of-the art classical simulation methods at unprecedented fidelities. We find that the considerable difficulty of classically simulating H2 is likely limited only by qubit number, demonstrating the promise and scalability of the quantum charge-coupled device architecture as continued progress is made toward building larger machines. Published by the American Physical Society 2025

DeCross, M.↗

Probing Postmeasurement Entanglement without Postselection

We study the problem of observing quantum collective phenomena emerging from large numbers of measurements. These phenomena are difficult to observe in conventional experiments because, in order to distinguish the effects of measurement from dephasing, it is necessary to postselect on sets of measurement outcomes with Born probabilities that are exponentially small in the number of measurements performed. An unconventional approach, which avoids this exponential “postselection problem”, is to construct cross-correlations between experimental data and the results of simulations on classical computers. However, these cross-correlations generally have no definite relation to physical quantities. We first show how to incorporate classical shadows into this framework, thereby allowing for the construction of quantum information-theoretic cross-correlations. We then identify cross-correlations that both upper and lower bound the measurement-averaged von Neumann entanglement entropy, as well as cross-correlations that lower bound the measurement-averaged purity and entanglement negativity. These bounds show that experiments can be performed to constrain postmeasurement entanglement without the need for postselection. To illustrate our technique, we consider how it could be used to observe the measurement-induced entanglement transition in Haar-random quantum circuits. We use exact numerical calculations as proxies for quantum simulations and, to highlight the fundamental limitations of classical memory, we construct cross-correlations with tensor-network calculations at finite bond dimension. Our results reveal a signature of measurement-induced criticality that can be observed using a quantum simulator in polynomial time and with polynomial classical memory. Published by the American Physical Society 2024

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Quantum Simulators and Applications on Quantum Framework

Simulating quantum circuits is essential for validating quantum algorithms. However, no single simulator consistently performs best - efficiency depends on circuit structure, entanglement, and depth. In this work, we integrate Qiskit-Aer (state-vector and matrix product state) and QTensor, a tree-tensor-network based simulator, into the Quantum Framework (QFw), a modular platform that supports multiple quantum backends via a unified interface. We also enable distributed quantum approximate optimization algorithm (DQAOA) application compatibility with QFw, allowing sub-problems to be solved in parallel at scale. We then benchmark DQAOA and TFIM (transverse field Ising model) circuits across supported simulators, showing how performance varies significantly with problem type. All simulations are deployed on the Frontier supercomputer using QFw's MPI-based orchestration for distributed, multinode execution. These results underscore the need for simulatoragnostic infrastructure to enable systematic evaluation and highperformance scaling of quantum workloads. QFw provides a practical and extensible path toward reproducible quantum algorithm development across diverse application domains.

Chundury, Srikar [ORNL] (ORCID:0009000183359259)↗

A Quantum-Classical Collaborative Training Architecture Based on Quantum State Fidelity

Recent advancements have highlighted the limitations of current quantum systems, particularly the restricted number of qubits available on near-term quantum devices. This constraint greatly inhibits the range of applications that can leverage quantum computers. Moreover, as the available qubits increase, the computational complexity grows exponentially, posing additional challenges. Consequently, there is an urgent need to use qubits efficiently and mitigate both present limitations and future complexities. To address this, existing quantum applications attempt to integrate classical and quantum systems in a hybrid framework. In this study, we concentrate on quantum deep learning and introduce a collaborative classical-quantum architecture called co-TenQu. The classical component employs a tensor network for compression and feature extraction, enabling higher-dimensional data to be encoded onto logical quantum circuits with limited qubits. On the quantum side, we propose a quantum-state-fidelity-based evaluation function to iteratively train the network through a feedback loop between the two sides. co-TenQu has been implemented and evaluated with both simulators and the IBM-Q platform. Compared to state-of-the-art approaches, co-TenQu enhances a classical deep neural network by up to 41.72% in a fair setting. Additionally, it outperforms other quantum-based methods by up to 1.9 times and achieves similar accuracy while utilizing 70.59% fewer qubits.

42 ENGINEERING↗

Beyond-classical computation in quantum simulation

Quantum computers hold the promise of solving certain problems that lie beyond the reach of conventional computers. However, establishing this capability, especially for impactful and meaningful problems, remains a central challenge. Here, we show that superconducting quantum annealing processors can rapidly generate samples in close agreement with solutions of the Schrödinger equation. We demonstrate area-law scaling of entanglement in the model quench dynamics of two-, three-, and infinite-dimensional spin glasses, supporting the observed stretched-exponential scaling of effort for matrix-product-state approaches. We show that several leading approximate methods based on tensor networks and neural networks cannot achieve the same accuracy as the quantum annealer within a reasonable time frame. Thus, quantum annealers can answer questions of practical importance that may remain out of reach for classical computation.

King, Andrew D. [D-Wave Quantum Inc., Burnaby, BC ↗

Gleipnir: toward practical error analysis for Quantum programs

Practical error analysis is essential for the design, optimization, and evaluation of Noisy Intermediate-Scale Quantum(NISQ) computing. However, bounding errors in quantum programs is a grand challenge, because the effects of quantum errors depend on exponentially large quantum states. In this work, we present Gleipnir, a novel methodology toward practically computing verified error bounds in quantum programs. Gleipnir introduces the (ρ,δ)-diamond norm, an error metric constrained by a quantum predicate consisting of the approximate state ρ and its distance δ to the ideal state ρ. This predicate (ρ,δ) can be computed adaptively using tensor networks based on the Matrix Product States. Gleipnir features a lightweight logic for reasoning about error bounds in noisy quantum programs, based on the (ρ,δ)-diamond norm metric. Furthermore, our experimental results show that Gleipnir is able to efficiently generate tight error bounds for real-world quantum programs with 10 to 100 qubits, and can be used to evaluate the error mitigation performance of quantum compiler transformations.

Tao, Runzhou↗