Searcharxiv⌕ Search

arXiv subjects

Kan He

Publications and source records attributed to Kan He.

At least 19 recordsLinked to original sources

Maximal Violation of Mermin Inequality for Commuting von Neumann Algebras and Multipartite Vacuum Entanglement in QFT

Summers and Werner proved that Bell inequalities are violated maximally and generically in the vacuum of a relativistic quantum field theory in [S. J. Summers and R. Werner, Commun. Math. Phys. 110 (1987), 247-259]. Their criterion concerns two-party case, that is, there are two algebras of quantum observables: one algebra and its commutant. In this case, the maximal CHSH value is converged to in every normal state exactly when the algebra is strongly stable. In the paper, we study the corresponding question for three and more mutually commuting von Neumann algebras. We focus on the multipartite Mermin inequalities instead of CHSH ones. For the tripartite Mermin functional we show that maximal violation in every normal state is equivalent to the existence of a common sequence of asymptotic GHZ stabilizers. Strong stability of each local factor is an necessary condition for maximal violation, and a joint embedding of an infinite GHZ tensor product is sufficient. Counterexamples show that strong stability and type III_1 of the individual algebras, even together with tripartite duality, do not suffice to arrive at the maximal violation. The results are also extended to n>=3 parties.

quant-ph↗

A $k$-entanglement measure complying with the many-body resource theory and its evaluation

$k$-entanglement provides a hierarchical characterization of multipartite correlations according to their entanglement structure, ranging from multipartite entanglement ($k=n$) to genuine multipartite entanglement ($k=2$). Its quantitative treatment for mixed states faces three related obstacles: the standard axioms for such quantifications does not incorporate the requirements from many-body resource theory, as it does not regulate how to quantify the entanglement assigned to part systems of the same multipartite state and how to describe the rule that the entanglement possessed by a part system never exceeds the entanglement possed by whole system; no explicit measures are known that satisfy the above requirements from many-body resource theory; and the extreme difficulty in numerical evaluation at mixed states of known quantifications. In this work, we first formulate an axiomatic framework for \emph{true} $k$-entanglement measures that obeys the many-body resource theory, by supplementing usual faithfulness and LOCC monotonicity with two new ones: unification condition and hierarchy condition. Then, for every $2\leq k\leq n$, we construct a witness-based true $k$-entanglement measure $E_w^{(k,n)}$ without the convex-roof extension, which is valid for both finite- and infinite-dimensional $n$-partite systems. Finally, we derive a method of constructing finite-dimensional $k$-entanglement witnesses from positive operator and $k$-separable-state optimizations, design an evaluation scheme of $E_w^{(k,n)}$ based on pre-established database of $k$-entanglement witnesses sampled by positive operators. To check the feasibility of this computing scheme, we develop a software tool, which implements the computation of the approximation of $E_w^{(k,n)}$ for systems up to four qubits. Numerical tests show that the software is sufficiently accurate and reliable.

quant-ph↗

A scalable entanglement distribution framework for hybrid quantum networks

The realization of a scalable quantum network (QN) hinges on the efficient distribution of entanglement across heterogeneous hardware platforms. While traditional QN frameworks are often restricted to single-encoding schemes, relying exclusively on either discrete (DV) or continuous (CV) variables, such segregated architectures limit the capacity and interoperability of large-scale systems. Here, we propose a scalable hybrid entanglement distribution scheme that bridges these domains by mapping hybrid entanglement swapping and concentration at DV--CV interfaces onto a unified set of series and parallel graph rules. We demonstrate that our hybrid approach exhibits a {potential} performance advantage over traditional point-to-point generation of maximally entangled states, achieving enhanced end-to-end entanglement within series-parallel topologies. These results provide a theoretical foundation for designing resource-efficient, interpretable architectures for the future quantum internet.

quant-ph↗

A Hamiltonian-Level Certificate for Network-Free Distributed Quantum Simulation:Exact Tensor-Separability Criterion and Approximate Residual Bounds

