Code properties of the holographic Sierpinski triangle
Not Available
SEARCH · Engineering Papers
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.
Not Available
Not Available
Not Available
We show via explicit construction that for six or more parties, there exist extreme rays of the subadditivity cone that can be realized by quantum states, but not by holographic states. This is a counterexample to a conjecture first formulated in Hernández-Cuenca et al. [The holographic entropy cone from marginal independence, J. High Energy Phys. 09 (2022) 190.], and implies the existence of deep holographic constraints that restrict the allowed patterns of independence among various subsystems beyond the universal quantum mechanical restrictions.
In environments with prodigious numbers of neutrinos, such as core-collapse supernovae, neutron star mergers, or the early Universe, neutrino-neutrino interactions are dynamically significant. They can dominate neutrino flavor evolution and force it to be nonlinear, causing collective neutrino oscillations. Such collective oscillations have been studied numerically, for systems with up to millions of neutrinos, using mean-field or one-particle effective approximations. However, such a system of interacting neutrinos is a quantum many-body system, wherein quantum correlations could play a significant role in the flavor evolution—thereby motivating the exploration of many-body treatments that follow the time evolution of these correlations. In many-body flavor evolution calculations with two neutrino flavors, the emergence of spectral splits in the neutrino energy distributions has been found to be correlated with the degree of quantum entanglement across the spectrum. In this work, for the first time, we investigate the emergence of spectral splits in the three-flavor many-body collective neutrino oscillations. We find that the emergence of spectral splits resembles the number and location found in the mean-field approximation but not in the width. Moreover, unlike in the two-flavor many-body calculations, we find that additional degrees of freedom make it more difficult to establish a correlation between the location of the spectral splits and the degree of quantum entanglement across the neutrino energy spectrum. The observation from the two-flavor case, that neutrinos nearest to the spectral split frequency exhibit the highest level of entanglement, is more difficult to ascertain in the three-flavor case because of the presence of multiple spectral splits across different pairwise combinations of flavor and/or mass states. Published by the American Physical Society 2025
Kinetic simulations of collisionless (or weakly collisional) plasmas using the Vlasov equation are often infeasible due to high-resolution requirements and the exponential scaling of computational cost with respect to dimension. Recently, it has been proposed that matrix product state (MPS) methods, a quantum-inspired but classical algorithm, can be used to solve partial differential equations with exponential speed-up, provided that the solution can be compressed and efficiently represented as a MPS within some tolerable error threshold. Here, in this work, we explore the practicality of MPS methods for solving the Vlasov-Poisson equations for systems with one coordinate in space and one coordinate in velocity, and find that important features of linear and nonlinear dynamics, such as damping or growth rates and saturation amplitudes, can be captured while compressing the solution significantly. Furthermore, by comparing the performance of different mappings of the distribution functions onto the MPS, we develop an intuition of the MPS representation and its behavior in the context of solving the Vlasov-Poisson equations, which will be useful for extending these methods to higher-dimensional problems.
Learning a many-body Hamiltonian from its dynamics is a fundamental problem in physics. Here, in this Letter, we propose the first algorithm to achieve the Heisenberg limit for learning an interacting N-qubit local Hamiltonian. After a total evolution time of $\mathscr{O}$(ε –1 ), the proposed algorithm can efficiently estimate any parameter in the N-qubit Hamiltonian to ε error with high probability. Our algorithm uses ideas from quantum simulation to decouple the unknown N-qubit Hamiltonian H into noninteracting patches and learns H using a quantum-enhanced divide-and-conquer approach. The proposed algorithm is robust against state preparation and measurement error, does not require eigenstates or thermal states, and only uses polylog(ε –1 ) experiments. In contrast, the best existing algorithms require $\mathscr{O}$(ε –2 ) experiments and total evolution time. We prove a matching lower bound to establish the asymptotic optimality of our algorithm.
Not Available
For this work, we study the evolution of conditional mutual information (CMI) in generic open quantum systems, focusing on one-dimensional random circuits with interspersed local noise. Unlike in noiseless circuits, where CMI spreads linearly while being bounded by the light cone, we find that noisy random circuits with an error rate 𝑝 exhibit superlinear propagation of CMI, which diverges far beyond the light cone at a critical circuit depth 𝑡 𝑐 ∝ 𝑝 −1 . We demonstrate that the underlying mechanism for such rapid spreading is the combined effect of local noise and a scrambling unitary, which selectively removes short-range correlations while preserving long-range correlations. To analytically capture the dynamics of CMI in noisy random circuits, we introduce a coarse-graining method, and we validate our theoretical results through numerical simulations. Furthermore, we identify a universal scaling law governing the spreading of CMI.
Here, we present a protocol for detecting multipartite entanglement in itinerant many-body electronic systems using single-particle Green’s functions. To achieve this, we first establish a connection between the quantum Fisher information and single-particle Green’s functions by constructing a set of witness operators built out of single electron creation and destruction operators in a doubled system. This set of witness operators is indexed by a momentum k. We compute the quantum Fisher information for these witness operators and show that for thermal ensembles it can be expressed as an autoconvolution of the single-particle spectral function. We then apply our framework to a one-dimensional fermionic system to showcase its effectiveness in detecting entanglement in itinerant electron models. We observe that the detected entanglement level is sensitive to the wave vector associated with witness operator. Our protocol will permit detecting entanglement in many-body systems using scanning tunneling microscopy and angle-resolved photoemission spectroscopy, two spectroscopies that measure the single-particle Green’s function. It offers the prospect of the experimental detection of entanglement through spectroscopies beyond the established route of measuring the dynamical spin response.
Recently, it was discovered that the proton structure at high energies exhibits maximal entanglement. This leads to a simple relation between the proton’s parton distributions and the entropy of hadrons produced in high-energy inelastic interactions, which has been experimentally confirmed. In this Letter, we extend this approach to the production of jets. Here, the maximal entanglement predicts a relation between the jet fragmentation function and the entropy of hadrons produced in jet fragmentation. We test this relation using the ATLAS Collaboration data on jet production at the Large Hadron Collider, and find a good agreement between the prediction based on maximal entanglement within the jet and the data. This study represents the first use of a quantum entanglement framework in an experimental study of the hadronization process, offering a new perspective on the transition from perturbative to nonperturbative QCD. Our results open the door to a more comprehensive understanding of the quantum nature of hadronization.
Not Available
Not Available
Overparametrization is one of the most surprising and notorious phenomena in machine learning. Recently, there have been several efforts to study if, and how, quantum neural networks (QNNs) acting in the absence of hardware noise can be overparametrized. In particular, it has been proposed that a QNN can be defined as overparametrized if it has enough parameters to explore all available directions in state space. That is, if the rank of the quantum Fisher information matrix (QFIM) for the QNN's output state is saturated. Here, we explore how the presence of noise affects the overparametrization phenomenon. Our results show that noise can “turn on” previously zero eigenvalues of the QFIM. This enables the parametrized state to explore directions that were otherwise inaccessible, thus potentially turning an overparametrized QNN into an underparametrized one. For small noise levels, the QNN is quasioverparametrized, as large eigenvalues coexists with small ones. Then, we prove that as the magnitude of noise increases all the eigenvalues of the QFIM become exponentially suppressed, indicating that the state becomes insensitive to any change in the parameters. As such, there is a pull-and-tug effect where noise can enable new directions but also suppress the sensitivity to parameter updates. Finally, our results imply that current QNN capacity measures are ill-defined when hardware noise is present. Published by the American Physical Society 2024
Quantum simulation of many-body systems, particularly using ultracold atoms and trapped ions, presents a unique form of quantum control—it is a direct implementation of a multi-qubit gate generated by the Hamiltonian. As a consequence, it also faces a unique challenge in terms of benchmarking, because the well-established gate benchmarking techniques are unsuitable for this form of quantum control. Here we show that the symmetries of the target many-body Hamiltonian can be used not only to benchmark but to characterize experimental errors in the quantum simulation. We use our results to develop protocols to characterize these errors, which can be implemented using state-of-the-art technology. We consider two forms of errors: (i) unitary errors arising out of systematic errors in the applied Hamiltonian and (ii) canonical non-Markovian errors arising out of random shot-to-shot fluctuations in the applied Hamiltonian. We show that the dynamics of the expectation value of the target Hamiltonian itself, which is ideally constant in time, can be used to characterize these errors. In the presence of errors, the expectation value of the target Hamiltonian shows a characteristic thermalization dynamics, when it satisfies the operator thermalization hypothesis (OTH). That is, an oscillation in the short time followed by relaxation to a steady-state value in the long time limit. We show that while the steady-state value can be used to characterize the coherent errors, the amplitude of the oscillations can be used to estimate the non-Markovian errors. We prove a sandwich theorem to establish a linear relation between the amplitude of the oscillations and the magnitude of the non-Markovian errors. Moreover, by varying the initial state, we show that the steady state values can be used to completely construct the generator of the coherent errors. Using these results, we develop two experimental protocols to characterize the unitary errors based on these results, one of which requires single-qubit addressing and the other one doesn't. We also develop a protocol to characterize non-Markovian errors. Published by the American Physical Society 2024
We derive a general upper bound to mutual information in terms of the Fisher information. The bound may be further used to derive a lower bound for the Bayesian quadratic cost. These two provide alternatives to other inequalities in the literature (e.g., the van Trees inequality) that are useful also for cases where the latter ones give trivial bounds. We then generalize them to the quantum case, where they bound the Holevo information in terms of the quantum Fisher information. We illustrate the usefulness of our bounds with a case study in quantum phase estimation. Here, they allow us to adapt to mutual information (useful for global strategies where the prior plays an important role), the known and highly nontrivial bounds for the Fisher information in the presence of noise. The results are also useful in the context of quantum communication, both for continuous and discrete alphabets. Published by the American Physical Society 2025
We study the properties of output distributions of noisy random circuits. We obtain upper and lower bounds on the expected distance of the output distribution from the “useless” uniform distribution. These bounds are tight with respect to the dependence on circuit depth. Our proof techniques also allow us to make statements about the presence or absence of anticoncentration for both noisy and noiseless circuits. We uncover a number of interesting consequences for hardness proofs of sampling schemes that aim to show a quantum computational advantage over classical computation. Specifically, we discuss recent barrier results for depth-agnostic and/or noise-agnostic proof techniques. We show that in certain depth regimes, noise-agnostic proof techniques might still work in order to prove an often-conjectured claim in the literature on quantum computational advantage, contrary to what has been thought prior to this work.