Entanglement, Quantum teleportation

заголовки анонсы
25.06.2026
13:15 Arxiv.org Physics Positron Emission Tomography with quantum-entangled Compton events: first imaging results at clinically relevant activities

arXiv:2606.25804v1 Announce Type: new Abstract: In Positron Emission Tomography, a potential, yet unutilized enhancement, may come from exploiting the quantum entanglement of the annihilation quanta, inscribed in the correlation of their polarizations. To investigate this, we built a PET demonstrator capable of measuring polarization correlations of annihilation quanta by their Compton scattering, based on single-layer scintillator polarimeters. We present a detailed study of the imaging of two $^{68}$Ge line sources, 45 MBq each, to extract the spatial resolution and assess image quality. The results show that a spatial resolution of 2.5$\pm$0.1 mm is obtained using single-pixel events, while resolutions obtained with polarization-correlated Compton events range from 3.6$\pm$0.3 mm to 4.9$\pm$0.3 mm, depending on data selection criteria. We also found that the polarization-correlated Compton events exhibit up to 20% higher average signal to random background ratio compared to the

Скрыть анонс
23.06.2026
11:20 Arxiv.org Physics Emergence of Gaussian entanglement and non-Gaussianity in high-harmonic generation driven by bright squeezed light

arXiv:2606.22714v1 Announce Type: cross Abstract: High harmonic generation (HHG) is a highly nonlinear optical process in which radiation from a strong driving field is up-converted into its high-order harmonics. In atomic systems, this nonlinearity manifests itself through the intensity scaling of the emitted harmonics with the driving field strength. Despite the highly nonlinear nature of HHG, when the driving field is prepared in a classical Gaussian state and atomic depletion remains negligible, the quantum statistical properties of the generated harmonics retains classical Gaussian quantum statistics. Driving HHG with bright squeezed vacuum (BSV) light challenges this paradigm, as its enhanced field fluctuations can modify the statistical properties of the generated harmonics. In this work, we investigate the conditions under which BSV-driven HHG gives rise to non-classical Gaussian states, and identify the regimes where this Gaussian description breaks down. For bichromatic

Скрыть анонс
11:20 Arxiv.org Physics An interpretable closed form for entanglement entropy from bitstrings, guided by a graph neural network

arXiv:2606.22713v1 Announce Type: cross Abstract: The empirical bitstring distribution is the most accessible observable on Rydberg-atom arrays, but the bipartite von~Neumann entropy it constrains is far costlier to obtain. We present a six-term linear closed form for the entropy, built on bitstring-derivable physics scalars, and characterize its accuracy, portability, scaling behaviour, and calibration cost. The feature set is selected with guidance from a trained graph neural network: probing the network localizes its entropy prediction to the two-point correlators on the bipartition boundary, and an exhaustive ground-truth search restricted to those boundary correlators isolates the form. It reaches $0.024$~nats mean absolute error in distribution: $6.4$ times the network's error, but in a form a human can read and apply without retraining. Fit once and applied unchanged, it has lower error than the base network on five of six out-of-distribution pools and ties the sixth. An

Скрыть анонс
10:02 Technology.org Physicists measure quantum entanglement of quantum critical metal

In a study published in Nature Physics, Rice University’s Qimiao Si collaborated with researchers from TU Wien in an experiment

Скрыть анонс
09:44 Aps.org Editors' Suggestions Optimal filtering and generation of entangled photons for quantum applications in the presence of noise

Author(s): Jordan M. Thomas, Andrew R. Cameron, Akil Pathiranage, Si Xie, Raju Valivarthi, Panagiotis Spentzouris, Maria Spiropulu, Cristián Peña, and Prem KumarThe distribution of quantum entanglement and teleportation in real-world environments underlies current efforts in quantum communication and networking, and requires designing devices such that extraneous noise photons do not obscure photon detection. This study analyzes the physics of filtering entangled-photon sources for both high noise rejection and purity, for multiphoton applications in high-noise scenarios. Using these methods, entanglement is successfully distributed through 50 km of optical fiber while coexisting high-power classical Internet signals generate substantial background noise. [Phys. Rev. Applied 25, 064064] Published Mon Jun 22, 2026

Скрыть анонс
20.06.2026
22:53 Phys.org Ancient enamel just exposed a hidden human family entanglement that may still echo in your DNA

An analysis of ancient teeth is giving scientists a rare peek into interactions between human relatives hundreds of thousands of years ago that have left a lasting imprint on our species.

Скрыть анонс
21:40 Google news Sci/Tech Saturday Citations: Intermittent fasting and chronic stress; macroscopic entanglement; gamma-ray bursts - Phys.org

Saturday Citations: Intermittent fasting and chronic stress; macroscopic entanglement; gamma-ray bursts  Phys.orgQuantum Fisher information in a strange metal  NatureScientists just found quantum entanglement in a crystal you can see with the naked eye  The Economic TimesPhysicists measure quantum entanglement of quantum critical metal  Rice UniversitySchrödinger’s anthill: Quantum entanglement detected inside a centimeter-sized strange metal  Yahoo

Скрыть анонс
15:20 Phys.org Saturday Citations: Intermittent fasting and chronic stress; macroscopic entanglement; gamma-ray bursts

Researchers reported this week a deadly outbreak of plague in Siberia 5,500 years ago, revealing that Yersinia pestis evolved lethal genetic traits far earlier than suspected. A drug developed for heart tissue repair may also help kidney tissue repair and regeneration. And neighborhood socialization opportunities could shape children's brain development.

Скрыть анонс
19.06.2026
07:26 Arxiv.org Physics Entanglement structure of the dynamical phases in the sub-Ohmic spin-boson model

arXiv:2606.20313v1 Announce Type: cross Abstract: The sub-Ohmic spin-boson model exhibits three distinct dynamical regimes in its spin population dynamics, classified as coherent, incoherent, and pseudo-coherent. Whether these regimes correspond to distinct spin-bath entanglement structures remains an open question. Here we address this using tree tensor network states with projector-splitting time evolution (TTN-TDVP-PS), scanning a broad grid in the sub-Ohmic $(s, \alpha)$ plane. We find that the spin entanglement entropy $S_\mathrm{spin}(t)$ reaches a stationary plateau on a timescale shorter than the polarization relaxation, enabling construction of a stationary entropy landscape from the stationary value $S_\mathrm{stable}$. Within this scalar entropy landscape, the entropy ridge broadly follows the population-based phase boundary at small $s$, but does not reproduce the two-branch structure at large $s$. The ridge remains single-valued within the incoherent region rather than

Скрыть анонс
07:26 Arxiv.org Physics Constraint-Limited Tube Orientation of Entangled Polymers in Oscillatory Shear Deformation

arXiv:2606.20049v1 Announce Type: cross Abstract: We develop a molecularly motivated description of the nonlinear index (NLI) in oscillatory shear deformation of entangled polymers. The central assumption is that the shear component of the tube-orientation tensor cannot grow without bound. Convective constraint release (CCR), chain stretch, and tube dilation progressively reduce the number and lifetime of orientational constraints, but the maximum shear alignment of a tube segment is geometrically limited by $S_{xy}\leq 1/2$. This motivates a constraint-limited orientation closure in which the NLI first grows approximately with strain amplitude and then approaches the limiting value $\mathrm{NLI}_{\max}=3$ asymptotically rather than through an artificial cutoff. The same framework yields a molecular expression for the characteristic half-saturation strain $\gamma_s$, defined by $\mathrm{NLI}(\gamma_s)=3/2$, in terms of the entanglement number, oscillation frequency, and a critical

Скрыть анонс
18.06.2026
09:59 Arxiv.org Physics Towards Entanglement-Enhanced Atom Interferometry Using Bow-Tie Cavities

arXiv:2606.18552v1 Announce Type: cross Abstract: Atom interferometers are among the most sensitive instruments for precision measurements and tests of fundamental physics. Their performance, however, is ultimately limited by quantum projection noise when uncorrelated atomic ensembles are employed. Cavity-assisted generation of entangled states has proven to be a promising route toward quantum-enhanced interferometry beyond the standard quantum limit. In this work, we present the realization and characterization of a monolithic bow-tie cavity developed to achieve a strong collective atom-light coupling with strontium atoms. Unlike conventional standing-wave Fabry-P\'erot resonators, the traveling-wave geometry of the bow-tie cavity provides homogeneous atom-light coupling over the entire atomic ensemble, making it particularly suitable for entanglement-enhanced atom interferometry with freely falling atoms. The monolithic cavity architecture presents several scientifically relevant

Скрыть анонс
17.06.2026
12:26 Arxiv.org Physics Tripartite entanglement of remote atomic qubits

arXiv:2606.17173v1 Announce Type: cross Abstract: Distributed entanglement across multi-node quantum networks is essential for a wide range of quantum technologies, including modular quantum computers, distributed sensing and metrology, and multi-party secure communication protocols. Such large-scale quantum networks will require photonic interconnects to generate and sustain entangled states across localized nodes. Previously, three-node distributed Greenberger-Horne-Zeilinger (GHZ) states have been generated between solid-state qubits and atomic ensembles, but not yet in the platform of individual atomic qubits, which can be replicated, detected, and individually controlled with high fidelity. Here we report the first fully-distributed GHZ state of qubits across a three-node quantum network of single atomic memories, using photonic interconnects. We achieve a bounded fidelity of $0.841(17) \leq \mathcal{F} \leq 0.881(17)$ at an entanglement generation rate of 0.095(5)/sec and

Скрыть анонс
12:26 Arxiv.org Physics Principle of Entangled-Photon Thermometry for Ultrafast Laser Processing

arXiv:2606.17635v1 Announce Type: new Abstract: A quantum-enhanced approach for fast temperature diagnostics in ultrashort laser surface processing is introduced. The goal is to overcome limitations of existing methods, such as plasma emission, emissivity changes during ablation, and the need for time-consuming pump-probe measurements. The proposed method exploits polarization anisotropy in entangled photon pairs. The idler photon interacts with the laser-affected material surface, while its entangled counterpart is detected in a remote optical arm. Temperature-dependent changes in the complex refractive index modify the reflectance of p- and s-polarizations on the idler path, altering the coincidence-resolved polarization statistics of the signal photons. Using a Qiskit-based model incorporating experimental pump-probe reflectometry data, remote reconstruction of rapid thermal dynamics during femtosecond laser ablation is demonstrated. Although based on simulation, the model employs

Скрыть анонс
07:05 Arxiv.org Math On the entanglement induced by the deformation of phase-space