Circuit cutting allows quantum circuits to be evaluated on smaller devices at the cost of additional sampling and classical reconstruction. For Hamiltonian-simulation circuits, the target unitary $\exp[it\mathbf H]$ connects this decomposition problem to the structure of the generator. We develop a Hamiltonian-level certificate that assesses exact separability and the accuracy of independent module evolution before a gate decomposition is chosen. For a time-independent Hamiltonian and a fixed module partition, the Hilbert--Schmidt projection onto sums of module-local terms isolates a cross-module residual $H_{ns}$. Its vanishing is necessary and sufficient for product evolution at all times; for Pauli-list inputs, this condition is checked in one pass over the combined coefficients. When $H_{ns}\ne0$, the projected evolution has operator-norm error at most $|t| ||H_{ns}||_{op}$. Across a bipartition, an explicit first-order algebraic correction has the same operator-Schmidt rank as $H_{ns}$ and leaves a second-order residual. The same Hamiltonian residual connects this approximation to short-time entanglement, determining the leading state-space and operator-space entangling powers and, through its Schmidt spectrum, the leading Choi tripartite-information terms. Numerical experiments test these relations and demonstrate block-factorised simulation up to $20$ qubits.

quant-ph↗

An Operator-Theoretic Model of Entanglement Percolation in Series-Parallel Quantum Networks

The realization of entanglement distribution (ED) in large-scale quantum networks (QNs), as a fundamental theoretical framework of quantum communication, faces significant challenges. Percolation theory, drawn from statistical physics, has been identified as a potential solution to this problem. Nevertheless, when addressing ED, percolation theory primarily relies on numerical simulations and approximate algorithms. This approach often lacks interpretability and controllability for many phenomena occurring during the ED process in large-scale networks, including emergent phenomena near the threshold. To address these limitations, in this paper, we {focus on} leveraging operator theory to construct a mathematical framework for entanglement percolation in series-parallel QNs. Through the application of operator-theoretic methodologies, we analyze several critical issues within the entanglement percolation process.

quant-ph↗

Verifying full quantum network nonlocality in arbitrary configurations by nonlinear Bell-like inequalities

Full quantum network nonlocality (FQNN) describes a scenario where all sources in a network are nonlocal. Existing criteria of FQNN can only be verified in star networks by violating a single Bell-like inequality. Here we propose a method that certifies FQNN in general quantum networks using only a single Bell-like inequality. We show that the topological obstacle to one-shot detection can be overcome by expanding the original network with a carefully chosen number of auxiliary local sources and parties. The correlations of the enlarged network are then tested with a single inequality; a violation implies that all original sources must be nonlocal. Our approach provides an efficient, experimentally friendly way to verify FQNN in any network topology.

quant-ph↗

SCARA: A Semantics-Constrained Autonomous Remediation Agent for Opaque Industrial Software Vulnerabilities

Critical-infrastructure operators are increasingly expected to assess and remediate vulnerabilities in deployed industrial software. However, much of this software exists as opaque industrial software (OIS), including stripped firmware, proprietary protocol handlers, and compiled control logic without source code, symbols, build environments, or hardware interfaces. While binary analysis can identify vulnerability candidates, existing automated repair systems largely rely on source code, compilable artifacts, sanitizer feedback, or instrumentable builds, leaving a gap between binary-level discovery and validated remediation. This paper presents SCARA, a Semantics-Constrained Autonomous Remediation Agent for OIS. SCARA operates under a source-unavailable defender model and connects upstream binary vulnerability candidates to conditionally validated remedies through a four-stage pipeline. Operational-state-aware verification (OSVA) filters infeasible candidates using a nine-component industrial state model; remediation synthesis (RSA) selects the strongest available remedy across protocol mitigation, binary hardening, and SSCKG-constrained source patches; and correctness validation (CVA) provides conditional correctness evidence via behavioral-coverage preservation, independent replay, and typed rejection feedback. On OIS-RemedBench, a 15-case benchmark spanning firmware, protocol handlers, and ICS/PLC artifacts, SCARA achieves observed 100% precision with no false positives, refutes 20.0% of cases as operationally infeasible, and reaches 88.9% remediation success after targeted reruns. To our knowledge, SCARA is the first end-to-end framework that connects binary vulnerability candidates to conditionally validated remediation for opaque industrial software.

cs.CR↗

Securing the Dark Matter: A Semantic-Enhanced Neuro-Symbolic Framework for Supply Chain Analysis of Opaque Industrial Software

