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

International Conference on Intelligence Science and Information Engineering

Entanglement Upper Bound of Stabilizer Codewords

Yu-qian Wu, Xiaoyu Chen

Published Aug 1, 2011• 0 citations
Publisher

Abstract

The relative entropy of entanglement, the global robustness of entanglement and the geometric measure are equal for stabilizer quantum code words. The entanglement upper bounds can be get from the generator with Pauli measurement. Using an iterative algorithm can get the exact value of the entanglement.
DOI
10.1109/isie.2011.9

Related papers

Entanglement of stabilizer codewords

Xiaoyu Chen, Li-zhen Jiang

The geometric measure, the logarithmic robustness and the relative entropy of entanglement are proved to be equal for a stabilizer quantum codeword. The entanglement upper and lower bounds are determined with the generators of code. The entanglement of dual-containing CSS codes, Gottesman codes and the related codes are given. An iterative algorithm is developed to determine the exact value of the entanglement when the two bounds are not equal.

arXiv:1008.5337•Aug 31, 2010•1 citation

量子稳定子码的码字纠缠

Xiaoyu Chen

Quantum communication and quantum computation are two important parts of quantum information science. Quantum algorithm usually uses real equally weighted states, among them are graph states, whose entanglement is well studied. Quantum communication is inevitably connected with quantum error correcting codes (QECC). The most important and frequently used QECCs are quantum stabilizer codes, which can be seen as the combination of graph states with classical error correcting codes. We argue that the complexity of quantum coding is closely related to the entanglement of the code. We prove that entanglement measured by the geometric measure, the robustness and the relative entropy of entanglement are equal for a stabilizer quantum codeword. The entanglement upper and lower bounds are determined from the generators of a quantum code. CSS codes are quantum codes derived from classical codes. We prove that the entanglement of CSS code equals its number of classical generators when the CSS code is dual-containing. We give the entanglement of codewords for Gottesman codes and related codes. An iterative algorithm is developed to calculate the entanglement numerically.

Zhongguo kexue. Wulixue Lixue Tianwenxue•Feb 1, 2015•1 citation

Entanglement bound for multipartite pure states based on local measurements

Li-zhen Jiang, Xiaoyu Chen, Tian-Yu Ye

An entanglement bound based on local measurements is introduced for multipartite pure states. It is the upper bound of the geometric measure and the relative entropy of entanglement. It is the lower bound of the minimal-measurement entropy. For pure bipartite states, the bound is equal to the entanglement entropy. The bound is applied to pure tripartite qubit states and the exact tripartite relative entropy of entanglement is obtained for a wide class of states.

arXiv:1104.3280•Physical Review A•Oct 5, 2011•2 citations

Connections between relative entropy of entanglement and geometric measure of entanglement

Tzu-Chieh Wei, Marie Ericsson, Paul M. Goldbart +1 more

As two of the most important entanglement measures---the entanglement of formation and the entanglement of distillation---have so far been limited to bipartite settings, the study of other entanglement measures for multipartite systems appears necessary. Here, connections between two other entanglement measures---the relative entropy of entanglement and the geometric measure of entanglement---are investigated. It is found that for arbitrary pure states the latter gives rise to a lower bound on the former. For certain pure states, some bipartite and some multipartite, this lower bound is saturated, and thus their relative entropy of entanglement can be found analytically in terms of their known geometric measure of entanglement. For certain mixed states, upper bounds on the relative entropy of entanglement are also established. Numerical evidence strongly suggests that these upper bounds are tight, i.e., they are actually the relative entropy of entanglement.

Quantum Information and Computation•Jul 1, 2004•44 citations

Connections between relative entropy of entanglement and geometric measure of entanglement

Tzu-Chieh Wei, Marie Ericsson, Paul M. Goldbart +1 more

As two of the most important entanglement measures--the entanglement of formation and the entanglement of distillation--have so for been limited to bipartite settings, the study of other entanglement measures for multipartite systems appears necessary. Here, connections between two other entanglement measures--the relative entropy of entanglement and the geometric measure of entanglement--are investigated. It is found that for arbitrary pure states the latter gives rise to a lower bound on the former. For certain pure states, some bipartite and some multipartite, this lower bound is saturated, and thus their relative entropy of entanglement can be found analytically in terms ot their known geometric measure of entanglement. For certain mixed states, upper bounds on the relative entropy of entanglement are also established. Numerical evidence strongly suggests that these upper bounds are tight, i.e., they are actually the relative entropy of entanglement.

