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

Annals of the New York Academy of Sciences

Degree of Entanglementa

Abner Shimony

Published Apr 1, 1995• 320 citations
Publisher
DOI
10.1111/j.1749-6632.1995.tb39008.x

Related papers

Entangled Entanglementa

Günther Krenn, Anton Zeilinger

Annals of the New York Academy of Sciences•Apr 1, 1995•0 citations

The bell inequality: A measure of entanglementa?

William J. Munro, Kae Nemoto, Andrew G. White

Entanglement is a critical resource used in many current quantum information schemes. As such entanglement has been extensively studied in two qubit systems and its entanglement nature has been exhibited by violations of the Bell inequality. Can the amount of violation of the Bell inequality be used to quantify the degree of entanglement? What do Bell inequalities indicate about the nature of entanglement?

arXiv:quant-ph/0102119•Journal of Modern Optics•Jun 1, 2001•41 citations

Terms of Entanglement

University of Pennsylvania Press eBooks•May 23, 2013•0 citations

Degree-𝑑 chow parameters robustly determine degree-𝑑 PTFs (and algorithmic applications)

Ilias Diakonikolas, Daniel M. Kane

The degree-d Chow parameters of a Boolean function are its degree at most d Fourier coefficients. It is well-known that degree-d Chow parameters uniquely characterize degree-d polynomial threshold functions (PTFs) within the space of all bounded functions. In this paper, we prove a robust version of this theorem: For f any Boolean degree-d PTF and g any bounded function, if the degree-d Chow parameters of f are close to the degree-d Chow parameters of g in ℓ2-norm, then f is close to g in ℓ1-distance. Notably, our bound relating the two distances is independent of the dimension. That is, we show that Boolean degree-d PTFs are robustly identifiable from their degree-d Chow parameters. No non-trivial bound was previously known for d >1.

arXiv:1811.03491•ACM Symposium on Theory of Computing (STOC)•Jun 20, 2019•7 citations

Exploring degrees of entanglement

John M. Myers, Tai Tsun Wu

Quantum Information Processing•Oct 15, 2009•4 citations

Improved Check Node Decomposition for Linear Programming Decoding

Xiaopeng Jiao, Jianjun Mu

For the linear programming decoding (LPD) proposed by Feldman et al., the number of constraints increases exponentially with check degrees. By decomposing a high-degree check node into a number of degree-3 check nodes, the number of constraints grows linearly with check degrees. In this letter, we show that the size of the LPD can be reduced by decomposing a high-degree check node into a number of degree-4 check nodes. The LPD using the degree-4 decomposition leads to almost the same number of constraints as using the degree-3 decomposition, while the number of auxiliary variable nodes is less than half of the one using the degree-3 decomposition. Moreover, when decomposing a high degree check node into a number of check nodes with degree d, d>4, the number of constraints increases rapidly and the size of the LPD becomes larger than the degree-4 decomposition. It is demonstrated on an LDPC code and a BCH code that the decoding time of the degree-4 decomposition is the smallest among the different decomposition methods.

IEEE Communications Letters•Jan 2, 2013•4 citations
The degree-d Chow parameters of a Boolean function are its degree at most d Fourier coefficients. It is well-known that degree-d Chow parameters uniquely characterize degree-d polynomial threshold functions (PTFs) within the space of all bounded functions. In this paper, we prove a robust version of this theorem: For f any Boolean degree-d PTF and g any bounded function, if the degree-d Chow parameters of f are close to the degree-d Chow parameters of g in ℓ2-norm, then f is close to g in ℓ1-distance. Notably, our bound relating the two distances is independent of the dimension. That is, we show that Boolean degree-d PTFs are robustly identifiable from their degree-d Chow parameters. No non-trivial bound was previously known for d >1.
For the linear programming decoding (LPD) proposed by Feldman et al., the number of constraints increases exponentially with check degrees. By decomposing a high-degree check node into a number of degree-3 check nodes, the number of constraints grows linearly with check degrees. In this letter, we show that the size of the LPD can be reduced by decomposing a high-degree check node into a number of degree-4 check nodes. The LPD using the degree-4 decomposition leads to almost the same number of constraints as using the degree-3 decomposition, while the number of auxiliary variable nodes is less than half of the one using the degree-3 decomposition. Moreover, when decomposing a high degree check node into a number of check nodes with degree d, d>4, the number of constraints increases rapidly and the size of the LPD becomes larger than the degree-4 decomposition. It is demonstrated on an LDPC code and a BCH code that the decoding time of the degree-4 decomposition is the smallest among the different decomposition methods.