Automated vulnerability detection in critical-infrastructure software confronts a fundamental barrier: industrial software is routinely deployed as stripped, symbol-free binaries that deprive conventional Software Composition Analysis of the source-level transparency it requires. Existing binary analysis techniques close this Semantic Gap only partially -- graph-based detectors preserve structural syntax but discard behavioral semantics, while large language models supply rich semantic cues at the cost of unstable, hallucination-prone inference. To address this gap, we present a semantic-enhanced neuro-symbolic framework that reconstructs behavioral semantics directly from opaque binaries and performs tractable global risk reasoning. Three tightly coupled mechanisms drive this capability: (1) abstract interpretation combined with a reflexive prompting pipeline that structurally constrains a local LLM agent, effectively suppressing hallucinations; (2) a surjective transformation that compresses raw Code Property Graphs into typed Software Supply Chain Knowledge Graphs amenable to scalable reasoning; and (3) a domain-adapted Graphormer that captures long-range vulnerability propagation, augmented by embedding-space subgraph matching to uncover zero-day and APT-style attack patterns. Evaluated across three benchmarks of increasing domain specificity, the framework consistently outperforms all baselines on detection accuracy, semantic lifting fidelity, and APT fingerprint matching. Deployment on a hybrid virtual-physical testbed incorporating production-grade hardware from five ICS vendors further confirms strong detection coverage of high-impact CVEs while substantially reducing false-positive rates relative to leading commercial tools.

cs.SE↗

Mutually-commuting von Neumann algebra models of quantum networks and violation of Bell-type inequalities

Employing mutually-commuting von Neumann algebras to represent the algebra of observables on quantum systems provides a framework for studying quantum information theory in systems with infinite degrees of freedom and quantum field theory, yielding many profound results that differ from non-relativistic quantum systems. In this paper, we establish a mutually-commuting von Neumann algebra model of quantum networks with arbitrary structures. We derive Bell-type inequalities on this model, and determine various bounds for Bell-type inequalities based on the structure of underline von Neumann algebras, and identify the algebraic structural conditions required for their violation. The conditions on the algebraic structure of observables for maximal violation of Bell-type inequalities, which we discovered in the context of von Neumann algebra models, can in turn guide the search for measurements in the non-relativistic setting.

quant-ph↗

Violation of Bell-type Inequalities on Mutually-commuting von Neumann Algebra Models of Entanglement Swapping Networks

Violation of Bell inequalities in bipartite systems represented by mutually-commuting von Neumann algebras has pioneered the study of vacuum entanglement in algebraic quantum field theory. It is unexpected that the maximal violation of Bell inequality can discover algebraic structures. In the paper, we establish the mutually-commuting von Neumann algebra model for entanglement swapping networks and Bell-type inequalities on this model. It generalizes the bipartite case to the ternary case. These algebras are all general von Neumann algebras, which provide a natural perspective to investigate Bell nonlocality in quantum networks in the infinitely-many-degree-of-freedom setting. We determine various bounds for Bell-type inequalities based on the structure of von Neumann algebras, and identify the algebraic structural conditions required for their violation. Finally, we show that the maximal violation of Bell-type inequalities in entanglement swapping networks can be used to determine partially the type classification of the underlying von Neumann algebras.

math.FA↗

Negativity Percolation in Continuous-Variable Quantum Networks

Quantum networks (QNs) have been predominantly driven by discrete-variable (DV) architectures. Yet, optical platforms naturally generate Gaussian states--the common states of continuous-variable (CV) systems, making CV-based QNs an attractive route toward scalable, chip-integrated quantum computation and communication. To bridge the gap between well-studied DV entanglement percolation theories and their CV counterpart, we introduce a Gaussian-to-Gaussian entanglement distribution scheme that deterministically transports two-mode squeezed vacuum states across large CV networks. Analysis of the scheme's collective behavior using statistical-physics methods reveals a new form of entanglement percolation--negativity percolation theory (NegPT)--characterized by a bounded entanglement measure called the ratio negativity. We discover that NegPT exhibits a mixed-order phase transition, marked simultaneously by both an abrupt change in global entanglement and a long-range correlation between nodes. This distinctive behavior places CV-based QNs in a new universality class, fundamentally distinct from DV systems. Additionally, the abruptness of this transition introduces a critical vulnerability of CV-based QNs: conventional feedback mechanism becomes inherently unstable near the threshold, highlighting practical implications for stabilizing large-scale CV-based QNs. Our results unify statistical models for CV-based entanglement distribution and uncover previously unexplored critical phenomena unique to CV systems, providing valuable insights and guidelines essential for developing robust, feedback-stabilized QNs.