Quantum Information and Computation•Jul 1, 2004•58 citations

Connections between relative entropy of entanglement and geometric measure of entanglement

Tzu-Chieh Wei, Marie Ericsson, Paul M. Goldbart +1 more

As two of the most important entanglement measures--the entanglement of formation and the entanglement of distillation--have so far been limited to bipartite settings, the study of other entanglement measures for multipartite systems appears necessary. Here, connections between two other entanglement measures--the relative entropy of entanglement and the geometric measure of entanglement--are investigated. It is found that for arbitrary pure states the latter gives rise to a lower bound on the former. For certain pure states, some bipartite and some multipartite, this lower bound is saturated, and thus their relative entropy of entanglement can be found analytically in terms of their known geometric measure of entanglement. For certain mixed states, upper bounds on the relative entropy of entanglement are also established. Numerical evidence strongly suggests that these upper bounds are tight, i.e., they are actually the relative entropy of entanglement.

arXiv:quant-ph/0405002•Apr 30, 2004•0 citations
Quantum communication and quantum computation are two important parts of quantum information science. Quantum algorithm usually uses real equally weighted states, among them are graph states, whose entanglement is well studied. Quantum communication is inevitably connected with quantum error correcting codes (QECC). The most important and frequently used QECCs are quantum stabilizer codes, which can be seen as the combination of graph states with classical error correcting codes. We argue that the complexity of quantum coding is closely related to the entanglement of the code. We prove that entanglement measured by the geometric measure, the robustness and the relative entropy of entanglement are equal for a stabilizer quantum codeword. The entanglement upper and lower bounds are determined from the generators of a quantum code. CSS codes are quantum codes derived from classical codes. We prove that the entanglement of CSS code equals its number of classical generators when the CSS code is dual-containing. We give the entanglement of codewords for Gottesman codes and related codes. An iterative algorithm is developed to calculate the entanglement numerically.
As two of the most important entanglement measures---the entanglement of formation and the entanglement of distillation---have so far been limited to bipartite settings, the study of other entanglement measures for multipartite systems appears necessary. Here, connections between two other entanglement measures---the relative entropy of entanglement and the geometric measure of entanglement---are investigated. It is found that for arbitrary pure states the latter gives rise to a lower bound on the former. For certain pure states, some bipartite and some multipartite, this lower bound is saturated, and thus their relative entropy of entanglement can be found analytically in terms of their known geometric measure of entanglement. For certain mixed states, upper bounds on the relative entropy of entanglement are also established. Numerical evidence strongly suggests that these upper bounds are tight, i.e., they are actually the relative entropy of entanglement.
As two of the most important entanglement measures--the entanglement of formation and the entanglement of distillation--have so for been limited to bipartite settings, the study of other entanglement measures for multipartite systems appears necessary. Here, connections between two other entanglement measures--the relative entropy of entanglement and the geometric measure of entanglement--are investigated. It is found that for arbitrary pure states the latter gives rise to a lower bound on the former. For certain pure states, some bipartite and some multipartite, this lower bound is saturated, and thus their relative entropy of entanglement can be found analytically in terms ot their known geometric measure of entanglement. For certain mixed states, upper bounds on the relative entropy of entanglement are also established. Numerical evidence strongly suggests that these upper bounds are tight, i.e., they are actually the relative entropy of entanglement.
As two of the most important entanglement measures--the entanglement of formation and the entanglement of distillation--have so far been limited to bipartite settings, the study of other entanglement measures for multipartite systems appears necessary. Here, connections between two other entanglement measures--the relative entropy of entanglement and the geometric measure of entanglement--are investigated. It is found that for arbitrary pure states the latter gives rise to a lower bound on the former. For certain pure states, some bipartite and some multipartite, this lower bound is saturated, and thus their relative entropy of entanglement can be found analytically in terms of their known geometric measure of entanglement. For certain mixed states, upper bounds on the relative entropy of entanglement are also established. Numerical evidence strongly suggests that these upper bounds are tight, i.e., they are actually the relative entropy of entanglement.