arXiv subjects

Jinchuan Hou

Publications and source records attributed to Jinchuan Hou.

At least 19 recordsLinked to original sources

arXiv2026

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↗

arXiv2026

Algebraic Maximal Numerical Range and its preservers of Triple Products on $C^*$-Algebras

Let $\mathcal{A}$ and $\mathcal{B}$ be unital $C^*$-algebras, and let $V_0(a)=\{f(a): f\in\mathcal S(\mathcal A), f(a^*a)=\|a\|^2\}$ be the algebraic maximal numerical range of $a\in\mathcal{A}$, where $\mathcal S(\mathcal A)$ is the set of all states of $\mathcal A$. We study the properties of $V_0(a)$ and characterize surjective maps preserving $V_0$ of triple products. We show that if $Φ\colon\mathcal{A}\to\mathcal{B}$ satisfies $V_0(Φ(a)Φ(b)Φ(c))=V_0(abc) \text{~for all~} a,b,c\in\mathcal{A},$ then the map $a\mapsto Φ(1_{\mathcal{A}})^{-1}Φ(a)$ is a multiplicative bijection. Furthermore, for von Neumann algebras without central summands of type $I_1$ or prime $C^*$-algebras of real rank zero, such preservers are precisely $*$-isomorphisms multiplied by a central element $u\in Z(\mathcal{B})$ with $u^3=1$.

math.OA↗

arXiv2026

Ascent and descent of bounded linear operators

Let $\mathcal B(\mathcal X)$ be the algebra of all bounded linear operators on a real or complex Banach space $\mathcal{X}$ with $\dim\mathcal X \ge 3$. In this paper, we first explore the ascent (descent) of upper triangular block operator matrices and certain special algebraic operators, and then establish characterizations for the ascent (descent) of rank-one and rank-two operators. Based on these results, we characterize features for some special operators by the ascent (descent) of Jordan products. As an application, we give the structure of all maps with range containing all bounded operators of rank at most three preserving the ascent (descent) of operator Jordan product on $\mathcal B(\mathcal X)$.

math.FA↗

arXiv2026

Imaginarity Resource Theory of Gaussian Quantum Channels

Complex numbers play an indispensable role in quantum mechanics and quantum information, as validated by both theoretical analysis and experimental verification. Since quantum information processing inherently relies on quantum channels, the resource theory for quantum channels is equally fundamental to that for quantum states. In this paper, we propose two frameworks for quantifying the imaginarity of Gaussian channels. The first framework regards all real superchannels as free superchannels. Within this setting, we introduce two concrete imaginarity measures for Gaussian channels: I_s^GC based on existing imaginarity measures of Gaussian states, and I_d^GC derived directly from the intrinsic parameters of Gaussian channels, which enjoys high computational simplicity. The second framework adopts only a proper subset of real superchannels as free superchannels. Under this framework, we put forward another imaginarity measure I_c^GC , which is fully determined by the inherent parameters of Gaussian channels and features continuity as well as tractable computation. As a practical application, we employ I_c^GC to investigate the dynamical behavior of Quantum Brownian Motion Gaussian channels throughout the entire evolutionary process.

quant-ph↗

arXiv2026

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↗

arXiv2026

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↗

arXiv2026

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↗

arXiv2026

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↗

arXiv2025

$k$-Entanglement Measure for Multipartite Systems without Convex-Roof Extensions and its Evaluation

Multipartite entanglement underpins quantum technologies but its study is limited by the lack of universal measures, unified frameworks, and the intractability of convex-roof extensions. We establish an axiomatic framework and introduce the first \emph{true} $k$-entanglement measure, $E_w^{(k,n)}$, which satisfies all axioms, establishes $k$-entanglement as a multipartite quantum resource, avoids convex-roof constructions, and is efficiently computable. A universal algorithm evaluates arbitrary finite-dimensional states, with open-source software covering all partitions of four-qubit systems. Numerical tests certify $k$-entanglement within 200 seconds, consistent with necessary-and-sufficient criteria, tightening bounds and revealing new thresholds. This framework offers a scalable, practical tool for rigorous multipartite entanglement quantification.

quant-ph↗

arXiv2025

Detecting $k$-nonseparability and $k$-partite Entanglement with Generalized Skew Information and Mutually Unbiased Measurements

Multipartite quantum entanglement, as a core quantum resource, is fundamental to the advancement of quantum science and technology. In multipartite quantum systems, there are two kinds of quantum entanglement: $k$-nonseparability and $k$-partite entanglement. In this paper, we propose sufficient criteria for detecting $k$-nonseparability and $k$-partite entanglement by using the generalized Wigner-Yanase skew information and mutually unbiased measurements. Examples are given to demonstrate the detection capability and advantages of these criteria. As an application, an example of recognizing the networks by detecting the depth of quantum networks is given.

quant-ph↗

arXiv2025

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↗

arXiv2025

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↗

arXiv2025

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↗

arXiv2025

An easily computable measure of Gaussian quantum imaginarity

