Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Journal of Physics A Mathematical and General

Method for detecting concurrence without the structural physical approximation by local operations and classical communication

Yan-Kui Bai, Shu‐Shen Li, Houzhi Zheng, Ahmad Abliz

Published May 3, 2006• 3 citations
Publisher

Abstract

We present a modified method for detecting the concurrence in an arbitrary two-qubit quantum state rho(AB) with local operations and classical communication. In this method, it is not necessary for the two observers to prepare the quantum state rho(AB) by the structural physical approximation. Their main task is to measure four specific functions via two local quantum networks. With these functions they can determine the concurrence and then the entanglement of formation.

DOI
10.1088/0305-4470/39/20/014

Related papers

Method for measuring two-qubit entanglement of formation by local operations and classical communication

Yan-Kui Bai, Shu‐Shen Li, Houzhi Zheng

We present a parametrically efficient method for measuring the entanglement of formation E-f in an arbitrarily given unknown two-qubit state rho(AB) by local operations and classical communication. The two observers, Alice and Bob, first perform some local operations on their composite systems separately, by which the desired global quantum states can be prepared. Then they estimate seven functions via two modified local quantum networks supplemented a classical communication. After obtaining these functions, Alice and Bob can determine the concurrence C and the entanglement of formation E-f.

Journal of Physics A Mathematical and General•Sep 21, 2005•10 citations

Detecting a set of entanglement measures in an unknown tripartite quantum state by local operations and classical communication

Yan-Kui Bai, Shu‐Shen Li, Houzhi Zheng +1 more

We propose a more general method for detecting a set of entanglement measures, i.e., negativities, in an arbitrary tripartite quantum state by local operations and classical communication. To accomplish the detection task using this method, three observers do not need to perform partial transposition maps by the structural physical approximation; instead, they only need to collectively measure some functions via three local networks supplemented by a classical communication. With these functions, they are able to determine the set of negativities related to the tripartite quantum state.

arXiv:quant-ph/0604209•Physical Review A•Aug 4, 2006•1 citation

Noiseless method for checking the Peres separability criterion by local operations and classical communication

Yan-Kui Bai, Shu‐Shen Li, Houzhi Zheng

We present a method for checking the Peres separability criterion in an arbitrary bipartite quantum state ${\ensuremath{\rho}}_{\mathrm{AB}}$ within local operations and classical communication scenario. The method does not require noise operation which is needed in making the partial transposition map physically implementable. The main task for the two observers, Alice and Bob, is to measure some specific functions of the partial transposed matrix. With these functions, they can determine the eigenvalues of ${\ensuremath{\rho}}_{\mathrm{AB}}^{{T}_{\mathrm{B}}}$, among which the minimum serves as an entanglement witness.

arXiv:quant-ph/0504026•Physical Review A•Nov 18, 2005•7 citations

Universal observable detecting all two-qubit entanglement and determinant-based separability tests

Remigiusz Augusiak, Maciej Demianowicz, Paweł Horodecki

We construct a single observable, measurement of whose mean value on four copies of an unknown two-qubit state is sufficient to determine unambiguously whether the state is separable or entangled. In other words, there exists a universal collective entanglement witness detecting all two-qubit entanglement. The test is directly linked to a function that characterizes the entanglement quantitatively to some extent. This function is an entanglement monotone under so-called local pure operations and classical communication which preserve local dimensions. Moreover, it provides tight upper and lower bounds for negativity and concurrence. An elementary quantum computing device estimating unknown two-qubit entanglement is designed.

arXiv:quant-ph/0604109•Physical Review A•Mar 13, 2008•88 citations

Experimental determination of entanglement for arbitrary pure states

Shao-Ming Fei, Ming‐Jing Zhao, Kai Chen +1 more

We present a way of experimentally determining the concurrence in terms of the expectation values of local observables for arbitrary multipartite pure states. Instead of the joint measurements on two copies of a state in the experiment for two-qubit systems [S. P. Walborn et al., Nature (London) 440, 20 (2006)], we only need one copy of the state in every measurement for any arbitrary dimensional multipartite systems, avoiding the preparation of twin states or the imperfect copy of the state.

