Search NASA⌕ Search

SEARCH · Search NASA

Results for “Entanglement entropy”

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.

95 records · Page 6
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

Hollow-grams: generalized entanglement wedges from the gravitational path integral

Recently, Bousso and Penington (BP) made a proposal for the entanglement wedge associated to a gravitating bulk region. In this paper, we derive this proposal in time-reflection symmetric settings using the gravitational path integral. To do this, we exploit the connection between random tensor networks (RTNs) and fixed-geometry states in gravity. We define the entropy of a bulk region in an RTN by removing tensors in that region and computing the entropy of the open legs thus generated in the “hollowed” RTN. We thus derive the BP proposal for RTNs and hence, also for fixed-geometry states in gravity. By then expressing a general holographic state as a superposition over fixed-geometry states and using a diagonal approximation, we provide a general gravitational path integral derivation of the BP proposal. We demonstrate that the saddles computing the Rényi entropy Sn depend on how the bulk region is gauge-invariantly specified. Nevertheless, we show that the BP proposal is universally reproduced in the n → 1 limit.

2D Gravity↗
DOE OSTI2025

Quantum magic and computational complexity in the neutrino sector

We consider the quantum magic in systems of dense neutrinos undergoing coherent flavor transformations, relevant for supernova and neutron-star binary mergers. Mapping the three-flavor-neutrino system to qutrits, the evolution of quantum magic is explored in the single scattering angle limit for a selection of initial tensor-product pure states for 𝑁 𝜈 ≤ 8 neutrinos. For |𝜈𝑒⟩ ⊗𝑁𝜈 initial states, the magic, as measured by the 𝛼 = 2 stabilizer Renyi entropy ℳ 2 , is found to decrease with radial distance from the neutrino sphere, reaching a value that lies below the maximum for tensor-product qutrit states. Further, the asymptotic magic per neutrino, ℳ 2 /𝑁 𝜈 , decreases with increasing 𝑁 𝜈 . In contrast, the magic evolving from states containing all three flavors reaches values only possible with entanglement, with the asymptotic ℳ 2 /𝑁 𝜈 increasing with 𝑁 𝜈 . These results highlight the connection between the complexity in simulating quantum physical systems and the parameters of the Standard Model.

computational complexity↗
DOE OSTI2025

Thermalization and criticality on an analogue–digital quantum simulator

Abstract Understanding how interacting particles approach thermal equilibrium is a major challenge of quantum simulators 1,2 . Unlocking the full potential of such systems towards this goal requires flexible initial state preparation, precise time evolution and extensive probes for final state characterization. Here we present a quantum simulator comprising 69 superconducting qubits that supports both universal quantum gates and high-fidelity analogue evolution, with performance beyond the reach of classical simulation in cross-entropy benchmarking experiments. This hybrid platform features more versatile measurement capabilities compared with analogue-only simulators, which we leverage here to reveal a coarsening-induced breakdown of Kibble–Zurek scaling predictions 3 in theXYmodel, as well as signatures of the classical Kosterlitz–Thouless phase transition 4 . Moreover, the digital gates enable precise energy control, allowing us to study the effects of the eigenstate thermalization hypothesis 5–7 in targeted parts of the eigenspectrum. We also demonstrate digital preparation of pairwise-entangled dimer states, and image the transport of energy and vorticity during subsequent thermalization in analogue evolution. These results establish the efficacy of superconducting analogue–digital quantum processors for preparing states across many-body spectra and unveiling their thermalization dynamics.

Science & Technology - Other Topics↗
DOE OSTI2025

Performance of wave function and Green's function methods for non-equilibrium many-body dynamics

Theoretical descriptions of the non-equilibrium dynamics of quantum many-body systems essentially employ either (i) explicit treatments, relying on the truncation of the expansion of the many-body wave function, (ii) compressed representations of the many-body wave function, or (iii) evolution of an effective (downfolded) representation through Green's functions. In this work, we select representative cases of each of the methods and address how these complementary approaches capture the dynamics driven by intense field perturbations to non-equilibrium states. Under strong driving, the systems are characterized by strong entanglement of the single-particle density matrix and natural populations approaching those of a strongly interacting equilibrium system. We generate a representative set of results that are numerically exact and form a basis for a critical comparison of the distinct families of methods. We demonstrate that the compressed formulation based on similarity-transformed Hamiltonians (coupled-cluster approach) is practically exact in weak fields and, hence, weakly or moderately correlated systems. Coupled cluster, however, struggles for strong driving fields, under which the system exhibits strongly correlated behavior, as measured by the von Neumann entropy of the single-particle density matrix. The dynamics predicted by Green's functions in the (widely popular) G W approximation are less accurate, but improve significantly upon the mean-field results in the strongly driven regime. Published by the American Physical Society 2025

Reeves, Cian C. (ORCID:0009000642581845)↗
DOE OSTI2025

Noisy quantum trees: infinite protection without correction

We study quantum networks with tree structures, in which information propagates from a root to leaves. At each node in the network, the received qubit unitarily interacts with fresh ancilla qubits, after which each qubit is sent through a noisy channel to a different node in the next level. Therefore, as the tree depth grows, there is a competition between the irreversible effect of noise and the protection against such noise achieved by the delocalization of information. In the classical setting, where each node simply copies the input bit into multiple output bits, this model has been studied as the broadcasting or reconstruction problem on trees, which has broad applications. In this work, we study the quantum version of this problem. We consider a Clifford encoder at each node that encodes the input qubit in a stabilizer code, along with a single qubit Pauli noise channel at each edge. Such noisy quantum trees describe a scenario in which one has access to a stream of fresh (low-entropy) ancilla qubits, but cannot perform error correction. Therefore, they provide a different perspective on quantum fault tolerance. Furthermore, they provide a useful model for describing the effect of noise within the encoders of concatenated codes. We prove that above certain noise thresholds, which depend on the properties of the code such as its distance, as well as the properties of the encoder, information decays exponentially with the depth of the tree. On the other hand, by studying certain efficient decoders, we prove that for codes with distance d ≥ 2 and for sufficiently small (but non-zero) noise, classical information and entanglement propagate over a noisy tree with infinite depth. Indeed, we find that this remains true even for binary trees with certain 2-qubit encoders at each node, which encodes the received qubit in the binary repetition code with distance d = 1.

Quantum information↗