Engineering PapersSearch

SEARCH · Engineering Papers

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.

At least 37 records · Page 2

Detecting Multipartite Entanglement Patterns Using Single-Particle Green’s Functions

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.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND

Characterizing non-Markovian and coherent errors in quantum simulation

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

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC

Mutual information bounded by Fisher information

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

97 MATHEMATICS AND COMPUTING

Complementarity-based complementarity: The choice of mutually unbiased observables shapes quantum uncertainty relations

Quantum uncertainty relations impose fundamental limits on the joint knowledge that can be acquired from complementary observables: Perfect knowledge of a quantum state in one basis implies maximal indetermination in all other mutually unbiased bases (MUBs). Uncertainty relations derived from joint properties of the MUBs are generally assumed to be uniform, irrespective of the specific observables chosen within a set. In this work, we demonstrate instead that the uncertainty relations can depend on the choice of observables. Through both experimental observation and numerical methods, we show that selecting different sets of three MUBs in a five-dimensional quantum system results in distinct uncertainty bounds, i.e., in varying degrees of complementarity, in terms of both entropy and variance.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC

Diagonal Approximation for Holographic Rényi Entropies

Recently, Dong et al., [A modified cosmic brane proposal for holographic Renyi entropy, J. High Energy Phys. 06 (2024) 120] proposed a modified cosmic brane prescription for computing the Rényi entropy 𝑆𝛼 of a holographic system in the presence of multiple extremal surfaces. This prescription was found by assuming a diagonal approximation, where the Rényi entropy is computed after first measuring the areas of all extremal surfaces. We derive this diagonal approximation for the case of two extremal surfaces and show that it accurately computes Rényi entropies up to 𝑂⁡(log⁡𝐺) corrections. For 𝛼 <1, this allows us to derive the modified cosmic brane prescription, which differs from the original cosmic brane prescription at leading order in 𝐺. For 𝛼 >1, it leads to the original cosmic brane prescription without needing to assume that replica symmetry is unbroken in the bulk.

FOS: Physical sciences

Generalised squeezing and information theory approach to quantum entanglement

It is shown that the usual one- and two-mode squeezing are based on reducible representations of the SU(1,1) group. Generalized squeezing is introduced with the use of different SU(1,1) rotations on each irreducible sector. Two-mode squeezing entangles the modes and information theory methods are used to study this entanglement. The entanglement of three modes is also studied with the use of the strong subadditivity property of the entropy.

Vourdas, A.

Structure of the Majorana Clifford group

In quantum information science, Clifford operators and stabilizer codes play a central role for systems of qubits (or qudits). In this study, we study their analogs for systems composed of Majorana fermions. In this case, a crucial role is played by fermion parity symmetry, which is an unbreakable symmetry present in any system with fundamentally fermionic degrees of freedom. We prove that the subgroup of parity-preserving Majorana Cliffords can be represented by the orthogonal group over the binary field 𝔽 2 , and we show how it can be generated by braiding operators and used to construct any (even-parity) Majorana stabilizer code. We also analyze the frame potential for this so-called p-Clifford group when acting on a fixed-parity sector of the Hilbert space, proving that it is equivalent to the frame potential of the ordinary Clifford group acting on the same sector.

Computational complexity

Bounding entanglement entropy with Clifford double cosets

Following on our previous work studying the orbits of quantum states under Clifford circuits via reachability graphs, we introduce contracted graphs whose vertices represent classes of quantum states with the same entropy vector. These contracted graphs represent the double cosets of the Clifford group, where the left cosets are built from the stabilizer subgroup of the starting state and the right cosets are built from the entropy-preserving operators. We study contracted graphs for stabilizer states, as well as 𝑊 states and Dicke states, discussing how the diameter of a state's contracted graph constrains the entropic diversity of its two-qubit Clifford orbit. We derive an upper bound on the number of entropy vectors that can be generated using any 𝑛-qubit Clifford circuit, for any quantum state. Here, we speculate on the holographic implications for the relative proximity of gravitational duals of states within the same Clifford orbit. Although we concentrate on how entropy evolves under the Clifford group, our double-coset formalism, and thus the contracted graph picture, is extendable to generic gate sets and generic state properties.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC

Entropy of the Quantum–Classical Interface: A Potential Metric for Security