arXiv:2606.17587v1 Announce Type: cross Abstract: Most quantum gravity theories propose that the fundamental concept of space-time is mostly compatible with quantum theory in noncommutative (NC) space. In the present paper, we revisit the notion of entanglement induced by NC deformations of phase space. The positive partial transpose (PPT) criterion for separability of bipartite Gaussian states is extended to a general class of Bopp's shift. In particular, we have considered both the position-position and momentum-momentum noncommutativity, with deformation parameters $\theta$ and $\eta$, respectively. It turns out that $\theta$ and $\eta$ induce the entanglement. We have directly applied the formalism for an anisotropic two-dimensional harmonic oscillator. Peres-Horodecki separability condition leads to a constraint equation for the parameter values of the oscillator in NC space. It turns out that the bipartite Gaussian state is almost always entangled in deformed space. To implement

Скрыть анонс
00:03 Phys.org High degree of quantum entanglement detected for first time in centimeter-sized crystal of strange metal

Many quantum effects can be observed only when a small number of particles is studied—individual atoms, molecules or photons, for example, carefully shielded from the rest of the world. But what about macroscopic objects, consisting of an unimaginably large number of particles? Can they, too, display effects that provide a direct glimpse into the quantum world?

Скрыть анонс
16.06.2026
07:52 Arxiv.org Physics Scheme for Transport-based Global Entanglement Distribution using Quantum Processors

arXiv:2606.15421v1 Announce Type: cross Abstract: We propose a scheme for distributing entanglement over global distances in a heralded manner by using satellites to physically transport entangled processor nodes with rare-earth-ion qubits. A full analysis of channel losses, errors and background light is performed to determine the fidelity and number of entangled pairs that can be distributed between two ground stations. We show that the scheme works already with a single satellite and can distribute close to the theoretical maximum number of entangled pairs that can be generated in a satellite overpass. In addition, we argue that in theory transportation-based schemes outperform other satellite-based schemes and can be scaled up to a constellation without additional channel losses. Daytime operation seems feasible as long as the sky is clear, with an EPR pair fidelity ranging from 99.3% at shorter network lengths to 93.9% with global coverage and can be further improved by active

Скрыть анонс
07:52 Arxiv.org Physics Single-Image Entanglement Verification with Spatially Encoded Measurement Contexts

arXiv:2606.15382v1 Announce Type: cross Abstract: Entangled photon pairs produced by spontaneous parametric down-conversion exhibit rich spatial entanglement structure that is often difficult to probe with conventional measurements. Here, we show that spin-orbit optical elements can convert this spatial structure into directly observable quantum interference patterns. Using a $q$-plate, we demonstrate that the relative wavefront curvature of biphoton states generated by a pair of nonlinear crystals can be retrieved from the spatial modulation of coincidence images. Building on this principle, we introduce a liquid-crystal metasurface that performs spatially multiplexed Bell measurements across the transverse profile of the photon field. The device, which we call a Clauser-Horne-Shimony-Holt (CHSH) plate, assigns different polarization projections to different azimuthal sectors of the beam, allowing the sixteen joint measurements required for a CHSH test to be realized simultaneously

Скрыть анонс
07:22 Arxiv.org CS HiMPO: Hindsight-Informed Memory Policy Optimization for Less-Entangled Credit in Long-Horizon Agents

arXiv:2606.16285v1 Announce Type: new Abstract: Long-horizon agents rely on memory mechanisms to compress interaction history, but optimizing memory writing faces a distinct credit assignment challenge: a memory update may be rewarded or penalized due to downstream tool failures, noisy observations, or reasoning errors rather than its own contribution. This causally entangled credit can lead agents to discard useful evidence or preserve irrelevant information. We propose HiMPO, a Hindsight-Informed Memory Policy Optimization framework for assigning less-entangled credit to memory-writing actions in long-horizon agents. HiMPO first estimates the local utility of a memory update by comparing the task-relevant information recoverable from the previous and updated memories under the same pre-write state. It then uses hindsight relevance as a bounded retrospective filter that attenuates memory credit when local utility is not supported by the target outcome. The resulting memory-specific

Скрыть анонс
15.06.2026
10:42 Arxiv.org Physics Scaling native entanglement generation in layered semiconductors with quasi-phase matching

arXiv:2606.14553v1 Announce Type: cross Abstract: Efficient generation of entangled photons typically relies on spontaneous parametric down-conversion (SPDC) in phase-matched macroscopic nonlinear media. However, generating entanglement under phase-matching constraints requires additional bulk optics or interferometers. In contrast, ultrathin van der Waals semiconductors - such as transition metal dichalcogenides (TMDs) - exhibit strong enough optical nonlinearities for SPDC to be observed from subwavelength-thick media, thereby bypassing conventional phase-matching constraints. In this microscopic domain, the intrinsic crystal symmetry governs the nonlinear optical response, enabling the native generation of polarization-entangled photon pairs. However, generating these states efficiently has been fundamentally restricted by the material's coherence length ($L_c$), which limits the attainable conversion efficiency. Here, we investigate periodically-poled TMDs (PPTMDs) designed to

Скрыть анонс
12.06.2026
11:44 Arxiv.org Physics Quantum Entanglement Beyond Kinematics: A Dynamical Hypothesis in (3,2)-Dimensional Spacetime

arXiv:2606.12457v1 Announce Type: new Abstract: Quantum entanglement produces nonlocal correlations for which no local dynamical account is known. In Ref.[1] we proposed that these correlations are mediated through an extra temporal dimension and introduced a $(3,2)$-dimensional spacetime framework on a phenomenological basis; the present paper derives that framework from the bulk geometry. A single extra spatial dimension admits no effective superluminal shortcut on the brane, this rules it out as a candidate mediator and motivates the extra-time setting. Within the warped-product metric ansatz the five-dimensional vacuum Einstein equations fix the warp factor uniquely, leaving no freedom in the geometry once $\mathbb{Z}_2$ symmetry is imposed. A massless bulk field $\mathscr{X}_a(\mathbf{x},t,\tau)$, sourced on the brane by the preparation event and by the measurement interactions, propagates causally through the extra-time dimension; equal-time correlations at arbitrarily large

Скрыть анонс
01:38 Phys.org A new kind of entanglement helps quantum sensors tune out noise

In a quest to build the most accurate quantum sensors in the world, scientists are constantly improving their performance, making them more precise, more stable and more reliable. But eventually, physical constraints will prevent further improvements.

Скрыть анонс
11.06.2026
08:37 Arxiv.org Math Optimizing Encoder Circuits of Entanglement-Assisted Quantum LDPC Codes via Beam Search

arXiv:2606.11468v1 Announce Type: cross Abstract: Entanglement-assisted (EA) quantum QC-LDPC codes offer strong error-correction capabilities with structured parity-check matrices, but their practical use depends on efficient encoder circuits and the availability of pre-shared Bell pairs (ebits). In all encoder implementations based on the stabilizer formalism, the dominant contribution to this complexity comes from the use of controlled gates. In this paper, we adopt the Sharma-Kumar-Garani (SKG) encoder construction. We formulate the encoder optimization as a search over GF(2) row operations that decompose the binary matrix derived from its CNOT sub-sequence. We solve this problem using a beam search algorithm guided by a Hamming-distance heuristic. For the tested EA quantum QC-LDPC code families, the proposed method achieves CNOT-count reductions of 7.3-34.0% relative to the SKG baseline encoder. The optimized circuits also yield lower CNOT counts than Patel-Markov-Hayes synthesis

Скрыть анонс
09.06.2026
13:46 Arxiv.org Math Entanglement in the Quantum Volunteer's Dilemma

arXiv:2606.08227v1 Announce Type: cross Abstract: A well-known model in game theory, the Volunteer's Dilemma describes a group of $n$ players who decide whether to volunteer for a collective benefit at a personal cost, or to abstain and risk forfeiting the benefit altogether. A quantum version of this dilemma, developed within the Eisert-Wilkens-Lewenstein framework, allows each player to manipulate one qubit of a shared entangled state, leading to symmetric Nash equilibria with higher expected payoffs than in the classical game. Existing analyses, however, assume maximal entanglement. Within the same framework, we introduce a generalized Quantum Volunteer's Dilemma with a tunable entanglement parameter $\gamma$ and study the extent to which equilibrium behavior depends on the level of entanglement. We derive explicit conditions relating $\gamma$, the number of players, and the players' strategies under which symmetric Nash equilibria exist, focusing on two canonical strategy

Скрыть анонс
11:18 Arxiv.org CS Entanglement in the Quantum Volunteer's Dilemma

arXiv:2606.08227v1 Announce Type: cross Abstract: A well-known model in game theory, the Volunteer's Dilemma describes a group of $n$ players who decide whether to volunteer for a collective benefit at a personal cost, or to abstain and risk forfeiting the benefit altogether. A quantum version of this dilemma, developed within the Eisert-Wilkens-Lewenstein framework, allows each player to manipulate one qubit of a shared entangled state, leading to symmetric Nash equilibria with higher expected payoffs than in the classical game. Existing analyses, however, assume maximal entanglement. Within the same framework, we introduce a generalized Quantum Volunteer's Dilemma with a tunable entanglement parameter $\gamma$ and study the extent to which equilibrium behavior depends on the level of entanglement. We derive explicit conditions relating $\gamma$, the number of players, and the players' strategies under which symmetric Nash equilibria exist, focusing on two canonical strategy

Скрыть анонс
06:16 Google news Sci/Tech SpaceX IPO Forces Investors to Bet on Musk’s Entangled AI Empire - Bloomberg

SpaceX IPO Forces Investors to Bet on Musk’s Entangled AI Empire  BloombergSpaceX Left California. Its IPO Payday Did Not.  ForbesOil prices may hit $150 per barrel soon if Iran war continues, energy economist says  CNBCBuy or stand by? What investing pros are saying about investing in SpaceX's IPO.  Business InsiderHow Banks Are Using SpaceX to Woo the Superrich  The New York Times

Скрыть анонс
08.06.2026
19:47 Phys.org Researchers craft a new, simple recipe for highly entangled quantum states

Building useful quantum technologies—from sensors to computers—requires generating highly complex entangled states, in which the properties of particles are deeply intertwined. Producing such states has traditionally required complex tools and carefully engineered setups with many parts.

Скрыть анонс
13:52 Arxiv.org CS Entanglement from Expansion: High Rank-Width in Deterministic Graphs

arXiv:2606.07110v1 Announce Type: new Abstract: Entanglement in quantum graph states is intrinsically linked to rank-width, a graph complexity measure introduced by Oum and Seymour. In this work, we enable the preparation of maximally entangled deterministic graph states in constant depth by developing a general method to derive lower bounds on the rank-width of regular graphs from their edge expansion. By bridging edge-isoperimetric inequalities with the strong chromatic index and Jel\'inek's approach for lower bounding cut-rank, we systematically establish lower bounds for the rank-width of Cartesian products, including hypercubes, Hamming graphs, and grids. Extending this framework via Boolean function analysis, using a generalization of the Kahn-Kalai-Linial's Theorem, we strengthen the bounds for all Cartesian products by a non-trivial logarithmic factor. These methods result in the discovery of deterministic families of graphs on $n$ vertices with a provably maximum rank-width

