Deciding whether a quantum state has secret correlations is an NP-complete problem

Details Deciding whether a quantum state has secret correlations is an NP-complete problem Deciding whether a quantum state has secret correlations is an NP-complete problem

2006-12-07

arxiv.org/abs/quant-ph/0612052v2

Physics

Quantum Physics

3 pages, revtex, no fig, typos corrected

Scientific paper

From the NP-hardness of the quantum separability problem and the relation
between bipartite entanglement and the secret key correlations, it is shown
that the problem deciding whether a given quantum state has secret correlations
in it or not is in NP-complete.

Affiliated with

Also associated with

No associations

Rating

Deciding whether a quantum state has secret correlations is an NP-complete problem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Deciding whether a quantum state has secret correlations is an NP-complete problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Deciding whether a quantum state has secret correlations is an NP-complete problem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-16202