dorsal/arxiv
View SchemaDeciding whether a quantum state has secret correlations is an NP-complete problem
| Authors | Jae-Weon Lee, DoYong Kwon, Jaewan Kim |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/0612052 |
| URL | https://arxiv.org/abs/quant-ph/0612052 |
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.
{
"annotation_id": "3e177101-0c6c-470d-88b6-53f72c574846",
"date_created": "2026-03-02T18:02:34.609000Z",
"date_modified": "2026-03-02T18:02:34.609000Z",
"file_hash": "3b2ed7836d60e9002a1c4fdf378fa3321acf27b265f0272aea30586e74dfe767",
"private": false,
"record": {
"abstract": "From the NP-hardness of the quantum separability problem and the relation\nbetween bipartite entanglement and the secret key correlations, it is shown\nthat the problem deciding whether a given quantum state has secret correlations\nin it or not is in NP-complete.",
"arxiv_id": "quant-ph/0612052",
"authors": [
"Jae-Weon Lee",
"DoYong Kwon",
"Jaewan Kim"
],
"categories": [
"quant-ph",
"cs.IT",
"math.IT"
],
"title": "Deciding whether a quantum state has secret correlations is an NP-complete problem",
"url": "https://arxiv.org/abs/quant-ph/0612052"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "1e54a31d-9601-44a9-907a-85b79f12a61f",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}