Скрыть анонс
05.06.2026
10:05 Arxiv.org Math Unlocking Exponential and Unbounded Robust Gains in Shannon Capacity of Classical Multiple Access Channels with Causal CSIT via Quantum Entanglement Assistance

arXiv:2606.05412v1 Announce Type: new Abstract: Quantum entanglement assistance is known to improve the Shannon capacity of classical communication networks but the largest gains noted thus far are rather modest (less than 6%), motivating the question: are large capacity gains ever possible? It is shown in this work that in the presence of causal channel state information at the transmitters, quantum entanglement assistance provides a multiplicative capacity advantage that grows exponentially with the number of users K for certain classical K-user multiple access channels with fixed size (binary) alphabet for inputs, outputs and states. Similarly, in the presence of causal channel state information at the transmitters, quantum entanglement assistance is shown to provide a multiplicative capacity advantage that is unbounded as the size of the state alphabet grows, while the number of users (K=3) and the input and output alphabet (binary) are held fixed. Even with only a few users and

Скрыть анонс
07:37 Arxiv.org CS A Class of Multipartite Entangled States Based on State Transitions

arXiv:2606.05579v1 Announce Type: cross Abstract: We introduce Transition states (T states), denoted by $\ket{T_k^n}$, as a class of multipartite entangled states characterized by a fixed number of state transitions between adjacent qubits. These states form equal-amplitude superpositions over all states with a specified transition count. Unlike Bell states based on two-qubit correlations, GHZ states characterized by global correlations among all qubits, and W and Dicke states based on fixed numbers of qubit excitations, T states are defined by transition counts along an ordered sequence of qubits. We prove that T states are unitarily equivalent to Dicke states through a chain of CX (controlled-X) operations, thereby establishing a direct correspondence between transition-based and excitation-based representations of multipartite entanglement.

Скрыть анонс
07:37 Arxiv.org CS Multi-task Learning is Not Enough: Representational Entanglement in Dual-output Second Language Speech Recognition

arXiv:2606.06065v1 Announce Type: new Abstract: Second-language (L2) speech recognition often requires transcriptions of pronunciations and intended meanings. Multi-task learning (MTL) is a natural approach because it assumes that shared representations benefit both outputs. However, this paper shows that this assumption does not hold across Korean and English. MTL improves meaning but degrades surface transcription, especially in English, where the degradation scales with surface-meaning divergence measured by Levenshtein edit distance.Encoder analysis links these patterns to encoder-level entanglement, with Korean preserving distinct task representations while English produces nearly identical ones. Cross-task decoder analysis shows that the meaning dual-output decoder adapts with a unique representation, while the surface dual-output decoder remains constrained by the encoder. These findings motivate the design of MTL frameworks that mitigate encoder-level entanglement to reduce

Скрыть анонс
07:37 Arxiv.org CS Unlocking Exponential and Unbounded Robust Gains in Shannon Capacity of Classical Multiple Access Channels with Causal CSIT via Quantum Entanglement Assistance

arXiv:2606.05412v1 Announce Type: new Abstract: Quantum entanglement assistance is known to improve the Shannon capacity of classical communication networks but the largest gains noted thus far are rather modest (less than 6%), motivating the question: are large capacity gains ever possible? It is shown in this work that in the presence of causal channel state information at the transmitters, quantum entanglement assistance provides a multiplicative capacity advantage that grows exponentially with the number of users K for certain classical K-user multiple access channels with fixed size (binary) alphabet for inputs, outputs and states. Similarly, in the presence of causal channel state information at the transmitters, quantum entanglement assistance is shown to provide a multiplicative capacity advantage that is unbounded as the size of the state alphabet grows, while the number of users (K=3) and the input and output alphabet (binary) are held fixed. Even with only a few users and

Скрыть анонс
03.06.2026
17:42 QuantaMagazine.org Entanglement Builds Space-Time. Now “Magic” Gives It Gravity.

In holographic theories, physicists may have traced the pliability of space-time to its quantum roots: a measure of quantumness known as “magic.” The post Entanglement Builds Space-Time. Now “Magic” Gives It Gravity. first appeared on Quanta Magazine

Скрыть анонс
12:55 Arxiv.org CS EntangleCodec: A Unified Discrete Audio Tokenizer via Semantic-Acoustic Entanglement

arXiv:2606.02739v1 Announce Type: new Abstract: Audio tokenizers serve as the discrete interface between continuous audio and Audio Language Models (ALMs), but existing tokenizers often struggle to support both understanding and generation. Reconstruction-oriented codecs preserve acoustic fidelity but lack rich semantics, while semantic-aware tokenizers typically rely on separate semantic and acoustic streams, introducing redundancy or misalignment. We propose \textbf{EntangleCodec}, a unified discrete audio tokenizer that learns caption-aligned semantic-acoustic representations before quantization. By aligning audio with rich captions rather than ASR transcripts, EntangleCodec captures linguistic content, speaker identity, emotion, prosody, and acoustic scenes within a compact token stream. A flow-matching diffusion decoder further enables high-quality reconstruction across speech, music, and general audio. EntangleCodec achieves reconstruction quality competitive with

Скрыть анонс
02.06.2026
08:44 Aps.org Editors' Suggestions Fractal structure of multipartite entanglement in monitored quantum circuits

Author(s): Vaibhav Sharma and Erich J. MuellerThe authors show that quantum entanglement can organize into fractal geometric patterns due to repeated random measurements. They mapped the geometry of clusters of entangled qubits, finding that the largest cluster is riddled with holes at different scales, like the irregular self-repeating structure of coastlines or snowflakes. [Phys. Rev. A 113, L060402] Published Mon Jun 01, 2026

Скрыть анонс
08:20 Arxiv.org Math An Explicit Scott-Type Bound for Absolutely Maximally Entangled States with Arbitrary Defect

arXiv:2606.01943v1 Announce Type: cross Abstract: Absolutely maximally entangled (AME) states and, more generally, $k$-uniform states in $(\C^q)^{\otimes n}$ are central objects in multipartite entanglement theory, with applications to quantum secret sharing, quantum masking, and quantum error correction. In the extremal case $k=\lfloor n/2\rfloor$, Scott (2004) proved a sharp nonexistence bound showing that AME states cannot exist once the number of parties $n$ exceeds a threshold of order $2q^{2}$ (with a parity dependence on $n$), where $q$ is the local dimension. Recently, Ning et al.\ studied \emph{defective} AME states (i.e., $k=\lfloor n/2\rfloor-l$ with $l>0$), gave explicit Scott-type bounds for defects $l=1,2$ and conjectured a general $(2l+2)q^{2}+o(q^{2})$ behavior. In this paper, we solve this conjecture and establish a fully explicit Scott-type upper bound for AME states with arbitrary defect $l\ge 0$, yielding Scott's bound for $l=0$ and Ning et al.'s bounds for $l=1,2$

Скрыть анонс
08:20 Arxiv.org CS An Explicit Scott-Type Bound for Absolutely Maximally Entangled States with Arbitrary Defect

arXiv:2606.01943v1 Announce Type: cross Abstract: Absolutely maximally entangled (AME) states and, more generally, $k$-uniform states in $(\C^q)^{\otimes n}$ are central objects in multipartite entanglement theory, with applications to quantum secret sharing, quantum masking, and quantum error correction. In the extremal case $k=\lfloor n/2\rfloor$, Scott (2004) proved a sharp nonexistence bound showing that AME states cannot exist once the number of parties $n$ exceeds a threshold of order $2q^{2}$ (with a parity dependence on $n$), where $q$ is the local dimension. Recently, Ning et al.\ studied \emph{defective} AME states (i.e., $k=\lfloor n/2\rfloor-l$ with $l>0$), gave explicit Scott-type bounds for defects $l=1,2$ and conjectured a general $(2l+2)q^{2}+o(q^{2})$ behavior. In this paper, we solve this conjecture and establish a fully explicit Scott-type upper bound for AME states with arbitrary defect $l\ge 0$, yielding Scott's bound for $l=0$ and Ning et al.'s bounds for $l=1,2$

Скрыть анонс
01.06.2026
10:57 Arxiv.org CS Pseudoentanglement in constant depth: How trivial states can have non-trivial entanglement structure

arXiv:2605.31448v1 Announce Type: cross Abstract: We construct a family of 2D-local constant-depth quantum circuits that output states whose entanglement entropy across a specified cut cannot be estimated in quantum polynomial time. As constant-depth quantum circuits can be learned from polynomially many quantum samples, our resulting pseudoentangled states are implicitly public-key and not pseudorandom. This separates pseudoentanglement from pseudorandomness in the shallow-circuit regime: the former is possible, while the latter is not. The construction is based on the quantum intractability of the Dense-Sparse Learning Parity with Noise problem introduced in [DJ25] and uses a bounded-fan-in, bounded-fan-out classical randomized encoding for linear maps $\mathbf{x} \mapsto \mathbf{Mx},$ which could be of independent interest. As applications, we obtain quantum hardness for the problem of learning the entanglement structure (across a fixed cut) of the ground-state of 1D and 2D local

Скрыть анонс
10:57 Arxiv.org CS Entanglement distribution protocols under imperfect fidelity and quantum memory conditions

arXiv:2605.31347v1 Announce Type: cross Abstract: The rapid development of quantum computers and sensors urges for the development of a quantum Internet capable of transmitting quantum bits over long distances. Photons used for quantum data transfer are fragile over time and sensitive to their environment, so that they cannot be directly used over long distances. To remedy this problem, long distance paths are segmented into shorter links and entangled pairs of photons are distributed over these links and swapped to create end-to-end entangled pairs over long distances, eventually used for teleportation. In this paper, we develop an existing protocol taking account of fidelity and imperfect memories. We shorten the execution time and thus increase its link success probability creating the so-called Locally Heralded Distribution (LHD). It turns out that the proposed protocol outperforms some previous protocols. We benchmark through simulation the performances of protocols considered in

Скрыть анонс
29.05.2026
11:49 Arxiv.org Statistics Exact Geometric Typicality and Bipartite Entanglement from the Projected Central Limit Theorem on Hyperspheres

arXiv:2605.29732v1 Announce Type: cross Abstract: Starting from the exact Projected Central Limit Theorem on hyperspheres, we rederive the Beta distribution for subsystem occupation probabilities and Lubkin's purity formula from elementary hyperspherical moments, quantifying the finite-size ``platykurtic'' suppression of tails relative to the Gaussian approximation used in standard eigenstate-thermalization and typicality treatments. Our main new result concerns the bipartite quantum mutual information $\langle I(A{:}B)\rangle$ for Haar-random pure states. We show that its full asymptotic expansion in $1/N$ admits a Bernoulli-factorized form in which every order $k \ge 1$ carries the symmetric factor $(d_A^{2k}-1)(d_B^{2k}-1)$ and all higher odd-order corrections vanish identically. Through an exact algebraic reorganization of Page's formula (conjectured in Ref.~\cite{Page1993} and subsequently proven~\cite{Foong1994, SanchezRuiz1995, Sen1996}), we establish that the leading