The resource-theoretic frameworks for quantum imaginarity have been developed in recent years. Within these frameworks, many imaginarity measures for finite-dimensional systems have been proposed. However, for imaginarity of Gaussian states in continuous-variable (CV) systems, there are only two known Gaussian imaginarity measures, which exhibit prohibitive computational complexity when applied to multi-mode Gaussian states. In this paper, we propose a computable Gaussian imaginarity measure $\mathcal I^{G_n}$ for $n$-mode Gaussian systems. The value of $\mathcal I^{G_n}$ is simply formulated by the displacement vectors and covariance matrices of Gaussian states. A comparative analysis of $\mathcal{I}^{G_n}$ with existing two Gaussian imaginarity measures indicates that $\mathcal{I}^{G_n}$ can be used to detect imaginarity in any $n$-mode Gaussian states more efficiently. As an application, we study the dynamics behaviour of $(1+1)$-mode Gaussian states in Gaussian Markovian noise environments for two-mode CV system by utilizing ${\mathcal I}^{G_2}$. Moreover, we prove that, ${\mathcal I}^{G_n}$ can induce a quantification of any $m$-multipartite multi-mode CV systems which satisfies all requirements for measures of multipartite multi-mode Gaussian correlations, which unveils that, $n$-mode Gaussian imaginarity can also be regarded as a kind of multipatite multi-mode Gaussian correlation and is a multipartite Gaussian quantum resource.

quant-ph↗

arXiv2024

Gaussian unsteerable channels and computable quantifications of Gaussian steering

The current quantum resource theory for Gaussian steering for continuous-variable systems is flawed and incomplete. Its primary shortcoming stems from an inadequate comprehension of the architecture of Gaussian channels transforming Gaussian unsteerable states into Gaussian unsteerable states, resulting in a restricted selection of free operations. In the present paper, we explore in depth the structure of such $(m+n)$-mode Gaussian channels, and introduce the class of the Gaussian unsteerable channels and the class of maximal Gaussian unsteerable channels, both of them may be chosen as the free operations, which completes the resource theory for Gaussian steering from $A$ to $B$ by Alice's Gaussian measurements. We also propose two quantifications $\mathcal{J}_{j}$ $(j=1,2)$ of $(m+n)$-mode Gaussian steering from $A$ to $B$. The computation of the value of $\mathcal{J}_{j}$ is straightforward and efficient, as it solely relies on the covariance matrices of Gaussian states, eliminating the need for any optimization procedures. Though $\mathcal{J}_{j}$s are not genuine Gaussian steering measures, they have some nice properties such as non-increasing under certain Gaussian unsteerable channels. Additionally, we compare ${\mathcal J}_2$ with the Gaussian steering measure $\mathcal N_3$, which is based on the Uhlmann fidelity, revealing that ${\mathcal J}_2$ is an upper bound of $\mathcal N_3$ at certain class of $(1+1)$-mode Gaussian pure states. As an illustration, we apply $\mathcal J_2$ to discuss the behaviour of Gaussian steering for a special class of $(1+1)$-mode Gaussian states in Markovian environments, which uncovers the intriguing phenomenon of rapid decay in quantum steering.

quant-ph↗

arXiv2022

A computable multipartite multimode Gaussian correlation measure and the monogamy relation for continuous-variable systems

In this paper, a computable multipartite multimode Gaussian quantum correlation measure ${\mathcal M}^{(k)}$ is proposed for any $k$-partite continuous-variable (CV) systems with $k\geq 2$. ${\mathcal M}^{(k)}$ depends only on the covariance matrix of CV states, is invariant under any permutation of subsystems, is a quantification without ancilla problem, nonincreasing under $k$-partite local Gaussian channels (particularly, invariant under $k$-partite local Gaussian unitary operations), vanishes on $k$-partite product states. For a $k$-partite Gaussian state $ρ$, ${\mathcal M}^{(k)}(ρ)=0$ if and only if $ρ$ is a $k$-partite product state. Thus, for the bipartite case, ${\mathcal M}={\mathcal M}^{(2)}$ is an accessible replacement of the Gaussian quantum discord and Gaussian geometric discord. Moreover, ${\mathcal M}^{(k)}$ satisfies the unification condition, hierarchy condition that a multipartite quantum correlation measure should obey. ${\mathcal M}^{(k)}$ is not bipartite like monogamous, but, ${\mathcal M}^{(k)}$ is complete monogamous and tight complete monogamous.

quant-ph↗

arXiv2022

Approximate separation of quantum gates and separation experiments of CNOT based on Particle Swarm Optimization algorithm

Ying conceived of using two or more small-capacity quantum computers to produce a larger-capacity quantum computing system by quantum parallel programming ([M. S. Ying, Morgan-Kaufmann, 2016]). In doing so, the main obstacle is separating the quantum gates in the whole circuit to produce a tensor product of the local gates. It has been showed that there are few separable multipartite quantum gates, so the approximate separation problem involves finding local quantum gates that approximate a given inseparable gate. We propose and study a problem involving the approximate separation of multipartite gates based on quantum-gate fidelity. For given multipartite and local gates, we conclude that the smaller is the maximal distance between the products of an arbitrary pair of eigenvalues, the greater is their gate fidelity. This provides a criterion for approximate separation. Lastly, we discuss the optimal approximate separation of the CNOT gate.

quant-ph↗

arXiv2021

Separation of gates in quantum parallel programming

The number of qubits in current quantum computers is a major restriction on their wider application. To address this issue, Ying conceived of using two or more small-capacity quantum computers to produce a larger-capacity quantum computing system by quantum parallel programming ([M. S. Ying, Morgan-Kaufmann, 2016]). In doing so, the main obstacle is separating the quantum gates in the whole circuit to produce a tensor product of the local gates. In this study, we theoretically analyse the (sufficient and necessary) separability conditions of multipartite quantum gates in finite or infinite dimensional systems. We then conduct separation experiments with n-qubit quantum gates on IBM quantum computers using QSI software.

quant-ph↗