arXiv subjects

Xiangling Xu

Publications and source records attributed to Xiangling Xu.

8 recordsLinked to original sources

arXiv2026

Fermions are fundamentally more nonlocal than Bosons

Bell's theorem shows that entangled quantum particles can exhibit correlations that classical particles cannot reproduce without an additional nonlocal resource, such as communication. In this sense, quantum particles are fundamentally more nonlocal than classical ones, and entanglement becomes unavoidable in physics. Here we prove the analogous result within quantum theory itself: indistinguishable fermions transmitted through a quantum network can generate correlations that distinguishable particles or indistinguishable bosons cannot reproduce without additional communication. In the same sense, fermions are fundamentally more nonlocal than bosons or distinguishable particles, motivating fermionic anticommutation and indistinguishability as unavoidable operational resources. Our result further implies that fermions can strictly surpass all qubit-based protocols for certain distributed computing tasks, demonstrating that a complete understanding of information processing requires going beyond qubits to fermionic information carriers - febits.

quant-ph↗

arXiv2026

The bulk spectral gap is semi-decidable: a convergent family of certified upper bounds

Determining spectral gaps in the thermodynamic limit is a central challenge in quantum many-body physics. Existing rigorous methods are largely limited to special settings, while variational numerical approaches typically provide estimates rather than certified bounds. Here we introduce a complete family of certified upper bounds on the bulk spectral gap of quantum many-body systems. These upper bounds are obtained by solving a series of semidefinite programs and they become arbitrarily tight at the cost of more computational resources. This shows that the bulk spectral gap is semi-decidable, in contrast to undecidability results for alternative notions of spectral gap based on sequences of finite systems with prescribed boundary conditions. As a proof of principle, we apply our algorithm to the spin-$\frac{1}{2}$ kagome lattice Heisenberg antiferromagnet and obtain, to our knowledge, the first nontrivial certified upper bounds on its bulk spectral gap.

quant-ph↗

arXiv2026

Comment on "Quantum theory based on real numbers cannot be experimentally falsified": On the compatibility of physical principles with information theory for fermions

The manuscript [arXiv:2603.19208] proposes a physically motivated postulate to select the appropriate formulation of quantum theory over real Hilbert spaces, ruling out the theory considered in [Nature 600, 625-629 (2021)] in favour of the alternative theory which reproduces the predictions of standard quantum information theory (QIT). Here, we first make the claim that a general physical postulate should in particular be satisfied by Fermionic Information Theory (FIT), the standard framework describing information encoded in the presence or absence of identical fermions. We then show that this postulate proposed by [arXiv:2603.19208] fails in FIT, hence is not a general physical postulate according to our claim. More broadly, our results highlight the importance of confronting proposed foundational principles with fermionic information theories, a point that also deserves further examination in recent related works such as [arXiv:2503.17307] and [arXiv:2504.02808].

quant-ph↗

arXiv2025

Quantitative quantum soundness for all multipartite compiled nonlocal games