Скрыть анонс
11:49 Arxiv.org Math Exact Geometric Typicality and Bipartite Entanglement from the Projected Central Limit Theorem on Hyperspheres

arXiv:2605.29732v1 Announce Type: cross Abstract: Starting from the exact Projected Central Limit Theorem on hyperspheres, we rederive the Beta distribution for subsystem occupation probabilities and Lubkin's purity formula from elementary hyperspherical moments, quantifying the finite-size ``platykurtic'' suppression of tails relative to the Gaussian approximation used in standard eigenstate-thermalization and typicality treatments. Our main new result concerns the bipartite quantum mutual information $\langle I(A{:}B)\rangle$ for Haar-random pure states. We show that its full asymptotic expansion in $1/N$ admits a Bernoulli-factorized form in which every order $k \ge 1$ carries the symmetric factor $(d_A^{2k}-1)(d_B^{2k}-1)$ and all higher odd-order corrections vanish identically. Through an exact algebraic reorganization of Page's formula (conjectured in Ref.~\cite{Page1993} and subsequently proven~\cite{Foong1994, SanchezRuiz1995, Sen1996}), we establish that the leading

Скрыть анонс
11:49 Arxiv.org Physics Contrast enhanced imaging through weakly scattering media with spatially entangled photons

arXiv:2605.28998v1 Announce Type: cross Abstract: Improving the image contrast of objects immersed in weakly scattering media can be achieved using various strategies. One common approach is to reject events associated with scattered photons in favor of the detection of ballistic photons. While this is traditionally done via time gating or spatial filtering, we propose a different approach based on probing the object with spatio-temporally entangled photon pairs. We show that coincidence detection, followed by post-selection on spatially correlated events, allows us to isolate ballistic from scattered bi-photons, thereby enhancing image contrast relative to a single-photon detection strategy, and simultaneously removes events due to background light. Our predictions are obtained via numerical simulations and confirmed by experiments conducted in two configurations where either both photons or only one illuminates the scene. In both scenarios, correlation post-selection shows an

Скрыть анонс
11:49 Arxiv.org CS A Comprehensive Protocol Stack for Quantum Networks with a Global Entanglement Module

arXiv:2509.16817v2 Announce Type: replace-cross Abstract: The development of large-scale quantum networks requires not only advances in physical-layer technologies but also a comprehensive protocol stack that integrates communication, control, and resource management across all layers. We present the first such protocol stack, which introduces a Global Entanglement Module (GEM) that maintains a consistent, network-wide view of entanglement resources through distributed synchronization strategies. By enabling real-time adaptive execution of entanglement distribution plans, GEM bridges the gap between static planning and dynamic operation. The stack naturally supports pre-distributed entanglement, purification, and multi-partite state generation, making it applicable to a broad range of quantum networking applications. We design and evaluate multiple adaptive heuristics for real-time execution and show that a lightweight scoring-based strategy consistently achieves the best performance,

Скрыть анонс
02:03 Phys.org Quantum entanglement provides a new framework for understanding chemical bonding

Chemical bonding is one of the central organizing principles of the microscopic world. It determines how atoms combine and thereby governs a wide range of physical and chemical properties of quantum systems across many length scales, ranging from small molecules and biomolecules to macroscopically large solid materials.

Скрыть анонс
28.05.2026
07:08 Arxiv.org CS Dynamic Entanglement Packet Scheduling for Quantum Networks

arXiv:2605.28795v1 Announce Type: cross Abstract: Sharing entanglement among multiple users remains a central challenge for scalable quantum networks. Recent work proposed an on-demand entanglement packet architecture in which a controller uses a Time Division Multiple Access (TDMA) approach to allocate network resources. Quantum nodes are assigned a periodic schedule that probabilistically fulfills application requests for end-to-end entanglements. The schedule is recomputed periodically using well-known algorithms, such as Earliest Deadline First (EDF). However, a static schedule offers limited flexibility when outcomes are stochastic and arrivals are asynchronous. To overcome this limitation, we propose an online scheduler that dynamically schedules, defers, retries, or drops entanglement distribution reservations. In our simulations, the dynamic scheduler achieves lower completion time, higher completion ratio, and higher throughput than the static baseline. Furthermore, when the

Скрыть анонс
07:08 Arxiv.org CS EFaaS: A Quantum-Classical Serverless Entangled Scheduler for Hybrid Variational Algorithms

arXiv:2605.27540v1 Announce Type: cross Abstract: As quantum computing enters the Utility Era, realizing near-term advantage relies heavily on Hybrid Variational Quantum Algorithms (VQAs). These algorithms require a tightly coupled, iterative loop between a classical CPU optimizer and a Quantum Processing Unit (QPU). However, current quantum cloud access models are bottlenecked by decoupled batch-queues that sever this loop, introducing massive Time-to-Next-Shot (TTNS) latency. This delay inflates convergence time from minutes to hours and exposes the computation to quantum hardware drift, degrading algorithmic fidelity. Unlike prior works that rely on resource-wasting static hardware reservations or state-oblivious stateless functions, we propose EFaaS, a novel serverless middleware designed specifically for hybrid quantum workflows. EFaaS fundamentally departs from existing architectures by treating classical parameter optimization and quantum circuit execution as entangled,

Скрыть анонс
27.05.2026
17:06 Phys.org Quantum teleportation carries microwave states at temperatures up to 4 K, beating classical limit

A growing number of quantum engineers worldwide have been trying to realize large-scale quantum networks, which consist of several connected quantum computers or devices that share information with each other. The successful realization of these networks could potentially pave the way for the realization of new high-speed and secure communication systems, or even of a quantum version of the internet.

Скрыть анонс
09:48 Arxiv.org Physics Integrated squeezed light sources for two-mode entanglement in thin-film lithium niobate

arXiv:2605.26583v1 Announce Type: cross Abstract: Scalable generation of nonclassical light sources on an integrated platform is a key requirement for photonic quantum information processing. In particular, realizing multiple indistinguishable squeezed light sources on a single chip is an essential step toward continuous-variable quantum computing. Here, we demonstrate the fabrication of two indistinguishable and independently controllable optical parametric oscillators on a thin-film lithium niobate (TFLN) platform. The device design focuses on reproducibility, independent tunability, and compatibility with larger telecom-wavelength continuous-variable photonic circuits. We observe up to 0.5 dB of directly measured squeezing below the shot-noise level from each source. By interfering the two modes on a beam splitter, we generate an EPR-type two-mode squeezed state and verify continuous-variable entanglement through violation of the Duan-Simon inseparability criterion. This is the

Скрыть анонс
09:48 Arxiv.org Physics Selective Biexciton Generation Under Energy-Time Entangled Quantum Light in Quantum Dots

arXiv:2605.26466v1 Announce Type: new Abstract: Energy-time entangled photons provide new opportunities for controlling multiphoton absorption beyond classical limits. Here, we investigate biexciton generation in nanocrystal quantum dots driven by energy-time-entangled quantum light generated via a spontaneous parametric down-conversion process. We show that quantum correlations can enhance biexciton production while suppressing excitonic populations. By employing a three-level model, we demonstrate that biexciton generation depends nontrivially on the photon arrival-time entanglement and the pump bandwidth. Consequently, we find that maximizing efficiency requires an optimally shaped entangled photon field rather than simply scaling parameters for a monotonic improvement. Extending to a realistic CdSe/CdS core-shell quantum dots containing many excitonic states coupled to the quantum field, we demonstrate that increasing the bi-photon arrival time entanglement (closer arrival time)

Скрыть анонс
08:33 Aps.org Editors' Suggestions Excited states from local effective Hamiltonians of matrix product states and their entanglement spectrum transition

Author(s): Denise Cocchiarella, Mingru Yang, Yueshui Zhang, Mari Carmen Bañuls, Hong-Hao Tu, and Yuhan LiuExcited states of interacting systems are generally difficult to access. In one-dimensional critical systems, however, they can be obtained from the variational matrix product state optimization of the ground state, specifically from eigenvectors of the local effective Hamiltonian constructed from it. Here, the authors provide a conformal field theory perspective that explains the success of this method. They further predict, and numerically confirm, an entanglement-spectrum transition with subsystem-to-system size ratio, by a reorganization of conformal towers. [Phys. Rev. B 113, 205145] Published Tue May 26, 2026

Скрыть анонс
02:48 Phys.org Entanglement injuries cause prolonged suffering for whales and dolphins—early intervention is crucial

When a humpback whale became entangled in a craypot line off Kaikōura last week, witnesses described it thrashing in distress for ten minutes before eventually freeing itself.

Скрыть анонс
26.05.2026
12:39 Arxiv.org Math Entanglement cost for infinite-dimensional physical systems

arXiv:2401.09554v2 Announce Type: replace-cross Abstract: We prove that the entanglement cost equals the regularized entanglement of formation for any infinite-dimensional quantum state $\rho_{AB}$ with finite quantum entropy on at least one of the subsystems $A$ or $B$. This generalizes a foundational result in quantum information theory that was previously formulated only for operations and states on finite-dimensional systems. The extension to infinite-dimensional systems is nontrivial because the conventional tools for establishing both the direct and converse bounds, i.e., strong typicality, monotonicity, and asymptotic continuity, are no longer directly applicable. To address this problem, we construct a new entanglement dilution protocol for infinite-dimensional states implementable by local operations and a finite amount of one-way classical communication (one-way LOCC), using weak and strong typicality multiple times. We also prove the optimality of this protocol among all

Скрыть анонс
12:39 Arxiv.org CS Abduction-Deduction Entanglement: Domain Generalization via Representation Transplants

arXiv:2605.25156v1 Announce Type: new Abstract: Prediction models trained under the source distribution do not generalize well to a different target distribution. A valid inference about an unseen data distribution must be anchored by the invariance of certain causal mechanisms that generate the source and target data, however, these structural invariances are non-identifiable from the source data alone. Under mild causal assumptions about the data, we show that the optimal prediction in the target is in fact partially identifiable by the source distribution. The result rests on a simple observation: In any domain, the optimal prediction can be factorized into what we call a pair of abduction and deduction maps, where the abduction map makes inference about some unobserved variables (possibly confounders) from the observed variables and the deduction map predicts the label using both the observed and inferred quantities. Access to large source data pins down the optimal prediction,

Скрыть анонс
25.05.2026
08:07 Arxiv.org CS Purification Strategy Optimization for Entanglement Routing in Quantum Networks

