arXiv subjects

Jianqi Sheng

Publications and source records attributed to Jianqi Sheng.

8 recordsLinked to original sources

arXiv2026

Diffusive Speed Limits for U(1)-Covariant Quantum Error Correction

Fast preparation of quantum error-correcting codes is essential for scalable quantum memories, but geometric locality and $U(1)$ charge conservation impose an unavoidable transport constraint. We combine exact complementary-channel geometry, charge-sector Haar analysis, and a gate-resolved connected-moment expansion to study one-dimensional covariant encoders under flagged erasure. Charge-Haar codes attain the universal adjacent-charge lower bound up to exponentially small corrections, yielding an exact $n^{-1/2}$ extensive-erasure law and a sharp half-erasure transition. For local number-conserving brickwork circuits, diffusion of the logical charge enforces an $\Omega(n^2)$ encoding-time lower bound; we also prove an $O(n^3)$ mixing bound for the classical component and reduce the remaining full-channel upper bound to a source-restricted low-support operator-spreading problem. These results identify diffusion as an operational limit on symmetry-constrained quantum coding and establish a route to its exact formation time.

quant-ph↗

arXiv2026

Task-Dependent Syndrome Memory in Quantum Sensing and State Recovery

Preserving metrological information under noise is central to quantum sensing, yet finite detectors and memories impose an unavoidable limit on how finely noise trajectories can be resolved. Using exact symmetric-logarithmic-derivative geometry, we determine when a monitored trajectory can be compressed without losing quantum Fisher information. For an explicit faithful monitored qubit family, the complete joint signal-and-noise model is recoverable from only polynomially many type records, requiring $O(\log n)$ terminal memory, whereas deferred recovery of arbitrary $n$-qubit states requires exponentially many trajectories, or $O(n)$ memory. Online correction replaces this terminal storage by an irreducible per-use readout and feedback alphabet. These results establish syndrome information as a task- and timing-dependent resource connecting quantum sensing, statistical sufficiency, and quantum error correction.

quant-ph↗

arXiv2026

When Quantum States over Spacetime Have No Common Process

Determining whether observations across spacetime arise from one quantum process is central to causal inference and to consistent observer-relative descriptions. For quantum-state-over-spacetime (QSOST) data, this remains obstructed because causally agnostic interferometry compresses process matrices: every setting can appear physical although its hidden positive completions cannot be glued to a common parent. We formulate this as an inverse positive-lift problem and solve it exactly. Each positive-weight QSOST branch has a unique least positive lift, yielding a data-only common-parent criterion. We prove that settingwise realizability implies common-process realizability for every finite family if and only if the QSOST projection is injective on deterministic processes. Thus any normalized information loss can be exposed as a strict gluing failure. For bipartite qubits we identify a $63$-dimensional hidden fiber and construct definite-order separations, including a minimal two-setting, two-outcome example with exact noise threshold $\eta=1/\sqrt2$ and a sparse interferometric witness. Under explicit causal-access conditions, we also derive exact delayed fact-inference limits and identify the minimal environment; restoring full access removes only the pre--post gap. These results identify the boundary between spacetime tomography and global process composition, turning hidden process incompatibility into an experimentally testable phenomenon.

quant-ph↗

arXiv2026

Protecting Astronomical Interferometry through Quantum-Memory Scrambling

Preserving the complex visibility of coherently captured starlight is essential for quantum-assisted long-baseline interferometry, because this nonlocal coherence carries the spatial information needed to form astronomical images. Yet finite memory lifetime and imperfect retrieval inevitably produce storage failures; when a failed cell is heralded, its erased subsystem can leak which-node information to the environment and dephase the stored coherence. Strict finite-dimensional ($U(1)$) covariance further forbids uniform exact correction of all single-memory erasures. We address this combined physical and symmetry-imposed limit using local number-conserving quantum scrambling, parameter-independent pattern-conditioned recovery, and a fixed Gottesman--Jennewein--Croke receiver. We prove a channel-to-Fisher-information stability theorem that converts approximate logical recovery into an operational guarantee on receiver-accessible information over compact visibility regions. All-pattern finite-size simulations show that scrambling redistributes erasure risk and suppresses high-leakage events, while a separate equal-budget comparison identifies a shallow design that outperforms the tested deeper and charge-sector Haar-random benchmarks at the prespecified operating point. A separate compilation resolves every nontrivial recovery branch into abstract nearest-neighbor number-conserving gates. Although the present low-rate design does not yet improve fixed-total-memory throughput, it establishes a blueprint for converting spare memory capacity into protection of astronomical coherence, opening a path toward higher-rate, erasure-resilient quantum telescope architectures.

