CXCheng-Qian Xu

Cheng-Qian Xu

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Cheng-Qian Xu has a total of 6 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Bipartite entanglement measures for anyonic systems

    by Wenhao Ye, Li You, Cheng-Qian Xu

    As promising candidates for realizing fault-tolerant quantum computing, systems composed of anyons feature nontensor product state space due to their distinctive fusion rules, resulting in entanglement properties that differ fundamentally from those of conventional quantum systems. However, a quantitative characterization of entanglement in such systems remains elusive. In this Letter, we address this issue in bipartite settings using the framework of quantum resource theory. We propose three measures that quantify total entanglement, conventional entanglement, and anyonic charge entanglement (ACE) of a bipartite anyonic state, respectively. Our central result is summarized as a theorem: Total entanglement is composed of ACE and conventional entanglement. Geometrically, ACE measures the distance between the state and its charge-decorrelated version, while conventional entanglement is the minimal distance between the latter and the set of separable states, characterizing Bell nonlocality in the conventional sense. Our result confirms the long-standing intuition that ACE stems from the reduced dimensionality of the separable state space due to superselection and fusion constraints. Furthermore, we prove that ACE is equivalent to a previously proposed probe termed the entropy of ACE, thereby providing rigorous theoretical support for the latter’s monotonicity as an entanglement measure and extending the known correspondence between the geometric and operational characterizations of bipartite correlations to anyonic systems.

  • Open Access

    Learning quantum phases via single-qubit disentanglement

    by Zheng An, Chenfeng Cao, Cheng-Qian Xu, D. L. Zhou

    Identifying phases of matter presents considerable challenges, particularly within the domain of quantum theory, where the complexity of ground states appears to increase exponentially with system size. Quantum many-body systems exhibit an array of complex entanglement structures spanning distinct phases. Although extensive research has explored the relationship between quantum phase transitions and quantum entanglement, establishing a direct, pragmatic connection between them remains a critical challenge. In this work, we present a novel and efficient quantum phase transition classifier, utilizing disentanglement with reinforcement learning-optimized variational quantum circuits. We demonstrate the effectiveness of this method on quantum phase transitions in the transverse field Ising model (TFIM) and the XXZ model. Moreover, we observe the algorithm's ability to learn the Kramers-Wannier duality pertaining to entanglement structures in the TFIM. Our approach not only identifies phase transitions based on the performance of the disentangling circuits but also exhibits impressive scalability, facilitating its application in larger and more complex quantum systems. This study sheds light on the characterization of quantum phases through the entanglement structures inherent in quantum many-body systems.


  • Topological correlation in anyonic states constrained by anyonic superselection rules

    by Cheng-Qian Xu, D. L. Zhou

    An anyonic system not only has potential applications in the construction of topological quantum computers but also presents a unique property known as topological entanglement entropy (TEE) in quantum many-body systems. Recently, Bonderson et al. [ Ann. Phys. (NY) 385, 399 (2017)] have formally defined the entropy of anyonic charge entanglement (ACE) in anyonic states that has been shown to be able to derive TEE. We give it operational meaning from the perspective of quantum information theory. Specifically, for an anyonic bipartite system, we define an operational measure of topological correlation based on the principle of maximum entropy, where the topological correlation is the information that cannot be accessed by local operations constrained by anyonic superselection rules (SSRs) and classical communication. For a given anyonic bipartite state with maximal rank, we prove that its topological correlation is equal to its entropy of ACE. This measure can be extended to measure nonlocal resources of other compound quantum systems in the presence of SSRs and can provide a more refined classification of correlations in a multipartite system with SSRs.


  • Quantum mutual information redistribution in a pure tripartite state by a number partitioning algorithm

    by Muchun Yang, Cheng-Qian Xu, D. L. Zhou

    Quantum information distribution in a tripartite state plays a fundamental role in quantum information processes. Here we investigate how a bipartite unitary transformation UAB redistributes the quantum mutual information with the third party C in a tripartite pure state |ψ〉ABC in a dA×dB×dC-dimensional Hilbert space. In particular, we focus on finding out the optimal unitary transformation UAB* that maximizes the quantum mutual entropy between party A and party C, I(A:C)=S(ρA)−S(ρB)+S(ρC). We show that the mutual entropy I(A:C) is upper bounded by 2S(ρC) derived from the Araki-Lieb inequality. This upper bound can be realized via an optimal unitary transformation for any pure state with the rank rC of ρC satisfying rC≤dA. For a generic pure state with rC>dA, the upper bound cannot be realized by any bipartite unitary transformation. To maximize the mutual entropy in the later case, we propose a fast numerical algorithm to produce an approximate optimal unitary transformation, where our optimization is transformed into a modified number partition problem. The validness of our algorithm is confirmed by its comparison with the results from the Adam algorithm for parameterized unitary transformations. Our approximate algorithm thus provides a practical protocol to implement redistribution of quantum mutual information for a tripartite quantum state with high dimensions.


  • Quantum teleportation using Ising anyons

    by Cheng-Qian Xu, D. L. Zhou

    Anyons have been extensively investigated as information carriers in topological quantum computation. However, how to characterize the information flow in quantum networks composed of anyons is less understood, which motivates us to study quantum communication protocols in anyonic systems. Here we propose a general topologically protected protocol for quantum teleportation based on the Ising anyon model and prove that with our protocol an unknown anyonic state of any number of Ising anyons can be teleported from Alice to Bob. Our protocol naturally generalizes quantum state teleportation from systems of locally distinguishable particles to systems of Ising anyons, which may promote our understandings of anyonic quantum entanglement as a quantum resource. In addition, our protocol is expected to be realized with the Majorana zero modes, one of the possible physical realizations for the Ising anyon in experiments.


  • Open Access

    Deterministic quantum one-time pad via Fibonacci anyons

    by Cheng-Qian Xu, D. L. Zhou

    Anyonic states, which are topologically robust because of their peculiar structure of Hilbert space, have important applications in quantum computing and quantum communication. Here we investigate the capacity of the deterministic quantum one-time pad (DQOTP) that uses Fibonacci anyons as an information carrier. We find that the Fibonacci particle-antiparticle pair produced from vacuum can be used to asymptotically send 2log2dτ bits of classical information (dτ is the quantum dimension of a Fibonacci anyon τ), which equals anyonic mutual information of the pair. Furthermore, by studying the DQOTP via a parameterized state of six Fibonacci anyons with trivial total charge, we give the analytical results of the maximum number of messages that can be sent for different parameters, which is a step function with every step corresponding to a regular simplex from the viewpoint of geometry. The results for the maximum number of messages sent by the DQOTP can be explained by anyonic accessible information.