arXiv:2605.23331v1 Announce Type: new Abstract: Quantum networks rely on the efficient distribution of entanglement to enable long-distance quantum communication and information processing. A key challenge in these networks is the design of routing protocols capable of maintaining high quality entanglement in the presence of noise, decoherence, and imperfect operations, which progressively degrade the fidelity of entangled states through entanglement swapping. Entanglement purification provides an effective mechanism to mitigate this degradation at the cost of additional resources. In this work, we study purification-aware quantum routing and formulate the problem of selecting optimal purification strategies as an optimization task. By employing dynamic programming techniques, we identify strategies that optimally balance resource consumption and end-to-end fidelity, demonstrating the effectiveness of our approach across different scenarios.

Скрыть анонс
22.05.2026
08:46 Arxiv.org Math Self-testing of exact entanglement embezzlement

arXiv:2605.22713v1 Announce Type: new Abstract: We consider bipartite exact entanglement embezzlement with a catalyst state vector $\psi$ in a Hilbert space $\mathcal{H}$ using unitaries (or more generally, contractions). If $\mathcal{M} \subseteq \mathcal{B}(\mathcal{H})$ is a von Neumann algebra and $U \in M_d \otimes \mathcal{M}$ and $V \in \mathcal{M}' \otimes M_d$ are unitaries (or more generally contractions), then such a protocol is of the form $(U \otimes I_d)(I_d \otimes V)(e_0 \otimes \psi \otimes e_0)=\sum_{i=0}^{d-1} \alpha_i e_i \otimes \psi \otimes e_i$, where each $\alpha_i>0$ and $\sum_{i=0}^{d-1} \alpha_i^2=1$. We show that any such protocol must arise from a unique state on the tensor product $\mathcal{O}_d \otimes \mathcal{O}_d$ of the Cuntz algebra with itself. As a result, we prove that exact entanglement embezzlement is a self-test for a collection of $d$ Cuntz isometries for each party and a unique quasi-free state on the Cuntz algebra $\mathcal{O}_d$ in the

Скрыть анонс
08:46 Arxiv.org Physics Diagrammatic Monte Carlo for Fermionic R\'enyi Entanglement Entropy

arXiv:2605.21632v1 Announce Type: cross Abstract: We develop a direct diagrammatic Monte Carlo framework for the Renyi entanglement entropy of interacting lattice fermions. The method starts from the fermionic graded-swap representation of Z_n[A]=Tr_A\rho_A^n, which converts the entropy problem into a replicated path integral with mixed temporal boundary conditions on the entangling region. In this representation the replica momenta are half-shifted, q_m=(2m+1)\pi/n, and the interaction expansion has a determinant form suitable for connected-determinant summation. We combine this expansion with a many-configuration Markov-chain Monte Carlo sampler to obtain order-by-order corrections for very large systems to very high orders. As a benchmark, we compare the order-by-order coefficients of a 3*3 Hubbard cluster with exact diagonalization. We then report a production calculation for a large periodic lattice with a square subregions. The dominant system-size limitation is therefore memory

Скрыть анонс
20.05.2026
07:11 Arxiv.org Math Quantum Entanglement Halves the Oblivious Update Bandwidth

arXiv:2605.19248v1 Announce Type: cross Abstract: We consider $(n,k)$ MDS-coded distributed storage over $\mathbb{F}_q$ with per-node storage $\alpha$ symbols. For the oblivious update problem, where a single message symbol changes and neither helpers nor the stale node know which, the classical lower bound is $\alpha k \log_2 q$ bits. We prove that when the $k$ contacted helpers share prior quantum entanglement, the update bandwidth is $\lceil \alpha/2 \rceil \cdot k \log_2 q$ bits-equivalent, a factor approaching 2 reduction. For $\alpha = 2$, a $[[k, k-2]]_q$ CSS code achieves bandwidth $k \log_2 q$ with one qudit per helper. For general $\alpha$, a $[[\lceil \alpha/2 \rceil k, \lceil \alpha/2 \rceil k - \alpha]]_q$ CSS code achieves the bound with $\lceil \alpha/2 \rceil$ qudits per helper. The matching converse uses the superdense coding bound: the stale node holds all transmitted qudits and hence the entangled partners, so each helper's channel supports at most $D^2$

Скрыть анонс
07:11 Arxiv.org Physics PEPSKit.jl: A Julia package for projected entangled-pair state simulations

arXiv:2605.19960v1 Announce Type: cross Abstract: We present PEPSKit.jl, a Julia package for simulating two-dimensional quantum many-body systems with infinite projected entangled-pair states (iPEPS). PEPSKit.jl builds on the TensorKit.jl package for tensor computations and provides high-level algorithms for iPEPS simulations that support both Abelian and non-Abelian symmetries, as well as fermionic systems. This work gives an overview of the main package features, which include support for ground-state, time-evolution, and finite-temperature simulations in systems with different physical symmetries and lattice geometries. These capabilities are illustrated through various examples and technical benchmarks.

Скрыть анонс
07:11 Arxiv.org CS Quantum Entanglement Halves the Oblivious Update Bandwidth

arXiv:2605.19248v1 Announce Type: cross Abstract: We consider $(n,k)$ MDS-coded distributed storage over $\mathbb{F}_q$ with per-node storage $\alpha$ symbols. For the oblivious update problem, where a single message symbol changes and neither helpers nor the stale node know which, the classical lower bound is $\alpha k \log_2 q$ bits. We prove that when the $k$ contacted helpers share prior quantum entanglement, the update bandwidth is $\lceil \alpha/2 \rceil \cdot k \log_2 q$ bits-equivalent, a factor approaching 2 reduction. For $\alpha = 2$, a $[[k, k-2]]_q$ CSS code achieves bandwidth $k \log_2 q$ with one qudit per helper. For general $\alpha$, a $[[\lceil \alpha/2 \rceil k, \lceil \alpha/2 \rceil k - \alpha]]_q$ CSS code achieves the bound with $\lceil \alpha/2 \rceil$ qudits per helper. The matching converse uses the superdense coding bound: the stale node holds all transmitted qudits and hence the entangled partners, so each helper's channel supports at most $D^2$

Скрыть анонс
19.05.2026
09:49 Arxiv.org Math Exact Entanglement-Depth Speed Frontier for Complete Quantum Charging

arXiv:2605.16935v1 Announce Type: cross Abstract: Complete quantum charging provides a sharp setting in which to ask how much multipartite entanglement is forced by speed itself. For a closed \(N\)-qubit battery evolving from \(\ket{\downarrow}^{\otimes N}\) to \(\ket{\uparrow}^{\otimes N}\) under a time-independent Hamiltonian, we exactly solve the pure-state depth-constrained speed problem. If the realized trajectory has entanglement depth at most \(k\), then the largest possible QSL-normalized rate \(\eta=\tau_{\rm QSL}/T\) is \(\eta_{\max}(k)=\lceil N/k\rceil^{-1/2}\). Conversely, an observed rate \(\eta\) certifies trajectory entanglement depth at least \(\bigl\lceil N/\lfloor \eta^{-2}\rfloor\bigr\rceil\). The mechanism is block orthogonalization: under a fixed product partition, complete charging forces all blocks to orthogonalize simultaneously, and the quantum speed limit converts this counting constraint into the speed bound. Balanced cluster-flip evolutions saturate the

Скрыть анонс
09:49 Arxiv.org Math Pre-Channel Entanglement Shaping Achieves Fundamental Superiority over Post-Distillation: A Geometric Entropy Perspective

arXiv:2605.16463v1 Announce Type: cross Abstract: Traditional entanglement distillation follows a post-processing paradigm, a noisy quantum state, after full transmission through a noisy channel, is treated as a static resource to be purified via LOCC (local operations and classical communication). This work demonstrates a fundamentally different paradigm,pre-channel entanglement shaping (PES) -- actively engineering the system-environment coupling before or during channel transmission -- achieves a level of purification capability that is physically unattainable by any post-distillation protocol. We prove this separation using the framework of geometric entropy (quantum relative entropy to separable states). In post-distillation, the protocol can only select low-entropy sub-ensembles from a fixed mixed state, leaving the global geometric entropy unchanged or increased. In contrast, PES \textit{suppresses the rate of geometric entropy production} during channel evolution, resulting in

Скрыть анонс
18.05.2026
12:15 Arxiv.org Math Additivity Results for the R\'enyi-2 Entanglement of Purification

arXiv:2605.15439v1 Announce Type: cross Abstract: We reformulate the R\'enyi entanglement of purification as a constrained minimum output R\'enyi entropy problem. Equivalently, for $p>1$, this formulation can be expressed in terms of a constrained maximal output Schatten $p$-norm. More precisely, for a completely positive map $\Omega:L(B')\to L(A)$, we consider the quantity $\upsilon_p(\Omega)$ defined by optimizing $\|(\Omega\otimes \mathrm{id}_E)(\sigma^{B'E})\|_p$ over all bipartite states $\sigma^{B'E}$ whose $B'$-marginal is maximally mixed. We focus on the case $p=2$. First, we compute $\upsilon_2$ for the transpose-depolarizing channel and prove that it is multiplicative under tensor powers. We then establish a general multiplicativity criterion: whenever a completely positive map $N:L(B')\to L(A)$ satisfies $N^{\dagger} \mathbin{\circ} N=a\,\mathrm{id}_A+b\,\mathrm{Tr}[\cdot]\,I_d$ for some constants $a,b\ge 0$, where $N^{\dagger}$ denotes the Hilbert-Schmidt adjoint of $N$,

Скрыть анонс
12:15 Arxiv.org Physics Entanglement Dynamics of Separable Squeezed States in Finite Memory Structured Reservoir

arXiv:2605.15426v1 Announce Type: cross Abstract: Entanglement in continuous-variable Gaussian systems is a key resource, and common reservoirs can both suppress and generate correlations. Existing work focused on pre-entangled states or Markovian baths, leaving open whether separable squeezed inputs entangle in structured environments or under modulation. We study two bosonic modes coupled to a common reservoir, each initialized in a separable squeezed vacuum. Dynamics are analyzed utilizing Gaussian covariance methods, evolved under approximate Non-Markovian quantum state diffusion (QSD), finite-temperature pseudomode embeddings, and Bures-based non-Markovian diagnostics. We identify three mechanisms absent in Markovian dynamics: (1) A detuning condition that freezes entanglement trajectories across reservoir correlation times; (2) birth, death, and revival of entanglement from orthogonal inputs; and (3) integer-locked beating with square-wave oscillations produced by periodic

Скрыть анонс
12:15 Arxiv.org Physics High-Efficiency InGaP-on-Insulator Microresonator Nonlinear Conversion and Entanglement Generation

arXiv:2605.15481v1 Announce Type: new Abstract: InGaP-on-insulator, with its intrinsically high $\chi^{(2)}$ optical nonlinearity, has emerged as an efficient and bright integrated photonic platform for frequency conversion and on-chip entanglement generation, but high waveguide propagation loss in the visible wavelength range has limited its overall performance. Here, we identify the dominant loss mechanism through mode-profile analysis and effectively mitigate the loss using a surface treatment method. Statistical analysis of the resonator quality factor and propagation loss reveals the optimal ring radius that maintains a strong nonlinear interaction while suppressing significant bending related loss, resulting in loss as low as 0.49 dB/cm (4.31 dB/cm) at 1560 nm (780 nm). The method provides a 3.5--4$\times$ linear performance enhancement, enabling a second-harmonic generation efficiency of $3.01\times10^{5}$ %/W and a photon-pair generation rate of