quant-ph↗

arXiv2026

Connecting Quantum Contextuality and Nonlocality

Quantum theory departs from classical physics in its treatment of correlations, most prominently through the phenomena of contextuality and nonlocality. Once regarded primarily as foundational curiosities, these effects are now understood as key operational resources for quantum computation, communication, and simulation. Although traditionally investigated in distinct settings, recent theoretical and experimental advances have revealed deep conceptual, mathematical, and operational connections between them. This review presents a unified perspective on these developments based on sheaf-theoretic and graph-theoretic frameworks, which provide theory-independent characterizations of statistical correlations. These approaches clarify the structural relationship between contextuality and nonlocality, facilitate the formulation of experimentally testable inequalities, and guide implementations in realistic physical platforms, with particular emphasis on photonic systems. By bridging abstract theoretical structures and concrete experimental realizations, this review sheds light on the nonclassical foundations of quantum correlations and their emerging role in quantum technologies.

quant-ph↗

arXiv2025

Experimental Test of Quantum Nonlocality from Contextuality

There are two powerful arguments against the possibility of extending quantum mechanics, the violation of Bell inequalities and the Kochen-Specker theorem, but the connection between the two remains confused. Following the distinctive strategy proposed by Cabello [Phys. Rev. Lett. 127, 070401 (2021)], Bell inequalities can be violated by state-independent contextuality sets. However, the experimental realization of such ideas is challenging as it requires high-dimensional entanglement. Orbital angular momentum provides an unlimited state space and the number of effective dimensions can be readily tailored as required. We performed an experimental test of non-locality based on Bell inequalities from contextuality, using orbital angular momentum entanglement in a bipartite photonic system. Our experiment not only shows a new way to produce non-locality but also connects contextuality and non-locality, two fundamental quantum resources that are critical for quantum computation and secure communication tasks.

quant-ph↗

arXiv2025

Orbital Angular Momentum Experimental Bound on the Maximum Predictive Power of Physical Theories in Multi-Dimensional Systems

The completeness of quantum mechanics in predictive power is a central question in its foundational study. While most investigations focus on two-dimensional systems, high-dimensional systems are more general and widely applicable. Building on the non-extensibility theorem by Colbeck and Renner [Phys. Rev. Lett. 101, 050403 (2008)], which established that no higher theory can enhance the predictive power of quantum mechanics for two-dimensional systems, we extend this result to arbitrarily dimensional systems. We connect maximum potential predictive power achievable by any alternative theory to experimentally observable correlations, and establish optimal experimental bounds across varying dimensions by exploiting two-photon orbital angular momentum entangled states with entanglement concentration. These bounds falsify a broader class of alternative theories, including Bell's and Leggett's models, and those that remain theoretically ambiguous or experimentally unverified. Our findings not only deepen the foundational understanding of quantum mechanics but also hold significant potential for high-dimensional quantum cryptography.

quant-ph↗

arXiv2025

Crypto-nonlocality in arbitrarily dimensional systems

According to Bell's theorem, any model based on local variables cannot reproduce certain quantum correlations. A critical question is whether one could devise an alternative framework, based on nonlocal variables, to reproduce quantum correlations while adhering to fundamental principles. Leggett proposed a nonlocal model, termed crypto-nonlocality, rooted in considerations of the reality of photon polarization, but this property restricted it to being bi-dimensional. In this Letter, we extend the crypto-nonlocal model to higher dimensions and develop a framework for constructing experimentally testable Leggett-type inequalities for arbitrary dimensions. Our investigation into models that yield specific predictions exceeding those of quantum mechanics is intriguing from an information-theoretic perspective and is expected to deepen our understanding of quantum correlations.

quant-ph↗