We show a scheme of preparing multipartite W type of maximally entangled states among many atomic ensembles with the generation time increasing with the party number only polynomially. The scheme is based on laser man...We show a scheme of preparing multipartite W type of maximally entangled states among many atomic ensembles with the generation time increasing with the party number only polynomially. The scheme is based on laser manipulation of atomic ensembles and single-photon detection, and fits well the status of the current experimental technology. We also show one of the applications of this kind of W state, demonstrating Bell theorem without inequalities.展开更多
For graphs F and G,let F→(G,G)denote that any red/blue edge coloring of F contains a monochromatic G.Define Folkman number f(G;t)to be the smallest order of a graph F such that F→(G,G)andω(F)≤t.It is shown that f(...For graphs F and G,let F→(G,G)denote that any red/blue edge coloring of F contains a monochromatic G.Define Folkman number f(G;t)to be the smallest order of a graph F such that F→(G,G)andω(F)≤t.It is shown that f(G;t)≤cn for p-arrangeable graphs with n vertices,where p≥1,c=c(p)and t=t(p)are positive constants.展开更多
基金supported by the National Natural Science Foundation of China(Grant Nos.11174052 and 11474049)the China Advanced Science and Technology Innovation Fund
文摘We show a scheme of preparing multipartite W type of maximally entangled states among many atomic ensembles with the generation time increasing with the party number only polynomially. The scheme is based on laser manipulation of atomic ensembles and single-photon detection, and fits well the status of the current experimental technology. We also show one of the applications of this kind of W state, demonstrating Bell theorem without inequalities.
基金supported by NSFC(No.11671088)“New century excellent talents support plan for institutions of higher learning in Fujian province”(SJ2017-29).
文摘For graphs F and G,let F→(G,G)denote that any red/blue edge coloring of F contains a monochromatic G.Define Folkman number f(G;t)to be the smallest order of a graph F such that F→(G,G)andω(F)≤t.It is shown that f(G;t)≤cn for p-arrangeable graphs with n vertices,where p≥1,c=c(p)and t=t(p)are positive constants.