Скрыть анонс
12:15 Arxiv.org CS HOPPER: A Hop-by-hop Entanglement Distribution Protocol for Asynchronous Quantum Networks

arXiv:2605.15869v1 Announce Type: cross Abstract: The quantum Internet relies on the ability to distribute entangled quantum bits (ebits) between quantum memories at the end nodes, to perform applications like blind or distributed quantum computing that are impossible if end nodes are connected via a classical, i.e., non-quantum network. This need creates new challenges due to the fragile nature of entanglement, which decoheres over short timescales and cannot be amplified, buffered, or retransmitted. Two broad categories of approaches have been proposed in the scientific literature to realize such an entanglement distribution in a given path: one relying on a synchronous time-slotted model, and another one where intermediate nodes interact asynchronously. However, both of them implicitly assume a serial operation, where one ebit is established and made available to the application on end nodes before creating a new one. This is inefficient in long-range networks, with high

Скрыть анонс
12:15 Arxiv.org CS Additivity Results for the R\'enyi-2 Entanglement of Purification

arXiv:2605.15439v1 Announce Type: cross Abstract: We reformulate the R\'enyi entanglement of purification as a constrained minimum output R\'enyi entropy problem. Equivalently, for $p>1$, this formulation can be expressed in terms of a constrained maximal output Schatten $p$-norm. More precisely, for a completely positive map $\Omega:L(B')\to L(A)$, we consider the quantity $\upsilon_p(\Omega)$ defined by optimizing $\|(\Omega\otimes \mathrm{id}_E)(\sigma^{B'E})\|_p$ over all bipartite states $\sigma^{B'E}$ whose $B'$-marginal is maximally mixed. We focus on the case $p=2$. First, we compute $\upsilon_2$ for the transpose-depolarizing channel and prove that it is multiplicative under tensor powers. We then establish a general multiplicativity criterion: whenever a completely positive map $N:L(B')\to L(A)$ satisfies $N^{\dagger} \mathbin{\circ} N=a\,\mathrm{id}_A+b\,\mathrm{Tr}[\cdot]\,I_d$ for some constants $a,b\ge 0$, where $N^{\dagger}$ denotes the Hilbert-Schmidt adjoint of $N$,

Скрыть анонс
15.05.2026
13:02 Arxiv.org Math Translation symmetry-enforced long-range entanglement in mixed states

arXiv:2605.15200v1 Announce Type: cross Abstract: We show by a counting argument that even though translation symmetry admits symmetric short-range entangled (SRE) eigenstates, there are not enough such SRE eigenstates to span the zero momentum sector. This means that the fixed point strong-to-weak spontaneous symmetry breaking state of translation symmetry is long-range entangled: it cannot be written as a mixture of SRE states. This is a subtle form of long-range entanglement in mixed states that cannot be detected by long-range connected correlation functions.

Скрыть анонс
13:02 Arxiv.org Physics Entangled Telecom Photon Generation using Twisted Van der Waals Crystals

arXiv:2605.14592v1 Announce Type: new Abstract: Nanoscale quantum light sources are essential building blocks for integrated quantum photonic systems. Here, we report a wavelength-scale entangled-photon source based on van der Waals-engineered NbOBr$_2$, and benchmark its performance for telecom-wavelength quantum light generation. By exploiting the material's second-order nonlinearity, we generate quantum-correlated photon pairs via spontaneous parametric down-conversion. We then use a 90$^{\circ}$ twisted stacking to induce quantum interference in photon-pair generation, yielding polarization-entangled photons. This approach enables tunability of the quantum optical state via control of the excitation laser polarization. We experimentally obtain entanglement fidelities exceeding 95% for Bell states, along with a high coincidence-to-accidental ratio of $\sim$335, and a brightness approximately one order of magnitude higher than recently reported telecom sources based on transition

Скрыть анонс
13:02 Arxiv.org CS A Resource-Driven Framework for Configurable Entanglement in Quantum Networks

arXiv:2605.15029v1 Announce Type: cross Abstract: Shared multipartite entanglement defines a ``whatever channel'', i.e., a latent communication substrate that does not determine a priori which end-to-end entangled links are activated, but can be configured to support different entanglement-connectivity graphs through Local Operations and Classical Communication (LOCC). Building on this, we propose a resource-driven framework in which multipartite entanglement is treated as a programmable resource that induces a space of admissible entanglement-graph configurations. Within this framework, connectivity provisioning emerges as a particular instance of a more general resource reconfiguration process. To support this paradigm, we introduce a set of structural design parameters that characterize the operational degrees of freedom of the resource and define the admissible transformations independently of the specific mechanism used to realize them. We then formalize Entanglement Rolling as a

Скрыть анонс
14.05.2026
08:35 Arxiv.org Math Random Access Code protocols: Quantum advantage related to intraparticle entanglement-based contextuality

arXiv:2605.13350v1 Announce Type: cross Abstract: The quantum enhancement of success probability in the Random Access Code (RAC) protocols remains unexplored from two important perspectives. First, the use of entanglement between two co-measurable degrees of freedom of a single particle (intraparticle entanglement) in achieving such quantum enhancement has not been investigated. Second, no explicit quantitative correspondence has been established between the predicted/observed quantum advantage and the underlying quantum resource responsible for it. In this work, we address both these aspects simultaneously by harnessing a single-particle resource. For this purpose, the RAC protocol is formulated in terms of intraparticle entanglement between, for instance, spin/polarization and path degrees of freedom of a single particle. Within this framework, a relevant Bell-type inequality, derived from the assumption of noncontextuality for single particle path-spin measurements, is used. Based

Скрыть анонс
08:35 Arxiv.org Math Quantum Fractional Revival and Entanglement Entropy in Unitary Cayley Graphs

arXiv:2605.13645v1 Announce Type: new Abstract: This paper extends the theory of quantum fractional revival (QFR) on unitary Cayley graphs $X=(V(\mathbb{Z}_n),E(S))$ in several directions that remained unresolved in previous work. First, we investigate QFR with respect to the Laplacian matrix Hamiltonian in addition to the adjacency matrix Hamiltonian. In particular, we prove that for regular graphs the two models differ only by a global phase factor, and we determine the conditions under which the Laplacian framework independently admits QFR. Second, for unitary Cayley graphs of order $n=2p$, where $p$ is an odd prime, we derive an explicit closed-form expression for the minimum revival time, $t^{*}=\frac{2\pi}{p},$ and show that the associated revival amplitudes are given by \[ \alpha=\cos\!\left(\frac{2\pi}{p}\right), \qquad \beta=-i\sin\!\left(\frac{2\pi}{p}\right). \] Third, we provide a complete characterization of strongly cospectral vertex pairs in $X=(V(\mathbb{Z}_n),E(S))$

Скрыть анонс
08:35 Arxiv.org CS "It became a self-fulfilling prophecy": How Lived Experiences are Entangled with AI Predictions in Menstrual Cycle Tracking Apps

arXiv:2605.13261v1 Announce Type: new Abstract: In menstrual cycle tracking apps (MCTAs), AI-based predictions and insights have become increasingly popular. These features enable users to receive personalized information about their bodies and mental states. However, there is currently little research on how these predictive AI features and explanations affect users' lived experiences. This paper examines human-AI entanglement in MCTAs through 14 semi-structured user interviews and a group autoethnography. These methods uncover the processes leading to this phenomenon. Our results reveal that: (1) users understand their lived experiences in light of AI predictions, although these predictions can be faulty due to imperfect logging practices, (2) the user interface features and AI explanations do not support awareness or critical engagement with this entanglement and meaning-making, and (3) non-normative MCTA users report a sense of isolation in this entangled interaction. Based on our

Скрыть анонс
13.05.2026
11:12 Arxiv.org Math Simultaneously Minimizing Storage and Bandwidth Under Exact Repair With Quantum Entanglement

arXiv:2605.12455v1 Announce Type: new Abstract: We study exact-regenerating codes for entanglement-assisted distributed storage systems. Consider an $(n,k,d,\alpha,\beta_{\mathsf{q}},B)$ distributed system that stores a file of $B$ classical symbols across $n$ nodes with each node storing $\alpha$ symbols. A data collector can recover the file by accessing any $k$ nodes. When a node fails, any $d$ surviving nodes share an entangled state, and each of them transmits a quantum system of $\beta_{\mathsf{q}}$ qudits to a newcomer. The newcomer then performs a measurement on the received quantum systems to generate its storage. Recent work [1] showed that, under functional repair where the regenerated content may differ from that of the failed node, there exists a unique optimal regenerating point that \emph{simultaneously minimizes both storage $\alpha$ and repair bandwidth $d \beta_{\mathsf{q}}$} when $d \geq 2k-2$. In this paper, we show that, under \emph{exact repair}, where the

Скрыть анонс
11:12 Arxiv.org Physics General Criteria for Certifying Genuine High-Dimensional Quantum Teleportation

arXiv:2605.11593v1 Announce Type: new Abstract: Developing reliable methods for certifying the dimension of a given quantum system or process is essential to ensure the validity of claimed realization of high-dimensional (HD) quantum advantages. The existing criteria for certifying genuine HD quantum teleportation (HDQT) mainly focus on demonstrating the successful transmission of genuine HD quantum states. However, a complete certification of HDQT must also identify the entanglement dimension of resource, which is critical for verifying whether the transmission capacity and noise resilience meet the necessary thresholds. Here we propose two universal criteria (based on fidelity and robustness, respectively) for certifying genuine HDQT behaviors that can close this gap by fully identifying the dimension of the entanglement. Both criteria require only the input and output teleportation data and remain feasible under partial Bell-state measurements. Furthermore, the robustness-based

Скрыть анонс
11:12 Arxiv.org CS Simultaneously Minimizing Storage and Bandwidth Under Exact Repair With Quantum Entanglement

arXiv:2605.12455v1 Announce Type: new Abstract: We study exact-regenerating codes for entanglement-assisted distributed storage systems. Consider an $(n,k,d,\alpha,\beta_{\mathsf{q}},B)$ distributed system that stores a file of $B$ classical symbols across $n$ nodes with each node storing $\alpha$ symbols. A data collector can recover the file by accessing any $k$ nodes. When a node fails, any $d$ surviving nodes share an entangled state, and each of them transmits a quantum system of $\beta_{\mathsf{q}}$ qudits to a newcomer. The newcomer then performs a measurement on the received quantum systems to generate its storage. Recent work [1] showed that, under functional repair where the regenerated content may differ from that of the failed node, there exists a unique optimal regenerating point that \emph{simultaneously minimizes both storage $\alpha$ and repair bandwidth $d \beta_{\mathsf{q}}$} when $d \geq 2k-2$. In this paper, we show that, under \emph{exact repair}, where the