Hybrid quantum–classical systems are emerging as key platforms in quantum computing, sensing, and communication technologies, but the quantum–classical interface (QCI)—the boundary enabling these systems—introduces unique and largely unexplored security vulnerabilities. This position paper proposes using entropy-based metrics to monitor and enhance security, specifically at the QCI. We present a theoretical security outline that leverages well-established information-theoretic entropy measures, such as Shannon entropy, von Neumann entropy, and quantum relative entropy, to detect anomalous behaviors and potential breaches at the QCI. By linking entropy fluctuations to scenarios of practical relevance—including quantum key distribution, quantum sensing, and hybrid control systems—we promote the potential value and applicability of entropy-based security monitoring. While explicitly acknowledging practical limitations and theoretical assumptions, we argue that entropy-based metrics provide a complementary approach to existing security methods, inviting further empirical studies and theoretical refinements that can strengthen future quantum technologies.

97 MATHEMATICS AND COMPUTING

Exploring nonmultiplicativity in the geometric measure of entanglement

The geometric measure of entanglement (GME) quantifies how close a multipartite quantum state is to the set of separable states under the Hilbert-Schmidt inner product. The GME can be nonmultiplicative, meaning that the closest product state to two states is entangled across subsystems. In this work, we explore the GME in two families of states: those that are invariant under bilateral orthogonal (𝑂⊗𝑂) transformations, and mixtures of singlet states. In both cases, a region of GME nonmultiplicativity is identified around the antisymmetric projector state. We employ state-of-the-art numerical optimization methods and models to quantitatively analyze nonmultiplicativity in these states for 𝑑=3. Here, we also investigate a constrained form of GME that measures closeness to the set of real product states and show that this measure can be nonmultiplicative even for real separable states.

Quantum correlations in quantum information

Achievable Rates for Concatenated Square Gottesman-Kitaev-Preskill Codes

The Gottesman-Kitaev-Preskill (GKP) codes are known to achieve optimal rates under displacement noise and pure-loss channels, which establishes theoretical foundations for its optimality. However, such optimal rates are only known to be achieved at a discrete set of noise strengths with the current self-dual symplectic lattice construction. In this work, we develop a new coding strategy using concatenated continuous variable-discrete variable encodings to go beyond past results and establish GKP’s optimal rate over all noise strengths. In particular, for displacement noise, the rate is obtained through a constructive approach by concatenating GKP codes with a quantum polar code and analog decoding. For a pure-loss channel, we prove the existence of capacity-achieving GKP codes through a random coding approach. These results highlight the capability of concatenation-based GKP codes and provides new methods for constructing good GKP lattices.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC

Spectral Properties and Coding Transitions of Haar-Random Quantum Codes

A quantum error-correcting code with a nonzero error threshold undergoes a mixed-state phase transition when the error rate reaches that threshold. We explore this phase transition for Haar-random quantum codes, in which the logical information is encoded in a random subspace of the physical Hilbert space. We focus on the spectrum of the encoded system density matrix as a function of the rate of uncorrelated, single-qudit errors. For low error rates, this spectrum consists of well-separated bands, representing errors of different weights. As the error rate increases, the bands for high-weight errors merge. The evolution of these bands with increasing error rate is well described by a simple analytic ansatz. Using this ansatz, as well as an explicit calculation, we show that the threshold for Haar-random quantum codes saturates the hashing bound, and thus coincides with that for random stabilizer codes. For error rates that exceed the hashing bound, typical errors are uncorrectable, but postselected error correction remains possible until a much higher detection threshold. Postselection can in principle be implemented by projecting onto subspaces corresponding to low-weight errors, which remain correctable past the hashing bound.

decoherence

Dynamical logical qubits in the Bacon-Shor code

The Bacon-Shor code is a quantum error correcting subsystem code composed of weight-2 check operators that admits a single logical qubit, and has distance 𝑑 on a 𝑑×𝑑 square lattice. We show that when viewed as a Floquet code, by choosing an appropriate measurement schedule of the check operators, it can additionally host several dynamical logical qubits. Specifically, we identify a period-4 measurement schedule of the check operators that preserves logical information between the instantaneous stabilizer groups. Such a schedule not only measures the usual stabilizers of the Bacon-Shor code, but also measures and promotes gauge operators of the parent subsystem code to additional temporary stabilizers that protect the dynamical logical qubits against errors. We show that the code distance of these Floquet-Bacon-Shor codes scales as Θ⁢(𝑑/√𝑘) on an 𝑛=𝑑×𝑑 lattice with 𝑘 dynamical logical qubits, along with the logical qubit of the parent subsystem code. Unlike the usual Bacon-Shor code, the Floquet-Bacon-Shor code family introduced here can therefore saturate the subsystem bound 𝑘⁢𝑑=𝑂⁡(𝑛). Moreover, several errors are shown to be self-corrected purely by the measurement schedule itself. This work provides insights into the design space for dynamical codes and expands the known approaches for constructing Floquet codes.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC

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

97 MATHEMATICS AND COMPUTING

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

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS

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.

decoherence

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.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS

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.

decoherence