SEARCH · Search NASA
Results for “Quantum information theory”
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.
Gap between holographic and quantum mechanical extreme rays of the subadditivity cone
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.
Quantum error thresholds for gauge-redundant digitizations of lattice field theories
In the quantum simulation of lattice gauge theories, gauge symmetry can be either fixed or encoded as a redundancy of the Hilbert space. While gauge-fixing reduces the number of qubits, keeping the gauge redundancy can provide code space to mitigate and correct quantum errors by checking and restoring Gauss’s law. In this work, we consider the correctable errors for generic finite gauge groups and design the quantum circuits to detect and correct them. We calculate the error thresholds below which the gauge-redundant digitization with Gauss’s law error correction has better fidelity than the gauge-fixed digitization involving only gauge-invariant states. Our results provide guidance for fault-tolerant quantum simulations of lattice gauge theories. Published by the American Physical Society 2024
Exploring entanglement and spectral split correlations in three-flavor collective neutrino oscillations
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
Probing the Onset of Maximal Entanglement inside the Proton in Diffractive Deep Inelastic Scattering
Not Available
Universal Spreading of Conditional Mutual Information in Noisy Random Circuits
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.
Entanglement as a Probe of Hadronization
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.
Onset of Scrambling as a Dynamical Transition in Tunable-Range Quantum Circuits
In a fast-scrambling many-body quantum system, information is spread and entanglement is built up on a time scale that grows logarithmically with the system size. This is of fundamental interest in understanding the dynamics of many-body systems, as well as in efficiently producing entangled resource states and error-correcting codes. In this work, we identify a dynamical transition marking the onset of scrambling in quantum circuits with different levels of long-range connectivity. In particular, we show that as a function of the interaction range for circuits of different structures, the tripartite mutual information exhibits a scaling collapse around a critical point between two clearly defined regimes of different dynamical behavior. We study this transition analytically in a related long-range Brownian-circuit model and show how the transition can be mapped onto the statistical mechanics of a long-range Ising model in a particular region of parameter space. This mapping predicts mean-field critical exponents v=–1/(1 + s c ), which are consistent with the critical exponents extracted from Clifford-circuit numerics. In addition to systems with conventional power-law interactions, we identify the same phenomenon in deterministic sparse circuits that can be realized in experiments with neutral-atom arrays.
Learning to Predict Arbitrary Quantum Processes
We present an efficient machine-learning (ML) algorithm for predicting any unknown quantum process ℰ over 𝑛 qubits. For a wide range of distributions 𝒟 on arbitrary 𝑛-qubit states, we show that this ML algorithm can learn to predict any local property of the output from the unknown process ℰ, with a small average error over input states drawn from 𝒟. The ML algorithm is computationally efficient even when the unknown process is a quantum circuit with exponentially many gates. Our algorithm combines efficient procedures for learning properties of an unknown state and for learning a low-degree approximation to an unknown observable. The analysis hinges on proving new norm inequalities, including a quantum analogue of the classical Bohnenblust-Hille inequality, which we derive by giving an improved algorithm for optimizing local Hamiltonians. Numerical experiments on predicting quantum dynamics with evolution time up to 10 6 and system size up to 50 qubits corroborate our proof. Overall, our results highlight the potential for ML models to predict the output of complex quantum dynamics much faster than the time needed to run the process itself.
A Polynomial-Time Classical Algorithm for Noisy Quantum Circuits
We provide a polynomial-time classical algorithm for noisy quantum circuits. The algorithm computes the expectation value of any observable for any circuit, with a small average error over input states drawn from an ensemble (e.g., the computational basis). Our approach is based upon the intuition that noise exponentially damps nonlocal correlations relative to local correlations. This enables one to classically simulate a noisy quantum circuit by keeping track of only the dynamics of local quantum information. Our algorithm also enables sampling from the output distribution of a circuit in quasipolynomial time, so long as the distribution anticoncentrates. A number of implications are discussed, including a fundamental limit on the efficacy of noise mitigation strategies: For constant noise rates, any quantum circuit for which error mitigation succeeds in polynomial-time on most input states can also be classically simulated in polynomial-time on most input states. Our algorithms scale exponentially in the inverse noise rate, which is fundamental and makes them impractical for current quantum devices.
A Whirlwind History of Cryptography
This presentation provides an overview of cryptography starting with the Spartan Scytale used extensively during the Peloponnesian wars up through present day. Cryptography and cryptanalysis developed side by side in arms race. Algorithm development stagnated pending cracking. Once a method of crypto was cracked, development took off. Cryptography and cryptanalysis drove developments in math, linguistics, information theory, and quantum theory, and pushed development of the first computers.
Measures of Holographic Correlation: Discovery, Interpretation, Application (Final Report)
The main goals of this project were twofold: (1) to find measures of quantum correlations that are amenable to interpretation in a holographic context, and use these measures to develop a more detailed understanding of holography itself and (2) To use insights developed in a holographic setting to better understand the theory of quantum information in more traditional (nonholographic) settings.
Noise-induced barren plateaus in variational quantum algorithms
Abstract Variational Quantum Algorithms (VQAs) may be a path to quantum advantage on Noisy Intermediate-Scale Quantum (NISQ) computers. A natural question is whether noise on NISQ devices places fundamental limitations on VQA performance. We rigorously prove a serious limitation for noisy VQAs, in that the noise causes the training landscape to have a barren plateau (i.e., vanishing gradient). Specifically, for the local Pauli noise considered, we prove that the gradient vanishes exponentially in the number of qubits n if the depth of the ansatz grows linearly with n . These noise-induced barren plateaus (NIBPs) are conceptually different from noise-free barren plateaus, which are linked to random parameter initialization. Our result is formulated for a generic ansatz that includes as special cases the Quantum Alternating Operator Ansatz and the Unitary Coupled Cluster Ansatz, among others. For the former, our numerical heuristics demonstrate the NIBP phenomenon for a realistic hardware noise model.
Holevo information and ensemble theory of gravity
Holevo information is an upper bound for the accessible classical information of an ensemble of quantum states. In this work, we use Holevo information to investigate the ensemble theory interpretation of quantum gravity. We study the Holevo information in random tensor network states, where the random parameters are the random tensors at each vertex. Based on the results in random tensor network models, we propose a conjecture on the holographic bulk formula of the Holevo information in the gravity case. As concrete examples of holographic systems, we compute the Holevo information in the ensemble of thermal states and thermo-field double states in the Sachdev-Ye-Kitaev model. The results are consistent with our conjecture.
Efficient sparse state preparation via quantum walks
Continuous-time quantum walks (CTQWs) on dynamic graphs, referred to as dynamic CTQWs, are a recently introduced universal model of computation that offers a new paradigm in which to envision quantum algorithms. In this work, we develop an algorithm that converts single-edge and self-loop dynamic CTQWs to the gate model of computation. We use this mapping to introduce an efficient sparse quantum state preparation framework based on dynamic CTQWs. Our approach utilizes combinatorics techniques such as minimal hitting sets, minimum spanning trees, and shortest Hamiltonian paths to reduce the number of controlled gates required to prepare sparse states. We show that our framework encompasses the current state of the art ancilla-free sparse state preparation method by reformulating this method as a CTQW. This CTQW-based framework offers an alternative to the uniformly controlled rotation method used by Qiskit by requiring fewer CX gates when the target state has a polynomial number of non-zero amplitudes.
Fixed-point quantum circuits for quantum field theories
Renormalization group ideas and effective operators are introduced to efficiently prepare ground states of massive lattice field theories on digital quantum devices. This is accomplished with a systematic approximation through localized unitaries that removes an exponentially costly barrier in the spatial volume of the quantum simulation. With these methods, classically computed ground states in a spatial volume L, containing a few Compton wavelengths, can be used to determine operators for preparing the ground state toward the thermodynamic limit with a precision improving as e –mL on beyond-classical quantum registers. Here, due to the exponential spatial decay of correlations in massive theories and the double exponential suppression of digitization artifacts in the number of qubits representing the scalar field, the derived fixed-point quantum circuits are expected to be relevant for simulations of quantum field theories throughout the evolution from small-scale near-term quantum devices to large-scale fault-tolerant quantum computers.
Error rate reduction of single-qubit gates via noise-aware decomposition into native gates
In the current era of Noisy Intermediate-Scale Quantum (NISQ) technology, the practical use of quantum computers remains inhibited by our inability to aptly decouple qubits from their environment to mitigate computational errors. In this paper, we introduce an approach by which knowledge of a qubit’s initial quantum state and the standard parameters describing its decoherence can be leveraged to mitigate the noise present during the execution of a single-qubit gate. We benchmark our protocol using cloud-based access to IBM quantum processors. On ibmq_rome, we demonstrate a reduction of the single-qubit error rate by 38%, from $1.6 \times 10 ^{-3}$ to $1.0 \times 10 ^{-3}$ , provided the initial state of the input qubit is known. On ibmq_bogota, we prove that our protocol will never decrease gate fidelity, provided the system’s T 1 and T 2 times have not drifted above 100 times their assumed values. The protocol can be used to reduce quantum state preparation errors, as well as to improve the fidelity of quantum circuits for which some knowledge of the qubits’ intermediate states can be inferred. This paper presents a pathway to using information about noise levels and quantum state distributions to significantly reduce error rates associated with quantum gates via optimized decomposition into native hardware gates.
Estimating the randomness of quantum circuit ensembles up to 50 qubits
Random quantum circuits have been utilized in the contexts of quantum supremacy demonstrations, variational quantum algorithms for chemistry and machine learning, and blackhole information. The ability of random circuits to approximate any random unitaries has consequences on their complexity, expressibility, and trainability. To study this property of random circuits, we develop numerical protocols for estimating the frame potential, the distance between a given ensemble and the exact randomness. Our tensor-network-based algorithm has polynomial complexity for shallow circuits and is high-performing using CPU and GPU parallelism. We study 1. local and parallel random circuits to verify the linear growth in complexity as stated by the Brown–Susskind conjecture, and; 2. hardware-efficient ansätze to shed light on its expressibility and the barren plateau problem in the context of variational algorithms. Our work shows that large-scale tensor network simulations could provide important hints toward open problems in quantum information science.