Скрыть анонс
11:12 Arxiv.org CS GKnow: Measuring the Entanglement of Gender Bias and Factual Gender

arXiv:2605.12299v1 Announce Type: new Abstract: Recent works have analyzed the impact of individual components of neural networks on gendered predictions, often with a focus on mitigating gender bias. However, mechanistic interpretations of gender tend to (i) focus on a very specific gender-related task, such as gendered pronoun prediction, or (ii) fail to distinguish between the production of factually gendered outputs (the correct assumption of gender given a word that carries gender as a semantic property) and gender biased outputs (based on a stereotype). To address these issues, we curate \gknow, a benchmark to assess gender knowledge and gender bias in language models across different types of gender-related predictions. \gknow allows us to identify and analyze circuits and individual neurons responsible for gendered predictions. We test the impact of neuron ablation on benchmarks for disentangling stereotypical and factual gender (DiFair and the test set of GKnow), as well as

Скрыть анонс
11.05.2026
09:05 Arxiv.org Physics Entanglement-informed distributed wavefunction approach to scalable quantum many-body systems

arXiv:2605.07621v1 Announce Type: cross Abstract: We show that the entanglement structure of quantum many-body states defines a natural and optimal distributed representation for their simulation. An arbitrary entanglement cut induces a bipartite decomposition of the wavefunction, mapping its distribution onto that of the entanglement spectrum. In this representation the Hamiltonian application, the core of Krylov-subspace methods, reduces to local contractions and communication-optimal operations. Using benchmarks from different methods and models, we demonstrate near-linear scaling for sufficiently large systems and identify entanglement spectrum fragmentation as a key factor controlling computational cost. This establishes entanglement as an organizing principle and unified, method-independent, route for scaling up quantum many-body simulations.

Скрыть анонс
09:05 Arxiv.org CS PRISM: Refracting the Entangled User Behavior Space for E-Commerce Search

arXiv:2605.07296v1 Announce Type: new Abstract: E-commerce search systems rely on modeling user behavior to estimate item relevance and user preference, which are typically assumed to be stable and independently learnable signals. However, in practice, user interactions are jointly shaped by exposure mechanisms, feedback loops, and semantic matching, leading to entangled and dynamically drifting behavioral signals. As a result, both preference estimation and relevance modeling suffer from confounding effects and semantic misalignment, which limits the robustness of downstream ranking models. To address this issue, we propose PRISM, a Preference-Relevance Interaction Semantic Modeling framework for e-commerce search behavior prediction. PRISM explicitly models the interaction between user preference and item relevance rather than treating them as independent components. Specifically, it introduces a preference rectification module to iteratively refine user preference under

Скрыть анонс
08.05.2026
09:32 Arxiv.org Physics Macroscopic entanglement between two magnon modes via two-tone driving of a superconducting qubit

arXiv:2605.06297v1 Announce Type: cross Abstract: The cavity-mediated coupling between magnons in an yttrium-iron-garnet (YIG) sphere and a superconducting qubit has recently been demonstrated as a new platform for preparing macroscopic quantum states. Here, based on this system, we propose to entangle two magnon modes in two YIG spheres by driving the qubit with a two-tone field and by appropriately choosing the frequencies and strengths of the two driving fields. We show that strong entanglement can be achieved with fully feasible parameters. We further provide a detection scheme for experimentally verifying the entanglement. Our results indicate that macroscopic entanglement between two magnon modes in two millimeter-sized YIG spheres, involving more than $10^{18}$ spins, can be realized using currently available parameters, which finds promising applications in fundamental studies, such as macroscopic quantum mechanics and the test of unconventional decoherence theories.

Скрыть анонс
09:32 Arxiv.org CS Exploring Entanglement and Parameter Sensitivity in QAOA through Quantum Fisher Information

arXiv:2507.18844v2 Announce Type: replace-cross Abstract: Quantum Fisher Information (QFI) can be used to quantify how sensitive a quantum state reacts to changes in its variational parameters, making it a natural diagnostic for algorithms such as the Quantum Approximate Optimization Algorithm (QAOA). We perform a systematic QFI analysis of QAOA for Max-Cut on cyclic and complete graphs with $N = 4 - 10$ qubits. Two mixer families are studied, RX-only and hybrid RX-RY, with depths $p = 2, 4, 6$ and $p = 3, 6, 9$, respectively, and with up to three entanglement stages implemented through cyclic- or complete-entangling patterns. Complete graphs consistently yield larger QFI eigenvalues than cyclic graphs; none of the settings reaches the Heisenberg limit ($4N^2$), but several exceed the linear bound ($4N$). Introducing entanglement primarily redistributes QFI from diagonal to off-diagonal entries: non-entangled circuits maximize per-parameter (diagonal) sensitivity, whereas entangling

Скрыть анонс
09:32 Arxiv.org CS Topology-Driven Anti-Entanglement Control for Soft Robots

arXiv:2605.05236v1 Announce Type: new Abstract: In the field of precision manufacturing in complex constrained environments, the role of soft robots is increasingly prominent, and the realization of anti-winding control based on multi-intelligent body reinforcement learning has become a research hotspot. One of the core problems at present is to coordinate multiple robots to complete the unwinding operation in a highly constrained environment. The existing distributed training framework faces some observability challenges in high-density barrier and unstable environments, resulting in poor learning results. This paper proposes a topology-driven Multi-Agent Reinforcement Learning (TD-MARL) framework to coordinate multi-robot systems to avoid entanglement. Specifically, the critical network adopts centralized learning, so that each intelligent body can perceive the strategies of other intelligent bodies by sharing the topological state, thus alleviating the training instability caused

Скрыть анонс
07.05.2026
12:09 Arxiv.org Math Quantum Compression for Distributed Entanglement

arXiv:2605.04271v1 Announce Type: cross Abstract: We study compression strategies for multipartite entanglement distribution under uncertainty in the partitioning of the quantum state. When the partition is not known at the time of state preparation, we show that a joint design of the resource state and a family of compression schemes can increase the entanglement across partitions under a fixed transmission budget. We formulate this as a source coding problem and derive non-asymptotic upper and lower bounds on the achievable average entanglement subject to an average coding rate. We furthermore design an efficient method for jointly optimizing states and lossless compression maps by exploiting the inherent symmetry of weighted Dicke states. In the bipartite case, we propose practical constructions that closely approach the derived upper bound, and more generally we provide practical constructions for multipartite settings.

Скрыть анонс
12:09 Arxiv.org CS Quantum Compression for Distributed Entanglement

arXiv:2605.04271v1 Announce Type: cross Abstract: We study compression strategies for multipartite entanglement distribution under uncertainty in the partitioning of the quantum state. When the partition is not known at the time of state preparation, we show that a joint design of the resource state and a family of compression schemes can increase the entanglement across partitions under a fixed transmission budget. We formulate this as a source coding problem and derive non-asymptotic upper and lower bounds on the achievable average entanglement subject to an average coding rate. We furthermore design an efficient method for jointly optimizing states and lossless compression maps by exploiting the inherent symmetry of weighted Dicke states. In the bipartite case, we propose practical constructions that closely approach the derived upper bound, and more generally we provide practical constructions for multipartite settings.

Скрыть анонс
02:37 Phys.org Hourglass nanographenes unlock strong, robust multi-spin entanglement

Researchers from the National University of Singapore (NUS) and collaborators have developed a predictive design strategy for creating graphene-like molecules with multiple interacting spins and enhanced resilience to magnetic perturbations, opening new avenues for molecular-scale quantum information technologies and next-generation spintronics.

Скрыть анонс
06.05.2026
07:40 Arxiv.org Math Computation of entanglement for quantum states by a Consensus-Based Optimization method

arXiv:2605.03773v1 Announce Type: cross Abstract: The computation of quantum entanglement can be formulated as a high-dimensional nonconvex optimization problem with orthogonality constraints. In this work, we propose structure-preserving consensus-based optimization (CBO) methods for entanglement computation, with one approach based on a Hermitian formulation and the other evolving directly on the unitary manifold. To handle the variable dimension of the feasible set, we introduce a cross-dimensional interaction mechanism allowing exchange of information between particles of different sizes. Numerical experiments demonstrate that the proposed methods achieve accurate approximations.

Скрыть анонс
07:40 Arxiv.org Math Page Curve for Local-Operator Entanglement from Free Probability

arXiv:2605.02995v1 Announce Type: cross Abstract: The local-operator entanglement (LOE) measures the classical simulability of a Heisenberg operator and is conjectured to witness many-body chaos in locally interacting systems. Using tools from free probability, we analytically compute its value for Haar random dynamics for all R\'enyi indices. We find that it asymptotically reproduces the Page curve for random states in the case of traceless operators, with exponentially deviating corrections. In contrast to higher-order out-of-time ordered correlators, which depend on operator correlations via free cumulants, the leading-order LOE is independent of the initial operator. Guided by our Haar result, we therefore argue that the long-time value of the LOE entropies in chaotic systems will depend only on autocorrelation functions of the initial operator up to exponentially small corrections, suggesting that the higher-order structure of the full Eigenstate Thermalization Hypothesis is not

Скрыть анонс
07:40 Arxiv.org Physics Phase-Reference Control of Steady-State Entanglement in Open Quantum Systems

arXiv:2605.03978v1 Announce Type: cross Abstract: We show that steady-state entanglement in open quantum systems is controlled by the phase reference of a phase-sensitive reservoir. Using a covariance-matrix approach for Gaussian-preserving dynamics, we demonstrate that purely local, phase-sensitive dissipation can generate entanglement when combined with coherent coupling. The steady state exhibits a finite entangled region with an optimal squeezing strength that maximizes both the magnitude and thermal robustness of entanglement. We find that coherent coupling does not enhance entanglement monotonically, but instead regulates the conversion of local squeezing into nonlocal correlations. Importantly, the coupling dependence is controlled by the phase reference of the squeezed reservoir: phase-locked (rotating-frame) and laboratory-frame implementations yield qualitatively distinct steady states and entanglement structure. These results establish phase-sensitive reservoir engineering

Скрыть анонс
07:40 Arxiv.org CS Sequential vs. Simultaneous Entanglement Swapping under Optimal Link-Layer Control

arXiv:2605.04047v1 Announce Type: cross Abstract: Connection-less, packet-switched quantum network architectures distribute entanglement across multi-hop paths through sequential entanglement swapping, in which each node acts on purely local state information. The architectural advantages over the connection-oriented alternative -- simultaneous SWAP-ASAP -- are compelling, but sequential swapping holds partial chains in intermediate buffers between successive swaps, exposing them to memory decoherence in a way simultaneous SWAP-ASAP avoids by design. We present a proof-of-principle study at fixed chain length $n = 4$ in which each elementary link is governed by a fixed reinforcement-learning policy optimizing the secret-key rate of the six-state protocol, leaving the network-layer protocol as the sole independent variable. Sweeping the network-layer memory coherence time $T_c^{\mathrm{ext}}$ over four orders of magnitude reveals a clear regime structure governed by the dimensionless