arXiv:0909.4851•Physical Review A•Sep 21, 2009•31 citations

Concurrence percolation threshold of large-scale quantum networks

Omar Malik, Xiangyi Meng, Shlomo Havlin +3 more

Abstract Quantum networks describe communication networks that are based on quantum entanglement. A concurrence percolation theory has been recently developed to determine the required entanglement to enable communication between two distant stations in an arbitrary quantum network. Unfortunately, concurrence percolation has been calculated only for very small networks or large networks without loops. Here, we develop a set of mathematical tools for approximating the concurrence percolation threshold for unprecedented large-scale quantum networks by estimating the path-length distribution, under the assumption that all paths between a given pair of nodes have no overlap. We show that our approximate method agrees closely with analytical results from concurrence percolation theory. The numerical results we present include 2D square lattices of 2002 nodes and complex networks of up to 104 nodes. The entanglement percolation threshold of a quantum network is a crucial parameter for constructing a real-world communication network based on entanglement, and our method offers a significant speed-up for the intensive computations involved.

Communications Physics•Jul 29, 2022•27 citations
We present a modified method for detecting the concurrence in an arbitrary two-qubit quantum state rho(AB) with local operations and classical communication. In this method, it is not necessary for the two observers to prepare the quantum state rho(AB) by the structural physical approximation. Their main task is to measure four specific functions via two local quantum networks. With these functions they can determine the concurrence and then the entanglement of formation.
We present a parametrically efficient method for measuring the entanglement of formation E-f in an arbitrarily given unknown two-qubit state rho(AB) by local operations and classical communication. The two observers, Alice and Bob, first perform some local operations on their composite systems separately, by which the desired global quantum states can be prepared. Then they estimate seven functions via two modified local quantum networks supplemented a classical communication. After obtaining these functions, Alice and Bob can determine the concurrence C and the entanglement of formation E-f.
We propose a more general method for detecting a set of entanglement measures, i.e., negativities, in an arbitrary tripartite quantum state by local operations and classical communication. To accomplish the detection task using this method, three observers do not need to perform partial transposition maps by the structural physical approximation; instead, they only need to collectively measure some functions via three local networks supplemented by a classical communication. With these functions, they are able to determine the set of negativities related to the tripartite quantum state.
We present a method for checking the Peres separability criterion in an arbitrary bipartite quantum state ${\ensuremath{\rho}}_{\mathrm{AB}}$ within local operations and classical communication scenario. The method does not require noise operation which is needed in making the partial transposition map physically implementable. The main task for the two observers, Alice and Bob, is to measure some specific functions of the partial transposed matrix. With these functions, they can determine the eigenvalues of ${\ensuremath{\rho}}_{\mathrm{AB}}^{{T}_{\mathrm{B}}}$, among which the minimum serves as an entanglement witness.
We construct a single observable, measurement of whose mean value on four copies of an unknown two-qubit state is sufficient to determine unambiguously whether the state is separable or entangled. In other words, there exists a universal collective entanglement witness detecting all two-qubit entanglement. The test is directly linked to a function that characterizes the entanglement quantitatively to some extent. This function is an entanglement monotone under so-called local pure operations and classical communication which preserve local dimensions. Moreover, it provides tight upper and lower bounds for negativity and concurrence. An elementary quantum computing device estimating unknown two-qubit entanglement is designed.
Abstract Quantum networks describe communication networks that are based on quantum entanglement. A concurrence percolation theory has been recently developed to determine the required entanglement to enable communication between two distant stations in an arbitrary quantum network. Unfortunately, concurrence percolation has been calculated only for very small networks or large networks without loops. Here, we develop a set of mathematical tools for approximating the concurrence percolation threshold for unprecedented large-scale quantum networks by estimating the path-length distribution, under the assumption that all paths between a given pair of nodes have no overlap. We show that our approximate method agrees closely with analytical results from concurrence percolation theory. The numerical results we present include 2D square lattices of 2002 nodes and complex networks of up to 104 nodes. The entanglement percolation threshold of a quantum network is a crucial parameter for constructing a real-world communication network based on entanglement, and our method offers a significant speed-up for the intensive computations involved.