quant-ph↗

TRAM: A Transverse Relaxation Time-Aware Qubit Mapping Algorithm for NISQ Devices

Noisy intermediate-scale quantum (NISQ) devices impose dual challenges on quantum circuit execution: limited qubit connectivity requires extensive SWAP-gate routing, while time-dependent decoherence progressively degrades quantum information. Existing qubit mapping algorithms optimize for hardware topology and static calibration metrics but systematically neglect transverse relaxation dynamics (T2), creating a fundamental gap between compiler decisions and evolving noise characteristics. We present TRAM (Transverse Relaxation Time-Aware Qubit Mapping), a coherence-guided compilation framework that elevates decoherence mitigation to a primary optimization objective. TRAM integrates calibration-informed community detection to construct noise-resilient qubit partitions, generates time-weighted initial mappings that anticipate coherence decay, and dynamically schedules SWAP operations to minimize cumulative error accumulation. Evaluated on Qiskit-based simulators with realistic noise models, TRAM outperforms SABRE by 3.59% in fidelity, reduces gate count by 11.49%, and shortens circuit depth by 12.28%, establishing coherence-aware optimization as essential for practical quantum compilation in the NISQ era.

quant-ph↗

Multipartite correlation measures and framework for multipartite quantum resources theory

In recent years, it has been recognized that properties of multipartite physical systems, such as genuine multipartite entanglement, can be considered as important resources for quantum information and other areas of physics. However, the current framework of multipartite quantum resource theory is flawed. In this paper, we propose a more reasonable framework for multipartite quantum resource theory with a particular focus on axiomatic definition for true measures of multipartite quantum correlations (MQC) that regulates how to measure the correlation in part systems (the unification condition) and how to describe the requirement from many-body resource theory that the correlation hold by part system does not exceed that of the entire system (the hierarchy condition). We find that, due to the inherent characteristics of MQCs, the true measures of different MQCs exhibit distinct hierarchy conditions. Based on this framework, we verify that multipartite entanglement, $k$-entanglement, $k$-partite entanglement, multipartite non-PPT, multipartite coherence, multipartite imaginarity, multipartite multi-mode Gaussian non-product correlation, multipartite multi-mode Gaussian imaginarity, and multipartite single-mode Gaussian coherence are all symmetric multipartite quantum resources. We also show that, multipartite steering is an asymmetric multipartite quantum resource. Finally, the monogamy relations for true measures of symmetric MQCs are discussed.

quant-ph↗

MALF: A Multi-Agent LLM Framework for Intelligent Fuzzing of Industrial Control Protocols

Industrial control systems (ICS) are vital to modern infrastructure but increasingly vulnerable to cybersecurity threats, particularly through weaknesses in their communication protocols. This paper presents MALF (Multi-Agent LLM Fuzzing Framework), an advanced fuzzing solution that integrates large language models (LLMs) with multi-agent coordination to identify vulnerabilities in industrial control protocols (ICPs). By leveraging Retrieval-Augmented Generation (RAG) for domain-specific knowledge and QLoRA fine-tuning for protocol-aware input generation, MALF enhances fuzz testing precision and adaptability. The multi-agent framework optimizes seed generation, mutation strategies, and feedback-driven refinement, leading to improved vulnerability discovery. Experiments on protocols like Modbus/TCP, S7Comm, and Ethernet/IP demonstrate that MALF surpasses traditional methods, achieving a test case pass rate (TCPR) of 88-92% and generating more exception triggers (ETN). MALF also maintains over 90% seed coverage and Shannon entropy values between 4.2 and 4.6 bits, ensuring diverse, protocol-compliant mutations. Deployed in a real-world Industrial Attack-Defense Range for power plants, MALF identified critical vulnerabilities, including three zero-day flaws, one confirmed and registered by CNVD. These results validate MALF's effectiveness in real-world fuzzing applications. This research highlights the transformative potential of multi-agent LLMs in ICS cybersecurity, offering a scalable, automated framework that sets a new standard for vulnerability discovery and strengthens critical infrastructure security against emerging threats.

cs.CR↗

Equivariant U-Shaped Neural Operators for the Cahn-Hilliard Phase-Field Model