Скрыть анонс
05.05.2026
10:19 Arxiv.org Physics Free-standing circular Bragg gratings enabling efficient GaAs quantum dot entangled photon pair sources

arXiv:2605.02360v1 Announce Type: new Abstract: Deterministic and bright quantum light sources based on scalable semiconductor technologies are a crucial building block for future quantum communication networks. While circular Bragg gratings (CBGs) are highly effective for extracting light from solid-state quantum emitters, conventional architectures rely on complex multi-layer processing or flip-chip bonding, which introduce detrimental strain and limit scalability. Here, we present a fabrication-minimal approach to realize monolithic, free-standing CBG cavities with deterministically positioned single GaAs quantum dots (QDs). By utilizing aspect-ratio-dependent etching (ARDE) in a single-step top-down process, we achieve the necessary vertical structural asymmetry for directional emission without requiring bottom reflectors. Finite-difference time-domain (FDTD) simulations validate this geometry, predicting free-space extraction efficiencies up to $68 \, \%$ and coupling

Скрыть анонс
10:19 Arxiv.org CS Entanglement Generation During Distribution via Spatial Superposition Entanglement Generation

arXiv:2605.02564v1 Announce Type: cross Abstract: The exploitation of quantum coherence at the level of propagation represents a powerful paradigm for quantum communication networks. In this work, we show that the coherent superposition of spatially distinct communication links enables entanglement generation inherently during distribution. Specifically, separable quantum states can be deterministically transformed into entangled states, when the noisy communication links they traverse are coherently superposed. Contrary to the conventional view of noise as a detrimental effect, we demonstrate that quantum noise itself can be transformed into a constructive resource for entanglement generation for both bipartite and multipartite entanglement. Given the practical feasibility of implementing spatial superposition in interferometric setups, our approach provides a feasible method for distributed entanglement engineering, opening new directions for quantum communication and networked

Скрыть анонс
10:19 Arxiv.org CS Entanglement is Half the Story: Post-Selection vs. Partial Traces

arXiv:2605.02385v1 Announce Type: cross Abstract: While tensor networks have their traditional application in simulating quantum systems, in the recent decade they have gathered interest as machine learning models. We combine the experience from both fields and derive how quantum constraints placed on a tensor network manifest a change in capabilities. To this end, we employ a method of inference of classical tensor networks on a quantum computer to define a hybrid architecture. This hybrid tensor network is a practical unified framework for it's classical and quantum tensor network edge cases. We identify post-selection as the important property on which this interpolation hinges. The amount of post-selection corresponds to the level to which quantum constraints are enforced on the tensor network. On this basis, we propose a new hyperparameter which controls the transition between the hybrid and the quantum tensor network. In the comparison of classical and quantum tensor networks it

Скрыть анонс
09:01 Aps.org Editors' Suggestions Quantum Spin Liquid Phase in the Shastry-Sutherland Model Revealed by High-Precision Infinite Projected Entangled-Pair States

Author(s): Philippe Corboz, Yining Zhang, Boris Ponsioen, and Frédéric MilaHigh-precision tensor network calculations in the 2D thermodynamic limit reveal a narrow quantum spin liquid phase, consistent with previous studies, but based on variational states significantly closer to the exact ground state in the thermodynamic limit. [Phys. Rev. Lett. 136, 186701] Published Mon May 04, 2026

Скрыть анонс
04.05.2026
19:06 Aps.org Editors' Suggestions Quantum Teleportation over Thermal Microwave Network

Author(s): W. K. Yam, S. Gandorfer, F. Fesquet, M. Handschuh, K. E. Honasoge, A. Marx, R. Gross, and K. G. FedorovThe deterministic quantum teleportation of microwave coherent states between two spatially-separated dilution refrigerators connected via a superconducting channel operating at temperatures up to 4 Kelvin demonstrates the experimental feasibility of quantum communication over a thermal microwave network. [Phys. Rev. Lett. 136, 180801] Published Mon May 04, 2026

Скрыть анонс
12:50 Arxiv.org Math Entanglement Enabled Data Transmission over an Arbitrarily Varying Channel

arXiv:2605.00132v1 Announce Type: cross Abstract: Shared randomness is the central ingredient for stabilizing symmetrizable communication systems against arbitrarily varying jammers. Given the presence of the jammer, however, the question arises how this precious resource could have been distributed. Several works discuss the use of external sources for this task. In this work, we show, based on the most standard optical communication model, how the sender and receiver can employ entangled two-mode squeezed states to counter the jamming attack of an energy-limited jammer during the distribution phase when both the sender and jammer are allowed to use binary phase shift keying and two-mode squeezed vacuum states.

Скрыть анонс
12:50 Arxiv.org Physics Generation of Tunable Entanglement from Thin-Film Lithium Niobate

arXiv:2605.00214v1 Announce Type: cross Abstract: Entangled photon pairs play a major role in various modern technologies such as quantum imaging, communication, and computing. Conventional photon-pair sources are often based on spontaneous parametric down-conversion in bulk nonlinear crystals. Recent advances have also shown entangled photon-pairs from transition metal dichalcogenide thin-films, however, these materials are not widely available and are not compatible with existing fabrication capabilities. We present a new thin-film lithium niobate source of polarization-entangled photon pairs at the telecom wavelength that requires no additional optical elements for entanglement generation and allows for easy application using the existing lithium niobate fabrication technologies. We demonstrate tunable entanglement generation using the three-fold rotational crystal symmetry of lithium niobate, allowing the generation of different maximally entangled Bell states or completely

Скрыть анонс
12:50 Arxiv.org Physics Quantum Entanglement Degree, Mean Positronium Lifetime, and the $3\gamma$/$2\gamma$ Annihilation-Rate Ratio as Novel PET Biomarkers for Hypoxia -- Concept, Challenges, and Predictions

arXiv:2605.00021v1 Announce Type: new Abstract: This manuscript introduces a novel method to assess tissue oxygen concentration via the quantum entanglement (QE) of photons originating from positronium which is produced within the patient's body during positron emission tomography. We also investigate the possibility of assessing hypoxia by simultaneously detecting positronium lifetime and the positronium decay rate ratio. We introduce two distinct quantum sensing approaches. Method 1 utilizes the correlation between oxygen concentration and ortho-positronium (o-Ps) decay rates, relying on the simultaneous measurement of the mean o-Ps lifetime ($\tau_{\mathrm{oPs}}$) and the $3\gamma$-to-$2\gamma$ annihilation rate ratio of o-Ps ($R_{\mathrm{oPs-3\gamma/2\gamma}}$). Method 2 introduces a novel hypothesis: that the degree of QE is sensitive to the relative contribution of annihilation mechanisms (pick-off vs. conversion), which in turn depends on oxygen concentration. We derive a

Скрыть анонс
12:50 Arxiv.org CS Entanglement Enabled Data Transmission over an Arbitrarily Varying Channel

arXiv:2605.00132v1 Announce Type: cross Abstract: Shared randomness is the central ingredient for stabilizing symmetrizable communication systems against arbitrarily varying jammers. Given the presence of the jammer, however, the question arises how this precious resource could have been distributed. Several works discuss the use of external sources for this task. In this work, we show, based on the most standard optical communication model, how the sender and receiver can employ entangled two-mode squeezed states to counter the jamming attack of an energy-limited jammer during the distribution phase when both the sender and jammer are allowed to use binary phase shift keying and two-mode squeezed vacuum states.

Скрыть анонс
12:50 Arxiv.org CS EASE: Federated Multimodal Unlearning via Entanglement-Aware Anchor Closure

arXiv:2605.00733v1 Announce Type: new Abstract: Federated Multimodal Learning (FML) trains multimodal models across decentralized clients while keeping their image-text pairs private. However, joint embedding training entangles forgotten knowledge across both modalities and client gradient subspaces, hindering federated unlearning. Previous federated unlearning approaches neither sever the cross-modal reconstruction channel mediated by bilinear coupling nor separate forget-exclusive update directions from those shared with retained clients. We identify an Anchor Principle for federated multimodal contrastive unlearning: forgotten alignments persist through three residual anchors arising from bilinear cross-modal coupling, principal-angle subspace entanglement, and continued federated updates. At the modality level, we show that bilateral displacement of both visual and language branches closes the cross-modal reconstruction channel. Correspondingly, our method addresses subspace

Скрыть анонс
12:50 Arxiv.org CS Fidelity-Guaranteed Entanglement Routing with Distributed Purification Planning

arXiv:2605.00246v1 Announce Type: new Abstract: Many quantum-network applications require end-to-end Bell pairs whose fidelity exceeds a request-specific threshold, but existing entanglement routing algorithms either optimize only throughput without regard for fidelity or enforce fidelity guarantees using centralized controllers with global link-state knowledge. We present Q-GUARD, an online entanglement routing algorithm that enforces per-request fidelity thresholds within a distributed protocol model in which nodes exchange link-state information only with their $k$-hop neighbors. After link outcomes are realized in each slot, Q-GUARD builds per-link purification cost tables from realized Bell pairs, allocates per-hop fidelity targets using a Werner-state equal-split rule, and selects between candidate path segments using a segment-local expected-goodput (EXG) metric that jointly accounts for swap success, purification overhead, and resource availability. We also introduce

Скрыть анонс
01.05.2026
13:44 Arxiv.org Math Light-Cone Structure of Propagation of Entanglement

arXiv:2604.27170v1 Announce Type: cross Abstract: For a wide class of bipartite systems with localized couplings, we establish existence of an effective light-cone for propagation of entanglement. This result yields a hard lower bound on the time it takes, under ideal conditions (no loss, no decoherence), to transport entanglement to a distant location (say, a node of a graph-structured quantum network), or to maintain it there.

Скрыть анонс
13:44 Arxiv.org Math Resolving spurious topological entanglement entropy in stabilizer codes

arXiv:2604.27053v1 Announce Type: cross Abstract: Topological entanglement entropy (TEE) is a key diagnostic of long-range entanglement in two-dimensional gapped phases of matter, but it can suffer from spurious contributions that overestimate the total quantum dimension of the underlying topological order. In this work, we identify the microscopic origin of spurious TEE and introduce a concave partition for computing the Levin-Wen TEE of translation-invariant stabilizer codes of prime-dimensional qudits. We rigorously prove that this prescription is free of spurious contributions. As a complementary probe, we study bivariate bicycle codes on a bipartite cylinder and show that the entanglement entropy depends sensitively on the cylinder circumference, revealing topological frustration of the underlying anyons.

Скрыть анонс
Первая← Предыдущая12345678910Предыдущая →