|
| related topics |
| {algorithm, log, probability} |
| {state, states, entangled} |
| {key, protocol, security} |
| {entanglement, phys, rev} |
| {let, theorem, proof} |
| {alice, bob, state} |
| {theory, mechanics, state} |
| {time, systems, information} |
| {state, phys, rev} |
|
Deciding whether a quantum state has secret correlations is an
NP-complete problem
Jae-Weon Lee, DoYong Kwon, Jaewan Kim
abstract: 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.
- oai_identifier:
- oai:arXiv.org:quant-ph/0612052
- categories:
- quant-ph
- comments:
- 3 pages, revtex, no fig, typos corrected
- arxiv_id:
- quant-ph/0612052
- created:
- 2006-12-07
- updated:
- 2006-12-15
Full article ▸
|
|
| related documents |
| 9702057v1 |
| 0208112v1 |
| 0608156v1 |
| 0209148v1 |
| 0206066v1 |
| 0312115v1 |
| 0508156v3 |
| 0308016v1 |
| 0606017v1 |
| 0012088v1 |
| 0405063v2 |
| 0507024v1 |
| 0612033v1 |
| 0606242v3 |
| 0502144v1 |
| 0209139v1 |
| 0406146v1 |
| 0703193v2 |
| 0507194v1 |
| 0209059v1 |
| 0406121v1 |
| 0206078v1 |
| 0312096v2 |
| 0501093v1 |
| 0701198v1 |
|