Compiled nonlocal games transfer the power of Bell-type multi-prover tests into a single-device setting by replacing spatial separation with cryptography. Concretely, the KLVY compiler (STOC'23) maps any multi-prover game to an interactive single-prover protocol, using quantum homomorphic encryption. A crucial security property of such compilers is quantum soundness, which ensures that a dishonest quantum prover cannot exceed the original game's quantum value. For practical cryptographic implementations, this soundness must be quantitative, providing concrete bounds rather than merely asymptotic. While quantitative quantum soundness has been established for the KLVY compiler in the bipartite case, it has only been shown asymptotically for multipartite games. This is a significant gap, as multipartite nonlocality exhibits phenomena with no bipartite analogue, and the difficulty of enforcing space-like separation makes single-device compilation especially compelling. This work closes this gap by providing quantitative upper bounds for all multipartite compiled nonlocal games via a new sequential NPA-like hierarchy. In particular, finite-level convergence yields quantitative quantum soundness with respect to the commuting quantum value, and flat optimality yields the same with respect to the tensor-product quantum value. On the way, we introduce an NPA-like hierarchy for quantum instruments and prove its completeness, thereby characterizing correlations from operationally-non-signaling sequential strategies. This NPA-like hierarchy can be seen to complement previous multipartite generalizations of the S-G-HJW purification theorem, which takes a central role in quantum information, nonlocality, and contextuality. We further develop novel geometric arguments for the decomposition of sequential strategies into their signaling and non-signaling parts, which might be of independent interest.

quant-ph↗

arXiv2025

Quantitative Tsirelson's Theorems via Approximate Schur's Lemma and Probabilistic Stampfli's Theorems

Whether an almost-commuting pair of operators must be close to a commuting pair is a central question in operator and matrix theory. We investigate this problem for pairs of $C^*$-subalgebras $\mathcal{A}$ and $\mathcal{B}$ of $M_d(\mathbb{C})$, showing that each operator in $\mathcal{B}$ is $O(d^2ε)$-close in operator norm to an operator in the commutant $\mathcal{A}'$ under two complementary formulations of "$ε$-almost commutation." One formulation is probabilistic, requiring that the operators of $\mathcal{B}$ have small commutators for most Haar-random unitaries acting on $\mathcal{A}$. This first formulation leads to two novel probabilistic generalizations of Stampfli's theorem, which relates an operator's distance from the scalars to the norm of its inner derivation. The second formulation is deterministic, requiring small commutators between the generators of $\mathcal{A}$ and $\mathcal{B}$; we analyze this using an approximate Schur's lemma formulated in terms of Weyl-Heisenberg (clock-and-shift) matrices. As an application of our results to quantum information theory, we obtain a quantitative Tsirelson's theorem: in dimension $d$, every $ε$-almost quantum commuting observable model is well approximated by a quantum tensor-product model with error $O(d^2ε)$.

quant-ph↗

arXiv2025

Quantitative Quantum Soundness for Bipartite Compiled Bell Games via the Sequential NPA Hierarchy

Compiling Bell games under cryptographic assumptions replaces the need for physical separation, allowing nonlocality to be probed with a single untrusted device. While Kalai et al. (STOC'23) showed that this compilation preserves quantum advantages, its quantitative quantum soundness has remained an open problem. We address this gap with two primary contributions. First, we establish the first quantitative quantum soundness bounds for bipartite compiled Bell games via a newly formalized convergent sequential Navascu\'es-Pironio-Ac\'in (NPA) hierarchy: any polynomial-time prover's score is controlled by a finite-level hierarchy value, and finite-level convergence gives a negligible gap to the commuting quantum value, or to the tensor-product quantum value under flat optimality. Second, we provide a full characterization of this sequential NPA hierarchy, establishing it as a robust numerical tool that is of independent interest. Finally, for games without such finite-level certificates, we explore the necessity of NPA approximation error for quantitatively bounding their compiled scores, linking these considerations to the complexity conjecture $\mathrm{MIP}^{\mathrm{co}}=\mathrm{coRE}$ and open challenges such as quantum homomorphic encryption correctness for "weakly commuting" quantum registers.

quant-ph↗

arXiv2022

On the Kinematic Morphology around Halos

In this paper, we report an interesting kinematic phenomenon around the halos' edge related to the splashback radius. After the shell-crossing, cosmic flow exhibits various rotational morphologies via stream-mixing. Vorticity is generated in a particular way that coincides with the large-scale structure. Notably, one specific flow morphology, which is spiraling inward and compressing in the third direction, concentrates around halos. A detailed examination that reveals a sharp change in the logarithmic derivative of its volume fraction, coincides with the location of the splashback radius defined as the outermost caustic structure. Such a feature encodes valuable phase space information and provides a new perspective on understanding the dynamical evolution of halos. As a volume-weighted quantity, the profile of flow morphology is purely kinematic. And unlike other related studies, the rotational flow morphologies capture the anisotropic phase structure in the multi-stream region.

astro-ph.CO↗

arXiv2022

Two convergent NPA-like hierarchies for the quantum bilocal scenario

Characterising the correlations that arise from locally measuring a single part of a joint quantum system is one of the main problems of quantum information theory. The seminal work [M. Navascu\'es et al., New J. Phys. 10, 073013 (2008)], known as the Navascu\'es-Pironio-Ac\'in (NPA) hierarchy, reformulated this question as a polynomial optimisation problem over noncommutative variables and proposed a convergent hierarchy of necessary conditions, each testable using semidefinite programming. More recently, the problem of characterising the quantum network correlations, which arise when locally measuring several independent quantum systems distributed in a network, has received considerable interest. Several generalisations of the NPA hierarchy, such as the scalar extension [A. Pozas-Kerstjens et al., Phys. Rev. Lett. 123, 140503 (2019)], were introduced while their converging sets remain unknown. In this work, we introduce a new bilocal factorisation NPA hierarchy, prove its equivalence to a modified bilocal scalar extension NPA hierarchy, and characterise its convergence in the case of the simplest network, the bilocal scenario. We further explore its relations with the other known generalisations.

quant-ph↗