Phase separation in binary mixtures, governed by the Cahn-Hilliard equation, plays a central role in interfacial dynamics across materials science and soft matter. While numerical solvers are accurate, they are often computationally expensive and lack flexibility across varying initial conditions and geometries. Neural operators provide a data-driven alternative by learning solution operators between function spaces, but current architectures often fail to capture multiscale behavior and neglect underlying physical symmetries. Here we show that an equivariant U-shaped neural operator (E-UNO) can learn the evolution of the phase-field variable from short histories of past dynamics, achieving accurate predictions across space and time. The model combines global spectral convolution with a multi-resolution U-shaped architecture and regulates translation equivariance to align with the underlying physics. E-UNO outperforms standard Fourier neural operator and U-shaped neural operator baselines, particularly on fine-scale and high-frequency structures. By encoding symmetry and scale hierarchy, the model generalizes better, requires less training data, and yields physically consistent dynamics. This establishes E-UNO as an efficient surrogate for complex phase-field systems.

cs.LG↗

Witnessing nonlocality in quantum network of continuous-variable systems by generalized quasiprobability functions

Gaussian measurements can not be used to witness nonlocality in Gaussian states as well as the network nonlocality in networks of continuous-variable (CV) systems. Thus special non-Gaussian measurements have to be utilized. In the present paper, we first propose a kind of nonlinear Bell-type inequality that is applicable to quantum networks of both finite or infinite dimensional systems. Violation of the inequality will witness the network nonlocality. This inequality allows us to propose a method of the supremum strategy for detecting network nonlocality in CV systems with source states being any multipartite multi-mode Gaussian states according to the configurations of the networks by utilizing non-Gaussian measurements based on generalized quasiprobability functions. The nonlinear Bell-type inequalities for CV networks, which depend solely on the generalized quasiprobability functions of Gaussian states, are straightforward to construct and implement. As illustrations, we propose the corresponding nonlinear Bell-type inequalities for any chain, star, tree-shaped and cyclic networks in CV systems with source states being $(1+1)$-mode Gaussian states. The examples show that this approach works well for witnessing the nonlocality in networks of CV systems. Particularly, a thorough discussion is given for the entanglement swapping network. Our study provide a strong signature for the network nonlocality nature of CV systems and lead to precise recipes for its experimental verification.

quant-ph↗

Reducing Complexity of Shadow Process Tomography with Generalized Measurements

Quantum process tomography (QPT) is crucial for advancing quantum technologies, including quantum computers, quantum networks and quantum sensors. Shadow process tomography (SPT) utilizes the Choi isomorphism to map QPT to shadow state tomography (SST), significantly reducing the sample complexity for extracting information from quantum processes. However, SPT relies on random unitary operators and complicates the determination of the optimal unitary operator that minimizes the shadow norm, which is the key factor influencing the sample complexity. In this work, we propose a generalized SPT framework that minimizes the shadow norm by replacing unitary operators with generalized measurements (POVMs). This approach, termed shadow process tomography with POVMs (POVM-SPT), uses convex optimization to identify the optimal POVM for minimizing the shadow norm, thereby further reducing sample complexity. We demonstrate the identification of the optimal POVM through numerical simulations and provide the corresponding optimization algorithms. Our numerical experiments demonstrate that POVM-SPT achieves a substantial reduction in shadow norm compared to conventional SPT, with an approximate 7-fold improvement for single-qubit input states and a remarkable $2^{180}$-fold enhancement for 64-qubit input states. These results reveal that POVM-SPT offers significant advantages in simplifying SPT tasks, particularly for large-scale quantum systems.

quant-ph↗

A nonconvex entanglement monotone determining the characteristic length of entanglement distribution in continuous-variable quantum networks

Quantum networks (QNs) promise to enhance the performance of various quantum technologies in the near future by distributing entangled states over long distances. The first step towards this is to develop novel entanglement measures that are both informative and computationally tractable at large scales. While numerous such entanglement measures exist for discrete-variable (DV) systems, a comprehensive exploration for experimentally preferred continuous-variable (CV) systems is lacking. Here, we introduce a class of CV entanglement measures, among which we identify a nonconvex entanglement monotone -- the ratio negativity, which possesses a simple, scalable form that determines the exponential decay of optimal entanglement swapping on a chain of pure Gaussian states. This characterization opens avenues for leveraging statistical physics tools to analyze swapping-protocol-based CV QNs.

quant-ph↗